{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6964778,0.0032937543,0.2684686,0.0007235735,0.000069755115,0.00006959073,0.00005628437,0.00023606516,0.030604705],"genre_scores_gemma":[0.99167717,0.0010871418,0.006326253,0.000024216997,0.00002190529,0.000015051912,0.0000075310927,0.000016850943,0.0008238428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953985,0.00020247659,0.000013436474,0.00004043901,0.00012410819,0.00007958596],"domain_scores_gemma":[0.99384475,0.005176553,0.00042447387,0.00022784024,0.0002647564,0.0000615723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012485369,0.00045052273,0.00029036397,0.00061312935,0.00028695446,0.0007357653,0.00043246677,0.00035149543,0.0008999411],"category_scores_gemma":[0.008109441,0.00021529646,0.00025899743,0.00057753985,0.0007817578,0.0010104284,0.0006625058,0.00039270025,0.000118221156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019460991,0.0001783999,0.0031815162,0.00024990863,0.00005748128,0.00031451177,0.0003544338,0.77653235,0.04426092,0.12897712,0.0005632758,0.045135427],"study_design_scores_gemma":[0.000014907111,0.00021616297,0.0016601293,0.000028991295,0.000045458764,0.00015296663,0.00011464071,0.9603031,0.014540758,0.022074271,0.0008210163,0.00002755079],"about_ca_topic_score_codex":0.0005028325,"about_ca_topic_score_gemma":0.0004472008,"teacher_disagreement_score":0.0012485369,"about_ca_system_score_codex":0.00057824573,"about_ca_system_score_gemma":0.00036329887,"threshold_uncertainty_score":0.0066030025},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041263506,0.070259385,0.48371318,0.021165535,0.0027344027,0.0001119671,0.0011613654,0.0013043878,0.37828624],"genre_scores_gemma":[0.8033193,0.07312012,0.03754835,0.0027646602,0.009443047,0.0005791062,0.0006607258,0.00079541194,0.0717693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993412,0.00017517115,0.000025615413,0.00009565662,0.0002863915,0.000075931726],"domain_scores_gemma":[0.99609715,0.002661681,0.00018869028,0.00037613267,0.00052866025,0.0001476921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010312663,0.00086132524,0.0008436305,0.0013533747,0.0005811869,0.0025351162,0.0012148897,0.0014757336,0.007821726],"category_scores_gemma":[0.00965493,0.0005684318,0.00035725458,0.0015107435,0.0023335824,0.004280645,0.0010372255,0.0035058982,0.0014199046],"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.000007635985,0.000012696244,0.00007388332,0.00008153195,0.000005947597,0.000029506142,0.000084812484,0.012500475,0.00046851014,0.9634623,0.010907741,0.012364871],"study_design_scores_gemma":[0.000004514354,0.000005547309,0.00011858926,0.000042305845,0.0000029562855,0.000044538374,0.000020861382,0.03694083,0.000118086384,0.952919,0.009774304,0.0000083669565],"about_ca_topic_score_codex":0.0012489716,"about_ca_topic_score_gemma":0.00047842314,"teacher_disagreement_score":0.007821726,"about_ca_system_score_codex":0.0013366351,"about_ca_system_score_gemma":0.0006432235,"threshold_uncertainty_score":0.02616632},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07999678,0.00083088386,0.90982336,0.0006997972,0.00031537443,0.00012516537,0.00010307956,0.0009333494,0.007172288],"genre_scores_gemma":[0.8788938,0.0005278177,0.115569994,0.00026518203,0.00015030714,0.00013567055,0.000120691926,0.000070534865,0.004265958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994351,0.00015784916,0.00003136852,0.000048451624,0.00021882086,0.00010831045],"domain_scores_gemma":[0.99747014,0.0010435577,0.00010255022,0.00033910465,0.0009799694,0.000064802574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011376945,0.0005212245,0.00034340195,0.0006826014,0.0006701895,0.00050158723,0.0007557297,0.00047901907,0.001422122],"category_scores_gemma":[0.0047279852,0.00021361669,0.00023864271,0.0007702723,0.00062135793,0.0010267782,0.0009889841,0.0010603772,0.00028577883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000843885,0.00037889834,0.0017141434,0.00018388724,0.000077483644,0.00031316184,0.00041388485,0.276572,0.15069915,0.13400583,0.011237306,0.42356032],"study_design_scores_gemma":[0.00005532253,0.0002531161,0.00054875336,0.000041740645,0.00007084435,0.00023198659,0.0000479526,0.94400203,0.03612576,0.013538087,0.0050432645,0.00004102859],"about_ca_topic_score_codex":0.0040000426,"about_ca_topic_score_gemma":0.006971932,"teacher_disagreement_score":0.0040000426,"about_ca_system_score_codex":0.0009079523,"about_ca_system_score_gemma":0.0015239873,"threshold_uncertainty_score":0.007953525},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014822715,0.052841663,0.80345833,0.0015343045,0.0005665942,0.00006317058,0.000085991895,0.00023195018,0.12639526],"genre_scores_gemma":[0.7409814,0.06324522,0.12641543,0.0007617421,0.0012332139,0.00044804023,0.00020171716,0.00014591712,0.0665674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999734,0.00011090438,0.0000058001774,0.000033020016,0.00009221229,0.000023986357],"domain_scores_gemma":[0.9998154,0.00012569936,0.0000119964725,0.000012626168,0.000025340934,0.000008855553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041599793,0.0007345039,0.0005183178,0.00025856195,0.00021923168,0.00074075157,0.00058826973,0.0007091549,0.0015305832],"category_scores_gemma":[0.00094376487,0.00023279311,0.00019658297,0.001025101,0.0009080362,0.00047351993,0.0005630304,0.0007586165,0.0005903516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037577887,0.000043782595,0.0001855192,0.00023976747,0.000031880656,0.00016576584,0.00015400763,0.6396319,0.0019392268,0.23864262,0.015922204,0.10300572],"study_design_scores_gemma":[0.00002305982,0.00008887119,0.00025912156,0.00010724369,0.000018509005,0.00013143933,0.00008513354,0.6874603,0.0006356218,0.25874788,0.052418243,0.000024647823],"about_ca_topic_score_codex":0.002010257,"about_ca_topic_score_gemma":0.0013796516,"teacher_disagreement_score":0.002010257,"about_ca_system_score_codex":0.00079643354,"about_ca_system_score_gemma":0.0004892628,"threshold_uncertainty_score":0.0057786107},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2703696,0.00040206112,0.7220663,0.00015778294,0.000034831828,0.000027934933,0.000057561327,0.00019293993,0.0066909445],"genre_scores_gemma":[0.9682523,0.00009650486,0.030563692,0.000022329577,0.000008453065,0.000013374762,0.000017859524,0.0000044147196,0.0010210457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997714,0.00008111116,0.00001063393,0.000027479631,0.00007309197,0.00003632012],"domain_scores_gemma":[0.9997116,0.00010195748,0.000049781553,0.000055768007,0.0000657134,0.000015213053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029684074,0.0003069256,0.00025199517,0.0002855242,0.00032686305,0.0003790507,0.00033772722,0.00034324813,0.0005747741],"category_scores_gemma":[0.0008004786,0.00011924931,0.00018012022,0.0003301697,0.00044367797,0.00033225154,0.0005281828,0.00023214304,0.00013288256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047483254,0.000049341463,0.0023736216,0.00015099971,0.00006185183,0.0007013903,0.00053502707,0.6408517,0.10746873,0.101338506,0.0011060109,0.14488801],"study_design_scores_gemma":[0.000013551866,0.00012598759,0.0004387454,0.00001580022,0.000018634562,0.00015939253,0.000050271257,0.9691168,0.022394765,0.0057543656,0.0018881051,0.000023647974],"about_ca_topic_score_codex":0.002135273,"about_ca_topic_score_gemma":0.002861976,"teacher_disagreement_score":0.002135273,"about_ca_system_score_codex":0.00057622,"about_ca_system_score_gemma":0.0005069383,"threshold_uncertainty_score":0.0042456985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076497,0.0018032816,0.913137,0.00067700556,0.0001389171,0.000089811016,0.00013239593,0.00017305584,0.007351591],"genre_scores_gemma":[0.95326835,0.00078983384,0.042348642,0.00010363271,0.00011324227,0.00010475335,0.000047966074,0.00003339524,0.0031902026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988771,0.00048604436,0.000047914204,0.00017910388,0.00019496946,0.00021499394],"domain_scores_gemma":[0.99734664,0.0021375534,0.00015445112,0.00007741208,0.00021412047,0.00006980565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016746281,0.00097226456,0.001578528,0.0009245053,0.0007233908,0.0018388289,0.0016170179,0.001317161,0.0014694892],"category_scores_gemma":[0.007388753,0.0009740471,0.00047333492,0.001539663,0.0014055717,0.0014644377,0.0012510534,0.0007188096,0.0002953173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002716761,0.00007713355,0.000514374,0.00011783164,0.00007072747,0.00015754747,0.00013886581,0.93288904,0.0025177614,0.024965867,0.0014120021,0.03686715],"study_design_scores_gemma":[0.000037038986,0.00003490349,0.00015610184,0.0000074371596,0.000020204672,0.00004150778,0.00003303704,0.98027533,0.00047083237,0.018714586,0.00019696103,0.000012095682],"about_ca_topic_score_codex":0.0043159826,"about_ca_topic_score_gemma":0.0059244074,"teacher_disagreement_score":0.0043159826,"about_ca_system_score_codex":0.0013806964,"about_ca_system_score_gemma":0.0015511025,"threshold_uncertainty_score":0.010017693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011682042,0.00048707076,0.984209,0.0001297296,0.00007044658,0.000031576707,0.000069745336,0.00046887837,0.002851562],"genre_scores_gemma":[0.6469309,0.000924354,0.345193,0.00011039645,0.000046922516,0.00027905742,0.00030626197,0.0001452222,0.006063958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998036,0.00005687447,0.000012576148,0.00003934541,0.000059871807,0.000027774291],"domain_scores_gemma":[0.99940705,0.00036690428,0.00003722513,0.000052108888,0.00011346763,0.000023304938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034648163,0.00061974506,0.0008601869,0.0005631005,0.00049452943,0.00064803596,0.0013089373,0.0008327473,0.0020907342],"category_scores_gemma":[0.001675538,0.00051111536,0.00052630797,0.00094208174,0.0006028762,0.00063381426,0.0008801801,0.0008906488,0.00043643257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029634297,0.0000115082585,0.00015197777,0.00002816684,0.000013994354,0.000018193512,0.000034335495,0.9555257,0.00085647934,0.009574995,0.00074682623,0.033008154],"study_design_scores_gemma":[0.000003361799,0.000005770823,0.000018827352,0.0000026615278,0.000002394618,0.0000040249315,0.000003834827,0.9950216,0.00015613524,0.004505327,0.00027391824,0.000002252412],"about_ca_topic_score_codex":0.0128505295,"about_ca_topic_score_gemma":0.011291848,"teacher_disagreement_score":0.0128505295,"about_ca_system_score_codex":0.0008754214,"about_ca_system_score_gemma":0.0008442863,"threshold_uncertainty_score":0.025551438},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78969514,0.0015788154,0.1866847,0.00079446944,0.00011500825,0.00012093106,0.0030534854,0.0013304041,0.016627045],"genre_scores_gemma":[0.95959723,0.00091136026,0.026368104,0.00005846352,0.000041855692,0.00010619563,0.0015588993,0.00016900097,0.011188834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926156,0.000085322805,0.000034121196,0.00023089857,0.0002462198,0.00014188547],"domain_scores_gemma":[0.997405,0.0010952391,0.0004979473,0.0002659746,0.00058998744,0.00014585386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084585656,0.00084789534,0.0005224026,0.0016469713,0.00072132866,0.002848089,0.00084405264,0.0010069708,0.0047694696],"category_scores_gemma":[0.004394034,0.00050065,0.0007741078,0.0017429348,0.00057377573,0.0029968796,0.00092098815,0.0009472751,0.0019780414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010035828,0.00033309075,0.22013417,0.0006545814,0.00024960615,0.0009882023,0.003452377,0.36873943,0.049245436,0.025735088,0.006585656,0.32287887],"study_design_scores_gemma":[0.000025683892,0.00044171506,0.18808651,0.00019884552,0.00021866898,0.00074616197,0.00321738,0.71975553,0.03033692,0.021207707,0.035523593,0.00024130006],"about_ca_topic_score_codex":0.019751161,"about_ca_topic_score_gemma":0.017075183,"teacher_disagreement_score":0.019751161,"about_ca_system_score_codex":0.0013164744,"about_ca_system_score_gemma":0.0009414191,"threshold_uncertainty_score":0.039272368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021203714,0.00032493792,0.993958,0.00006483029,0.000032785192,0.000046628444,0.000021223459,0.00005511975,0.0033761286],"genre_scores_gemma":[0.18343747,0.0011047845,0.8070939,0.00021886421,0.00010939981,0.000730667,0.00011579513,0.00013230348,0.0070567545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938047,0.00026546014,0.000028658349,0.00007250262,0.00020407703,0.00004878056],"domain_scores_gemma":[0.9994972,0.00032889153,0.00004423945,0.000022598468,0.00008855221,0.000018570281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001444689,0.0021231328,0.001456518,0.0010459572,0.00060487626,0.0012110578,0.0016755004,0.0017335509,0.003253297],"category_scores_gemma":[0.0017102421,0.0009329768,0.001592048,0.0012696324,0.0005762252,0.0008129811,0.0012855105,0.0014115624,0.00048697993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009838133,0.000028263967,0.00006846906,0.000078475234,0.000045373738,0.0000427072,0.000023250614,0.97278637,0.00080160477,0.007789547,0.00044332954,0.017882882],"study_design_scores_gemma":[0.0000042636634,0.00002354923,0.000027592638,0.0000117023255,0.000010944496,0.00001303282,0.0000057380926,0.9962567,0.00015602507,0.0029030817,0.0005833918,0.0000040149253],"about_ca_topic_score_codex":0.0023072076,"about_ca_topic_score_gemma":0.0029261168,"teacher_disagreement_score":0.003253297,"about_ca_system_score_codex":0.0008270682,"about_ca_system_score_gemma":0.0008093377,"threshold_uncertainty_score":0.010883391},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017454965,0.0008941093,0.9753525,0.00017739894,0.0002798697,0.00013081713,0.000061698476,0.0007171275,0.0049315123],"genre_scores_gemma":[0.45528474,0.0011543393,0.5215943,0.0003275199,0.00027906802,0.00034459477,0.00022288444,0.00011077874,0.020681698],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935836,0.00019294977,0.000028354867,0.000085060834,0.00027375665,0.00006153239],"domain_scores_gemma":[0.9991473,0.00029852698,0.000036127814,0.00023660176,0.00024237852,0.0000391294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010251602,0.0006267298,0.00073044834,0.00044505397,0.0008276248,0.0006056995,0.0017914651,0.000720136,0.0022023],"category_scores_gemma":[0.001318921,0.00025204226,0.00039488173,0.0007004778,0.0006441591,0.0009469142,0.001356374,0.00089227245,0.0010292189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007383716,0.00021602551,0.000457268,0.00031409023,0.00013421109,0.00042535126,0.0008505172,0.100419246,0.19594009,0.14302026,0.011562985,0.5459216],"study_design_scores_gemma":[0.00019174321,0.001147097,0.00064382714,0.000044762586,0.00016092177,0.0010559045,0.00013464868,0.8853144,0.030019896,0.04577155,0.035393476,0.00012177112],"about_ca_topic_score_codex":0.00081118307,"about_ca_topic_score_gemma":0.0012784025,"teacher_disagreement_score":0.0022023,"about_ca_system_score_codex":0.00042165452,"about_ca_system_score_gemma":0.0006256352,"threshold_uncertainty_score":0.007367432},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011916542,0.0002865392,0.9722277,0.0005515595,0.00007038015,0.00007606622,0.000082912666,0.00007322741,0.014715192],"genre_scores_gemma":[0.782301,0.000792414,0.20112213,0.0003606042,0.00015895066,0.0004217229,0.00014014456,0.000120514465,0.014582584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992047,0.00032598095,0.000021454483,0.0001347064,0.00016225062,0.00015095108],"domain_scores_gemma":[0.99871945,0.0008123627,0.00014189087,0.000055032302,0.00019072993,0.00008048219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014429477,0.0013133266,0.00117225,0.0005395709,0.0006109198,0.001969862,0.0015140481,0.0018775923,0.004555132],"category_scores_gemma":[0.0036001476,0.00057470123,0.0010795672,0.00070593785,0.0014679974,0.0012877604,0.0016645478,0.0018155886,0.0004869163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034045173,0.000038106504,0.00014816444,0.000055922726,0.00002057914,0.00007872212,0.00006986522,0.92033744,0.00052584393,0.07018834,0.0013890179,0.0071139187],"study_design_scores_gemma":[0.0000100905045,0.000017565977,0.000043931006,0.000006526655,0.0000051498396,0.000016124428,0.000024073537,0.9782476,0.00010627548,0.02106625,0.00045149808,0.000004877081],"about_ca_topic_score_codex":0.0053370357,"about_ca_topic_score_gemma":0.004479985,"teacher_disagreement_score":0.0053370357,"about_ca_system_score_codex":0.0020575263,"about_ca_system_score_gemma":0.0022930924,"threshold_uncertainty_score":0.015238464},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14208739,0.0005584906,0.83769965,0.0003466077,0.00030342545,0.00012719491,0.00020248129,0.00031072056,0.018363958],"genre_scores_gemma":[0.67086804,0.00066846627,0.31820023,0.00023273853,0.00011705802,0.00020215052,0.00040140198,0.00007327686,0.009236592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955875,0.00006521618,0.00003362985,0.00006166523,0.00021629476,0.000064464315],"domain_scores_gemma":[0.9992405,0.00015430216,0.00014093576,0.00016306948,0.00019225039,0.00010899805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033652052,0.00027207678,0.00036814436,0.00072244037,0.0004414439,0.00066264404,0.0004606417,0.00042719874,0.00095233874],"category_scores_gemma":[0.0011633087,0.00021091424,0.00039795748,0.00048735697,0.0008633902,0.0006999156,0.0010620503,0.000893126,0.0002775558],"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.00006299392,0.00004914944,0.0005244182,0.00008807779,0.000017402826,0.00019519082,0.00018941381,0.036591467,0.025735151,0.8851129,0.0015725008,0.049861316],"study_design_scores_gemma":[0.0001074981,0.00037940903,0.0005677505,0.00007113339,0.000039646897,0.0010293716,0.0001269548,0.4416833,0.08155795,0.4262997,0.048014313,0.00012296317],"about_ca_topic_score_codex":0.0003379572,"about_ca_topic_score_gemma":0.00030470596,"teacher_disagreement_score":0.00095233874,"about_ca_system_score_codex":0.00047419345,"about_ca_system_score_gemma":0.00083291996,"threshold_uncertainty_score":0.003440559},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030883456,0.0012872333,0.9604877,0.00038535253,0.000059475133,0.000121334226,0.000051092265,0.0002330694,0.00649122],"genre_scores_gemma":[0.8935603,0.0012555986,0.1011823,0.00018520099,0.000052523876,0.00025840144,0.00008183761,0.000032045777,0.0033918452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935037,0.00022090421,0.000041286385,0.00008213393,0.00022756396,0.00007768265],"domain_scores_gemma":[0.9987326,0.00073664635,0.00019755751,0.00010231287,0.00018877172,0.00004210219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010389818,0.0007321276,0.00082635094,0.0005370363,0.0007133128,0.0009059112,0.001178511,0.0007410428,0.0008141979],"category_scores_gemma":[0.0026269197,0.00024717205,0.00034671207,0.000849363,0.00072475086,0.0009690288,0.00080578716,0.0005644288,0.00018966352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016004809,0.000121170866,0.00050974474,0.00039263946,0.00014285438,0.0007904958,0.00089297286,0.71057165,0.035572823,0.13378243,0.0056188516,0.11144427],"study_design_scores_gemma":[0.00003837476,0.00024626986,0.00015295722,0.000029839792,0.00005408531,0.00036247342,0.00007218149,0.96000314,0.0045175706,0.029250676,0.0052359877,0.000036377012],"about_ca_topic_score_codex":0.0016056555,"about_ca_topic_score_gemma":0.0024063531,"teacher_disagreement_score":0.0016056555,"about_ca_system_score_codex":0.00082074275,"about_ca_system_score_gemma":0.0009473405,"threshold_uncertainty_score":0.0059549212},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07965173,0.00075330754,0.90683544,0.0003448005,0.000056368037,0.00002118625,0.00008642007,0.00022119042,0.0120295985],"genre_scores_gemma":[0.96008927,0.0005750808,0.036422107,0.000102725586,0.00008213346,0.000033829037,0.00006463097,0.000036610407,0.0025935525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995788,0.00011120445,0.000012097745,0.000045696095,0.00016913193,0.000083107625],"domain_scores_gemma":[0.99909306,0.00058261707,0.00010097213,0.000068178626,0.0001282797,0.000026923733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068005506,0.00064366136,0.00042844244,0.0005356753,0.00027994608,0.0008723963,0.0005373542,0.0006989977,0.0010953738],"category_scores_gemma":[0.0023242692,0.00020136307,0.0004902329,0.00059032347,0.0009493369,0.0012577375,0.0004507706,0.00069683307,0.00028315868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074695825,0.00003163755,0.0010162987,0.000063708496,0.00003985373,0.00044208817,0.0001495799,0.7035626,0.010362555,0.26502535,0.0007804705,0.018451221],"study_design_scores_gemma":[0.000003662177,0.000022440123,0.00018323088,0.000005661304,0.000006880571,0.00015814119,0.0000131738525,0.97929335,0.0016959345,0.018050928,0.0005566002,0.000010007621],"about_ca_topic_score_codex":0.0019590969,"about_ca_topic_score_gemma":0.0011330966,"teacher_disagreement_score":0.0019590969,"about_ca_system_score_codex":0.0010238732,"about_ca_system_score_gemma":0.00064726133,"threshold_uncertainty_score":0.0074287653},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03954319,0.00040756012,0.95691293,0.0001612489,0.00003917593,0.000036369252,0.00003517352,0.00014142119,0.0027229558],"genre_scores_gemma":[0.6764003,0.00039999382,0.32124773,0.00010619796,0.000059208545,0.000073866126,0.00006170663,0.000029141813,0.0016219608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995339,0.00014662616,0.000037927926,0.000074467134,0.00015524428,0.00005184103],"domain_scores_gemma":[0.99919385,0.00043853113,0.0000877902,0.00012622031,0.000121186065,0.000032456614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068373495,0.00037146,0.00030736247,0.00033026512,0.00032757837,0.0006416674,0.0005772004,0.0005246556,0.0008407952],"category_scores_gemma":[0.0034504628,0.00015730811,0.00016405057,0.0006081379,0.0005934086,0.0010689945,0.0005217964,0.0006274837,0.00027238773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004805796,0.00008988312,0.0014520367,0.00018069994,0.000036524118,0.00021094101,0.00032905673,0.16480732,0.21864927,0.33583033,0.0014145686,0.27651882],"study_design_scores_gemma":[0.000042167445,0.00025005708,0.00038775167,0.00002879099,0.000026396221,0.00041043572,0.000032210814,0.87028295,0.074231066,0.04997465,0.0042873397,0.000046223722],"about_ca_topic_score_codex":0.00039332858,"about_ca_topic_score_gemma":0.0004924144,"teacher_disagreement_score":0.0008407952,"about_ca_system_score_codex":0.00049580855,"about_ca_system_score_gemma":0.00060455035,"threshold_uncertainty_score":0.0036159754},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53606296,0.0031351845,0.4490195,0.0005422833,0.00018115205,0.000050690523,0.00021154668,0.0016144513,0.009182214],"genre_scores_gemma":[0.98855186,0.0004705684,0.010309348,0.000037874193,0.000018619989,0.000009507383,0.000027051645,0.000020734255,0.00055440696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993703,0.00016201295,0.00003607699,0.000114515424,0.00015451497,0.00016263743],"domain_scores_gemma":[0.9963613,0.002479997,0.00032790718,0.0004080682,0.00034806016,0.00007464094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012915179,0.0011334362,0.0007656464,0.00061055244,0.0004541903,0.0009163465,0.00072838285,0.0007240898,0.00082817936],"category_scores_gemma":[0.005974301,0.00022184769,0.00026568005,0.0006117678,0.00065835915,0.0012430246,0.00077850616,0.00049632683,0.00018417787],"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.00051561155,0.00017425895,0.003042252,0.00023950191,0.00011042517,0.00065215223,0.00029541727,0.79132867,0.10999918,0.02998632,0.0016057969,0.062050458],"study_design_scores_gemma":[0.000038240683,0.0005403089,0.0016303798,0.000025620919,0.00015716822,0.00049574225,0.00010103269,0.94012314,0.0454473,0.009601081,0.001794098,0.00004589963],"about_ca_topic_score_codex":0.0014128509,"about_ca_topic_score_gemma":0.0018648532,"teacher_disagreement_score":0.0014128509,"about_ca_system_score_codex":0.0008324815,"about_ca_system_score_gemma":0.0010324696,"threshold_uncertainty_score":0.006830275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014043377,0.002296768,0.97812676,0.00045529925,0.00009166418,0.000047626912,0.000019620038,0.000111495465,0.0048073316],"genre_scores_gemma":[0.7275277,0.0039476566,0.26285943,0.00037852328,0.00026635578,0.00032165414,0.00009649026,0.000056405534,0.004545894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989838,0.000559156,0.000033894514,0.00012194875,0.00021412758,0.00008707002],"domain_scores_gemma":[0.9983101,0.0011919963,0.00013001381,0.00017213129,0.00016016011,0.000035673795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016076264,0.00063301984,0.00064832135,0.00072704925,0.0007879197,0.0012225448,0.00089592586,0.0009320998,0.0008140202],"category_scores_gemma":[0.003329359,0.00033388144,0.00037756664,0.0013274299,0.0011620495,0.0015722181,0.001218401,0.00068581355,0.00023561878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044961896,0.000038267593,0.0003041359,0.00013542337,0.000046885223,0.00007820202,0.00018843642,0.75481653,0.0028031636,0.15067914,0.0023877649,0.08847708],"study_design_scores_gemma":[0.000020544972,0.000060504357,0.000087860964,0.000019258112,0.000016749938,0.00007278756,0.000042480016,0.88231695,0.001004023,0.11081892,0.0055263466,0.000013565315],"about_ca_topic_score_codex":0.0010844598,"about_ca_topic_score_gemma":0.0011255002,"teacher_disagreement_score":0.0016076264,"about_ca_system_score_codex":0.00097649405,"about_ca_system_score_gemma":0.00077850244,"threshold_uncertainty_score":0.008502066},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13671352,0.0029826756,0.85430944,0.00024551005,0.00005654593,0.000026398919,0.000023291966,0.000073997224,0.0055685733],"genre_scores_gemma":[0.9642312,0.0015952976,0.03260679,0.00004343258,0.00006362659,0.000027825496,0.00001843471,0.000009449026,0.001403815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996828,0.0001405835,0.0000060204284,0.000024942847,0.000107799715,0.000037817375],"domain_scores_gemma":[0.99903095,0.00067463494,0.00009447364,0.00007495801,0.00010523969,0.000019727315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039188465,0.00036809786,0.0002711316,0.00019687072,0.00023472703,0.00044959222,0.00042668692,0.00039918628,0.0003870545],"category_scores_gemma":[0.0014509148,0.000103490616,0.00023719025,0.00032507398,0.00046582587,0.0005937308,0.00030965754,0.00037929774,0.0001035375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009566218,0.000079042155,0.0016816983,0.00022466137,0.000088257984,0.0005374497,0.0002850529,0.7183295,0.05344978,0.16742349,0.000913451,0.056892037],"study_design_scores_gemma":[0.000009106557,0.00019579534,0.00045419767,0.000009435283,0.00002358878,0.0002489407,0.000035971752,0.9719714,0.006110732,0.018820494,0.0021079571,0.000012319362],"about_ca_topic_score_codex":0.0005115879,"about_ca_topic_score_gemma":0.00072545017,"teacher_disagreement_score":0.0005115879,"about_ca_system_score_codex":0.0005111025,"about_ca_system_score_gemma":0.00027986921,"threshold_uncertainty_score":0.0037083626},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02333484,0.0018533862,0.95500606,0.0012311018,0.0003019695,0.00006485588,0.00008608116,0.00017955608,0.017942254],"genre_scores_gemma":[0.6695072,0.0034225516,0.31573018,0.0011060408,0.0004301511,0.00030407915,0.00012944802,0.00010180122,0.0092685325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965787,0.00015562036,0.0000122864285,0.000037536818,0.000102949256,0.000033738655],"domain_scores_gemma":[0.99885166,0.0006900707,0.00008385799,0.00017449976,0.0001547891,0.00004520168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058888766,0.00043030232,0.0003620633,0.00046658845,0.00036974714,0.00087058893,0.0006939463,0.00080255454,0.0021455348],"category_scores_gemma":[0.0029654964,0.00018800364,0.00025268976,0.0007854081,0.0022610764,0.0011991406,0.0011578337,0.0016231177,0.0005349378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000479333,0.000023329989,0.00012397466,0.000099750774,0.0000060651323,0.00007507442,0.00009379292,0.07897061,0.0049166526,0.89181244,0.0012893121,0.022541184],"study_design_scores_gemma":[0.00003683567,0.000052237694,0.00008637265,0.00004387601,0.0000054356715,0.00012768277,0.00002706618,0.6259522,0.003784889,0.35873693,0.011114472,0.000031985233],"about_ca_topic_score_codex":0.0010276791,"about_ca_topic_score_gemma":0.00084945,"teacher_disagreement_score":0.0021455348,"about_ca_system_score_codex":0.0009420759,"about_ca_system_score_gemma":0.0007840519,"threshold_uncertainty_score":0.0071775317},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33409393,0.00030222573,0.64608276,0.00028626685,0.00028638114,0.00040609445,0.00018416838,0.0026169878,0.015741142],"genre_scores_gemma":[0.8705194,0.00008318047,0.12422379,0.00009272295,0.000017821865,0.00011221885,0.00010190785,0.00002849882,0.004820408],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996853,0.00006591623,0.000017328786,0.00006541742,0.00012802858,0.00003817668],"domain_scores_gemma":[0.999519,0.00008408288,0.00004323257,0.00013405841,0.000177501,0.000042079166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038154444,0.0004196025,0.0004284326,0.00014285323,0.00020915772,0.0005095148,0.0015741504,0.00063732394,0.0025828762],"category_scores_gemma":[0.00066189235,0.00017832691,0.00024605144,0.00014849004,0.00033757222,0.00072105485,0.00045709955,0.0005612353,0.00066470983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008508015,0.00035931545,0.0012269875,0.00028143093,0.0001588598,0.0006929987,0.00025119225,0.0375476,0.85293376,0.011793924,0.0018433305,0.092059836],"study_design_scores_gemma":[0.00038730906,0.008397657,0.0018643477,0.00004889988,0.0002415235,0.002103932,0.000106678584,0.2973504,0.66674674,0.0027003384,0.019909013,0.00014307119],"about_ca_topic_score_codex":0.0006092733,"about_ca_topic_score_gemma":0.0009487876,"teacher_disagreement_score":0.0025828762,"about_ca_system_score_codex":0.0003012823,"about_ca_system_score_gemma":0.00035085998,"threshold_uncertainty_score":0.008640587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037447,0.00072853465,0.9586424,0.00028767428,0.00007703553,0.000064003834,0.00004840219,0.00014766095,0.0025571939],"genre_scores_gemma":[0.7489239,0.0010518949,0.24726853,0.00011119731,0.00011294001,0.00016147067,0.00010357942,0.00010200789,0.002164504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988254,0.0005628568,0.000050209284,0.00014704802,0.00025411375,0.0001604128],"domain_scores_gemma":[0.99592716,0.003339173,0.0002737226,0.0001843335,0.00018252907,0.000093016344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002010589,0.001011913,0.0012770469,0.00072774594,0.00078089006,0.0013402145,0.0012455508,0.0010536355,0.0010964],"category_scores_gemma":[0.005719726,0.00056956033,0.0005422384,0.0018259621,0.0010108381,0.0022358703,0.0008878291,0.001099365,0.00021923064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010888895,0.000034670356,0.00013004057,0.000077926365,0.000017938146,0.00004448299,0.000040748397,0.9643588,0.0016244432,0.019379862,0.0005268917,0.013655248],"study_design_scores_gemma":[0.000018032255,0.000028892426,0.000041944484,0.0000045170023,0.000005162259,0.000013306122,0.00001196928,0.98592746,0.000823687,0.012748521,0.0003716269,0.0000049150603],"about_ca_topic_score_codex":0.0028752338,"about_ca_topic_score_gemma":0.0026279432,"teacher_disagreement_score":0.0028752338,"about_ca_system_score_codex":0.0020601833,"about_ca_system_score_gemma":0.0017542002,"threshold_uncertainty_score":0.014947772},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03769724,0.00097637455,0.9581719,0.00011703134,0.00015264301,0.00008294294,0.000054513035,0.00075350306,0.001993926],"genre_scores_gemma":[0.880089,0.00052710687,0.11738839,0.00012859087,0.0001513816,0.000102677936,0.0001235609,0.000044785113,0.0014444464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992207,0.00022357808,0.000028088247,0.00015038264,0.00020347584,0.0001737224],"domain_scores_gemma":[0.9990459,0.00033557747,0.00010901528,0.00021507991,0.00022011949,0.00007438537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010711311,0.0005570584,0.0006961637,0.00091973285,0.001156137,0.0008841374,0.0016325752,0.0005541938,0.0008418049],"category_scores_gemma":[0.0016659256,0.00021182094,0.0003751928,0.0013948319,0.0006655215,0.0009204035,0.00090638647,0.0005416604,0.00019156843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004968385,0.0001918785,0.0020019556,0.0001957899,0.00016989087,0.00029584527,0.00039356572,0.5918157,0.029562404,0.070372015,0.0077429754,0.2967612],"study_design_scores_gemma":[0.00002311275,0.00016753172,0.00048512474,0.000011992109,0.000037587037,0.0001764609,0.000047620117,0.976795,0.004913868,0.012884301,0.0044309264,0.000026491622],"about_ca_topic_score_codex":0.0071126684,"about_ca_topic_score_gemma":0.0071256417,"teacher_disagreement_score":0.0071126684,"about_ca_system_score_codex":0.0009040349,"about_ca_system_score_gemma":0.0010092835,"threshold_uncertainty_score":0.014142573},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044164617,0.00054642436,0.8877108,0.0010383512,0.0003101199,0.00009144103,0.00034378486,0.0023953186,0.06339906],"genre_scores_gemma":[0.53993624,0.0005902544,0.4170597,0.00036446194,0.00013761283,0.00029736647,0.00052483444,0.00066715287,0.040422462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950683,0.00017303937,0.000019901112,0.000052655832,0.00017451434,0.00007299093],"domain_scores_gemma":[0.99899405,0.0004424614,0.0000417096,0.00028927554,0.00018333386,0.000049212988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004928791,0.0005313379,0.0005738496,0.00038203778,0.00036585674,0.0008933512,0.00088427856,0.0006217091,0.012888863],"category_scores_gemma":[0.002851681,0.00029340864,0.0003141401,0.0008730877,0.0005930682,0.0013091255,0.0011447322,0.0011987934,0.0018912075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002855384,0.0000746893,0.00036854,0.00017433791,0.00003683248,0.00013503272,0.00011550577,0.44559744,0.008818801,0.3928988,0.023710765,0.12778373],"study_design_scores_gemma":[0.00003450493,0.000023159,0.00006355738,0.000014972722,0.00000558739,0.000038879574,0.00001609034,0.91635835,0.0022765724,0.07349859,0.0076609296,0.000008791557],"about_ca_topic_score_codex":0.0024576809,"about_ca_topic_score_gemma":0.004275382,"teacher_disagreement_score":0.012888863,"about_ca_system_score_codex":0.0008872603,"about_ca_system_score_gemma":0.0008556014,"threshold_uncertainty_score":0.043117523},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5630868,0.0028783884,0.42323625,0.0012268048,0.00015393237,0.00013487307,0.00029709167,0.00052264007,0.008463241],"genre_scores_gemma":[0.97892725,0.00073531433,0.01807074,0.00008538289,0.000107944674,0.000082223814,0.00009290171,0.000054469598,0.0018436611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927515,0.00025630108,0.000020363628,0.00006993676,0.00020633431,0.00017197953],"domain_scores_gemma":[0.9939448,0.004237307,0.0007116312,0.00031027122,0.0005904896,0.00020547515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013215082,0.0006461839,0.0006049578,0.000790419,0.0007223523,0.0008228755,0.0007519166,0.0011873172,0.001635641],"category_scores_gemma":[0.0076925415,0.00028811433,0.00038191164,0.00072482816,0.0011915609,0.0016055737,0.0010087976,0.0012725445,0.00018315305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031929134,0.00012255112,0.0012039982,0.00027634593,0.000039728136,0.0003050949,0.00039615203,0.6856282,0.02107612,0.2725831,0.0017685724,0.016280964],"study_design_scores_gemma":[0.000015534728,0.00004419511,0.00017477371,0.000010425625,0.000005606809,0.00004519426,0.000022277312,0.9736534,0.0012447628,0.024437329,0.00033662692,0.000009977445],"about_ca_topic_score_codex":0.0023441936,"about_ca_topic_score_gemma":0.0012649226,"teacher_disagreement_score":0.0023441936,"about_ca_system_score_codex":0.0013394272,"about_ca_system_score_gemma":0.00080441736,"threshold_uncertainty_score":0.009718239},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31828496,0.0012043836,0.65161234,0.0009393396,0.00005085444,0.00007328257,0.00037123886,0.0003982698,0.027065445],"genre_scores_gemma":[0.98931247,0.00032406053,0.008500597,0.000060695867,0.000028086035,0.0000640949,0.000091214155,0.00004017767,0.0015785398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990139,0.00034656003,0.000027383418,0.000091691785,0.00026659094,0.00025380758],"domain_scores_gemma":[0.99344206,0.0044596535,0.0006748327,0.00029541826,0.0009583161,0.00016973475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018312408,0.0008888482,0.00086405105,0.0008098465,0.0004732905,0.0013096281,0.0009961644,0.00095250795,0.0019512447],"category_scores_gemma":[0.0091752345,0.00059251365,0.0005465278,0.0008118659,0.0024056274,0.0015958567,0.0013583791,0.0009108264,0.00043099548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006431939,0.000029747038,0.0004450329,0.000061748964,0.00002591136,0.00016270594,0.000112263835,0.93463594,0.0025119903,0.057445515,0.0006783657,0.0038264832],"study_design_scores_gemma":[0.0000058867986,0.00001377167,0.00015504732,0.000011176264,0.000006111689,0.000033469514,0.000024345574,0.9853596,0.0005363331,0.013760204,0.00008458042,0.000009453403],"about_ca_topic_score_codex":0.004723657,"about_ca_topic_score_gemma":0.0027633235,"teacher_disagreement_score":0.004723657,"about_ca_system_score_codex":0.0020593982,"about_ca_system_score_gemma":0.0016612753,"threshold_uncertainty_score":0.01494205},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5685728,0.0013710413,0.41596463,0.00026203503,0.00002790302,0.000052599727,0.00008220049,0.00021176515,0.013454972],"genre_scores_gemma":[0.99653924,0.00014347001,0.0028781537,0.000011551784,0.0000070224055,0.0000135332775,0.00001246228,0.000003738474,0.0003909929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903274,0.00036661356,0.00003304088,0.000089864276,0.00031818417,0.0001596428],"domain_scores_gemma":[0.9957253,0.0029367534,0.0003970851,0.00023653533,0.0006516783,0.00005272162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012872239,0.00066064385,0.00046018724,0.00044935572,0.00031823703,0.0007353191,0.0004870595,0.0006000146,0.0006433685],"category_scores_gemma":[0.005530796,0.00020648389,0.00024581814,0.0006538588,0.0007806836,0.00059127115,0.0006599611,0.000306213,0.0001430397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016207455,0.0000302239,0.0020770733,0.00008628204,0.00006382548,0.00026215232,0.00019903804,0.9499348,0.010732189,0.016420254,0.00029099896,0.019741036],"study_design_scores_gemma":[0.000008456791,0.00012213596,0.00064070633,0.000006777399,0.000019871311,0.00012305375,0.000040269137,0.9946503,0.0016989297,0.0024593424,0.0002187526,0.000011426444],"about_ca_topic_score_codex":0.0030548077,"about_ca_topic_score_gemma":0.0021215181,"teacher_disagreement_score":0.0030548077,"about_ca_system_score_codex":0.0008899087,"about_ca_system_score_gemma":0.0006025539,"threshold_uncertainty_score":0.0068075657},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011468558,0.0009862586,0.9773287,0.00021659296,0.00016726315,0.000055129716,0.00014096513,0.00023092619,0.009405549],"genre_scores_gemma":[0.6485059,0.0020125727,0.3354753,0.0004059974,0.00015652506,0.00022796882,0.0006375302,0.000054936136,0.012523211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934274,0.00017672085,0.00002763733,0.000084250234,0.00028272276,0.000085990614],"domain_scores_gemma":[0.9992224,0.00025601123,0.00006900589,0.00015096397,0.00026995034,0.000031718788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043063035,0.0004127365,0.00047803335,0.00040799665,0.00032402968,0.00072291185,0.00066364044,0.00050241646,0.002236082],"category_scores_gemma":[0.0015372934,0.00016408107,0.00023607301,0.000984277,0.00063803804,0.0006742541,0.0006935083,0.0005814656,0.00087930704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042192172,0.00006444416,0.001028351,0.0002892247,0.000052779385,0.0003133803,0.00016615415,0.1772115,0.0345492,0.5023059,0.0065060016,0.2770911],"study_design_scores_gemma":[0.000060344195,0.00019093201,0.00038125395,0.000046578916,0.00002980473,0.0005180581,0.000038000362,0.8681896,0.018551487,0.08226099,0.029699808,0.00003324949],"about_ca_topic_score_codex":0.0013453146,"about_ca_topic_score_gemma":0.0019123235,"teacher_disagreement_score":0.002236082,"about_ca_system_score_codex":0.00075892854,"about_ca_system_score_gemma":0.00078038237,"threshold_uncertainty_score":0.007480383},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094120175,0.0017821463,0.8697927,0.00086640316,0.00008626304,0.000055416596,0.00038611077,0.0001625642,0.03274822],"genre_scores_gemma":[0.97053057,0.0021429781,0.016777357,0.00016356293,0.00013778162,0.00006610658,0.00013250658,0.000056945275,0.009992231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995695,0.00014162739,0.000009766811,0.000040945437,0.0001642557,0.00007401439],"domain_scores_gemma":[0.9983027,0.001098961,0.0001875788,0.000105093706,0.0002384823,0.00006712642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090996805,0.0011560533,0.0007587926,0.00074323744,0.00043884743,0.00072391005,0.00057431357,0.0007677488,0.002779476],"category_scores_gemma":[0.0028949745,0.0002693158,0.0005850677,0.0006253634,0.0017626993,0.0011041494,0.0009194389,0.0007380504,0.00039951445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010744346,0.000025402149,0.00057427253,0.00011592982,0.000025543972,0.00036286176,0.000167866,0.71618265,0.008090691,0.2658272,0.0014354459,0.0070846314],"study_design_scores_gemma":[0.00000656576,0.00005071839,0.00024284283,0.000013707417,0.00000921393,0.00013303656,0.000045010085,0.9651059,0.0012282635,0.032441925,0.00070508785,0.000017712886],"about_ca_topic_score_codex":0.002990893,"about_ca_topic_score_gemma":0.0017921958,"teacher_disagreement_score":0.002990893,"about_ca_system_score_codex":0.0011271483,"about_ca_system_score_gemma":0.00074671645,"threshold_uncertainty_score":0.009298325},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06990096,0.0007652393,0.92123413,0.0002671685,0.00006121712,0.00008403456,0.00006628493,0.000107653665,0.007513319],"genre_scores_gemma":[0.9300638,0.00082076376,0.06523266,0.00005536614,0.000054395496,0.000109165914,0.000043064534,0.000016611853,0.003604082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941254,0.00021077767,0.000025146162,0.0000814853,0.00017934896,0.00009080612],"domain_scores_gemma":[0.9986829,0.00081993913,0.00019168957,0.00008136612,0.00017227391,0.000051805542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087968126,0.00050998444,0.00043249605,0.00051909697,0.0005191559,0.0006443009,0.0007365057,0.00046308312,0.0006409425],"category_scores_gemma":[0.0021424806,0.0002713222,0.0002237406,0.00093490334,0.00085720944,0.0008468222,0.00056128314,0.00037854913,0.00011603856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009683459,0.00004321045,0.00047349196,0.00007961766,0.000021580296,0.00024670223,0.00013872993,0.88560104,0.005183694,0.07763098,0.00072853896,0.02975551],"study_design_scores_gemma":[0.0000121512685,0.000030470337,0.000088359244,0.0000042110883,0.000008478577,0.000043227607,0.000018785124,0.9855327,0.0006805228,0.012761002,0.0008135146,0.0000065742806],"about_ca_topic_score_codex":0.0069236453,"about_ca_topic_score_gemma":0.006997885,"teacher_disagreement_score":0.0069236453,"about_ca_system_score_codex":0.0012231919,"about_ca_system_score_gemma":0.0013534146,"threshold_uncertainty_score":0.013766706},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035523504,0.00020014631,0.98918754,0.00022226278,0.00008678928,0.0001806832,0.000022931388,0.00021905765,0.0063283183],"genre_scores_gemma":[0.31280777,0.00046352326,0.67653155,0.00022259196,0.00006321513,0.0011490932,0.000050378836,0.000057000525,0.008654876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992442,0.00029760308,0.000033054745,0.00009879133,0.0002729608,0.00005354503],"domain_scores_gemma":[0.99961936,0.00012046215,0.00006275211,0.00005010841,0.00011164177,0.000035602974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011578498,0.0005735518,0.00034556192,0.0002796073,0.0004189081,0.0012609108,0.0013285164,0.0010292517,0.0041486523],"category_scores_gemma":[0.0014265046,0.00031959216,0.0005074174,0.00014498827,0.0007219521,0.00077634107,0.00093847944,0.0010751847,0.00094201305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018426875,0.00012360176,0.0005020972,0.00070161326,0.00007928418,0.00049110065,0.00031017727,0.38112944,0.05020688,0.4902806,0.0031599542,0.07283095],"study_design_scores_gemma":[0.000110469235,0.0004058067,0.00018289937,0.000087050896,0.000036884285,0.00022401263,0.00003698517,0.89783895,0.011745049,0.04953696,0.03976685,0.000028135919],"about_ca_topic_score_codex":0.000628238,"about_ca_topic_score_gemma":0.00077466836,"teacher_disagreement_score":0.0041486523,"about_ca_system_score_codex":0.0007467598,"about_ca_system_score_gemma":0.0009634794,"threshold_uncertainty_score":0.0138786435},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049285505,0.00018558587,0.9414163,0.00029547824,0.000064145206,0.00002889531,0.000084604435,0.00017752186,0.008461849],"genre_scores_gemma":[0.84981674,0.00023161026,0.14593516,0.0001944871,0.000075118165,0.00010123342,0.00011602728,0.000052326424,0.0034773261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989981,0.00032737144,0.000036572135,0.00012955343,0.00036834605,0.00014005782],"domain_scores_gemma":[0.9973207,0.0015081359,0.00030146757,0.00042835867,0.0003020181,0.00013937148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009787066,0.00037115734,0.0005984403,0.000788252,0.00048675854,0.0013675869,0.0008219641,0.00082923163,0.0018774441],"category_scores_gemma":[0.0050506997,0.00023992053,0.0003596696,0.00057590817,0.0018732642,0.0013634604,0.0019486815,0.0014535922,0.0004325463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012339003,0.000032144224,0.00069818966,0.00007757222,0.000018443196,0.00018970494,0.00013568634,0.100880004,0.013167448,0.8511864,0.0012268788,0.032264076],"study_design_scores_gemma":[0.0000141200635,0.000034738317,0.00011694266,0.000014597111,0.000003953049,0.00008458806,0.000020886397,0.78165853,0.004957637,0.21198517,0.0010851182,0.000023716306],"about_ca_topic_score_codex":0.00049691426,"about_ca_topic_score_gemma":0.00044968308,"teacher_disagreement_score":0.0018774441,"about_ca_system_score_codex":0.0008477192,"about_ca_system_score_gemma":0.00072165806,"threshold_uncertainty_score":0.0062807202},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0225094,0.0024532452,0.9690346,0.00023355345,0.00017897345,0.000089744964,0.00008669304,0.0003523943,0.0050614835],"genre_scores_gemma":[0.5254012,0.003235714,0.46379635,0.00038606543,0.0005917508,0.000277509,0.00028690614,0.000044169934,0.0059803114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985879,0.0003704334,0.00010818778,0.00014202784,0.0006701832,0.0001212027],"domain_scores_gemma":[0.9989202,0.00037748908,0.00015441475,0.00019514008,0.00029600805,0.000056654204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013920631,0.0011221649,0.0008471334,0.0006878256,0.00045914922,0.0011577902,0.0011909197,0.0006687706,0.002036859],"category_scores_gemma":[0.0020989657,0.00047650974,0.0006983665,0.00094167027,0.0006891178,0.0014115731,0.0017585099,0.0010479875,0.00071391714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070749223,0.00012560599,0.0010639379,0.00064265815,0.00058903114,0.0008389872,0.0005087737,0.16457961,0.13643982,0.14716728,0.0052395537,0.54209715],"study_design_scores_gemma":[0.00021832905,0.0006519668,0.00069499924,0.00009893708,0.00033850086,0.001494318,0.00005868843,0.8573569,0.060541302,0.0505875,0.0278007,0.00015789669],"about_ca_topic_score_codex":0.00026569347,"about_ca_topic_score_gemma":0.0005578527,"teacher_disagreement_score":0.002036859,"about_ca_system_score_codex":0.00050394767,"about_ca_system_score_gemma":0.00042687228,"threshold_uncertainty_score":0.0073620677},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04020721,0.00116138,0.94745755,0.00047873106,0.000058041984,0.00009291655,0.00004442405,0.00015066292,0.0103491405],"genre_scores_gemma":[0.9043793,0.0010442943,0.08990268,0.00010663794,0.000047902486,0.00010413967,0.000046580983,0.000024401741,0.0043441467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933654,0.00027728573,0.000022980854,0.00009431635,0.00018636422,0.000082477214],"domain_scores_gemma":[0.9996092,0.00021744365,0.00004290438,0.000059694048,0.00005102928,0.000019758962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093688065,0.00038067775,0.00043755627,0.0003592265,0.00039834596,0.0011469519,0.00072137505,0.00057250424,0.0012976836],"category_scores_gemma":[0.001698302,0.00016150052,0.00028540118,0.00094936497,0.0006389478,0.0010472165,0.0007223082,0.00045596002,0.00019489693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010120352,0.00006959664,0.00043377312,0.00008640915,0.00002884281,0.000158091,0.00009527285,0.6744458,0.004769912,0.21442582,0.0025502285,0.10283503],"study_design_scores_gemma":[0.000013138796,0.000029561981,0.00013745378,0.000006782314,0.0000066015573,0.00004903543,0.000038045317,0.93966895,0.0010846851,0.056871675,0.0020880245,0.000006139131],"about_ca_topic_score_codex":0.002005386,"about_ca_topic_score_gemma":0.0018365181,"teacher_disagreement_score":0.002005386,"about_ca_system_score_codex":0.001104234,"about_ca_system_score_gemma":0.0008976908,"threshold_uncertainty_score":0.008011818},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006477539,0.00007496783,0.9922651,0.000079500816,0.000028918057,0.000036573565,0.000010514579,0.00015841324,0.0008684846],"genre_scores_gemma":[0.5308118,0.00017355119,0.46423823,0.00020217449,0.00006570158,0.0003622665,0.00014381944,0.00007430579,0.0039281626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854124,0.0005176242,0.00006289257,0.00035642076,0.00030590402,0.00021593038],"domain_scores_gemma":[0.9979791,0.0012422489,0.0001499656,0.00024935903,0.00026843912,0.00011092065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018364001,0.00064324646,0.001558625,0.00046784992,0.00094729045,0.0010213577,0.0021382438,0.0015598305,0.002253575],"category_scores_gemma":[0.0049740407,0.00042997077,0.0006384821,0.0009888588,0.0013088469,0.0015824927,0.0024491316,0.0012955324,0.00063630246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018309032,0.00010735636,0.00061102904,0.00007585681,0.000056448655,0.00007376672,0.0001430615,0.83925104,0.0019568217,0.04187829,0.0018497393,0.11381336],"study_design_scores_gemma":[0.000039751918,0.000039245093,0.00005118999,0.0000034608365,0.0000048763136,0.00003208469,0.0000154382,0.9856888,0.00041211466,0.01317187,0.0005347772,0.000006422931],"about_ca_topic_score_codex":0.00210918,"about_ca_topic_score_gemma":0.0021103595,"teacher_disagreement_score":0.002253575,"about_ca_system_score_codex":0.0008891154,"about_ca_system_score_gemma":0.0024145688,"threshold_uncertainty_score":0.009711921},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07993844,0.000861923,0.89864314,0.0013939184,0.000076369455,0.000093057235,0.00030654832,0.00028971807,0.018396862],"genre_scores_gemma":[0.9273036,0.001477818,0.06271625,0.00022478345,0.0001801656,0.00029388588,0.00033070313,0.00005864884,0.007414156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997654,0.0008572722,0.00009213547,0.00027674495,0.00082241086,0.00029745582],"domain_scores_gemma":[0.9946197,0.0029490674,0.0009262041,0.0008123385,0.00049554056,0.00019713554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017709825,0.0007422709,0.0007106176,0.0008646914,0.0006619721,0.0020279777,0.0007706636,0.0014289907,0.0020120956],"category_scores_gemma":[0.007686334,0.00038273554,0.0004177976,0.0011199787,0.0023773059,0.0036675327,0.0025077178,0.0021937452,0.0005603427],"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.0001669881,0.00002522223,0.00019467612,0.00012291413,0.00001895379,0.00014391389,0.00019093697,0.099134795,0.0036576297,0.8744585,0.0019215868,0.01996382],"study_design_scores_gemma":[0.000048489528,0.00010480993,0.00010158962,0.000042763713,0.000011646812,0.00017171532,0.0000716922,0.4279068,0.0037003474,0.56374407,0.0040599997,0.000035975503],"about_ca_topic_score_codex":0.00073234807,"about_ca_topic_score_gemma":0.0004174095,"teacher_disagreement_score":0.0020279777,"about_ca_system_score_codex":0.0012883021,"about_ca_system_score_gemma":0.001146142,"threshold_uncertainty_score":0.009365976},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056028336,0.00019379372,0.94153994,0.00012639521,0.000014827389,0.000025015768,0.000027314636,0.00015789222,0.0018864785],"genre_scores_gemma":[0.8419219,0.0002463984,0.15657717,0.000032128548,0.000028882056,0.000062541854,0.000033994467,0.000043729422,0.0010532105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959403,0.0002062038,0.000012053178,0.000039066043,0.00008965805,0.000059084407],"domain_scores_gemma":[0.9992424,0.00053054304,0.00007576076,0.000053259788,0.00007470864,0.000023347722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081280136,0.000393999,0.00043041614,0.00033162464,0.00033994467,0.00046812563,0.00056745927,0.00026243666,0.0006991713],"category_scores_gemma":[0.0022928745,0.00018433986,0.00018863982,0.0006101639,0.00045598194,0.0006411319,0.0003889175,0.00038562075,0.00013334166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013158725,0.00007505556,0.0006660582,0.00006666978,0.000022302336,0.000082910665,0.000087649816,0.88754267,0.014056583,0.030651728,0.000876976,0.06573968],"study_design_scores_gemma":[0.0000070828282,0.00001860655,0.000057784415,0.000001927066,0.0000034363622,0.000014686296,0.000007894228,0.99202263,0.0025334079,0.005086906,0.00024332323,0.000002263944],"about_ca_topic_score_codex":0.0014327304,"about_ca_topic_score_gemma":0.0015108638,"teacher_disagreement_score":0.0014327304,"about_ca_system_score_codex":0.00071669184,"about_ca_system_score_gemma":0.00079614477,"threshold_uncertainty_score":0.005199969},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4347002,0.0024789944,0.53897566,0.00047851496,0.00005973197,0.00008605662,0.0002645346,0.00034854093,0.02260777],"genre_scores_gemma":[0.9922395,0.00046796928,0.0063445712,0.000028838162,0.000024835641,0.000025030287,0.000038326973,0.00001361391,0.0008173197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863654,0.00055065565,0.000057690355,0.00015188547,0.0003918928,0.00021128151],"domain_scores_gemma":[0.9945368,0.0034312464,0.0007116861,0.00027229614,0.00094580004,0.00010201225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013415836,0.0012394193,0.0010976122,0.0006164376,0.00049503526,0.0011952211,0.00077924575,0.0010171531,0.0012619657],"category_scores_gemma":[0.0068931654,0.00032690138,0.0005568561,0.0009448117,0.0010306602,0.0011474153,0.0009169159,0.0006801669,0.00037631165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019493377,0.000038195147,0.0018882336,0.00011983562,0.000077779776,0.00044471712,0.00015252465,0.96696657,0.010681624,0.012451234,0.00025705062,0.0067272843],"study_design_scores_gemma":[0.0000074273075,0.00009230718,0.00050474633,0.000008417204,0.000027498696,0.000234526,0.00003750348,0.99581784,0.0014276413,0.0016957679,0.00013299195,0.0000133048325],"about_ca_topic_score_codex":0.0028382095,"about_ca_topic_score_gemma":0.0014295215,"teacher_disagreement_score":0.0028382095,"about_ca_system_score_codex":0.0009240945,"about_ca_system_score_gemma":0.0008261612,"threshold_uncertainty_score":0.007095039},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124611676,0.0007196522,0.8670194,0.0002508062,0.000044028493,0.000106483196,0.000061638326,0.0001647089,0.0070216535],"genre_scores_gemma":[0.9757032,0.00023918421,0.02242584,0.000052244148,0.000012738527,0.000053104286,0.000026516198,0.0000075600924,0.0014795748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993957,0.00022199939,0.000017042454,0.00007350144,0.0001759687,0.000115767296],"domain_scores_gemma":[0.99885106,0.0007511405,0.00012699116,0.000096892116,0.00012895813,0.00004487188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010656696,0.0007167858,0.00057803554,0.00055315834,0.0006268322,0.00071081705,0.001145486,0.0008525435,0.0015462412],"category_scores_gemma":[0.0020511604,0.00022728032,0.0005052162,0.00046925934,0.0011312476,0.0011765115,0.001071373,0.0005716515,0.0002213632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001144666,0.00006981918,0.00069610425,0.00009579241,0.00003938957,0.00024993627,0.000269038,0.89060193,0.00738382,0.061136536,0.0010424396,0.038300745],"study_design_scores_gemma":[0.000012332155,0.000108798784,0.00016695983,0.000009158294,0.00001787447,0.000098516546,0.00005940002,0.98515064,0.0010556284,0.012502783,0.0008063013,0.000011598685],"about_ca_topic_score_codex":0.0029845964,"about_ca_topic_score_gemma":0.003844985,"teacher_disagreement_score":0.0029845964,"about_ca_system_score_codex":0.00089005206,"about_ca_system_score_gemma":0.0008091377,"threshold_uncertainty_score":0.006457746},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033975843,0.0046035093,0.9343942,0.004975912,0.00042005547,0.00006410028,0.000109499255,0.00045517884,0.021001764],"genre_scores_gemma":[0.81871825,0.0040578023,0.16878979,0.0011654339,0.0011632314,0.00010908431,0.00011769802,0.00013195665,0.0057468265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831367,0.0006097707,0.000066861816,0.00017746694,0.00070125906,0.00013085503],"domain_scores_gemma":[0.99157274,0.0057036714,0.00049095316,0.0012440861,0.0008327289,0.0001558816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002098793,0.0007606811,0.001079466,0.0010155414,0.0005677341,0.0023273604,0.0017256383,0.0012729567,0.004257717],"category_scores_gemma":[0.0127660725,0.00029529788,0.00029716158,0.0012105947,0.0019288126,0.0058842446,0.0019597122,0.002067056,0.00057600206],"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.00036439532,0.00021976729,0.0021639634,0.00044609958,0.00009680159,0.00016663356,0.00027685123,0.073014885,0.041757654,0.5620552,0.0059578726,0.3134799],"study_design_scores_gemma":[0.00008015411,0.00036782635,0.00073213887,0.00018540716,0.00009388444,0.0004335616,0.00010348189,0.47719172,0.01775224,0.48087502,0.022112742,0.00007183913],"about_ca_topic_score_codex":0.0004962615,"about_ca_topic_score_gemma":0.00064095866,"teacher_disagreement_score":0.004257717,"about_ca_system_score_codex":0.000876382,"about_ca_system_score_gemma":0.0008905343,"threshold_uncertainty_score":0.014243484},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008463952,0.00025979,0.98450893,0.00022757953,0.00007829571,0.000070532995,0.000042521002,0.0001309387,0.00621745],"genre_scores_gemma":[0.60996675,0.0008155031,0.37934282,0.00040627175,0.00014309694,0.00037532413,0.00011547348,0.00005308379,0.008781681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925727,0.0002339649,0.00003370449,0.000108505774,0.00027415686,0.00009233318],"domain_scores_gemma":[0.9984232,0.00074368255,0.000109084154,0.0003274065,0.00033157025,0.00006495363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000668228,0.00089754077,0.00045827008,0.0006754021,0.00072538067,0.00070123986,0.0011736215,0.0012007024,0.0017562205],"category_scores_gemma":[0.002838389,0.00024493263,0.0004071355,0.0007344511,0.0011814057,0.0013328494,0.0016579373,0.0009867168,0.0006941259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014056641,0.00010397873,0.00037561794,0.00018563315,0.000048911013,0.0005434096,0.00046195695,0.20536004,0.07986807,0.55534136,0.004830337,0.15274018],"study_design_scores_gemma":[0.000025048843,0.00014083533,0.00011146041,0.000043077922,0.00002445963,0.0007725509,0.000048654547,0.9098731,0.015578174,0.06537793,0.007950927,0.000053833694],"about_ca_topic_score_codex":0.0010229036,"about_ca_topic_score_gemma":0.0012961284,"teacher_disagreement_score":0.0017562205,"about_ca_system_score_codex":0.0006241656,"about_ca_system_score_gemma":0.0009973529,"threshold_uncertainty_score":0.00587517},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007199246,0.00026311353,0.9892105,0.00011320431,0.000029999646,0.000058229423,0.00002636092,0.0001764215,0.0029228246],"genre_scores_gemma":[0.58501655,0.00062963186,0.4104304,0.00014276581,0.00008484488,0.00026261396,0.00006172308,0.00010680395,0.003264592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983961,0.00049448136,0.00008399611,0.00025339797,0.0005823783,0.00018965387],"domain_scores_gemma":[0.99739635,0.0014419428,0.0002611607,0.0004491612,0.00036768502,0.00008377719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018965526,0.0012279564,0.0009408636,0.0010924002,0.00091788574,0.0010728043,0.0017098702,0.00078356196,0.0023062155],"category_scores_gemma":[0.0061692144,0.00040582538,0.0009817717,0.0014408942,0.0015860436,0.0018910447,0.002045102,0.0014711875,0.0006126095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031519093,0.00015241565,0.0005187475,0.0003036756,0.00010414165,0.00028717323,0.0005039951,0.51588094,0.036922023,0.18203342,0.0037016065,0.2592767],"study_design_scores_gemma":[0.00006334801,0.00016057362,0.00016655316,0.000036196365,0.000041709267,0.000375745,0.00004646783,0.9385438,0.013757827,0.04157168,0.0051955273,0.00004059743],"about_ca_topic_score_codex":0.0012847485,"about_ca_topic_score_gemma":0.0014428061,"teacher_disagreement_score":0.0023062155,"about_ca_system_score_codex":0.000892787,"about_ca_system_score_gemma":0.0011172934,"threshold_uncertainty_score":0.010030031},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032644965,0.001061425,0.9606719,0.0002579361,0.000048514976,0.000059172962,0.000106652515,0.0003531107,0.004796325],"genre_scores_gemma":[0.7531669,0.0012786489,0.2422185,0.00014989241,0.00010025855,0.00009276291,0.0001902281,0.000030339555,0.0027724493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977769,0.0007412468,0.00016172224,0.00035911315,0.00070593605,0.00025505864],"domain_scores_gemma":[0.9990037,0.00030405464,0.0002236161,0.00021034373,0.00021820742,0.000040076102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013821936,0.00095113675,0.0017533964,0.0008241357,0.0007002244,0.0010931658,0.0012633926,0.00096942077,0.0008275909],"category_scores_gemma":[0.001888032,0.0005238149,0.0009818615,0.0016732814,0.0008308799,0.0013456714,0.0012631068,0.0007635018,0.0005284046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017833221,0.0002218759,0.0031536145,0.0005675572,0.0007349627,0.0016175519,0.00091838714,0.43416828,0.15341455,0.09562857,0.004881128,0.30291024],"study_design_scores_gemma":[0.00011805625,0.00051854475,0.0008561809,0.000037082777,0.00039574396,0.0020780547,0.00005578274,0.9133076,0.050471097,0.024766129,0.0072363485,0.00015931112],"about_ca_topic_score_codex":0.00057596306,"about_ca_topic_score_gemma":0.0008860222,"teacher_disagreement_score":0.0017533964,"about_ca_system_score_codex":0.00065496995,"about_ca_system_score_gemma":0.0006428932,"threshold_uncertainty_score":0.0073097944},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002076324,0.00711298,0.004537672,0.037073486,0.00142133,0.000028287164,0.00031265907,0.00006719159,0.9473701],"genre_scores_gemma":[0.26576173,0.024153939,0.004447933,0.043667562,0.0072341673,0.00025066,0.0009332608,0.00034828953,0.6532025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99854517,0.00026003763,0.00003688136,0.00032160836,0.000548972,0.00028726287],"domain_scores_gemma":[0.9992901,0.00020953697,0.00006204353,0.000086306165,0.00022508846,0.00012675494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001364104,0.0006738735,0.00042188464,0.0012490834,0.0028531025,0.012540916,0.0013206078,0.0052203164,0.06670686],"category_scores_gemma":[0.0028873042,0.00022225291,0.00049695076,0.0016747031,0.004325259,0.015427528,0.003083953,0.005119924,0.011722268],"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.0000041089475,0.000004902524,0.00003966486,0.000013536007,9.856059e-7,0.00002909081,0.00013911126,0.000053825548,0.000035739948,0.96884435,0.024543174,0.0062916023],"study_design_scores_gemma":[0.0000035161895,0.000010079419,0.00012668608,0.000104298706,0.0000019018703,0.000106411615,0.00043207055,0.00021280751,0.00006195621,0.18782471,0.8111089,0.0000066931466],"about_ca_topic_score_codex":0.005537966,"about_ca_topic_score_gemma":0.0034202505,"teacher_disagreement_score":0.06670686,"about_ca_system_score_codex":0.0054391874,"about_ca_system_score_gemma":0.0035702768,"threshold_uncertainty_score":0.22315669},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016557384,0.0005743746,0.97628844,0.00024064386,0.000030072324,0.00009434702,0.00006642664,0.000118652286,0.006029679],"genre_scores_gemma":[0.8070732,0.001304534,0.18577686,0.00010068959,0.000053184973,0.00034494276,0.00006292964,0.00006368176,0.005219985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884135,0.00046507895,0.000052190368,0.00020931229,0.0003246511,0.00010746581],"domain_scores_gemma":[0.99886286,0.0006768596,0.00017307934,0.000057871843,0.0001935406,0.000035746754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012869156,0.0011417874,0.001182407,0.0005762823,0.00040954698,0.0014513908,0.0007458932,0.0010487714,0.0017867534],"category_scores_gemma":[0.0047885743,0.00077943556,0.00042231803,0.0005444818,0.0011077067,0.0012444195,0.001020217,0.0007678358,0.00061328214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011091335,0.000040761595,0.00022849304,0.00013380618,0.000027961998,0.000101374804,0.00014215044,0.92491746,0.0072551733,0.0380605,0.00074921874,0.028232109],"study_design_scores_gemma":[0.00003062231,0.00007309341,0.00006954802,0.000010528738,0.000010157062,0.000041098694,0.00003545373,0.9860844,0.0019635973,0.010823315,0.0008468846,0.000011345187],"about_ca_topic_score_codex":0.0017492782,"about_ca_topic_score_gemma":0.0019476041,"teacher_disagreement_score":0.0017867534,"about_ca_system_score_codex":0.0016210056,"about_ca_system_score_gemma":0.0013106021,"threshold_uncertainty_score":0.011761308},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12725402,0.00011104012,0.8672336,0.00027919636,0.00003994205,0.00006534987,0.00007026138,0.00016340437,0.004783206],"genre_scores_gemma":[0.89630204,0.00027856196,0.09857049,0.00013124946,0.000043408927,0.00008444487,0.000082503495,0.000038503866,0.004468909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99922276,0.00033233268,0.00001919585,0.000116312476,0.00021137408,0.000098005374],"domain_scores_gemma":[0.99810886,0.0011542763,0.00021865057,0.00025157072,0.00018979414,0.00007675891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006585022,0.0007015403,0.0006291662,0.0005679652,0.00040016964,0.00079117256,0.00074419414,0.00058180734,0.0015515634],"category_scores_gemma":[0.0027047817,0.00027526022,0.0005595242,0.0007043875,0.001336576,0.001162118,0.0010286934,0.0008874743,0.00039505496],"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.00024282462,0.000061807266,0.00056322466,0.00009973679,0.0000651141,0.0005371765,0.00014979392,0.72578,0.020552803,0.22757253,0.00071189547,0.023663098],"study_design_scores_gemma":[0.000018421886,0.000061165774,0.000119279895,0.0000053405915,0.0000118139915,0.00009788134,0.000022846023,0.9536752,0.0030380771,0.04243465,0.0005009587,0.000014292831],"about_ca_topic_score_codex":0.0011836687,"about_ca_topic_score_gemma":0.0010587717,"teacher_disagreement_score":0.0015515634,"about_ca_system_score_codex":0.00069149176,"about_ca_system_score_gemma":0.0006917155,"threshold_uncertainty_score":0.0051904917},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07672407,0.0008557396,0.91890556,0.00018076185,0.000045457455,0.00005448905,0.000064916014,0.0002676059,0.0029012866],"genre_scores_gemma":[0.97333694,0.00044915712,0.024997683,0.000050723564,0.000028578985,0.00005963778,0.000030662588,0.000020078125,0.0010266029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921083,0.00032750765,0.0000368399,0.00016447353,0.00012322399,0.00013719482],"domain_scores_gemma":[0.9983967,0.0011450554,0.00012757561,0.000087265005,0.00018636623,0.000056972265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001140797,0.0008979407,0.0010082658,0.00056894997,0.00052008237,0.0010701795,0.0012477254,0.0005964027,0.0011118323],"category_scores_gemma":[0.004077904,0.0003416225,0.00029034016,0.00080916233,0.00074163236,0.0012912264,0.00075734634,0.00042257697,0.00022159718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050832966,0.0000863253,0.001096598,0.0003097061,0.000102605176,0.0006426792,0.0005444915,0.81627256,0.0367156,0.08407868,0.0024343645,0.057208],"study_design_scores_gemma":[0.000023485867,0.00012248437,0.00017684624,0.000011504899,0.00003710067,0.00015226993,0.000047712183,0.97923994,0.0054935114,0.014076358,0.0006028564,0.00001597096],"about_ca_topic_score_codex":0.0010317473,"about_ca_topic_score_gemma":0.0011428321,"teacher_disagreement_score":0.0012477254,"about_ca_system_score_codex":0.00077075313,"about_ca_system_score_gemma":0.0008169634,"threshold_uncertainty_score":0.0060332417},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1675638,0.0025030102,0.81118816,0.00027328634,0.00012291741,0.000054570282,0.00007281907,0.00023227533,0.017989233],"genre_scores_gemma":[0.9811679,0.00072384207,0.016353115,0.00003955424,0.000067091925,0.000022242748,0.000012488455,0.000004630712,0.0016090006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936503,0.00019762927,0.000024452354,0.00013013954,0.00016954062,0.00011327117],"domain_scores_gemma":[0.998992,0.0005664229,0.00015581762,0.00008706633,0.00016560967,0.000033098062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070941576,0.0009649157,0.00078892265,0.000283116,0.0004667279,0.0012484238,0.0010609016,0.00086190895,0.00069099374],"category_scores_gemma":[0.0022276912,0.000320113,0.0003907685,0.0005811448,0.000735419,0.0010267153,0.00066709035,0.00047386403,0.00025122415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004293,0.00015240913,0.0024252674,0.00041678047,0.00021158197,0.001971184,0.0005325221,0.7765917,0.028214341,0.12380266,0.0013423502,0.0639099],"study_design_scores_gemma":[0.000021445008,0.00013492712,0.00038943204,0.000014478321,0.00006297029,0.00041154216,0.00007311708,0.9848706,0.0025065872,0.010372869,0.001122026,0.000020025082],"about_ca_topic_score_codex":0.0023728781,"about_ca_topic_score_gemma":0.0026045907,"teacher_disagreement_score":0.0023728781,"about_ca_system_score_codex":0.0006508593,"about_ca_system_score_gemma":0.0005447668,"threshold_uncertainty_score":0.004722297},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055377144,0.0014457864,0.93684965,0.00021828403,0.000042156615,0.00004487352,0.00003428943,0.000095570984,0.0058921934],"genre_scores_gemma":[0.9595306,0.0012605923,0.037349056,0.00007923093,0.00005261971,0.00006789285,0.000019386476,0.000014478262,0.0016261684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942756,0.00030881888,0.00001710399,0.000048795606,0.0001397132,0.000057940415],"domain_scores_gemma":[0.9989999,0.0007381809,0.00010033019,0.00005668899,0.00008174728,0.000023304197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009310765,0.000821164,0.00039707814,0.00034416298,0.0003855781,0.00081112166,0.00044787672,0.0004351815,0.0008402177],"category_scores_gemma":[0.0022438883,0.0002999796,0.00036389002,0.0005504125,0.00075106154,0.00082032516,0.00058869465,0.0003868498,0.00025758636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011772236,0.000043352888,0.0006518036,0.0001674783,0.000055263674,0.0005167792,0.00016237785,0.83640796,0.020559812,0.10530792,0.0010570317,0.034952577],"study_design_scores_gemma":[0.0000070620345,0.00006510627,0.00014748002,0.0000082563865,0.000012064681,0.0001634385,0.0000231663,0.9790375,0.0021846006,0.017790014,0.00054912886,0.000012166417],"about_ca_topic_score_codex":0.00064231077,"about_ca_topic_score_gemma":0.0011006906,"teacher_disagreement_score":0.0009310765,"about_ca_system_score_codex":0.00067829393,"about_ca_system_score_gemma":0.00039878974,"threshold_uncertainty_score":0.0049239993},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028353807,0.0010113338,0.9441725,0.00077831105,0.00016202198,0.000074093456,0.00036520194,0.00015362568,0.02492917],"genre_scores_gemma":[0.8854958,0.0037427188,0.100578934,0.000611796,0.00049263873,0.00030883792,0.00034991614,0.000111949295,0.008307418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999092,0.00017076828,0.000022160313,0.000108990156,0.00048793908,0.000118209806],"domain_scores_gemma":[0.99760085,0.001526318,0.00024499127,0.00024655228,0.00031889018,0.00006243861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007468488,0.0006859942,0.00055553927,0.000812674,0.0006205716,0.0015220011,0.0011556024,0.0012631947,0.003253838],"category_scores_gemma":[0.0047403965,0.00031082498,0.00041539993,0.00066886074,0.0019961684,0.0028219686,0.0009917681,0.0013518854,0.000781699],"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.000043502452,0.0000464723,0.00027271383,0.00018212524,0.000016164995,0.00024410198,0.00011456933,0.3127227,0.005623514,0.6656439,0.0022899187,0.012800337],"study_design_scores_gemma":[0.000016100566,0.0001180854,0.00028257025,0.000060913815,0.000019574916,0.0008175876,0.00008830973,0.7642674,0.003764362,0.22035177,0.010158288,0.00005507488],"about_ca_topic_score_codex":0.0008796209,"about_ca_topic_score_gemma":0.0005610518,"teacher_disagreement_score":0.003253838,"about_ca_system_score_codex":0.0011208043,"about_ca_system_score_gemma":0.0012036826,"threshold_uncertainty_score":0.010885179},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030656029,0.014068688,0.06920932,0.0033868244,0.0015981885,0.000091781585,0.00030918646,0.0003345517,0.90793586],"genre_scores_gemma":[0.21017216,0.02771625,0.03670784,0.0049515376,0.0025528662,0.00033786858,0.0008016355,0.00027427202,0.71648556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99942964,0.0001124022,0.000020227235,0.00012968655,0.00022489628,0.00008299986],"domain_scores_gemma":[0.99940133,0.00022519747,0.00002875663,0.00014542087,0.00014530541,0.000054026827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006267002,0.00071124895,0.00048446932,0.001136733,0.0013255537,0.0029805836,0.0009393543,0.0012926463,0.037400395],"category_scores_gemma":[0.0014352268,0.00032033707,0.00043115986,0.0009635318,0.0018490121,0.0028004423,0.0027471061,0.0018707073,0.012800017],"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.000045742716,0.00003189102,0.0001762948,0.0002502645,0.00002876696,0.00013562391,0.0005634594,0.001482991,0.002400041,0.7029545,0.07597832,0.21595217],"study_design_scores_gemma":[0.000020740865,0.000048708996,0.00018358145,0.00017933203,0.000014181401,0.00083676894,0.00011283288,0.0009983078,0.0014500573,0.26831645,0.7278179,0.000021170323],"about_ca_topic_score_codex":0.00042414182,"about_ca_topic_score_gemma":0.00057428103,"teacher_disagreement_score":0.037400395,"about_ca_system_score_codex":0.0010809478,"about_ca_system_score_gemma":0.00086019264,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028387249,0.00022171336,0.96837527,0.000084129875,0.000016271924,0.000027741686,0.000031132713,0.00011045519,0.0027459085],"genre_scores_gemma":[0.8501644,0.0003014637,0.14695047,0.00008884013,0.000033593344,0.00007087135,0.00005511471,0.00003426206,0.0023009588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994943,0.0001717712,0.000020206257,0.000090768954,0.00016126425,0.000061613115],"domain_scores_gemma":[0.9996222,0.00018899358,0.00005113429,0.000066449174,0.00005829804,0.000012903264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006349464,0.00091823866,0.00062057696,0.00026874023,0.00028941463,0.00057701534,0.0007126887,0.0005089649,0.00084974105],"category_scores_gemma":[0.001503066,0.00025817868,0.0004429564,0.0005674003,0.00077863934,0.00091526227,0.00071352336,0.00041101582,0.00023682056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011465094,0.00006789573,0.00047101435,0.00009098155,0.00005917714,0.00022958427,0.00014422876,0.8552782,0.03542835,0.04846586,0.00069416204,0.05895588],"study_design_scores_gemma":[0.000011460974,0.00010116517,0.00015256864,0.0000065565378,0.000021114945,0.00008134162,0.000020330031,0.9823406,0.0102456035,0.0063079083,0.0006967009,0.000014767721],"about_ca_topic_score_codex":0.0015730095,"about_ca_topic_score_gemma":0.002320336,"teacher_disagreement_score":0.0015730095,"about_ca_system_score_codex":0.0005809319,"about_ca_system_score_gemma":0.0006717088,"threshold_uncertainty_score":0.004215002},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22701524,0.00069445086,0.7664407,0.0004223016,0.000048162743,0.000063675914,0.00009481198,0.00009582152,0.005124896],"genre_scores_gemma":[0.9813213,0.00029373518,0.016627287,0.00002697776,0.00001890115,0.00003655114,0.000026186073,0.000017065491,0.001631954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958044,0.00016248356,0.000012795761,0.000066041,0.00006444641,0.00011380585],"domain_scores_gemma":[0.9984894,0.0010839986,0.00020444766,0.00004275846,0.000107971275,0.00007138576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010996662,0.00055345264,0.0005989533,0.00039298454,0.0004736931,0.00073523365,0.00077854434,0.0005617946,0.0016276063],"category_scores_gemma":[0.0023517087,0.00033877767,0.00029582845,0.00056204124,0.0006842072,0.00085479877,0.00062248437,0.00055251445,0.00016364218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007129109,0.000028428149,0.00025694614,0.00003246708,0.000011770848,0.00010539327,0.00004079962,0.98166454,0.0020206426,0.008920763,0.00025073366,0.006596192],"study_design_scores_gemma":[0.0000049037462,0.000017785776,0.00005444005,0.0000013506203,0.0000032944022,0.000008728178,0.000012461326,0.9975611,0.00020470787,0.0020508883,0.00007814548,0.000002236222],"about_ca_topic_score_codex":0.0064644176,"about_ca_topic_score_gemma":0.0045379945,"teacher_disagreement_score":0.0064644176,"about_ca_system_score_codex":0.0013175795,"about_ca_system_score_gemma":0.0009719062,"threshold_uncertainty_score":0.012853563},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030908486,0.00040241392,0.9669493,0.00015677915,0.000038078408,0.00006253401,0.000025282174,0.00008442056,0.0013728178],"genre_scores_gemma":[0.93734515,0.0003491395,0.061086692,0.000073782576,0.00004706699,0.00010415267,0.000033791435,0.00003181573,0.0009284354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794525,0.0009470822,0.00008856544,0.0003814585,0.00037737013,0.0002603684],"domain_scores_gemma":[0.99787307,0.0012776915,0.00031446258,0.00012675724,0.00026270445,0.00014525723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002814906,0.0010310992,0.0013665915,0.0006398545,0.0006952868,0.0015054897,0.0014920685,0.00085096085,0.00077724486],"category_scores_gemma":[0.0050079883,0.00039303643,0.00058101077,0.0009178757,0.0010607197,0.0020210173,0.0012918451,0.00080404186,0.00012018873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000201804,0.00007663701,0.0012056791,0.00009718325,0.00006590112,0.00014437901,0.00009602281,0.94527656,0.0036740836,0.022152435,0.000681469,0.026327932],"study_design_scores_gemma":[0.000011039064,0.00003649754,0.00011666566,0.0000029707298,0.0000113122005,0.000028651863,0.000017927212,0.9942629,0.0005969879,0.004753372,0.00015337254,0.000008278252],"about_ca_topic_score_codex":0.002449607,"about_ca_topic_score_gemma":0.0014911139,"teacher_disagreement_score":0.002814906,"about_ca_system_score_codex":0.0012072099,"about_ca_system_score_gemma":0.0013602938,"threshold_uncertainty_score":0.0148867965},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010545533,0.00047758842,0.9851968,0.0001294293,0.00007685843,0.0000638679,0.000028388655,0.00034340238,0.0031381468],"genre_scores_gemma":[0.55501,0.0011422408,0.4390885,0.0003135589,0.000076515586,0.00023244956,0.0001450491,0.000077575016,0.0039141956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993948,0.00018816294,0.00002555783,0.00007223622,0.0002407527,0.00007839582],"domain_scores_gemma":[0.99906284,0.00037043646,0.00010382081,0.00026229428,0.00016528706,0.00003531951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007072476,0.00061091624,0.0004093409,0.00046508713,0.00048676043,0.00049183413,0.0012473024,0.00052008603,0.0013054302],"category_scores_gemma":[0.0021785153,0.00018925362,0.0003695715,0.00056168536,0.0008099951,0.0011601653,0.00091976963,0.0009036526,0.00028763126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036005516,0.0001449033,0.00069083367,0.0002848708,0.00006650696,0.0004335922,0.00029571296,0.3838518,0.055006232,0.13250592,0.0046146503,0.42174503],"study_design_scores_gemma":[0.00003233612,0.00032400218,0.00017912411,0.000043266795,0.00003224844,0.0003640538,0.000031174393,0.9470928,0.015776398,0.023809249,0.012282816,0.00003263337],"about_ca_topic_score_codex":0.0017653527,"about_ca_topic_score_gemma":0.002723297,"teacher_disagreement_score":0.0017653527,"about_ca_system_score_codex":0.0006321956,"about_ca_system_score_gemma":0.000840915,"threshold_uncertainty_score":0.004586935},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049359915,0.00025211094,0.993024,0.000071746574,0.000023087468,0.000015247185,0.000019379993,0.00004270999,0.001615789],"genre_scores_gemma":[0.6557574,0.0015410092,0.33156025,0.00012149978,0.00013832256,0.0002113345,0.000098638084,0.00005709714,0.010514405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996457,0.00013510814,0.000013886853,0.000069841226,0.00010258617,0.00003280834],"domain_scores_gemma":[0.9995751,0.00027314023,0.000042687465,0.000029737457,0.00006703862,0.000012305836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063252106,0.0007550968,0.0004993675,0.00025278542,0.00027671797,0.00060675916,0.000584412,0.0008441226,0.0021353706],"category_scores_gemma":[0.0014761483,0.00027293182,0.0003622869,0.000519286,0.0005985709,0.0009782051,0.00045114697,0.00059678365,0.00061994407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005564874,0.000039359908,0.00020771769,0.00012411494,0.000023498102,0.00011586992,0.00006109988,0.901376,0.008372428,0.046167634,0.0008079661,0.04264873],"study_design_scores_gemma":[0.000009760227,0.000029200995,0.000066753964,0.000004984337,0.000005948768,0.000033684875,0.00000909944,0.99110985,0.00086892286,0.0072791083,0.00057533215,0.0000073622145],"about_ca_topic_score_codex":0.0012180263,"about_ca_topic_score_gemma":0.0019100277,"teacher_disagreement_score":0.0021353706,"about_ca_system_score_codex":0.0005614482,"about_ca_system_score_gemma":0.0005901519,"threshold_uncertainty_score":0.0071434975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06376315,0.0005111183,0.92412376,0.00046016535,0.00006135383,0.000046683854,0.00005466757,0.00008975519,0.010889362],"genre_scores_gemma":[0.96052116,0.00073767547,0.034948125,0.00010770321,0.00007557975,0.0000977478,0.00005199725,0.000045696703,0.0034142756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999114,0.00026579533,0.000026222606,0.000088658846,0.00033840805,0.00016692895],"domain_scores_gemma":[0.9948992,0.0038134905,0.00030982104,0.00021138397,0.0006741933,0.00009190928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019239206,0.000601303,0.00042989413,0.0009011178,0.00045077296,0.0010382739,0.00068886956,0.0005342736,0.0016838714],"category_scores_gemma":[0.009516569,0.00024734723,0.00029336108,0.0007916043,0.0018662588,0.0016305315,0.00089935213,0.0011388345,0.00015098363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021961318,0.0000131024135,0.00021928242,0.000028719518,0.0000069041903,0.00004705805,0.00006408872,0.6715379,0.0018360486,0.3216374,0.00041835755,0.0041692453],"study_design_scores_gemma":[0.0000027887695,0.000007603005,0.000054855405,0.0000051442344,0.0000020033358,0.000012530897,0.000013569341,0.94387025,0.0004504445,0.055154756,0.00042172542,0.000004322479],"about_ca_topic_score_codex":0.004084825,"about_ca_topic_score_gemma":0.0014675229,"teacher_disagreement_score":0.004084825,"about_ca_system_score_codex":0.0029702669,"about_ca_system_score_gemma":0.0015251901,"threshold_uncertainty_score":0.021550894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013767969,0.00032147148,0.9845218,0.00007288362,0.000013560863,0.000049482005,0.000018449826,0.0002256545,0.0010087853],"genre_scores_gemma":[0.51173174,0.00032931461,0.48580283,0.0000710219,0.000022659453,0.00016810796,0.00008044713,0.00007873135,0.0017151999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998276,0.00078812236,0.00007298097,0.00030101853,0.0003536211,0.00020818319],"domain_scores_gemma":[0.9981468,0.0010910754,0.00025870974,0.00028497013,0.00014583822,0.00007263534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023517678,0.0007446387,0.0009249666,0.0005645902,0.00063744816,0.0013406147,0.0015628389,0.0010907743,0.00075010664],"category_scores_gemma":[0.0041074883,0.0005820881,0.00046613018,0.0007754165,0.0010974283,0.0020107564,0.0012569405,0.00093479955,0.00030353747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011716463,0.000051122403,0.00026060033,0.00006942834,0.000029067674,0.000059912763,0.000127642,0.89860845,0.0034501406,0.030871285,0.0007480291,0.06560714],"study_design_scores_gemma":[0.00001724881,0.00004328946,0.000052122177,0.000006006653,0.000008735888,0.000043002008,0.000022887165,0.98517114,0.002352283,0.011502272,0.0007697746,0.000011299172],"about_ca_topic_score_codex":0.001614135,"about_ca_topic_score_gemma":0.001607361,"teacher_disagreement_score":0.0023517678,"about_ca_system_score_codex":0.0010404681,"about_ca_system_score_gemma":0.0009950541,"threshold_uncertainty_score":0.012437463},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.295284,0.0009963497,0.6994767,0.00019205501,0.000024539002,0.00003788216,0.000017539023,0.00015418415,0.003816744],"genre_scores_gemma":[0.9887406,0.0001141603,0.010884197,0.000013807687,0.000008201852,0.0000127603935,0.0000056784406,0.0000043145856,0.00021618392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930084,0.00032084627,0.00002720683,0.00006547957,0.00020379084,0.000081891936],"domain_scores_gemma":[0.99769187,0.001558396,0.00027498254,0.00016516654,0.0002733679,0.00003634572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001199818,0.00039978418,0.000432057,0.00032521313,0.00020882415,0.00063197274,0.0004496679,0.00047391187,0.0004952264],"category_scores_gemma":[0.0036171747,0.00016913943,0.00021925716,0.00040536214,0.00066605647,0.0005579827,0.0004300458,0.00045113018,0.00013949288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034476645,0.0000909328,0.0016094631,0.00012578728,0.00006807097,0.0002490296,0.0003687428,0.8502263,0.043831952,0.042783514,0.00048838515,0.059813],"study_design_scores_gemma":[0.0000199569,0.000119986034,0.00030688255,0.000008822574,0.00001488972,0.0000645054,0.00002410308,0.98869485,0.004022363,0.006452386,0.0002614141,0.000009782879],"about_ca_topic_score_codex":0.0006184649,"about_ca_topic_score_gemma":0.0005654559,"teacher_disagreement_score":0.001199818,"about_ca_system_score_codex":0.0005407293,"about_ca_system_score_gemma":0.00032822014,"threshold_uncertainty_score":0.006345272},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0435704,0.0013793056,0.9433092,0.00047480615,0.0000920033,0.00005897776,0.00017090049,0.0005463066,0.010398099],"genre_scores_gemma":[0.8950964,0.0020505914,0.090781696,0.0001498934,0.00017637185,0.00022912257,0.00029055652,0.00018373822,0.011041585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986504,0.00045332732,0.00005654138,0.0002757711,0.0003675777,0.00019634185],"domain_scores_gemma":[0.99413884,0.0043836697,0.0003721145,0.0005757978,0.000378456,0.00015122691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013331902,0.000591734,0.0015657904,0.000709854,0.00092277036,0.0016613932,0.0023738085,0.0011590801,0.0017128518],"category_scores_gemma":[0.0068588844,0.0009769412,0.0005413412,0.0016274685,0.0014235413,0.0017322255,0.0013775784,0.0012121606,0.00040070142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016170948,0.000040444764,0.00033493823,0.00020546872,0.000034917342,0.000079350975,0.00010743754,0.84859073,0.0030092022,0.1166396,0.0030157077,0.027780475],"study_design_scores_gemma":[0.000030935826,0.000023169308,0.00014347836,0.000011317489,0.000018862582,0.000038522,0.00002086906,0.92355484,0.0007486427,0.07433668,0.0010588858,0.000013766995],"about_ca_topic_score_codex":0.0029006647,"about_ca_topic_score_gemma":0.004955645,"teacher_disagreement_score":0.0029006647,"about_ca_system_score_codex":0.0023237648,"about_ca_system_score_gemma":0.0015685435,"threshold_uncertainty_score":0.016860127},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3648493,0.0012197775,0.6291819,0.00020360504,0.000047558988,0.00005941156,0.00009707309,0.00019123896,0.004150116],"genre_scores_gemma":[0.9836374,0.0002692223,0.015381459,0.000021532413,0.000013300052,0.000026548669,0.000020394473,0.000007226067,0.00062298356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993808,0.00028051267,0.000023862796,0.00009502557,0.0001083525,0.000111431036],"domain_scores_gemma":[0.99794203,0.0015087445,0.00020862484,0.00010550644,0.00019179743,0.000043254273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010876086,0.00072746334,0.0005938833,0.00048117983,0.00041187048,0.0008747106,0.0010526407,0.0007520951,0.00054797914],"category_scores_gemma":[0.0029809705,0.00030335205,0.00027829988,0.00057131756,0.00078586774,0.0012193577,0.00049770594,0.00032609922,0.00010829011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001435216,0.00002951455,0.0007282249,0.00005352367,0.000025263846,0.00048185547,0.000115317336,0.95495385,0.010896245,0.021186665,0.00020535554,0.011180768],"study_design_scores_gemma":[0.0000136378685,0.000105333085,0.000161146,0.0000054797506,0.000018507057,0.0001194301,0.00002767668,0.99267936,0.002310267,0.004221977,0.00032471927,0.000012454945],"about_ca_topic_score_codex":0.0032364,"about_ca_topic_score_gemma":0.0033871038,"teacher_disagreement_score":0.0032364,"about_ca_system_score_codex":0.00084207964,"about_ca_system_score_gemma":0.00074704806,"threshold_uncertainty_score":0.006435156},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025996536,0.7140979,0.23334716,0.0016598577,0.00063377275,0.00014930486,0.00007677996,0.00043425773,0.023604438],"genre_scores_gemma":[0.20631425,0.70031613,0.08755679,0.00035582352,0.001522019,0.00018207167,0.00021395422,0.00011462983,0.0034243192],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909186,0.00022779015,0.00009832139,0.00011194226,0.00041190744,0.00005816967],"domain_scores_gemma":[0.99538773,0.0030029707,0.0002680635,0.00022426057,0.0010387885,0.000078281904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018789226,0.00067327364,0.0006842769,0.0027636623,0.00037164008,0.0010941285,0.0011338984,0.0010755432,0.0013158991],"category_scores_gemma":[0.0054968,0.00047361746,0.00047547277,0.003480398,0.0006554161,0.0020185767,0.00083412917,0.0010933664,0.00045689478],"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.0000843024,0.00015578406,0.0028537514,0.0024431937,0.00009663134,0.00014578282,0.00017489398,0.027049242,0.0063578016,0.021785676,0.004072256,0.9347807],"study_design_scores_gemma":[0.000098159944,0.0015893126,0.0073081227,0.0042290622,0.00042140094,0.0033259203,0.00054582086,0.46643615,0.051407717,0.061256524,0.40307096,0.00031092373],"about_ca_topic_score_codex":0.0010262389,"about_ca_topic_score_gemma":0.00044737046,"teacher_disagreement_score":0.0027636623,"about_ca_system_score_codex":0.0006433005,"about_ca_system_score_gemma":0.000605286,"threshold_uncertainty_score":0.00993681},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028123286,0.00072451786,0.9580594,0.00029926404,0.000054525197,0.00004828265,0.000169277,0.00034922708,0.012172245],"genre_scores_gemma":[0.7759101,0.0009768592,0.21112974,0.0002212747,0.00020734189,0.00017816975,0.00030702146,0.000086872766,0.0109826205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828476,0.0005374595,0.000080748614,0.00028359747,0.00049103954,0.00032229384],"domain_scores_gemma":[0.9989532,0.0005230713,0.00014437918,0.00017403401,0.00016263172,0.000042670716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009784494,0.001101269,0.0013474296,0.00032271174,0.00034988893,0.0012881885,0.0006242272,0.0010037817,0.0023790754],"category_scores_gemma":[0.0028954176,0.0006633208,0.0005403844,0.00077710603,0.0006591364,0.0013472339,0.0012890329,0.0006394382,0.0011827039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004997277,0.00008200029,0.0008068662,0.00023237625,0.00020007693,0.00021499315,0.00016370656,0.66602993,0.035832826,0.07134381,0.0041290633,0.22046459],"study_design_scores_gemma":[0.00010615844,0.0002768808,0.00065011135,0.000028560415,0.000108140375,0.00042618028,0.000050214803,0.9286756,0.012402229,0.05058082,0.006645463,0.000049592025],"about_ca_topic_score_codex":0.0005220979,"about_ca_topic_score_gemma":0.0010596389,"teacher_disagreement_score":0.0023790754,"about_ca_system_score_codex":0.00047774703,"about_ca_system_score_gemma":0.0010523775,"threshold_uncertainty_score":0.007958829},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011944358,0.00044646484,0.98425114,0.00012656148,0.000025412286,0.00002153147,0.00005745817,0.00007067584,0.0030563616],"genre_scores_gemma":[0.74798524,0.0014888297,0.24282886,0.000055779143,0.00009194602,0.00017197218,0.0002091384,0.00006463906,0.0071036895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964225,0.000121098434,0.000017449776,0.00008330033,0.00008975135,0.000046267854],"domain_scores_gemma":[0.99927276,0.0004527917,0.00008477401,0.00006881583,0.000091306676,0.000029576833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006075499,0.00069609267,0.00091896247,0.00052298274,0.00043355505,0.0010414732,0.0011643831,0.0007854477,0.0013246754],"category_scores_gemma":[0.0023455212,0.00069948414,0.0005909771,0.001285235,0.00091138505,0.0016234461,0.0013189015,0.0008302456,0.00024465116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021184367,0.000007406658,0.00013470634,0.000028863598,0.0000088649385,0.00003460086,0.000046360008,0.9638513,0.0009641903,0.016337285,0.00047022913,0.01809496],"study_design_scores_gemma":[0.0000034757707,0.000016729044,0.00006602717,0.0000045079532,0.000004327833,0.000017595958,0.000011326704,0.98667175,0.00026457786,0.012497595,0.00043596953,0.0000062373174],"about_ca_topic_score_codex":0.0040140394,"about_ca_topic_score_gemma":0.0045212577,"teacher_disagreement_score":0.0040140394,"about_ca_system_score_codex":0.00091654423,"about_ca_system_score_gemma":0.00069518044,"threshold_uncertainty_score":0.00798136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37620878,0.0024459641,0.5945448,0.00047986914,0.000044625973,0.00006490075,0.00011824012,0.00030615076,0.025786739],"genre_scores_gemma":[0.99334115,0.00036475284,0.005488599,0.000031818556,0.00002433567,0.000028148792,0.000021907714,0.00001071849,0.00068859465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983903,0.0007002283,0.00004418123,0.00014239764,0.0004711078,0.00025180177],"domain_scores_gemma":[0.99327844,0.0049697035,0.0005800544,0.00029613936,0.00078025745,0.00009537162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002200469,0.0011456464,0.0009950697,0.0008447921,0.0005102331,0.0011530926,0.00082882005,0.0010228655,0.00082518364],"category_scores_gemma":[0.009209919,0.00041822557,0.0004654344,0.0012591364,0.001448012,0.0012232543,0.0011583793,0.00049730804,0.00023087424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059153997,0.00001893019,0.00083834794,0.000039264014,0.00004135645,0.00013761091,0.000092751216,0.9792906,0.002500881,0.011466593,0.00018219846,0.0053323153],"study_design_scores_gemma":[0.000004393863,0.000058406105,0.00036959499,0.00000616363,0.000019230665,0.000098963756,0.000029271408,0.9943348,0.0006897339,0.004222069,0.00015717983,0.000010253283],"about_ca_topic_score_codex":0.0024833088,"about_ca_topic_score_gemma":0.0014043541,"teacher_disagreement_score":0.0024833088,"about_ca_system_score_codex":0.0014561892,"about_ca_system_score_gemma":0.0007355322,"threshold_uncertainty_score":0.01163733},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05942985,0.001058419,0.9364322,0.00031220412,0.00003542978,0.000032112705,0.000028216284,0.000057003403,0.002614634],"genre_scores_gemma":[0.89941114,0.0012266,0.09646475,0.00007866273,0.00007863933,0.00008418395,0.00005305153,0.000041148673,0.0025618633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995908,0.00020273152,0.000012138118,0.000033170687,0.0001097802,0.000051409435],"domain_scores_gemma":[0.99874276,0.0010409974,0.00008110989,0.000044817236,0.000070564725,0.000019757581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009085395,0.00046518046,0.00041822257,0.00053264975,0.0004170249,0.00046328758,0.0006393172,0.0006031613,0.00067848817],"category_scores_gemma":[0.0023923295,0.00023724025,0.00038282198,0.0006812143,0.0005732444,0.0011247462,0.00059228047,0.00038598062,0.000091714566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008405253,0.00005063467,0.00068271917,0.0001495285,0.00003335649,0.00017668011,0.00014321507,0.9004305,0.007435199,0.049399335,0.00089204597,0.040522654],"study_design_scores_gemma":[0.0000060181396,0.00002489777,0.00007786006,0.0000033332676,0.0000042373076,0.000021558366,0.000015259378,0.9915507,0.0005159403,0.0073875263,0.00038983527,0.0000027882863],"about_ca_topic_score_codex":0.0013936243,"about_ca_topic_score_gemma":0.001207747,"teacher_disagreement_score":0.0013936243,"about_ca_system_score_codex":0.00079055986,"about_ca_system_score_gemma":0.0003026945,"threshold_uncertainty_score":0.0057359934},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07390246,0.0006191822,0.91994536,0.0002660536,0.000090500755,0.000098115925,0.000034918314,0.00053805386,0.0045054522],"genre_scores_gemma":[0.68771666,0.0005416082,0.30782,0.00017822027,0.00006216901,0.0001313099,0.00007227215,0.000061189414,0.0034165692],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974686,0.000055854503,0.000017710374,0.00003750716,0.0001092319,0.000032752723],"domain_scores_gemma":[0.9992606,0.00023161845,0.0000927973,0.0001757502,0.00020787225,0.000031347372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004718236,0.0003237808,0.00027203115,0.00062537385,0.00041702585,0.0004424004,0.00090101745,0.0004797749,0.0009075709],"category_scores_gemma":[0.0011413406,0.00011410236,0.00022947519,0.00047046863,0.0006004388,0.0012065702,0.00074479403,0.00057401886,0.00017449142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024973706,0.00015573202,0.0010976454,0.0003813963,0.000054811833,0.00035000595,0.0005761956,0.08289784,0.34171087,0.23690377,0.0021945708,0.3334275],"study_design_scores_gemma":[0.0000612275,0.000391566,0.00069457013,0.00006842373,0.00007716658,0.00094255817,0.00010081712,0.76695144,0.17492382,0.035623703,0.020107362,0.00005739797],"about_ca_topic_score_codex":0.00060284685,"about_ca_topic_score_gemma":0.0007321366,"teacher_disagreement_score":0.0009075709,"about_ca_system_score_codex":0.0005347517,"about_ca_system_score_gemma":0.0004880055,"threshold_uncertainty_score":0.0038799644},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79209363,0.00056502246,0.20232022,0.0005434196,0.00009833706,0.00008987827,0.000067740366,0.0008200177,0.0034018883],"genre_scores_gemma":[0.99460346,0.00005357986,0.0051492276,0.00002376422,0.000012975826,0.000022765531,0.00001396254,0.0000070206315,0.00011318759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989656,0.00042209218,0.000075130585,0.00012581056,0.0002076629,0.0002036036],"domain_scores_gemma":[0.9889203,0.007151055,0.0009620764,0.0016382342,0.0010078253,0.00032058248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027791983,0.00037175257,0.00060100044,0.0006984723,0.0011475857,0.0009503541,0.0011776581,0.00074443145,0.00037766833],"category_scores_gemma":[0.0133722,0.00026852815,0.00028528474,0.00049019157,0.0009916107,0.0016316513,0.0010791621,0.0005242619,0.00006238311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018298774,0.0004968831,0.049420267,0.0004883802,0.00027447875,0.003463318,0.0011493197,0.6090731,0.12254405,0.069504365,0.0041816686,0.1375742],"study_design_scores_gemma":[0.000041783314,0.00026149387,0.0015882452,0.000016068074,0.00004524809,0.00031203346,0.00008640341,0.9764263,0.011165497,0.009051042,0.000979886,0.000026106543],"about_ca_topic_score_codex":0.0020648774,"about_ca_topic_score_gemma":0.0013454504,"teacher_disagreement_score":0.0027791983,"about_ca_system_score_codex":0.0008789075,"about_ca_system_score_gemma":0.00078960403,"threshold_uncertainty_score":0.014697969},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22513156,0.0012938377,0.757448,0.00049444236,0.00011624122,0.000086184016,0.00022196867,0.0005464409,0.014661347],"genre_scores_gemma":[0.97135776,0.0003065385,0.026115429,0.000040218576,0.000016164562,0.000026363965,0.0000721959,0.000008114916,0.0020572585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965525,0.00010004743,0.000012622677,0.000039551887,0.00011946951,0.000072999326],"domain_scores_gemma":[0.99962234,0.0001145679,0.000039438004,0.000081017584,0.00012639133,0.000016200504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043846297,0.00039417428,0.00035347734,0.00031720623,0.00040631526,0.0005493386,0.00036859827,0.00041438028,0.00094976585],"category_scores_gemma":[0.00090049725,0.00012451888,0.00020894465,0.00031279557,0.00024792427,0.00033596723,0.00038820284,0.00030509723,0.00040483268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044661446,0.00015011833,0.0032664747,0.00023099517,0.00007932928,0.0008081792,0.00026694394,0.52713686,0.20567898,0.068279654,0.005082374,0.18857351],"study_design_scores_gemma":[0.00002149457,0.00038861056,0.0010551941,0.000021950687,0.000043250908,0.0004426376,0.0001053659,0.9110716,0.0681002,0.011579887,0.0071319365,0.00003792901],"about_ca_topic_score_codex":0.003285315,"about_ca_topic_score_gemma":0.007967451,"teacher_disagreement_score":0.003285315,"about_ca_system_score_codex":0.00054612395,"about_ca_system_score_gemma":0.00070938945,"threshold_uncertainty_score":0.006532371},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23069572,0.0005901192,0.71909285,0.0021595752,0.00018224225,0.00019688724,0.00026915348,0.0015009886,0.04531245],"genre_scores_gemma":[0.71781754,0.00046446547,0.27333575,0.00041577814,0.00008227188,0.00015948455,0.0003465598,0.00012890178,0.0072492603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919766,0.00033315795,0.00003289735,0.00011778184,0.00018396396,0.00013468014],"domain_scores_gemma":[0.99739456,0.0014732783,0.0002489068,0.00053605,0.00026751644,0.00007976735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010559497,0.00049230905,0.0003652119,0.00059426663,0.00094982417,0.0008529693,0.0005927396,0.0009060325,0.0029300873],"category_scores_gemma":[0.0054371497,0.00028175296,0.00039284557,0.0008359218,0.0008868661,0.002685577,0.0014603587,0.0010819111,0.00059945416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004614658,0.00019093661,0.0016937735,0.00030173102,0.000053225303,0.00047807142,0.00059625576,0.15437111,0.03271005,0.61339307,0.013324197,0.18242612],"study_design_scores_gemma":[0.0001035193,0.00024222214,0.0004405005,0.00008672348,0.000046958718,0.00047985997,0.00029484378,0.5678442,0.029322904,0.37763727,0.02345841,0.00004266524],"about_ca_topic_score_codex":0.0012358521,"about_ca_topic_score_gemma":0.002319418,"teacher_disagreement_score":0.0029300873,"about_ca_system_score_codex":0.0009834662,"about_ca_system_score_gemma":0.0007953285,"threshold_uncertainty_score":0.009802103},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08397978,0.0012570409,0.9051593,0.00024285536,0.00025244366,0.00023009183,0.000061658175,0.00030581854,0.008511098],"genre_scores_gemma":[0.8146422,0.0006520241,0.17947415,0.00023822216,0.00012789086,0.00019350671,0.000080907674,0.000011467053,0.004579522],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999491,0.00012730334,0.000024826935,0.000086235144,0.00020360482,0.0000670039],"domain_scores_gemma":[0.9996476,0.00008213964,0.000055971705,0.0000811162,0.00009537283,0.000037822898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040767065,0.00049238105,0.00056867214,0.0004572076,0.0005011571,0.00045976677,0.00085572945,0.00073366304,0.000835843],"category_scores_gemma":[0.000673229,0.00015913982,0.00031581454,0.00046475697,0.00061426964,0.00075711,0.00077823095,0.00047737831,0.00040507555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038114967,0.00029059258,0.0010760857,0.00042805445,0.00012348147,0.0006516792,0.0003101297,0.04433794,0.49597102,0.19857478,0.0026294927,0.25522557],"study_design_scores_gemma":[0.00038924348,0.0025301266,0.0016983211,0.00010191665,0.00023775334,0.0035495022,0.00014267859,0.7111159,0.14953142,0.082093455,0.048352145,0.0002576246],"about_ca_topic_score_codex":0.0002606264,"about_ca_topic_score_gemma":0.00035825456,"teacher_disagreement_score":0.00085572945,"about_ca_system_score_codex":0.00021263842,"about_ca_system_score_gemma":0.00037393215,"threshold_uncertainty_score":0.002796173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35426286,0.0026423826,0.6331661,0.00034982205,0.000052372594,0.000044363005,0.0000710992,0.00045697205,0.008954031],"genre_scores_gemma":[0.9809396,0.0005095606,0.0181364,0.000016675927,0.00001280677,0.000010102826,0.000014006535,0.000013742201,0.00034703355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969876,0.00012056033,0.000013041804,0.000033886077,0.00008656308,0.000047355097],"domain_scores_gemma":[0.99906284,0.00055906695,0.00013490865,0.00009045132,0.00013050901,0.00002224088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005175274,0.00061916583,0.00036240072,0.0003186344,0.00023336225,0.00050777494,0.00035828055,0.0004460232,0.00044023598],"category_scores_gemma":[0.0024003729,0.00013496264,0.00017072995,0.0003891766,0.00025523824,0.00066871475,0.00043903256,0.00024447884,0.0001345761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008998771,0.000048059264,0.0011002747,0.000104784245,0.000024573603,0.00012197814,0.00005157747,0.9382031,0.03074847,0.0032837614,0.00028964932,0.025933832],"study_design_scores_gemma":[0.000008750309,0.00016823472,0.00071463047,0.000010242819,0.00002339541,0.00012579474,0.000038631086,0.9800337,0.016383527,0.0019925386,0.0004890247,0.000011578355],"about_ca_topic_score_codex":0.0005365072,"about_ca_topic_score_gemma":0.00073685293,"teacher_disagreement_score":0.00061916583,"about_ca_system_score_codex":0.0003888892,"about_ca_system_score_gemma":0.0002944525,"threshold_uncertainty_score":0.0028216243},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008737964,0.0004757138,0.9797916,0.000172244,0.00006483552,0.000115927345,0.00014264992,0.00049378176,0.010005287],"genre_scores_gemma":[0.6425342,0.0010958383,0.3466859,0.0003189466,0.00006587632,0.0002870673,0.0002335094,0.00007319839,0.008705454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993019,0.00020068303,0.000039447365,0.00014470407,0.00017172075,0.00014150131],"domain_scores_gemma":[0.9995888,0.00009444745,0.0000647933,0.000119834694,0.00009723454,0.000034939796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068270945,0.0012831136,0.0012030419,0.00063773256,0.00057063816,0.0008456196,0.0014836469,0.0007492682,0.0026897308],"category_scores_gemma":[0.0007859194,0.0003157453,0.000589447,0.00086528115,0.0007156753,0.0009209517,0.00142398,0.00055528834,0.0013552171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006189465,0.00013757698,0.00063030235,0.00044072018,0.00017939076,0.0005773203,0.000215075,0.33241153,0.04793123,0.33549803,0.01707887,0.264281],"study_design_scores_gemma":[0.00013543038,0.0003991552,0.00025215998,0.00004582995,0.00009876967,0.0015334935,0.0001228866,0.89594746,0.01812582,0.068324424,0.014898529,0.00011611393],"about_ca_topic_score_codex":0.0007067443,"about_ca_topic_score_gemma":0.0010547197,"teacher_disagreement_score":0.0026897308,"about_ca_system_score_codex":0.0005833363,"about_ca_system_score_gemma":0.0010377478,"threshold_uncertainty_score":0.008998036},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11981844,0.0023552831,0.8622107,0.0006135038,0.0001470723,0.00007221317,0.00022204797,0.00031657727,0.014244286],"genre_scores_gemma":[0.87329054,0.0018418371,0.11332803,0.00015735828,0.00021387993,0.00016170871,0.00028356764,0.00008658434,0.010636572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995989,0.0001143745,0.000019321895,0.00004398228,0.00016527028,0.00005812342],"domain_scores_gemma":[0.99881005,0.000628817,0.00017014796,0.00011928975,0.00021349499,0.00005827368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050041627,0.00053929456,0.00033297832,0.0007065682,0.0003354777,0.0005254714,0.0004661699,0.0006565205,0.0015467368],"category_scores_gemma":[0.0031157355,0.00019280682,0.0003488328,0.0005863391,0.0006391162,0.00081522105,0.0008610972,0.00087845215,0.000328625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011542142,0.00003650948,0.0007871076,0.0001305252,0.00002266244,0.00020491477,0.0003056618,0.37364605,0.0096152825,0.57233524,0.0019950548,0.040805653],"study_design_scores_gemma":[0.000015638929,0.00004646091,0.00014224972,0.000021422062,0.0000061890482,0.000094057825,0.000034705514,0.88063216,0.0019994914,0.11279149,0.0042032897,0.000012844555],"about_ca_topic_score_codex":0.001721667,"about_ca_topic_score_gemma":0.0010349597,"teacher_disagreement_score":0.001721667,"about_ca_system_score_codex":0.0009894067,"about_ca_system_score_gemma":0.0006421317,"threshold_uncertainty_score":0.007178664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23083758,0.0005163252,0.75084054,0.00063782674,0.000048509257,0.00008407362,0.00034624635,0.00065733836,0.01603156],"genre_scores_gemma":[0.9179047,0.00045568388,0.074774995,0.00019830841,0.00007248865,0.00010310598,0.00023614454,0.00008503879,0.0061695557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994973,0.000113240574,0.000024970443,0.000064505926,0.00021272578,0.00008727201],"domain_scores_gemma":[0.9977391,0.0009567005,0.00034085847,0.00040479048,0.00038158888,0.00017701012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005730639,0.00050487154,0.00030716564,0.00048672745,0.00032565277,0.00079235225,0.00041273065,0.0005510445,0.0017112114],"category_scores_gemma":[0.0047473484,0.00023016018,0.00023933496,0.0005735767,0.0010465228,0.0011872906,0.000918135,0.0010183768,0.00029535586],"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.00021289234,0.00007082379,0.0011417319,0.00010622708,0.000024638015,0.000238525,0.00016449289,0.22463387,0.033909947,0.6924654,0.0030386033,0.043992817],"study_design_scores_gemma":[0.000022672632,0.00013133111,0.00047576474,0.000028840153,0.000009315501,0.00016487855,0.000032663724,0.76253015,0.019298036,0.214652,0.0026210735,0.000033211276],"about_ca_topic_score_codex":0.0012996033,"about_ca_topic_score_gemma":0.0016404353,"teacher_disagreement_score":0.0017112114,"about_ca_system_score_codex":0.00083337724,"about_ca_system_score_gemma":0.0009124002,"threshold_uncertainty_score":0.006046593},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.522936,0.0032503784,0.43831357,0.0015550671,0.00010129095,0.00013943334,0.0003485403,0.0003773962,0.032978337],"genre_scores_gemma":[0.99274904,0.0004010691,0.0048832064,0.000055520482,0.000029550272,0.000027078064,0.000042044852,0.00001620179,0.001796223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987086,0.00045721172,0.00003835327,0.00013684458,0.00038936915,0.00026971273],"domain_scores_gemma":[0.9910615,0.0068490854,0.00047243072,0.00033686426,0.0011187444,0.00016141991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023155767,0.00073515135,0.0007492133,0.0010072198,0.0006179181,0.0014612213,0.0009942416,0.0009773034,0.0021547743],"category_scores_gemma":[0.010670199,0.00029154093,0.0002966065,0.0012829694,0.0011574869,0.0011463375,0.0014447331,0.00050339865,0.00030660388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049411296,0.00006950776,0.0019885341,0.00017808417,0.00005292241,0.00022006422,0.00029318166,0.88325626,0.012103258,0.08063612,0.001268984,0.01943889],"study_design_scores_gemma":[0.000011999295,0.000118418066,0.0004288074,0.000015534373,0.00002214368,0.00010522662,0.00006623787,0.9877439,0.001887028,0.009253261,0.00033436887,0.0000130889775],"about_ca_topic_score_codex":0.003736918,"about_ca_topic_score_gemma":0.002711044,"teacher_disagreement_score":0.003736918,"about_ca_system_score_codex":0.0027000706,"about_ca_system_score_gemma":0.0012919854,"threshold_uncertainty_score":0.019590497},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013525864,0.016965328,0.84400696,0.0017291763,0.0022357365,0.00007906329,0.00021392843,0.0010556728,0.13236159],"genre_scores_gemma":[0.07059709,0.030116089,0.65880775,0.0013952426,0.0028752475,0.00058571063,0.0011533783,0.0009381712,0.23353127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99959904,0.00009834794,0.000014869603,0.00006476671,0.00019007335,0.000032898733],"domain_scores_gemma":[0.9995534,0.00018439698,0.00001817787,0.00012266384,0.00010350275,0.000017728335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005909883,0.0011564405,0.00066205167,0.000930637,0.0005493917,0.0014468341,0.0011774253,0.0011573766,0.017450005],"category_scores_gemma":[0.0020613354,0.00039660165,0.00039951026,0.0013867406,0.0008352681,0.0027888704,0.00097062223,0.002092882,0.0069409157],"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.00002546633,0.000029638817,0.00007375774,0.0001667888,0.000021657066,0.000027742106,0.000044430377,0.039295193,0.0007918434,0.45769992,0.09855704,0.40326655],"study_design_scores_gemma":[0.00002022246,0.000021668653,0.000100256206,0.00011390632,0.00001422699,0.0001486035,0.000024498368,0.12048539,0.0008093669,0.61171186,0.26653272,0.000017256985],"about_ca_topic_score_codex":0.001273751,"about_ca_topic_score_gemma":0.0014252451,"teacher_disagreement_score":0.017450005,"about_ca_system_score_codex":0.0009864199,"about_ca_system_score_gemma":0.00082272495,"threshold_uncertainty_score":0.058376074},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074221785,0.0019629954,0.9795105,0.00013121567,0.0001314278,0.00004367272,0.00005380824,0.00017803938,0.0105661135],"genre_scores_gemma":[0.5619971,0.00417285,0.4107072,0.00015554823,0.00043572797,0.00032261803,0.00023932743,0.0002081243,0.021761503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993284,0.00029219428,0.000023808263,0.000097042284,0.00017893343,0.000079679696],"domain_scores_gemma":[0.9996086,0.00024085656,0.000024023591,0.00005987903,0.000045446686,0.00002122241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008037232,0.0009029416,0.0013477022,0.00047075324,0.0004846118,0.0012519379,0.0011284956,0.0008834326,0.0042981184],"category_scores_gemma":[0.0015719726,0.0006611579,0.000465153,0.0010355479,0.00085451326,0.0011973275,0.0014094744,0.0012048549,0.0010259872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018374967,0.00010243197,0.00017347481,0.00018434749,0.00005594164,0.00012886329,0.00015714872,0.62286305,0.0072569647,0.16792835,0.0062520006,0.19471367],"study_design_scores_gemma":[0.000029784998,0.00006960523,0.00010325152,0.000027981618,0.00001632147,0.000115454175,0.000037717928,0.839626,0.0018622844,0.15385246,0.0042369426,0.000022120192],"about_ca_topic_score_codex":0.0003802458,"about_ca_topic_score_gemma":0.0007867275,"teacher_disagreement_score":0.0042981184,"about_ca_system_score_codex":0.00069562515,"about_ca_system_score_gemma":0.000673094,"threshold_uncertainty_score":0.014378667},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04656237,0.0004828947,0.9497705,0.0001987561,0.000019977953,0.000036311998,0.000033046188,0.000083230996,0.002812853],"genre_scores_gemma":[0.9507027,0.000553917,0.046978503,0.0000462445,0.000027464781,0.000082117316,0.000032937405,0.000034539706,0.0015416312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945647,0.00028358045,0.00001932395,0.000083124396,0.00010926798,0.00004830188],"domain_scores_gemma":[0.9990062,0.000630186,0.00013901367,0.00007079744,0.00012488564,0.000028977953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012099186,0.00089916063,0.00078875804,0.00040218642,0.0003092861,0.0006986274,0.0006488916,0.0007434602,0.0006336666],"category_scores_gemma":[0.00308511,0.00039448933,0.00037059694,0.00060460187,0.00082783104,0.0009083326,0.0009107743,0.00044678702,0.00019187976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021318961,0.000011494708,0.00015038846,0.000031559353,0.000013663224,0.000054398777,0.000035798996,0.9838162,0.002340391,0.0072827353,0.00023627137,0.006005771],"study_design_scores_gemma":[0.000005003418,0.000024189472,0.000055301276,0.0000036455774,0.0000054278453,0.000017955339,0.0000124511735,0.99162185,0.0006633312,0.0074098217,0.00017730717,0.0000037080124],"about_ca_topic_score_codex":0.0008840005,"about_ca_topic_score_gemma":0.0008171448,"teacher_disagreement_score":0.0012099186,"about_ca_system_score_codex":0.0008357287,"about_ca_system_score_gemma":0.00051999214,"threshold_uncertainty_score":0.0063987374},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8453552,0.0022787144,0.13770407,0.00035208216,0.00008120495,0.000034253877,0.00014547927,0.00034789235,0.013701029],"genre_scores_gemma":[0.9973556,0.000382667,0.0019005258,0.000021425281,0.000019862671,0.0000070449073,0.00002101743,0.000017499182,0.00027435084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978478,0.0007053462,0.00008286312,0.00021462783,0.0006307066,0.0005186018],"domain_scores_gemma":[0.979091,0.016837234,0.0013291015,0.0008256271,0.0016504095,0.00026673498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015692636,0.0015442512,0.0010872709,0.00074526866,0.00073001586,0.0013111626,0.00060888985,0.0012361971,0.000882357],"category_scores_gemma":[0.014171113,0.00032182105,0.00037615403,0.000921874,0.0013854852,0.001273466,0.0012314293,0.0008596751,0.0003242358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007543515,0.000093681694,0.007644037,0.00021672616,0.00017208794,0.00084668916,0.00030534065,0.9398436,0.026267845,0.007297741,0.0002956284,0.01626217],"study_design_scores_gemma":[0.000028429344,0.00071062695,0.0059167426,0.00004025655,0.00020486665,0.0009842169,0.00014469576,0.957161,0.030225066,0.0041073444,0.000399383,0.00007725848],"about_ca_topic_score_codex":0.0023417906,"about_ca_topic_score_gemma":0.0019091753,"teacher_disagreement_score":0.0023417906,"about_ca_system_score_codex":0.001008651,"about_ca_system_score_gemma":0.0009212848,"threshold_uncertainty_score":0.008299112},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009216272,0.009340642,0.93115824,0.0010947083,0.00033725967,0.00009934744,0.00010975847,0.00027321317,0.04837052],"genre_scores_gemma":[0.5030738,0.034837753,0.42519578,0.0006447141,0.0007244658,0.0006429835,0.00032176456,0.00017588452,0.034382842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869055,0.00042931535,0.00005539376,0.00015292331,0.0005775499,0.00009429061],"domain_scores_gemma":[0.99785775,0.0014570333,0.0001030302,0.00027272638,0.0002556579,0.000053828015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013393755,0.00058740185,0.00053696765,0.00090535125,0.0006385293,0.0017806151,0.0012821137,0.0015134455,0.002072837],"category_scores_gemma":[0.004390339,0.00040238223,0.00030827487,0.0019450873,0.0023171206,0.0031509837,0.0013777523,0.0018774262,0.0008985483],"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.0000205494,0.000016785181,0.00014062076,0.00022590796,0.000012283017,0.00012651976,0.00020850355,0.056308582,0.002571169,0.8753221,0.0043232637,0.060723823],"study_design_scores_gemma":[0.0000142672925,0.00004400863,0.00023179986,0.00014673294,0.000015188264,0.0003707985,0.00009659262,0.26469904,0.0026623514,0.6881304,0.043552525,0.000036340953],"about_ca_topic_score_codex":0.0017911155,"about_ca_topic_score_gemma":0.0009843614,"teacher_disagreement_score":0.002072837,"about_ca_system_score_codex":0.0013753067,"about_ca_system_score_gemma":0.001197393,"threshold_uncertainty_score":0.009978592},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01716902,0.0005220723,0.972926,0.00089771533,0.00015509903,0.00022611453,0.0002810897,0.00034646914,0.007476443],"genre_scores_gemma":[0.89769644,0.0006283432,0.091267064,0.0003392057,0.00018675369,0.00034392547,0.00022499228,0.00014935138,0.00916391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99298966,0.0037101945,0.00032995173,0.0008340517,0.0010987394,0.0010373974],"domain_scores_gemma":[0.9841595,0.011855581,0.0007709135,0.0015837115,0.0009520346,0.0006781581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010761278,0.0025553883,0.0044436264,0.0012463994,0.001330735,0.005623211,0.0058339313,0.004385781,0.0084738815],"category_scores_gemma":[0.026098661,0.0017107982,0.001365301,0.0026089028,0.0032650137,0.006442337,0.0037542845,0.0036046582,0.0012492958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013125931,0.00024519858,0.0004320245,0.0005517952,0.00018254659,0.00052013446,0.00030387737,0.68496716,0.003071285,0.2661916,0.008512769,0.03370896],"study_design_scores_gemma":[0.00010172337,0.00006706419,0.0000802276,0.000026573252,0.000031857115,0.0001268236,0.000029182196,0.89351124,0.0004670205,0.10488199,0.00064839807,0.000027883103],"about_ca_topic_score_codex":0.0020304953,"about_ca_topic_score_gemma":0.0018265445,"teacher_disagreement_score":0.010761278,"about_ca_system_score_codex":0.0034451233,"about_ca_system_score_gemma":0.0036041643,"threshold_uncertainty_score":0.056911767},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063125044,0.00049964443,0.913811,0.0005234673,0.00020072602,0.00022344416,0.0002638859,0.004336207,0.017016547],"genre_scores_gemma":[0.70380145,0.00036251193,0.28948632,0.00010580413,0.00015056369,0.00020089779,0.00038882042,0.00017679902,0.0053268145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931455,0.00014321358,0.00002984507,0.00006924161,0.00033948914,0.00010353171],"domain_scores_gemma":[0.99848986,0.00039662045,0.00008514859,0.00053674413,0.00037350936,0.00011817981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008377694,0.0004899269,0.0006661894,0.0012306308,0.0008587337,0.00112411,0.002049378,0.00083261484,0.0026932878],"category_scores_gemma":[0.0025743456,0.00038213303,0.00033938704,0.0014638319,0.0006050391,0.0019112008,0.0024541786,0.0012533517,0.00079279783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080644374,0.00057017646,0.0010966171,0.00032088917,0.00010306003,0.0006476714,0.0002866382,0.26671207,0.10548161,0.21852769,0.025183221,0.380264],"study_design_scores_gemma":[0.00006061698,0.00015415155,0.00026891584,0.000024685638,0.000042027743,0.00024079288,0.000034002787,0.9356242,0.01883346,0.035418097,0.009258986,0.000040127135],"about_ca_topic_score_codex":0.0017984401,"about_ca_topic_score_gemma":0.0024621484,"teacher_disagreement_score":0.0026932878,"about_ca_system_score_codex":0.0011932884,"about_ca_system_score_gemma":0.001117913,"threshold_uncertainty_score":0.009009957},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034582082,0.00013629755,0.96119356,0.00018429753,0.00004369042,0.000087476175,0.000027447355,0.0001266203,0.003618543],"genre_scores_gemma":[0.94454795,0.00011695129,0.053111617,0.000093293376,0.000021445161,0.00010555255,0.000025978954,0.00001785635,0.0019594643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988483,0.00048419644,0.000054599364,0.00016940595,0.00025307192,0.00019042028],"domain_scores_gemma":[0.99897194,0.00043805217,0.0001327189,0.00009525094,0.00023419007,0.000127846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011973373,0.00093020836,0.0010255743,0.0006260936,0.00089909165,0.0009651479,0.0018452774,0.0009205929,0.00095029984],"category_scores_gemma":[0.002386947,0.00032695,0.0005317676,0.0006599548,0.001146142,0.0011933179,0.0014540753,0.0009153058,0.00018760916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002876798,0.00014667571,0.0006986244,0.00007699559,0.000090031215,0.0005664425,0.00036163986,0.8422847,0.013978487,0.09547869,0.0020839677,0.0439461],"study_design_scores_gemma":[0.000016374457,0.00004072617,0.000047188965,0.0000034077527,0.000011553053,0.00006523116,0.00002297965,0.99160975,0.00090749434,0.006757719,0.0005072402,0.000010351696],"about_ca_topic_score_codex":0.0045923023,"about_ca_topic_score_gemma":0.004717306,"teacher_disagreement_score":0.0045923023,"about_ca_system_score_codex":0.0014378107,"about_ca_system_score_gemma":0.0011810675,"threshold_uncertainty_score":0.010432124},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39952248,0.0012050378,0.5934972,0.00039195546,0.00008936303,0.00007292506,0.00009429889,0.00014011662,0.004986602],"genre_scores_gemma":[0.98463386,0.00031847047,0.014094478,0.000022698683,0.000020555364,0.000028900042,0.000018509967,0.00001130758,0.0008512506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938834,0.00027923094,0.000022255384,0.00008363494,0.00010313472,0.00012337713],"domain_scores_gemma":[0.9974558,0.0017740341,0.0003876142,0.00010899592,0.00019956694,0.0000740856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001304465,0.000458689,0.0005234812,0.0003787043,0.00048463908,0.00068294466,0.0006075896,0.0005432982,0.0007572612],"category_scores_gemma":[0.0027181145,0.00029720747,0.0002801303,0.00058541464,0.0006114402,0.00090981764,0.00052325474,0.00047902728,0.00011822444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078231074,0.000034553646,0.0004902582,0.000042995285,0.000016519267,0.00017906864,0.000048860187,0.97904676,0.003464855,0.008572509,0.00027733424,0.007747988],"study_design_scores_gemma":[0.000003884554,0.000023106459,0.00010976206,0.0000019011994,0.0000050279264,0.000017145554,0.000014694531,0.9977876,0.00042858557,0.001492282,0.0001124796,0.0000036196773],"about_ca_topic_score_codex":0.0040969923,"about_ca_topic_score_gemma":0.0031177222,"teacher_disagreement_score":0.0040969923,"about_ca_system_score_codex":0.0010290655,"about_ca_system_score_gemma":0.0008097034,"threshold_uncertainty_score":0.008146286},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00140898,0.00049269415,0.9962341,0.00019838191,0.000043019863,0.00002197646,0.000016286323,0.00004631725,0.0015382098],"genre_scores_gemma":[0.35791463,0.0030030813,0.63179773,0.0004721663,0.0005585219,0.0005557725,0.00015115764,0.00016899526,0.00537796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880075,0.0005908576,0.000039808012,0.0001120113,0.00035533152,0.000101348014],"domain_scores_gemma":[0.9994735,0.00027744062,0.00006314899,0.000051304425,0.00010450025,0.000030183508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028783632,0.0013465061,0.0008654411,0.0006096698,0.0006450293,0.0012102927,0.0014909507,0.0013185756,0.0018504111],"category_scores_gemma":[0.0023870755,0.0004472018,0.000949944,0.00090039906,0.0009720178,0.0019506438,0.0015218164,0.0020406777,0.000414356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026911164,0.00007430814,0.00018834532,0.0001316683,0.00005001179,0.00008588394,0.00007843865,0.72599137,0.0021725893,0.24129955,0.0024714628,0.027429402],"study_design_scores_gemma":[0.00000617666,0.00003343561,0.000046708283,0.000010811797,0.000011723611,0.000024955858,0.000011971885,0.9578565,0.00035008756,0.039983895,0.0016574281,0.000006323087],"about_ca_topic_score_codex":0.0014773014,"about_ca_topic_score_gemma":0.0014381264,"teacher_disagreement_score":0.0028783632,"about_ca_system_score_codex":0.0012320975,"about_ca_system_score_gemma":0.0013613428,"threshold_uncertainty_score":0.01522243},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06788687,0.002575371,0.9212895,0.00026226227,0.00009033614,0.000027677426,0.00008172094,0.00042011592,0.0073661436],"genre_scores_gemma":[0.9526068,0.0014844929,0.043677967,0.00009474468,0.00010165377,0.00004419921,0.000097075055,0.00010579487,0.0017872493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770856,0.0008056863,0.00007106499,0.00021978898,0.00097169774,0.00022309204],"domain_scores_gemma":[0.98564225,0.012254705,0.00042834147,0.00093956717,0.00065987505,0.00007520161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042645354,0.00083804847,0.00096603465,0.0008648377,0.00048008896,0.001469396,0.0014118905,0.0012467116,0.0007620063],"category_scores_gemma":[0.02041519,0.00046633725,0.0006514678,0.0006178289,0.0012968071,0.0021326859,0.0012383065,0.0015777962,0.00040681774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015388802,0.000022858605,0.0010536575,0.00011491271,0.000050291066,0.00014165488,0.00015448131,0.93910414,0.0047709583,0.031235883,0.00041091864,0.022786342],"study_design_scores_gemma":[0.000001654132,0.000024397055,0.00021630482,0.0000112995,0.000006234395,0.000041226274,0.000010921751,0.9926409,0.001697779,0.0051396773,0.00019615113,0.000013436237],"about_ca_topic_score_codex":0.002546224,"about_ca_topic_score_gemma":0.0014460606,"teacher_disagreement_score":0.0042645354,"about_ca_system_score_codex":0.0016253438,"about_ca_system_score_gemma":0.0007841248,"threshold_uncertainty_score":0.022553265},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16768959,0.004491076,0.8008661,0.0009205108,0.00014242709,0.00005242894,0.00020817126,0.00026922618,0.025360519],"genre_scores_gemma":[0.9831577,0.0011008091,0.012235552,0.00009243752,0.00010354269,0.000048643655,0.00005729098,0.00003848962,0.003165602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853647,0.00059057056,0.000023062928,0.00012283165,0.0003757545,0.0003512137],"domain_scores_gemma":[0.99464697,0.0037232833,0.0005040603,0.0002903732,0.0007123648,0.00012291964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001669491,0.0011310552,0.00069911825,0.00075050816,0.000685379,0.0015292335,0.0006700701,0.0010566592,0.0028422123],"category_scores_gemma":[0.0042317663,0.00032086766,0.00057160354,0.001113358,0.0017145813,0.0016066313,0.0009844478,0.0009265437,0.0006827315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011772692,0.000027276576,0.00053771597,0.00008123153,0.000049170605,0.00018050332,0.0000913559,0.92992646,0.0037328147,0.057306033,0.00088792725,0.0070617464],"study_design_scores_gemma":[0.0000086889795,0.00004665983,0.00018912178,0.0000130154085,0.000011333776,0.000093606715,0.000030438085,0.98077685,0.001061266,0.0172764,0.00048199293,0.000010640317],"about_ca_topic_score_codex":0.0020479008,"about_ca_topic_score_gemma":0.0012368442,"teacher_disagreement_score":0.0028422123,"about_ca_system_score_codex":0.0018837928,"about_ca_system_score_gemma":0.00060475146,"threshold_uncertainty_score":0.013667941},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009572294,0.012817986,0.70670587,0.0011363949,0.0008307797,0.00004895646,0.00018099569,0.00078526605,0.2679215],"genre_scores_gemma":[0.31844708,0.022068791,0.18825874,0.0009135851,0.001346194,0.00017479449,0.00040044126,0.0005020391,0.46788839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973553,0.00006291197,0.000007488282,0.000040689738,0.00011920504,0.00003412846],"domain_scores_gemma":[0.9996184,0.0001765132,0.000021311373,0.00009087845,0.00007589567,0.00001689475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031516157,0.0006168458,0.00050757756,0.0006829131,0.0003276602,0.0013181241,0.0006035437,0.0009827,0.013045934],"category_scores_gemma":[0.0010708199,0.00033798168,0.00030041524,0.0011756361,0.00056366273,0.0013506757,0.000747479,0.0011798773,0.0044413637],"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.00007410822,0.00004267984,0.00022054499,0.00022645906,0.00003759872,0.00027633493,0.00026360105,0.03622719,0.012568762,0.46638492,0.030506134,0.4531717],"study_design_scores_gemma":[0.000029431367,0.00011518385,0.0006312846,0.00016795551,0.000057930676,0.0025360696,0.00013497355,0.123376116,0.011089222,0.4829929,0.37879705,0.00007189643],"about_ca_topic_score_codex":0.00036730565,"about_ca_topic_score_gemma":0.00071353826,"teacher_disagreement_score":0.013045934,"about_ca_system_score_codex":0.0004809065,"about_ca_system_score_gemma":0.00031094352,"threshold_uncertainty_score":0.043642998},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014639588,0.0012232469,0.96606976,0.0021090799,0.0001298789,0.00010030706,0.00017618056,0.00017887601,0.015372971],"genre_scores_gemma":[0.7985472,0.0041056667,0.182372,0.0008156186,0.00085827586,0.0004644311,0.00025560037,0.00015770573,0.01242354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995605,0.0017619821,0.00015529734,0.00062543235,0.0013052813,0.0005470897],"domain_scores_gemma":[0.9881598,0.007621065,0.0009976766,0.0021060992,0.00080688123,0.00030855395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040133265,0.0012616003,0.0012090257,0.002611578,0.001628617,0.0033003998,0.0030360767,0.0024293845,0.0038464991],"category_scores_gemma":[0.014298444,0.00092692603,0.0018508417,0.0022239825,0.0048643164,0.0102075655,0.004739845,0.0046770032,0.0007488553],"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.000039773004,0.000023073928,0.00016681703,0.00008759233,0.000028284845,0.000111788424,0.00013556969,0.056735944,0.00092813256,0.933389,0.0012503525,0.007103632],"study_design_scores_gemma":[0.0000137807765,0.00005534519,0.000082200735,0.000036211623,0.000027311453,0.00018783091,0.000064581596,0.27042148,0.0009808504,0.7240216,0.004072501,0.000036294252],"about_ca_topic_score_codex":0.000941769,"about_ca_topic_score_gemma":0.00058879174,"teacher_disagreement_score":0.0041667568,"about_ca_system_score_codex":0.0041667568,"about_ca_system_score_gemma":0.002023663,"threshold_uncertainty_score":0.030232072},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0095321415,0.00034503083,0.98615634,0.0002208054,0.00002879583,0.000042937918,0.00003532334,0.000060814968,0.0035777846],"genre_scores_gemma":[0.69593793,0.0018730279,0.2964016,0.00022807,0.00019168749,0.00042370698,0.0001602822,0.00008678879,0.004696895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797004,0.0011191873,0.00007578663,0.00019170716,0.0005024843,0.00014073926],"domain_scores_gemma":[0.9955788,0.0030901944,0.00041511454,0.00034512722,0.00044944894,0.00012119016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00200566,0.00068585435,0.00088010635,0.0006048745,0.0005542038,0.0009621855,0.0010066355,0.0010257444,0.0013678058],"category_scores_gemma":[0.009543336,0.00045933702,0.00035203464,0.0010473661,0.0015649467,0.0017596822,0.0016806225,0.0011391812,0.0004116748],"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.00011877831,0.00003499941,0.00030699765,0.00018809605,0.000028607506,0.0001023812,0.0001560478,0.4387238,0.0048488365,0.5033883,0.0017637034,0.05033945],"study_design_scores_gemma":[0.000039421862,0.0000888432,0.00006518251,0.00003123562,0.000008298462,0.00006629459,0.000020468728,0.818288,0.0014313017,0.17729211,0.002652616,0.000016162106],"about_ca_topic_score_codex":0.00048537535,"about_ca_topic_score_gemma":0.0005377705,"teacher_disagreement_score":0.00200566,"about_ca_system_score_codex":0.0011891497,"about_ca_system_score_gemma":0.0014167777,"threshold_uncertainty_score":0.010607123},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072401497,0.00023858715,0.9917853,0.000058333124,0.00001771497,0.000014098265,0.000013324708,0.00010891132,0.00052360387],"genre_scores_gemma":[0.6317504,0.0009107199,0.364819,0.000100387166,0.00007591392,0.000100633115,0.00005817764,0.000042344436,0.0021424447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999383,0.0002702833,0.000026496164,0.00008002087,0.00019400127,0.000046256737],"domain_scores_gemma":[0.99739933,0.0018609867,0.0002675315,0.00018655472,0.00023467881,0.00005090564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010289066,0.00068810716,0.00075976073,0.00033945675,0.0003412342,0.00073837576,0.0006533394,0.0010631649,0.0007413805],"category_scores_gemma":[0.0063241646,0.0003727665,0.0004351543,0.0005317027,0.001054279,0.0012107361,0.0009957365,0.00093729043,0.00035982634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015670861,0.000060669907,0.00036159522,0.00016319191,0.00004465803,0.00016670556,0.00015535495,0.91735965,0.014006097,0.014217023,0.00057289004,0.05273551],"study_design_scores_gemma":[0.0000067794776,0.0000348351,0.000062356645,0.0000051460725,0.0000049685073,0.000049316553,0.000006314746,0.99506444,0.0021322535,0.002423519,0.0001993448,0.000010718964],"about_ca_topic_score_codex":0.0020129958,"about_ca_topic_score_gemma":0.0017477851,"teacher_disagreement_score":0.0020129958,"about_ca_system_score_codex":0.0003768162,"about_ca_system_score_gemma":0.0009331617,"threshold_uncertainty_score":0.005441487},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30285677,0.0008279088,0.69081855,0.00037843167,0.00007297283,0.00007615289,0.00012051178,0.00013974572,0.004709034],"genre_scores_gemma":[0.9801595,0.0003202071,0.01704144,0.00004373872,0.000063270505,0.00006639532,0.00003807784,0.000011571275,0.0022558202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916637,0.00034399758,0.000028393226,0.00017442809,0.00015983662,0.00012708746],"domain_scores_gemma":[0.9979038,0.0011871909,0.00042003635,0.00018582249,0.00020758942,0.000095507385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008238782,0.00050330535,0.000899228,0.00035673077,0.0005295375,0.000676252,0.001089055,0.0008114255,0.0007886242],"category_scores_gemma":[0.0028045573,0.00041178058,0.00034255593,0.0005534975,0.0010005364,0.0014982297,0.0008811963,0.00069814554,0.00016972944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003427935,0.0000712532,0.0020455546,0.00013794101,0.000065209315,0.0005503629,0.00018911638,0.90078086,0.010206691,0.070437185,0.0007972339,0.014375865],"study_design_scores_gemma":[0.000026558033,0.00007029689,0.00032431073,0.000004058495,0.000012641252,0.0000739281,0.000037354446,0.9882492,0.00046142208,0.010263343,0.00046777548,0.00000911576],"about_ca_topic_score_codex":0.0015286475,"about_ca_topic_score_gemma":0.0012513824,"teacher_disagreement_score":0.0015286475,"about_ca_system_score_codex":0.0006588924,"about_ca_system_score_gemma":0.00050919293,"threshold_uncertainty_score":0.00478065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4378224,0.00598196,0.5444399,0.001238735,0.0003416748,0.00006056584,0.00020844632,0.00030715662,0.009599062],"genre_scores_gemma":[0.99128,0.0010176662,0.0061926343,0.000063157204,0.00011492951,0.000025945834,0.000057047884,0.000041726296,0.0012068495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874413,0.00045423867,0.000056866294,0.0001596946,0.00041776607,0.00016727584],"domain_scores_gemma":[0.9868901,0.0094696805,0.0012069283,0.0006434373,0.0016313706,0.00015841937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002063034,0.0009400065,0.00078120234,0.00090397283,0.00045222123,0.00096868863,0.0006513691,0.0007373885,0.0014446898],"category_scores_gemma":[0.013969386,0.00034662368,0.0002231894,0.000704554,0.001127385,0.0019954066,0.0009323281,0.0011273765,0.00024679318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006729876,0.0000820273,0.0063012014,0.0003146703,0.00009337129,0.0012255366,0.0007115168,0.73383796,0.03630874,0.18946755,0.0023242484,0.02866024],"study_design_scores_gemma":[0.00002151141,0.00013059887,0.0013988549,0.0000587733,0.00002802074,0.0004957997,0.000083472856,0.9702213,0.0047360803,0.022204623,0.00056293345,0.000058044436],"about_ca_topic_score_codex":0.0010858492,"about_ca_topic_score_gemma":0.000623956,"teacher_disagreement_score":0.002063034,"about_ca_system_score_codex":0.00088490563,"about_ca_system_score_gemma":0.000526316,"threshold_uncertainty_score":0.010910511},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076066814,0.010612539,0.89843464,0.0006341138,0.0003846916,0.00031478386,0.00019947834,0.0019817748,0.01137103],"genre_scores_gemma":[0.7914477,0.0068089697,0.19610502,0.0002461465,0.00043154674,0.0002435144,0.0003941415,0.000065413245,0.0042575467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992581,0.00026277,0.000049352442,0.00006364202,0.00029131287,0.00007479587],"domain_scores_gemma":[0.999193,0.00038858695,0.00008783367,0.00010762059,0.00018473013,0.00003822264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009488468,0.0005430332,0.0005083721,0.000955873,0.0006737788,0.0005974444,0.0007699626,0.0006834477,0.001048778],"category_scores_gemma":[0.0021158303,0.00016579895,0.00021952638,0.0011717778,0.00021643528,0.0012851408,0.00081808126,0.00041502112,0.00024153404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036490653,0.00015590234,0.0016235996,0.0007502414,0.00012877329,0.00068381167,0.0002156705,0.17074974,0.031050164,0.02307145,0.007745502,0.76346034],"study_design_scores_gemma":[0.000102589365,0.00041183515,0.00082194235,0.0000725376,0.00009888785,0.0004819177,0.000104760926,0.9324645,0.011135971,0.029339531,0.024934111,0.000031403913],"about_ca_topic_score_codex":0.0010402928,"about_ca_topic_score_gemma":0.0009375513,"teacher_disagreement_score":0.001048778,"about_ca_system_score_codex":0.0004354782,"about_ca_system_score_gemma":0.00039792067,"threshold_uncertainty_score":0.0050180554},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005331829,0.022706024,0.96014136,0.0016469662,0.00019108714,0.00008499794,0.000015969088,0.00008304956,0.009798629],"genre_scores_gemma":[0.57513636,0.05167732,0.35898906,0.0007395041,0.0013499421,0.0009485813,0.00006921356,0.000047780883,0.011042216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872017,0.0007244155,0.00006440538,0.00012231509,0.00032743145,0.000041371146],"domain_scores_gemma":[0.99795157,0.0012827943,0.00016860204,0.00015484163,0.0004109699,0.000031242093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002218105,0.00067686127,0.0005354474,0.0006098302,0.0003577213,0.0014853467,0.0008354385,0.0015650756,0.001031282],"category_scores_gemma":[0.004247206,0.00039328285,0.00039533936,0.0010272695,0.0013416812,0.0013101066,0.0007293688,0.0010461963,0.00037643703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005038647,0.00006719,0.000529677,0.0007163947,0.00007538959,0.0004039632,0.00040824933,0.14895478,0.007668287,0.66880846,0.004470815,0.16784628],"study_design_scores_gemma":[0.00003567131,0.00024338008,0.0002716295,0.00022675688,0.000055412598,0.0006233216,0.0001246869,0.5873225,0.0038584068,0.35658246,0.0506113,0.00004447028],"about_ca_topic_score_codex":0.0005827076,"about_ca_topic_score_gemma":0.00048686573,"teacher_disagreement_score":0.002218105,"about_ca_system_score_codex":0.0009513181,"about_ca_system_score_gemma":0.00052914344,"threshold_uncertainty_score":0.011730611},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023881977,0.00012759515,0.9744289,0.00013965716,0.000014265681,0.000037848175,0.00001665754,0.00006621784,0.00128686],"genre_scores_gemma":[0.7535455,0.00034697284,0.24393019,0.00012699627,0.00003866919,0.00016449686,0.00006369941,0.00004856715,0.0017349917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999236,0.0004326303,0.000025502986,0.000060716746,0.00017174939,0.00007339066],"domain_scores_gemma":[0.9993192,0.000305119,0.000110809226,0.000078998826,0.00015853671,0.000027348719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016221767,0.00045560874,0.00031722256,0.00032130664,0.00025701724,0.0006937598,0.00081232097,0.0004261437,0.00075015135],"category_scores_gemma":[0.0014869041,0.0002833985,0.00034687392,0.0003910351,0.0005200508,0.00068831607,0.00056290516,0.00060131936,0.0001310694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006107271,0.00004658643,0.00048022054,0.000050140734,0.00004015618,0.000063585685,0.00005080009,0.92748976,0.013722874,0.02539938,0.00058258255,0.032012776],"study_design_scores_gemma":[0.000006797261,0.000038136182,0.00005872436,0.0000042019687,0.000008896162,0.000018539442,0.000007450892,0.99340516,0.0024413802,0.0035427988,0.00046425342,0.0000036804688],"about_ca_topic_score_codex":0.0013022424,"about_ca_topic_score_gemma":0.0017442346,"teacher_disagreement_score":0.0016221767,"about_ca_system_score_codex":0.00083802454,"about_ca_system_score_gemma":0.0010891188,"threshold_uncertainty_score":0.008578956},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049427204,0.0004942598,0.944443,0.00023299559,0.000034360197,0.000031984673,0.000038019884,0.00010018349,0.005198021],"genre_scores_gemma":[0.9465628,0.00031044497,0.050604533,0.0000639362,0.00004339399,0.00006279146,0.000023552304,0.000016010794,0.002312503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940264,0.00030313266,0.000019309296,0.0000799076,0.00012526951,0.00006986289],"domain_scores_gemma":[0.9992624,0.0004944695,0.00008664982,0.00005111428,0.00008361898,0.000021840457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007025527,0.0007020386,0.00049625913,0.00029794395,0.00033626158,0.0007344808,0.00063180743,0.00065246323,0.0011741141],"category_scores_gemma":[0.0020871894,0.00029692764,0.0002998961,0.00051167206,0.0006661767,0.00091456313,0.0007084909,0.0004665578,0.00032001716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011620941,0.00005766015,0.0004111113,0.000089713816,0.000036915484,0.00027125533,0.0001267918,0.92432255,0.008648632,0.033512205,0.00064831617,0.03175865],"study_design_scores_gemma":[0.000006821807,0.000031573447,0.00006241107,0.0000028849724,0.000004586286,0.000037651414,0.00001371736,0.9934314,0.0005969339,0.005596552,0.000211441,0.00000404329],"about_ca_topic_score_codex":0.0009635754,"about_ca_topic_score_gemma":0.0011910752,"teacher_disagreement_score":0.0011741141,"about_ca_system_score_codex":0.00064069696,"about_ca_system_score_gemma":0.0004368259,"threshold_uncertainty_score":0.0046485662},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33141306,0.0026190542,0.50169235,0.017001612,0.00090354105,0.0006717582,0.0021463938,0.0018158666,0.14173633],"genre_scores_gemma":[0.896241,0.0010651263,0.08562898,0.0011549867,0.00053278584,0.00088032987,0.0009184633,0.00036107487,0.013217215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99643826,0.0012318111,0.00018188005,0.0005736826,0.0009222839,0.00065217295],"domain_scores_gemma":[0.97063464,0.020967424,0.0020658907,0.0034445717,0.0021339392,0.0007535538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043543084,0.000679966,0.00071056816,0.0013092657,0.0013668181,0.0024696435,0.0016352128,0.0012991311,0.0068024527],"category_scores_gemma":[0.030079754,0.00043403142,0.00061688543,0.0011484546,0.002728564,0.007444623,0.003552352,0.0023952788,0.0010018913],"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.00068716845,0.00012716922,0.0019656506,0.00023335702,0.000042167954,0.00024021183,0.00062310306,0.053051747,0.009821376,0.863338,0.011764372,0.05810558],"study_design_scores_gemma":[0.00021039374,0.00020870926,0.0005790904,0.0001954927,0.000045476852,0.0004677756,0.0003071465,0.14745067,0.01507634,0.8206603,0.014743038,0.000055602348],"about_ca_topic_score_codex":0.0014030922,"about_ca_topic_score_gemma":0.0012890097,"teacher_disagreement_score":0.0068024527,"about_ca_system_score_codex":0.0030356233,"about_ca_system_score_gemma":0.0022605322,"threshold_uncertainty_score":0.023028076},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024872301,0.00027675653,0.9726083,0.00018432338,0.00005923153,0.00006622132,0.000035335757,0.0005329587,0.001364485],"genre_scores_gemma":[0.65833366,0.00036712314,0.33874986,0.00005954517,0.000037413785,0.00011559348,0.0001246332,0.000035578567,0.0021766194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997234,0.00006124575,0.000018711384,0.00003982917,0.00011436049,0.000042395015],"domain_scores_gemma":[0.999678,0.00008581323,0.000062829924,0.00006305569,0.00008965755,0.000020695805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041112144,0.00044633026,0.00034227208,0.0007128341,0.0006823868,0.00051780645,0.00066437444,0.00034068697,0.00090503634],"category_scores_gemma":[0.0011230251,0.00014426235,0.00038034367,0.00050155324,0.00032213755,0.0007475644,0.00092724006,0.0004956394,0.00024280259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032940286,0.000065796055,0.0019276355,0.00012074747,0.0001115533,0.00021337702,0.0002670836,0.43472454,0.037873473,0.044609804,0.0039541987,0.47580242],"study_design_scores_gemma":[0.00003241331,0.00016098394,0.00036891646,0.000010253651,0.000036217327,0.00017473075,0.00007213317,0.97577673,0.008661696,0.009152692,0.005528921,0.000024440542],"about_ca_topic_score_codex":0.0022216886,"about_ca_topic_score_gemma":0.0030662578,"teacher_disagreement_score":0.0022216886,"about_ca_system_score_codex":0.0007696083,"about_ca_system_score_gemma":0.0010694625,"threshold_uncertainty_score":0.0055840015},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90367264,0.0013310293,0.09177783,0.00014379957,0.000032462936,0.000018437384,0.00004677767,0.00015582508,0.0028212687],"genre_scores_gemma":[0.99589145,0.0001895116,0.003489632,0.000014847193,0.0000062865415,0.0000062123527,0.000017465663,0.000006967479,0.00037763827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998514,0.0006025405,0.00007332112,0.00012688633,0.00046654505,0.00021676092],"domain_scores_gemma":[0.9913264,0.006362744,0.0006949842,0.00044446526,0.0010916237,0.00007983447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021849752,0.0008330267,0.00065633,0.0005870666,0.0004274613,0.00069380377,0.0004763047,0.0009078429,0.00068209285],"category_scores_gemma":[0.008272259,0.00023114847,0.0002549308,0.00054932863,0.00073006697,0.0009998964,0.0006555804,0.00045993022,0.0002134304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007271347,0.00007723183,0.0042073177,0.000114611816,0.00010686766,0.00032976156,0.00020313945,0.9287375,0.0348038,0.0062299073,0.00020333135,0.02425947],"study_design_scores_gemma":[0.000020630907,0.00028868642,0.0013545625,0.000015748183,0.00004752352,0.00022528274,0.000036562866,0.97478116,0.02176718,0.0012578798,0.00017571828,0.000029047997],"about_ca_topic_score_codex":0.0024342476,"about_ca_topic_score_gemma":0.00139096,"teacher_disagreement_score":0.0024342476,"about_ca_system_score_codex":0.00087387627,"about_ca_system_score_gemma":0.00048235312,"threshold_uncertainty_score":0.011555374},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013816146,0.0003156754,0.9825462,0.00014803976,0.000023867853,0.00006219764,0.000017091439,0.00005655313,0.0030141596],"genre_scores_gemma":[0.7656264,0.0007875134,0.22966012,0.00010954764,0.0001022286,0.00025072094,0.000047273523,0.0000725215,0.0033437784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872583,0.00065855356,0.000037431106,0.00016265584,0.00028684913,0.0001287639],"domain_scores_gemma":[0.9988589,0.00078370824,0.00012085361,0.000079103535,0.000116859184,0.000040600356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015891539,0.0015542043,0.0013284317,0.00044180683,0.00040939296,0.0011380109,0.0013434016,0.0010406604,0.0017653905],"category_scores_gemma":[0.0036530683,0.00047178107,0.0010060066,0.00091633416,0.0010461799,0.0015546342,0.0011554434,0.0010704563,0.0003535623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101788275,0.000067204324,0.00036752643,0.00012568408,0.000044572706,0.00028890898,0.00013828558,0.9322874,0.006958949,0.03552774,0.00066976587,0.023422163],"study_design_scores_gemma":[0.00001266504,0.000072967545,0.000061482526,0.0000051967654,0.000011659485,0.00011036016,0.000015562615,0.9928254,0.001524259,0.0050003487,0.00035227943,0.000007805266],"about_ca_topic_score_codex":0.00080891803,"about_ca_topic_score_gemma":0.0005387679,"teacher_disagreement_score":0.0017653905,"about_ca_system_score_codex":0.0008998124,"about_ca_system_score_gemma":0.00080024445,"threshold_uncertainty_score":0.0084043145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018688577,0.0007808588,0.98050576,0.0010116817,0.00014304227,0.000036557285,0.00010988705,0.00004779514,0.015495563],"genre_scores_gemma":[0.45683938,0.006920265,0.5165596,0.0022987272,0.0019820747,0.0009175913,0.0005149135,0.0002504551,0.013716995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99589807,0.0017185523,0.00018808612,0.00049490103,0.0013794937,0.0003208831],"domain_scores_gemma":[0.9959319,0.0022859238,0.00022748129,0.00083836075,0.0005964878,0.000119859935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003757482,0.0013262755,0.0015496572,0.0025164927,0.0012967674,0.004115865,0.0026905113,0.0023045384,0.0036375124],"category_scores_gemma":[0.007163307,0.00072193245,0.0017098848,0.0025070095,0.004575973,0.008996025,0.0033916445,0.005398014,0.00089294184],"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.0000038107055,0.0000060556927,0.000016914655,0.000022366687,0.000005404805,0.000015281817,0.000022944094,0.007751394,0.0001512594,0.98924303,0.0004878685,0.002273596],"study_design_scores_gemma":[0.0000066893354,0.000015422558,0.000027201244,0.000031881187,0.00000773784,0.00004153319,0.000019515845,0.07044471,0.00025131536,0.92300487,0.0061361655,0.000013078823],"about_ca_topic_score_codex":0.001236008,"about_ca_topic_score_gemma":0.0007980688,"teacher_disagreement_score":0.004115865,"about_ca_system_score_codex":0.0033247403,"about_ca_system_score_gemma":0.002016526,"threshold_uncertainty_score":0.024122834},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045481544,0.000727578,0.9512826,0.00010438242,0.00004680802,0.00004575333,0.000025378697,0.00023159379,0.0020543889],"genre_scores_gemma":[0.8431689,0.0006760487,0.15353148,0.00006411334,0.000031767715,0.000049594284,0.00003306352,0.0000120037175,0.0024330257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996973,0.000094077615,0.000021668928,0.000066195156,0.000075334254,0.00004546351],"domain_scores_gemma":[0.99972314,0.00013114055,0.000042631702,0.000049459817,0.000045204113,0.000008458309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059085846,0.00058797625,0.00044159754,0.00035120483,0.00041109108,0.0004876235,0.0005696,0.0005568473,0.00088820007],"category_scores_gemma":[0.0011984691,0.00019929197,0.0003759832,0.00031967807,0.0004719844,0.00087327615,0.0005587339,0.00038501318,0.00017547466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049075007,0.00008448554,0.001269323,0.00030064766,0.000107950604,0.00076195743,0.00040103082,0.52052325,0.096532315,0.05364528,0.001532963,0.32435],"study_design_scores_gemma":[0.000032790875,0.00029253878,0.00031191504,0.000017746104,0.000058014804,0.0006874376,0.000045638684,0.96155214,0.027877193,0.006370705,0.0027155103,0.00003825869],"about_ca_topic_score_codex":0.0010895561,"about_ca_topic_score_gemma":0.0013510224,"teacher_disagreement_score":0.0010895561,"about_ca_system_score_codex":0.00038177203,"about_ca_system_score_gemma":0.00035478742,"threshold_uncertainty_score":0.003124833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22151642,0.0015605548,0.7581752,0.00048858154,0.000059238613,0.00011344743,0.00055696885,0.0006131296,0.016916556],"genre_scores_gemma":[0.97138184,0.00048547875,0.026315141,0.000048562666,0.00001462218,0.00010314922,0.00018294757,0.000032033928,0.0014362137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874806,0.00048485157,0.00005450415,0.00013334752,0.00032521138,0.00025399163],"domain_scores_gemma":[0.9937568,0.004482043,0.00047931692,0.00045619824,0.00068646605,0.00013911388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028153292,0.0011322907,0.0010426576,0.0007558269,0.0005563479,0.0015389111,0.0012621016,0.0009228205,0.0018134761],"category_scores_gemma":[0.0074066063,0.00038481908,0.00039931646,0.0007210472,0.0013135299,0.0014794877,0.0014199094,0.0008524269,0.00054357847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047057183,0.00006350292,0.00082643004,0.00029758096,0.000081781785,0.00034103802,0.00019430058,0.8936144,0.016017841,0.07121864,0.0013015236,0.015572267],"study_design_scores_gemma":[0.000035513887,0.00011456569,0.0002959433,0.00003049745,0.000031496704,0.00015903627,0.000053423813,0.97649014,0.0088365115,0.013438472,0.0004839269,0.000030340854],"about_ca_topic_score_codex":0.0021615978,"about_ca_topic_score_gemma":0.0015580055,"teacher_disagreement_score":0.0028153292,"about_ca_system_score_codex":0.0013062808,"about_ca_system_score_gemma":0.0016088977,"threshold_uncertainty_score":0.014889121},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06356593,0.00095342076,0.92338824,0.00067779026,0.000100054036,0.00015077268,0.00027216529,0.00030473215,0.010586838],"genre_scores_gemma":[0.96219516,0.0004004186,0.03449573,0.00015437852,0.00007921589,0.00012792606,0.00010299323,0.000037945792,0.0024060886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981439,0.0007036464,0.00009715743,0.00017612713,0.0004963341,0.0003828612],"domain_scores_gemma":[0.9896735,0.008100734,0.00056469394,0.00040734405,0.0010627618,0.00019105036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035711892,0.0014840814,0.0011603776,0.0010280267,0.0006142711,0.0017937801,0.0016634767,0.0012754003,0.0028164592],"category_scores_gemma":[0.013398812,0.0006407299,0.00036182298,0.0012156147,0.0013568947,0.001441614,0.0016900428,0.0010730553,0.00044290695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067833555,0.00013002138,0.0008177059,0.00019755286,0.00008591766,0.00021779053,0.00039417855,0.8265247,0.004960365,0.073402174,0.0030701747,0.08952112],"study_design_scores_gemma":[0.0000685176,0.000106514926,0.0002756573,0.000032942517,0.0000402134,0.00007689225,0.000045408717,0.9665168,0.001653139,0.030611232,0.0005461431,0.000026672473],"about_ca_topic_score_codex":0.0027337954,"about_ca_topic_score_gemma":0.0043204194,"teacher_disagreement_score":0.0035711892,"about_ca_system_score_codex":0.0017505835,"about_ca_system_score_gemma":0.0020834545,"threshold_uncertainty_score":0.018886447},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22724362,0.0021371355,0.6175091,0.0030888866,0.0009481221,0.00016491547,0.0026868517,0.0015445546,0.14467677],"genre_scores_gemma":[0.8212517,0.0015119966,0.09997012,0.0014296175,0.00059440336,0.00044494646,0.0042282916,0.00072697015,0.06984204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967182,0.0008115298,0.00032710342,0.0009822798,0.00068805035,0.00047277872],"domain_scores_gemma":[0.9926797,0.0032758785,0.0006329243,0.0007713244,0.0019380195,0.0007020692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030830617,0.0007788185,0.00074519584,0.002364416,0.0026190383,0.0029846618,0.0008706159,0.0010924059,0.020627802],"category_scores_gemma":[0.0076473537,0.00097807,0.00233388,0.0014073859,0.002317114,0.008032178,0.0050719404,0.0033693898,0.0029006798],"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.0000683987,0.00002037255,0.0005043108,0.000091060996,0.000028908491,0.00014340121,0.0005307761,0.0004585326,0.0010762541,0.9861004,0.002262281,0.008715285],"study_design_scores_gemma":[0.000025756814,0.000050622904,0.00041652072,0.00005668188,0.000023920826,0.00033634188,0.00049572624,0.0030320683,0.0010262701,0.98273414,0.011775962,0.000025888663],"about_ca_topic_score_codex":0.0011758602,"about_ca_topic_score_gemma":0.0013886205,"teacher_disagreement_score":0.020627802,"about_ca_system_score_codex":0.0020130945,"about_ca_system_score_gemma":0.00086019095,"threshold_uncertainty_score":0.06900686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01231109,0.00044435306,0.9850986,0.00009368998,0.000016421282,0.000020270769,0.000021904929,0.00007091893,0.0019227375],"genre_scores_gemma":[0.9110049,0.0011896233,0.08445595,0.00008300521,0.000073008516,0.00014184283,0.000048355836,0.000026829019,0.0029764203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882215,0.00058318,0.000051813113,0.00009999676,0.0003117554,0.00013119103],"domain_scores_gemma":[0.9988852,0.00071133435,0.00014165629,0.00007411143,0.00015030833,0.00003732048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013002526,0.0014880693,0.00081567647,0.0004298042,0.00033068415,0.0009872523,0.00065834535,0.00079124194,0.00096365565],"category_scores_gemma":[0.0018574727,0.00058313424,0.0005349026,0.0006973569,0.00079857005,0.0009872325,0.0006956096,0.00050524727,0.00041737207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080374644,0.000040135903,0.0005083401,0.00009113236,0.000059994378,0.00025865014,0.000104845305,0.91612345,0.012065049,0.036791716,0.0008448827,0.033031408],"study_design_scores_gemma":[0.000009138099,0.00006911255,0.00012087401,0.0000056166646,0.000013829261,0.00008693087,0.000016820091,0.9899843,0.0012396079,0.008095017,0.0003470493,0.000011713572],"about_ca_topic_score_codex":0.000971509,"about_ca_topic_score_gemma":0.0013259288,"teacher_disagreement_score":0.0014880693,"about_ca_system_score_codex":0.00064015866,"about_ca_system_score_gemma":0.0004610258,"threshold_uncertainty_score":0.006876409},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03330029,0.0015580964,0.95845425,0.00026857908,0.00007763782,0.00009619245,0.0002064171,0.00016988559,0.0058686095],"genre_scores_gemma":[0.8185593,0.002052349,0.17435837,0.0001694028,0.00013306194,0.00025965722,0.00031787416,0.00006505033,0.0040848777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852437,0.00045066475,0.0000832629,0.00020210794,0.0005521333,0.00018765872],"domain_scores_gemma":[0.99546,0.0023129776,0.0007841577,0.00038764352,0.00096828066,0.00008692529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010601055,0.00095967425,0.00057880353,0.0005925151,0.00042550737,0.0011734309,0.0007019065,0.00094527635,0.0016232714],"category_scores_gemma":[0.005353014,0.00034012456,0.00046649,0.001079303,0.0009205337,0.0010271505,0.0005962046,0.0008763094,0.00057164335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023508101,0.000050287803,0.0008991368,0.00040450817,0.00008802189,0.00034472073,0.0002505242,0.77455735,0.032885905,0.1288483,0.0014992482,0.05993694],"study_design_scores_gemma":[0.000021738764,0.00016757078,0.00018881484,0.00004929434,0.000019768018,0.00024150177,0.000035914458,0.96662515,0.013100007,0.016802143,0.002712913,0.00003522706],"about_ca_topic_score_codex":0.0023168141,"about_ca_topic_score_gemma":0.0028639052,"teacher_disagreement_score":0.0023168141,"about_ca_system_score_codex":0.0013240308,"about_ca_system_score_gemma":0.0015777481,"threshold_uncertainty_score":0.00960654},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050508406,0.0004548242,0.9439735,0.00029465748,0.00004615861,0.00004091201,0.000035019635,0.00021501674,0.004431495],"genre_scores_gemma":[0.82620883,0.00052545447,0.17034212,0.00011296487,0.000030478117,0.00006619769,0.000049181654,0.000032549833,0.0026323022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960107,0.00014449886,0.000015017375,0.00005147654,0.00013422473,0.00005381556],"domain_scores_gemma":[0.9988411,0.00065333175,0.00013205601,0.00017506698,0.00016406245,0.00003441318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078367244,0.00041440557,0.00044683513,0.00038754998,0.00030876667,0.00040614113,0.00080877077,0.0004890441,0.0007765223],"category_scores_gemma":[0.0027439843,0.00013477218,0.00034018344,0.00045993985,0.0007631021,0.001081994,0.0006832282,0.0005609016,0.000174152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019536477,0.00005919763,0.0005120234,0.00017706348,0.000047109945,0.00037028367,0.00045567699,0.60303646,0.051303852,0.29115444,0.0017888324,0.050899655],"study_design_scores_gemma":[0.000012051259,0.000050831943,0.00005433241,0.000008348729,0.000010779277,0.00011547245,0.000016320895,0.98304623,0.0053691594,0.009991432,0.0013118216,0.000013266882],"about_ca_topic_score_codex":0.0020597735,"about_ca_topic_score_gemma":0.0017805438,"teacher_disagreement_score":0.0020597735,"about_ca_system_score_codex":0.000919647,"about_ca_system_score_gemma":0.000808753,"threshold_uncertainty_score":0.0066725016},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0546041,0.0007012388,0.9349001,0.0006714129,0.00032096985,0.00057729636,0.00020543578,0.0016245134,0.006394965],"genre_scores_gemma":[0.8995123,0.00023949915,0.09384679,0.00018893344,0.000089097106,0.00037154008,0.00014187662,0.000028722508,0.0055812607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987521,0.0003691165,0.000067237575,0.00011940643,0.00041018944,0.0002819134],"domain_scores_gemma":[0.9987078,0.0003984903,0.00019597783,0.00024723317,0.00031960956,0.00013093279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026530507,0.0006526473,0.0007353528,0.0011379855,0.0011982785,0.0008161025,0.0021916493,0.0011149925,0.0023460959],"category_scores_gemma":[0.004465522,0.00018955053,0.00048141243,0.0007413844,0.00083698105,0.0015709836,0.0017158099,0.0007368276,0.0003624157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014490639,0.0005025647,0.0024509626,0.0004705812,0.00015979327,0.0011374677,0.0004944076,0.25324324,0.024715584,0.32717994,0.022123136,0.36607322],"study_design_scores_gemma":[0.00025459056,0.00046216694,0.0007838756,0.00004405645,0.0000521338,0.00055635744,0.00006208501,0.8891328,0.010114549,0.07659991,0.021843327,0.00009406377],"about_ca_topic_score_codex":0.0018146303,"about_ca_topic_score_gemma":0.0017024793,"teacher_disagreement_score":0.0026530507,"about_ca_system_score_codex":0.0013442053,"about_ca_system_score_gemma":0.0020729199,"threshold_uncertainty_score":0.014030814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84447205,0.0005000351,0.14922866,0.00013722695,0.00002136259,0.000019641648,0.0000687607,0.0001486315,0.0054036463],"genre_scores_gemma":[0.9968263,0.000055916124,0.0028265584,0.000010946975,0.00000308897,0.000004890381,0.000011211406,0.000004188645,0.0002569536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992859,0.00028222444,0.000021294938,0.000081438535,0.00019949161,0.0001295999],"domain_scores_gemma":[0.99477035,0.0037482632,0.00035111496,0.00026586262,0.0007475926,0.00011685374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015636554,0.0006967129,0.0004717557,0.0003559622,0.00044605316,0.00087944244,0.0005043254,0.00078741007,0.0006240116],"category_scores_gemma":[0.005631688,0.0002175245,0.00019506406,0.00037859692,0.0007912544,0.00077659707,0.0006937413,0.0003622575,0.000112483736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007339472,0.00007014057,0.0027793315,0.0000965669,0.00006989272,0.00030687315,0.0001858995,0.93118656,0.037305366,0.010396501,0.00026449148,0.016604483],"study_design_scores_gemma":[0.000026569804,0.00028061314,0.0007550404,0.000007927283,0.000022644297,0.00011369346,0.000042889526,0.98592836,0.010402697,0.00226516,0.000135942,0.000018376883],"about_ca_topic_score_codex":0.0021637958,"about_ca_topic_score_gemma":0.0017368078,"teacher_disagreement_score":0.0021637958,"about_ca_system_score_codex":0.0007850885,"about_ca_system_score_gemma":0.00063076743,"threshold_uncertainty_score":0.008269489},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122645415,0.001264925,0.8621677,0.00049597805,0.00003542255,0.00005252782,0.00008842106,0.00022905956,0.013020552],"genre_scores_gemma":[0.9491106,0.00097085146,0.047596622,0.00008659477,0.000052280964,0.000033514265,0.00004108271,0.00005850206,0.0020499702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871576,0.0006556811,0.00007277315,0.00014577294,0.00030666354,0.00010332759],"domain_scores_gemma":[0.9969086,0.0021567377,0.0003668577,0.00017041329,0.0003588051,0.000038588278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023134516,0.0008562996,0.00075328967,0.0005257958,0.00027544345,0.0011367162,0.00052599027,0.0007861677,0.0015323508],"category_scores_gemma":[0.006980739,0.00033803697,0.00033634494,0.0006280997,0.0009939409,0.0016903927,0.00056441076,0.00042133464,0.00042937687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004046609,0.000053105174,0.0010693378,0.00022494436,0.00006380502,0.00022172235,0.00014546774,0.8860564,0.02820255,0.04449927,0.0004963419,0.038562324],"study_design_scores_gemma":[0.000027219354,0.00021404415,0.00071334274,0.000027074375,0.000057545833,0.00025624156,0.000052134994,0.9689331,0.01334381,0.015683778,0.0006678917,0.000023865476],"about_ca_topic_score_codex":0.00051371014,"about_ca_topic_score_gemma":0.0008563962,"teacher_disagreement_score":0.0023134516,"about_ca_system_score_codex":0.0010323618,"about_ca_system_score_gemma":0.000591243,"threshold_uncertainty_score":0.012234867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009793772,0.00038878233,0.98757756,0.00028386203,0.000022198155,0.000028057244,0.0000110703395,0.00010642978,0.001788339],"genre_scores_gemma":[0.8615759,0.0006637521,0.13512215,0.00012634907,0.000115761904,0.00019601884,0.0000367035,0.000061906234,0.0021015056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978702,0.0011987117,0.000054195694,0.0002152207,0.00045593068,0.00020566669],"domain_scores_gemma":[0.9975157,0.0018259474,0.00019769784,0.00015788866,0.00020367079,0.00009909333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027031898,0.0010289743,0.0017546444,0.00048057982,0.00063623546,0.0020120705,0.0016994018,0.0013652763,0.0009382805],"category_scores_gemma":[0.0048806206,0.00056712,0.00074813067,0.00095465215,0.0015500903,0.001915003,0.0016747621,0.001839264,0.00026250049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083247025,0.000056942506,0.00017263337,0.000047908165,0.000025746287,0.00005348208,0.00008131358,0.9351232,0.000972407,0.034495443,0.0007205808,0.028167043],"study_design_scores_gemma":[0.0000068577365,0.000010034668,0.0000177859,0.0000023228636,0.000002809258,0.0000065271247,0.0000058747682,0.99278945,0.00017412614,0.006887299,0.00009393124,0.0000029991304],"about_ca_topic_score_codex":0.0021535216,"about_ca_topic_score_gemma":0.0014684778,"teacher_disagreement_score":0.0027031898,"about_ca_system_score_codex":0.0015737825,"about_ca_system_score_gemma":0.0014637372,"threshold_uncertainty_score":0.014295995},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04250204,0.0003258493,0.9553478,0.0002369065,0.000027512067,0.000049084352,0.000044260996,0.00011670564,0.0013498173],"genre_scores_gemma":[0.8395554,0.0006997238,0.15655129,0.00010972768,0.00007982181,0.00021662153,0.00013207276,0.00010293423,0.0025523985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999131,0.00037655272,0.000023717139,0.0001478388,0.00020586881,0.000115117866],"domain_scores_gemma":[0.99649245,0.0027176505,0.0002517386,0.00017459303,0.0002605317,0.00010302817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021173318,0.00089247274,0.0009391369,0.00048168877,0.00043260714,0.00066463446,0.00087203225,0.0007262681,0.0010057349],"category_scores_gemma":[0.0061511905,0.00028064786,0.00025788616,0.0008246774,0.0012959538,0.0013038694,0.0008105422,0.00081897166,0.00016145063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010935851,0.000043616663,0.0001669496,0.00005765196,0.000015953923,0.000025067828,0.000046630357,0.9522397,0.0031952201,0.028163977,0.0006448089,0.015291095],"study_design_scores_gemma":[0.00001888357,0.000056501172,0.00007124689,0.0000044231047,0.000004554917,0.000011544318,0.000012960639,0.9886286,0.0010800739,0.0098832315,0.00022237288,0.0000054902666],"about_ca_topic_score_codex":0.0029460452,"about_ca_topic_score_gemma":0.0024495998,"teacher_disagreement_score":0.0029460452,"about_ca_system_score_codex":0.0017509669,"about_ca_system_score_gemma":0.0022949849,"threshold_uncertainty_score":0.012704194},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31538838,0.0015000353,0.6753743,0.0003853173,0.000034702414,0.000071277966,0.00007057162,0.00016104705,0.007014293],"genre_scores_gemma":[0.9808123,0.00045106473,0.01722273,0.000042562115,0.000022408478,0.000042228803,0.00002240104,0.000017501423,0.001366673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987018,0.0008101415,0.000038336115,0.00010998455,0.000158474,0.00018125969],"domain_scores_gemma":[0.99179465,0.0068719257,0.000570898,0.00020060857,0.00044680556,0.00011513161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033285713,0.0014841378,0.0013188405,0.00067506044,0.00044505295,0.0011873144,0.0009945835,0.0008546969,0.0006465877],"category_scores_gemma":[0.00811619,0.00062553596,0.00043045369,0.0010086553,0.0012101157,0.0010771566,0.0012880603,0.000483044,0.00016008508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031247962,0.000041217798,0.0008036682,0.00007253935,0.00008011544,0.00015795107,0.00021918319,0.9741253,0.0017073227,0.010637253,0.00031438007,0.011528535],"study_design_scores_gemma":[0.000010489988,0.00009905987,0.0001610379,0.0000055344185,0.000018041537,0.00003199478,0.000043905104,0.99522084,0.00063915487,0.0036335469,0.000128921,0.0000074657705],"about_ca_topic_score_codex":0.0026300927,"about_ca_topic_score_gemma":0.0021132694,"teacher_disagreement_score":0.0033285713,"about_ca_system_score_codex":0.0010710184,"about_ca_system_score_gemma":0.00054777466,"threshold_uncertainty_score":0.017603397},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039422832,0.00046089277,0.95695454,0.00013088375,0.000038543585,0.000043565567,0.000021916301,0.00008159794,0.0028452193],"genre_scores_gemma":[0.8141854,0.0007821804,0.18253101,0.00006759791,0.00005203207,0.00012825312,0.000039606417,0.000014709598,0.0021992398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994093,0.00022845111,0.000019766656,0.000063416264,0.00021475123,0.00006422967],"domain_scores_gemma":[0.9988624,0.00071402243,0.000106800086,0.00014932307,0.0001499461,0.000017536688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009420876,0.00034019124,0.00027905178,0.00035019714,0.00026548127,0.00049810007,0.0005937087,0.0004771781,0.00040964555],"category_scores_gemma":[0.002917489,0.00015437971,0.00020062485,0.0006132401,0.00083234,0.0007873391,0.00057116244,0.0005027372,0.00012441633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019268667,0.00008555705,0.0011417783,0.00014153162,0.00003657815,0.00034897635,0.00030006896,0.6608085,0.03289945,0.15344751,0.0011869152,0.14941038],"study_design_scores_gemma":[0.000011874365,0.00005654169,0.00024439095,0.000011500942,0.000007892979,0.00008256013,0.000013955479,0.98567605,0.0042449227,0.008670854,0.00096789113,0.000011585265],"about_ca_topic_score_codex":0.0022264684,"about_ca_topic_score_gemma":0.0031251397,"teacher_disagreement_score":0.0022264684,"about_ca_system_score_codex":0.0005434533,"about_ca_system_score_gemma":0.00063702546,"threshold_uncertainty_score":0.004982233},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078480184,0.0008304902,0.89525795,0.0006229035,0.000118779644,0.0000655632,0.00011552816,0.00023657389,0.024272088],"genre_scores_gemma":[0.9502306,0.00051621685,0.044485543,0.000076758944,0.000040505594,0.00005666179,0.000043580043,0.000025141455,0.004524951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933285,0.00024973633,0.000025905281,0.0000976768,0.00019922036,0.00009463268],"domain_scores_gemma":[0.99851924,0.00083327014,0.00014302033,0.00024937053,0.00018561908,0.00006948465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090118265,0.0005247556,0.00057907554,0.0003149654,0.00068460056,0.0009845828,0.000916168,0.00070215965,0.0024320115],"category_scores_gemma":[0.002887753,0.0001881776,0.00026876945,0.0005557193,0.0009478137,0.0015255234,0.0011206875,0.0007227613,0.000510194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031609074,0.00005775885,0.00041048837,0.00011970799,0.000029450888,0.00033680402,0.00016378066,0.38530955,0.012683838,0.5665532,0.0020264497,0.03199296],"study_design_scores_gemma":[0.00003290878,0.00005513166,0.00007609939,0.0000068867635,0.000012211836,0.00011416728,0.000028113018,0.91192406,0.004387878,0.081786856,0.001560263,0.000015461354],"about_ca_topic_score_codex":0.0013010547,"about_ca_topic_score_gemma":0.0015796294,"teacher_disagreement_score":0.0024320115,"about_ca_system_score_codex":0.0007764024,"about_ca_system_score_gemma":0.00075624295,"threshold_uncertainty_score":0.008135915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040664826,0.00019722256,0.9530879,0.0002771223,0.000030837327,0.000049393835,0.000024766889,0.00012755499,0.0055404245],"genre_scores_gemma":[0.7565239,0.00022233393,0.23863752,0.00015822788,0.000024589182,0.0001710047,0.000064283886,0.000033963795,0.004164114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980384,0.0000583994,0.000006956001,0.00004158749,0.000049274542,0.000040090992],"domain_scores_gemma":[0.99962246,0.00024139871,0.000039390387,0.000018258652,0.000053826105,0.000024563093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039877757,0.00039642397,0.0006025198,0.000359896,0.00038983085,0.00052341534,0.0006881583,0.00074770476,0.0019987833],"category_scores_gemma":[0.0011698952,0.00030151074,0.0005308879,0.00040024825,0.00050679385,0.0006281509,0.0005397129,0.0005335372,0.00014659614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019951096,0.000021623608,0.00034860964,0.000019323532,0.000016569578,0.0000560778,0.000026544176,0.97447836,0.0009224119,0.0095226765,0.00035752307,0.014210277],"study_design_scores_gemma":[0.0000064572364,0.000012572773,0.000046222336,0.0000016640619,0.000004236015,0.00000966336,0.000006821488,0.9973967,0.0001311707,0.0021760236,0.00020646954,0.0000020600105],"about_ca_topic_score_codex":0.0038034858,"about_ca_topic_score_gemma":0.003086386,"teacher_disagreement_score":0.0038034858,"about_ca_system_score_codex":0.0005503246,"about_ca_system_score_gemma":0.0009525932,"threshold_uncertainty_score":0.007562697},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054342444,0.00015624241,0.99341595,0.000056478133,0.000016227772,0.000027415945,0.000019309478,0.00006749189,0.00080657407],"genre_scores_gemma":[0.6599857,0.00061809784,0.33512267,0.00011000247,0.00006789217,0.00024364165,0.000105788946,0.00005626999,0.0036899194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989649,0.0003928218,0.000064860826,0.00021619184,0.00026844998,0.00009274843],"domain_scores_gemma":[0.99940836,0.00023658054,0.000089486464,0.00007830856,0.00015214499,0.000035117006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011082629,0.0014183464,0.0012576351,0.00032903597,0.0004343909,0.0012699589,0.0011422493,0.0011778926,0.0019555609],"category_scores_gemma":[0.0015123592,0.00051371136,0.00070398086,0.00047066514,0.00065178925,0.0013278478,0.0010693433,0.00082944223,0.0006082985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018066438,0.00006954745,0.00053030404,0.0002255139,0.00010654179,0.00021825603,0.00019055484,0.89004666,0.017768553,0.027133305,0.00088648824,0.06264367],"study_design_scores_gemma":[0.000029189889,0.0001270849,0.00008759335,0.000006899363,0.000021829945,0.000097919874,0.000018718409,0.991734,0.0026832977,0.0042705815,0.0009074371,0.000015455556],"about_ca_topic_score_codex":0.0009367936,"about_ca_topic_score_gemma":0.0009752018,"teacher_disagreement_score":0.0019555609,"about_ca_system_score_codex":0.0005371724,"about_ca_system_score_gemma":0.00088466663,"threshold_uncertainty_score":0.006542027},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086598784,0.0005575476,0.9047766,0.00022200398,0.00004788808,0.00008371046,0.000047701516,0.00028594935,0.0073798983],"genre_scores_gemma":[0.8841782,0.00020706824,0.11217704,0.00007144392,0.000031936677,0.00007745105,0.00005152105,0.000013085192,0.0031923556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989692,0.00033222872,0.00005433813,0.00013553067,0.00036910022,0.00013967429],"domain_scores_gemma":[0.9989341,0.00033313074,0.00014283748,0.0002229009,0.00031915045,0.000047933576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008217523,0.00076668465,0.00077406433,0.00067346287,0.0005988833,0.00088143646,0.0015853952,0.0011654072,0.00065281027],"category_scores_gemma":[0.0021456245,0.00024368991,0.0004830065,0.00094074523,0.00078876177,0.0010665699,0.0014437959,0.000477029,0.00035879546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004758923,0.00019845455,0.0010021462,0.00023361873,0.00018190472,0.0011364308,0.00071171694,0.5549602,0.11178923,0.10595911,0.002336555,0.22101489],"study_design_scores_gemma":[0.0000538414,0.00018804023,0.00014137456,0.000013033099,0.000049456816,0.00059386005,0.000035504174,0.97343135,0.013154945,0.010264098,0.002031314,0.000043165604],"about_ca_topic_score_codex":0.0015870165,"about_ca_topic_score_gemma":0.0019694977,"teacher_disagreement_score":0.0015870165,"about_ca_system_score_codex":0.00059152703,"about_ca_system_score_gemma":0.00089173653,"threshold_uncertainty_score":0.004345894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028124364,0.0005423132,0.9680724,0.00015577511,0.00003560598,0.000027057964,0.000024753936,0.00007799887,0.0029397935],"genre_scores_gemma":[0.8861608,0.00046603932,0.11124287,0.00009415766,0.00004079891,0.00008902672,0.000038359798,0.000020394935,0.0018476316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994301,0.00022826728,0.000019334593,0.00008180489,0.00014869763,0.00009183529],"domain_scores_gemma":[0.9995592,0.0002464816,0.000059038302,0.00004938554,0.00006146024,0.000024480907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061686453,0.0006810507,0.0006372289,0.00036945188,0.00061866356,0.0006612174,0.0008280649,0.0006007313,0.00070241035],"category_scores_gemma":[0.0015292998,0.00024492492,0.0002872783,0.0008081256,0.00065145787,0.00084878533,0.0008796226,0.00055604754,0.00019611082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013093566,0.000108250206,0.00058425154,0.000110234294,0.000042790743,0.00023536751,0.00012034174,0.840294,0.014016136,0.053308517,0.0022070082,0.08884221],"study_design_scores_gemma":[0.0000045542197,0.000019394522,0.000054979057,0.0000031994814,0.0000046160926,0.000038833667,0.000012358937,0.99407935,0.00091196474,0.00430028,0.00056556694,0.000004834875],"about_ca_topic_score_codex":0.0013273453,"about_ca_topic_score_gemma":0.0021036903,"teacher_disagreement_score":0.0013273453,"about_ca_system_score_codex":0.00069033745,"about_ca_system_score_gemma":0.00064958923,"threshold_uncertainty_score":0.0050088167},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7001242,0.0012102078,0.28967184,0.0004493257,0.000030335137,0.00003502375,0.00026961404,0.00028944697,0.007919986],"genre_scores_gemma":[0.9970456,0.00022427167,0.0022253648,0.000018848368,0.000011104525,0.000013882655,0.000032609514,0.00000863198,0.00041980582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886,0.0004577466,0.000055603086,0.00015134188,0.0002784469,0.00019693332],"domain_scores_gemma":[0.9908098,0.007212546,0.00083706225,0.00038846166,0.0006036218,0.0001484063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019949547,0.000682405,0.00080112496,0.0005796794,0.0004934549,0.0010724881,0.0009730486,0.00079301617,0.000816099],"category_scores_gemma":[0.010234189,0.0004052733,0.00031487626,0.00073730137,0.0016942936,0.0014347209,0.0012156091,0.0005148896,0.00015273484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022121333,0.000033841312,0.0039064987,0.00009940948,0.000050220504,0.0006957867,0.00029083487,0.9473453,0.0032524846,0.03639079,0.00053543557,0.0071782125],"study_design_scores_gemma":[0.000016780205,0.000055524415,0.0011441278,0.000010156087,0.000025392628,0.00020712342,0.00010468993,0.98412967,0.00097023894,0.013109125,0.00021119688,0.000015959036],"about_ca_topic_score_codex":0.0030423196,"about_ca_topic_score_gemma":0.0016666275,"teacher_disagreement_score":0.0030423196,"about_ca_system_score_codex":0.001142153,"about_ca_system_score_gemma":0.00053564244,"threshold_uncertainty_score":0.010550439},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47526032,0.00093935453,0.5070119,0.00039067387,0.000039289476,0.00013119643,0.00008874097,0.00016949122,0.015968988],"genre_scores_gemma":[0.9642517,0.000148007,0.03465944,0.000031478987,0.000012590917,0.000029858014,0.000012145285,0.000003427016,0.00085124566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993856,0.00021414692,0.000020004909,0.00005127067,0.00024953953,0.000079372156],"domain_scores_gemma":[0.9987526,0.0007740969,0.00020446042,0.000113179514,0.0001245597,0.00003112766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096996495,0.0006024239,0.0005251259,0.0004147253,0.00054192013,0.000562165,0.000610008,0.0008356423,0.0005850284],"category_scores_gemma":[0.0017484316,0.00018081798,0.00031805746,0.0005410673,0.0006360718,0.0007244042,0.0007890373,0.00036017262,0.00012652222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003131618,0.00011694081,0.002575769,0.00017747028,0.000090242735,0.0006908578,0.0003893398,0.8300956,0.03847711,0.08854609,0.0006065332,0.0379209],"study_design_scores_gemma":[0.000030164303,0.00021121625,0.00036385187,0.000008956932,0.000023554843,0.00026106986,0.000035082357,0.9821337,0.008116697,0.008181477,0.0006136113,0.000020558069],"about_ca_topic_score_codex":0.0015951473,"about_ca_topic_score_gemma":0.0020707666,"teacher_disagreement_score":0.0015951473,"about_ca_system_score_codex":0.0005430477,"about_ca_system_score_gemma":0.00048589817,"threshold_uncertainty_score":0.005129695},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013521298,0.001640757,0.97153306,0.0003628472,0.00003875988,0.000046648453,0.00012438864,0.00013790159,0.012594351],"genre_scores_gemma":[0.8209357,0.0067096935,0.16264078,0.0003375949,0.00030913018,0.0008207794,0.00030336072,0.0002703032,0.007672579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769825,0.0013214094,0.0000760547,0.00020148481,0.00049810554,0.00020470301],"domain_scores_gemma":[0.99474055,0.0039624893,0.0003614103,0.00023673358,0.0006013544,0.0000975251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032365369,0.0019208658,0.001396544,0.00085400906,0.0004815712,0.0020539165,0.001141936,0.0012689118,0.0028945229],"category_scores_gemma":[0.010160565,0.0005513195,0.00082463375,0.0014190172,0.0014335635,0.002340108,0.0018106065,0.0015448123,0.0013309624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023754637,0.00008009315,0.00030160468,0.0004604232,0.00011807686,0.0002809204,0.00038240963,0.6711349,0.014573275,0.2827274,0.0031384185,0.026565028],"study_design_scores_gemma":[0.000030002591,0.00010100809,0.00020623597,0.00006850563,0.00003546864,0.00016761463,0.000073137606,0.89486265,0.0036510837,0.09855868,0.0022134588,0.000032151853],"about_ca_topic_score_codex":0.0007183446,"about_ca_topic_score_gemma":0.00050148397,"teacher_disagreement_score":0.0032365369,"about_ca_system_score_codex":0.0013517278,"about_ca_system_score_gemma":0.0007761443,"threshold_uncertainty_score":0.017116606},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017062012,0.00024209789,0.98059535,0.00009649892,0.000017366401,0.000017431646,0.000018395025,0.00005557381,0.0018953471],"genre_scores_gemma":[0.7940485,0.0007125441,0.20150201,0.0000698438,0.000047012705,0.0001368271,0.000040165873,0.000023740462,0.0034192328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996424,0.00018886839,0.000011788052,0.00005070667,0.00007503743,0.000031228006],"domain_scores_gemma":[0.9992781,0.00051590445,0.00007223818,0.000030304678,0.00008182747,0.000021682163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006954912,0.0008535644,0.0005913363,0.00028624266,0.0002690089,0.0005788656,0.00057870336,0.0007859033,0.0013460527],"category_scores_gemma":[0.0018312539,0.00027755846,0.00023731013,0.0006204826,0.00064258935,0.0008845444,0.0004972175,0.00044790085,0.00033901373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004959374,0.000024501585,0.00017849462,0.00003725379,0.000011111956,0.000071978044,0.000039771818,0.962554,0.0036388552,0.0145923775,0.00027862724,0.018523376],"study_design_scores_gemma":[0.000010751649,0.00002554821,0.00003728209,0.000002104883,0.0000030529197,0.000015367588,0.000007276213,0.9950819,0.00043351384,0.004190843,0.00018828307,0.0000041192707],"about_ca_topic_score_codex":0.001074684,"about_ca_topic_score_gemma":0.0013171616,"teacher_disagreement_score":0.0013460527,"about_ca_system_score_codex":0.0005502501,"about_ca_system_score_gemma":0.00034154046,"threshold_uncertainty_score":0.0045030117},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7591412,0.0007180987,0.11065614,0.0036451125,0.00057368836,0.000109276174,0.0006433926,0.00032873507,0.124184415],"genre_scores_gemma":[0.9599754,0.00041416523,0.016620282,0.00047777127,0.0004429653,0.00008958489,0.0006122265,0.00013350173,0.021234034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985977,0.00040989765,0.000086675376,0.0002029454,0.0003753184,0.00032747278],"domain_scores_gemma":[0.9979413,0.00078085443,0.00033000138,0.00031840938,0.00025903241,0.00037041286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011882422,0.0007768062,0.000772766,0.0017333267,0.0014025124,0.004504068,0.0012600013,0.0016740112,0.011794849],"category_scores_gemma":[0.0034283234,0.0005102937,0.0007469022,0.0013818226,0.0022895455,0.005313052,0.0026842938,0.0033965558,0.0011318146],"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.000050058537,0.000037387494,0.00013391147,0.000017556687,0.000003445278,0.00005540457,0.0002021893,0.00068564503,0.000559025,0.9928631,0.000971568,0.0044206935],"study_design_scores_gemma":[0.000025786874,0.000021475335,0.00010570076,0.000009736436,0.000004845455,0.00008569482,0.00011827024,0.004437823,0.0002996436,0.99318486,0.0016975853,0.000008689788],"about_ca_topic_score_codex":0.00032810908,"about_ca_topic_score_gemma":0.00043851745,"teacher_disagreement_score":0.011794849,"about_ca_system_score_codex":0.0014306356,"about_ca_system_score_gemma":0.0005227592,"threshold_uncertainty_score":0.03945768},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05040233,0.00121892,0.944832,0.00022012898,0.000023124132,0.000030950534,0.000032684602,0.00016677297,0.0030730974],"genre_scores_gemma":[0.9402075,0.0010891217,0.056339927,0.00004262929,0.000035273748,0.00008955792,0.00003171362,0.00003273118,0.0021315408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902976,0.0005584897,0.00004249485,0.000089372414,0.00018459483,0.00009528653],"domain_scores_gemma":[0.99905056,0.00069409405,0.00009205579,0.00006184119,0.00007774916,0.00002366198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013297196,0.0007541141,0.0008602164,0.00045206843,0.0003868918,0.0011053502,0.0006548445,0.00092694146,0.0005506347],"category_scores_gemma":[0.0031337808,0.00040668243,0.00032585402,0.0007791073,0.0007145413,0.0015112364,0.0008358947,0.0004979332,0.00015789359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001025911,0.00003118991,0.00019278255,0.00007184739,0.000022546721,0.000111699395,0.000076158125,0.9335097,0.0041312785,0.022258198,0.00049804815,0.03899397],"study_design_scores_gemma":[0.000011854202,0.000035539946,0.00007341517,0.000004878228,0.000010078767,0.00004404698,0.000022785662,0.9850766,0.0016137812,0.012633346,0.00046410793,0.000009548776],"about_ca_topic_score_codex":0.0017223048,"about_ca_topic_score_gemma":0.0014531029,"teacher_disagreement_score":0.0017223048,"about_ca_system_score_codex":0.0006300288,"about_ca_system_score_gemma":0.00046842473,"threshold_uncertainty_score":0.007032335},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04257069,0.00637081,0.89114094,0.0020038825,0.0003096162,0.00021723859,0.0007710647,0.00043305973,0.056182846],"genre_scores_gemma":[0.79410917,0.013959635,0.17644826,0.001053724,0.0008584756,0.00053072063,0.000874647,0.0004112474,0.01175398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99475104,0.0022821424,0.0002493316,0.0006410897,0.0013719008,0.0007044257],"domain_scores_gemma":[0.9740442,0.021627983,0.0011479085,0.0013603634,0.001477207,0.0003422978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005673829,0.003487313,0.0025362992,0.0023017665,0.0015072734,0.0027536454,0.0023063999,0.0025790206,0.005059607],"category_scores_gemma":[0.029873367,0.0011724071,0.0013580996,0.0026859639,0.0052770646,0.0052300594,0.0034725696,0.004995096,0.0015824105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006577059,0.00009104703,0.000673346,0.0004632449,0.000089379224,0.0003812677,0.00062177924,0.21025197,0.006826858,0.7445188,0.0054968065,0.02992776],"study_design_scores_gemma":[0.00010747875,0.00027468806,0.00037303002,0.0002503088,0.00006954156,0.00040796841,0.00011845889,0.58690035,0.005074013,0.40078908,0.0055429204,0.000092136564],"about_ca_topic_score_codex":0.0029972172,"about_ca_topic_score_gemma":0.002247025,"teacher_disagreement_score":0.005673829,"about_ca_system_score_codex":0.0032197698,"about_ca_system_score_gemma":0.002794843,"threshold_uncertainty_score":0.030006409},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025350096,0.0012470123,0.95555246,0.0016101442,0.00023130553,0.000102986734,0.00037941863,0.0002765963,0.015249948],"genre_scores_gemma":[0.78754395,0.0048377365,0.18499507,0.0007907736,0.00046611213,0.00073704694,0.0005945994,0.00015105844,0.019883653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990827,0.0003171434,0.00004027399,0.00014627192,0.00027593368,0.00013765856],"domain_scores_gemma":[0.9977048,0.0013479048,0.0002874473,0.00019902027,0.00037523248,0.0000855654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014611008,0.0007702271,0.0006116256,0.0009526809,0.00087882247,0.0019068406,0.0014713402,0.0016239779,0.0033173126],"category_scores_gemma":[0.0054852334,0.00037772325,0.0007451057,0.0014808556,0.0018484639,0.004497338,0.0009546248,0.0013215439,0.00044948337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029300181,0.000017820606,0.0002633847,0.000049516846,0.000006886331,0.000052024716,0.00008945041,0.17156072,0.00055979175,0.820452,0.0017820956,0.0051370235],"study_design_scores_gemma":[0.000015859878,0.000019045196,0.00007842405,0.000016271155,0.000007895381,0.000032764106,0.000020379095,0.7081126,0.0002444686,0.28779492,0.003644764,0.000012587482],"about_ca_topic_score_codex":0.006815438,"about_ca_topic_score_gemma":0.0025443097,"teacher_disagreement_score":0.006815438,"about_ca_system_score_codex":0.0026147123,"about_ca_system_score_gemma":0.0016610933,"threshold_uncertainty_score":0.018971086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018055892,0.00047251588,0.979838,0.00012889666,0.000017643044,0.00005845073,0.00003387343,0.000079866084,0.0013147697],"genre_scores_gemma":[0.838891,0.0010237644,0.15850818,0.00010582449,0.000049626477,0.00017890894,0.00007464879,0.000030023491,0.001138021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825877,0.000747407,0.000082816485,0.00024154046,0.00050825224,0.00016121981],"domain_scores_gemma":[0.99379,0.0042030555,0.0008126418,0.00035754926,0.0007235807,0.000113102564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026914862,0.0009981275,0.0009109366,0.0006699667,0.00043807397,0.0010865233,0.001465611,0.0009511563,0.0012008373],"category_scores_gemma":[0.012754467,0.00056675606,0.00040355424,0.00071952544,0.0010721878,0.0013946076,0.0012484274,0.00072060246,0.00026216282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022781649,0.00006844024,0.001183809,0.00030455543,0.00007918314,0.00020346224,0.000251239,0.8440651,0.01458755,0.06705261,0.0008362374,0.07113996],"study_design_scores_gemma":[0.000011800116,0.00010130151,0.00014515448,0.000016795466,0.000018807052,0.000085610045,0.000020374875,0.99040705,0.0022765521,0.006366238,0.0005388514,0.000011550459],"about_ca_topic_score_codex":0.0011923409,"about_ca_topic_score_gemma":0.0012141914,"teacher_disagreement_score":0.0026914862,"about_ca_system_score_codex":0.0013444563,"about_ca_system_score_gemma":0.0013343813,"threshold_uncertainty_score":0.014234126},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06364516,0.00033795278,0.9318091,0.00027722857,0.000030758554,0.000043956978,0.00007374865,0.00016502687,0.0036169596],"genre_scores_gemma":[0.8865505,0.00045418672,0.1099142,0.00007447327,0.000057177574,0.00012342997,0.00010495305,0.000089568086,0.0026314394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992854,0.0003717039,0.000019927655,0.00007206991,0.00015024413,0.000100786245],"domain_scores_gemma":[0.99919707,0.00053747225,0.00010969636,0.000054875047,0.00006950855,0.000031283264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012321707,0.0008387356,0.000683265,0.00042157632,0.00031458517,0.00068914506,0.00072359346,0.0005126802,0.001064847],"category_scores_gemma":[0.002215872,0.00052233634,0.00044667692,0.0008266179,0.00064803095,0.0009915257,0.00067144545,0.00069042965,0.00015090662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039709037,0.000029416977,0.00010500972,0.000030627347,0.000013597311,0.000023732344,0.000021483182,0.98072606,0.002636081,0.0075900136,0.00032736256,0.008456853],"study_design_scores_gemma":[0.000007237907,0.000021058057,0.000044974393,0.0000015736531,0.0000042532497,0.0000046323657,0.0000065721697,0.9959621,0.00059121277,0.0032002644,0.00015379737,0.0000023855748],"about_ca_topic_score_codex":0.0021405169,"about_ca_topic_score_gemma":0.0026044894,"teacher_disagreement_score":0.0021405169,"about_ca_system_score_codex":0.0012558588,"about_ca_system_score_gemma":0.0012903694,"threshold_uncertainty_score":0.009111881},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24344823,0.0009946134,0.74681336,0.00015654524,0.000037868027,0.00004395726,0.000051465944,0.0002742235,0.008179759],"genre_scores_gemma":[0.9807128,0.00023624998,0.017737204,0.000022333923,0.00001949146,0.00002436033,0.000019578218,0.0000045135366,0.001223445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926764,0.0003035647,0.000027037595,0.00011044902,0.00016064798,0.00013066395],"domain_scores_gemma":[0.9991811,0.00034487722,0.000098120516,0.00017285286,0.0001657197,0.000037338123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005769969,0.0006577251,0.0006539056,0.00027599628,0.00049251836,0.0010014614,0.00087880786,0.0009078801,0.00040213793],"category_scores_gemma":[0.0016366076,0.00026558305,0.0003757227,0.00079158996,0.0005965929,0.0007503101,0.0010058369,0.00038901283,0.00020798102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081560014,0.000034655135,0.0016461818,0.000040646693,0.000053610005,0.0005550276,0.00014180341,0.95793754,0.005293455,0.016138384,0.00033330778,0.017743904],"study_design_scores_gemma":[0.00000648837,0.00003728412,0.00018772851,0.0000028434097,0.0000204697,0.00008084103,0.000044929464,0.99549294,0.0012637642,0.0022661425,0.000588884,0.000007737862],"about_ca_topic_score_codex":0.0059199915,"about_ca_topic_score_gemma":0.0053064963,"teacher_disagreement_score":0.0059199915,"about_ca_system_score_codex":0.0008247426,"about_ca_system_score_gemma":0.00053951796,"threshold_uncertainty_score":0.011771083},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07213096,0.0012652845,0.91188025,0.00040137823,0.000038633825,0.000033752018,0.00014766844,0.00035349908,0.013748713],"genre_scores_gemma":[0.9540682,0.0013946854,0.040375415,0.000101140526,0.00008391307,0.00010203338,0.00020532774,0.0001030679,0.0035662479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883133,0.00045230062,0.000039454517,0.000087980756,0.0004593475,0.00012961349],"domain_scores_gemma":[0.98826617,0.00882055,0.0006789102,0.00055000116,0.0015725822,0.00011182576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020433918,0.0010799159,0.00072423543,0.0010559759,0.00044511043,0.001187651,0.00096534,0.00092046306,0.0017711789],"category_scores_gemma":[0.014654432,0.00045610324,0.0005310273,0.00092519494,0.0016376084,0.0020087154,0.0011885376,0.0009711994,0.0004991586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011817869,0.0000340402,0.0012334079,0.000120558994,0.00003927119,0.0002802094,0.00015518008,0.86227703,0.0035661953,0.11575314,0.0009915082,0.015431235],"study_design_scores_gemma":[0.0000043929995,0.000021922348,0.00020897046,0.000012991361,0.000007958298,0.00012532268,0.000022753193,0.9815626,0.00079142646,0.017007124,0.00022669364,0.000007850301],"about_ca_topic_score_codex":0.0015264977,"about_ca_topic_score_gemma":0.0011236934,"teacher_disagreement_score":0.0020433918,"about_ca_system_score_codex":0.0016885519,"about_ca_system_score_gemma":0.00095162034,"threshold_uncertainty_score":0.012251377},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086766355,0.0031150123,0.8656986,0.00086390995,0.000058246973,0.00009919196,0.00027950603,0.0005230054,0.042596187],"genre_scores_gemma":[0.94843537,0.0026552253,0.044901643,0.0003750533,0.000118308744,0.00024038732,0.00016815352,0.00007934749,0.0030265744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982293,0.00069182017,0.00006234546,0.00019768519,0.00041933733,0.00039942455],"domain_scores_gemma":[0.98891383,0.007980311,0.0010369336,0.00055214483,0.0012456323,0.00027113434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029343702,0.0015606364,0.0012699177,0.001272622,0.0009656961,0.0021701325,0.0015471375,0.001050637,0.002120976],"category_scores_gemma":[0.01263855,0.0005384037,0.0009086338,0.0014469492,0.003677721,0.002851909,0.0028305466,0.0018883961,0.00083070976],"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.0003185487,0.00007306078,0.00061274343,0.00034258788,0.00010359065,0.0007182659,0.00043830802,0.37653688,0.008999594,0.5959899,0.0025338603,0.013332585],"study_design_scores_gemma":[0.000048901926,0.00011053322,0.00031712258,0.00008368324,0.00005433286,0.0005001944,0.00010670004,0.8118985,0.0041729207,0.18066305,0.0019780677,0.00006596005],"about_ca_topic_score_codex":0.0025907229,"about_ca_topic_score_gemma":0.0010606176,"teacher_disagreement_score":0.0029343702,"about_ca_system_score_codex":0.0021298768,"about_ca_system_score_gemma":0.0018091687,"threshold_uncertainty_score":0.015518606},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14175172,0.0010998253,0.85093844,0.0002278002,0.00004627561,0.000068530695,0.00007984286,0.0002442192,0.0055433298],"genre_scores_gemma":[0.95295125,0.00030643638,0.04441374,0.000042577372,0.000028771732,0.000041313673,0.000030388279,0.000009753036,0.0021757535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993229,0.00027624358,0.000018838491,0.000132599,0.00014948056,0.000100012345],"domain_scores_gemma":[0.9991584,0.00048484333,0.0001396328,0.00006443254,0.00012795793,0.000024852661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069348677,0.00091087795,0.0008713412,0.00025116475,0.00023804957,0.0006638523,0.0006330699,0.00078538666,0.00082717696],"category_scores_gemma":[0.0014784054,0.00029202137,0.00043754914,0.00051073893,0.00066943467,0.0009110833,0.0004508957,0.00038689957,0.0002786498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014069269,0.000031317042,0.0004985445,0.00010281103,0.00006324605,0.000297455,0.000077982055,0.961337,0.016328735,0.008357661,0.00029214963,0.012472364],"study_design_scores_gemma":[0.000026023647,0.00018839174,0.00024569183,0.0000058564015,0.000033653603,0.00012046933,0.000032542466,0.99118173,0.0040849214,0.0036261396,0.00043764978,0.000016967113],"about_ca_topic_score_codex":0.0016860362,"about_ca_topic_score_gemma":0.0015782876,"teacher_disagreement_score":0.0016860362,"about_ca_system_score_codex":0.00075267075,"about_ca_system_score_gemma":0.00045304035,"threshold_uncertainty_score":0.005461037},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06903742,0.0014689771,0.9231478,0.0003119292,0.000048256108,0.000072032206,0.00004039523,0.00018963359,0.0056835655],"genre_scores_gemma":[0.88818544,0.00088797143,0.1085019,0.00010515622,0.000048541806,0.000089532805,0.000038793612,0.000010790303,0.0021319445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934334,0.00031284758,0.000029100966,0.00007060237,0.00019779391,0.0000464011],"domain_scores_gemma":[0.99936634,0.00031272948,0.000094869276,0.00010721818,0.00009843398,0.000020513222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090806343,0.0005410856,0.00052972254,0.00041889332,0.00048449216,0.00040019368,0.00089068536,0.0006102252,0.00070334977],"category_scores_gemma":[0.0012360434,0.00024892666,0.00040992664,0.00077308575,0.0008979077,0.0010171297,0.0007777346,0.00043941505,0.00020058182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055232854,0.00018064781,0.001506507,0.00047419724,0.00017942167,0.0010736331,0.0008528199,0.28676358,0.20629442,0.23060098,0.0026475652,0.268874],"study_design_scores_gemma":[0.00004255964,0.0005145846,0.0004567183,0.0000322699,0.000079754594,0.00081786234,0.0000524038,0.9440236,0.02510034,0.024831947,0.0039918963,0.000056116183],"about_ca_topic_score_codex":0.00051303755,"about_ca_topic_score_gemma":0.00092200574,"teacher_disagreement_score":0.00090806343,"about_ca_system_score_codex":0.00041446643,"about_ca_system_score_gemma":0.0003980402,"threshold_uncertainty_score":0.004802346},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4596442,0.00047714953,0.5314987,0.0004950893,0.00005783349,0.00005958113,0.000093353876,0.00018137223,0.0074929087],"genre_scores_gemma":[0.97987086,0.00009683199,0.018322175,0.000023948589,0.00001845093,0.000014581794,0.000016371878,0.0000048374413,0.0016319976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972564,0.000088505076,0.00001618993,0.000051074032,0.000061534935,0.000057113913],"domain_scores_gemma":[0.99959344,0.00020745877,0.00004822887,0.000049062797,0.0000789921,0.000022843447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042927865,0.00032068937,0.000490983,0.00018600696,0.0005200385,0.00060237246,0.00046486,0.00056133186,0.0006485556],"category_scores_gemma":[0.001083855,0.00019067277,0.00015398997,0.00033265626,0.0004303866,0.0004305735,0.00040773556,0.00027340636,0.0001982239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010853403,0.00029584678,0.005080149,0.00017971717,0.00012719014,0.0016068951,0.0007904453,0.5837135,0.20677488,0.040758807,0.0021800504,0.15740727],"study_design_scores_gemma":[0.000025856298,0.00010448309,0.00035433692,0.0000038179346,0.00002770843,0.00017841987,0.00005196644,0.98698354,0.008523345,0.0032250115,0.00050959736,0.0000117848],"about_ca_topic_score_codex":0.002134243,"about_ca_topic_score_gemma":0.003878409,"teacher_disagreement_score":0.002134243,"about_ca_system_score_codex":0.000354471,"about_ca_system_score_gemma":0.0006301738,"threshold_uncertainty_score":0.004243672},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6805037,0.0040199137,0.30025867,0.00085688423,0.00010309977,0.00008814454,0.0005541598,0.00062320183,0.012992235],"genre_scores_gemma":[0.99645185,0.0003301981,0.0026972853,0.00003552192,0.000017890781,0.000028451404,0.00005391307,0.00001600341,0.00036885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820125,0.0007714063,0.00007108435,0.00020105475,0.0002787844,0.00047646672],"domain_scores_gemma":[0.9771016,0.01888225,0.0013801525,0.0007396504,0.0015415514,0.00035464825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037318354,0.0014529709,0.0015082698,0.0012161805,0.0008488864,0.001669359,0.0013948247,0.001154495,0.0009753793],"category_scores_gemma":[0.014206343,0.00057786476,0.0005314788,0.0017132838,0.0016437506,0.001990165,0.0016366653,0.00062918686,0.00018282433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030707277,0.000037065893,0.00077260396,0.00004815558,0.000050896055,0.0001186371,0.00004547849,0.98940676,0.0013804281,0.0030649642,0.000274619,0.0044933925],"study_design_scores_gemma":[0.000016584683,0.00015166173,0.00040976462,0.000008296546,0.00003304407,0.00009103709,0.000049016453,0.99477863,0.0016111309,0.002718576,0.000110806344,0.000021483413],"about_ca_topic_score_codex":0.007817608,"about_ca_topic_score_gemma":0.00374181,"teacher_disagreement_score":0.007817608,"about_ca_system_score_codex":0.00245256,"about_ca_system_score_gemma":0.0017592718,"threshold_uncertainty_score":0.019736052},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042212695,0.003368641,0.9290931,0.00047592266,0.000118440425,0.00005107529,0.00023755468,0.00021216403,0.024230305],"genre_scores_gemma":[0.9162037,0.0043823384,0.07139869,0.00023405494,0.00022888416,0.00022044788,0.00028567004,0.00015275483,0.0068934723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908626,0.0002445739,0.000041237385,0.000112501046,0.00036802707,0.0001474295],"domain_scores_gemma":[0.99685365,0.0021610146,0.00016611365,0.00024496543,0.0005227633,0.00005145239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016324929,0.0012202495,0.001074596,0.0014549535,0.0004712916,0.0016780946,0.0012904635,0.0010747045,0.0033007404],"category_scores_gemma":[0.008452002,0.00047048077,0.00055556674,0.0013736436,0.0023207522,0.0027659342,0.0013349265,0.0011169363,0.000796843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041188516,0.000032404645,0.0002370889,0.00020727377,0.000022627353,0.0002422906,0.00018547414,0.7547771,0.004764095,0.21754065,0.0015700073,0.020379912],"study_design_scores_gemma":[0.00000529713,0.000015838883,0.00014103275,0.00006700362,0.000007650524,0.00017078021,0.000038073198,0.9415842,0.0012002803,0.05566251,0.0010834414,0.00002383946],"about_ca_topic_score_codex":0.0025424385,"about_ca_topic_score_gemma":0.0016422247,"teacher_disagreement_score":0.0033007404,"about_ca_system_score_codex":0.0018840231,"about_ca_system_score_gemma":0.0012981719,"threshold_uncertainty_score":0.01366967},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021815334,0.00041267477,0.9756762,0.00024449668,0.000051575393,0.00005170082,0.00004482845,0.0000972039,0.0016061383],"genre_scores_gemma":[0.85425776,0.0005499023,0.1401166,0.00021234353,0.00011785168,0.00041327364,0.00013811306,0.00013945712,0.0040546944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878293,0.0005543433,0.000054325978,0.00016857119,0.0002793976,0.00016039144],"domain_scores_gemma":[0.9973761,0.0019189159,0.0002153849,0.00011562019,0.00031406176,0.000059889568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033460204,0.001673146,0.0016687394,0.00078403065,0.00053150486,0.0012144719,0.0018336034,0.0015655957,0.002144246],"category_scores_gemma":[0.007079089,0.0009005235,0.00073092745,0.001346926,0.001143436,0.0019618548,0.0019400886,0.0012443562,0.00027340112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054454184,0.000038838607,0.000112406604,0.000043795244,0.000034648692,0.000027942617,0.000038605813,0.98455447,0.0007775541,0.006507221,0.0004993441,0.0073106717],"study_design_scores_gemma":[0.000007371069,0.000022534121,0.00003167406,0.000002596833,0.000005953185,0.00000467714,0.0000050259755,0.99782,0.00016110731,0.0018804796,0.00005559013,0.0000030271497],"about_ca_topic_score_codex":0.0037566768,"about_ca_topic_score_gemma":0.0030074138,"teacher_disagreement_score":0.0037566768,"about_ca_system_score_codex":0.0011034291,"about_ca_system_score_gemma":0.0014220509,"threshold_uncertainty_score":0.017695665},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042504724,0.00076789234,0.95247173,0.000109678374,0.000037105463,0.00009764602,0.000021970176,0.0001696153,0.0038196926],"genre_scores_gemma":[0.91806704,0.0003830554,0.08016542,0.000059949773,0.000024271105,0.00017023626,0.000017695855,0.00001290645,0.0010994368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946946,0.00020104408,0.000030740743,0.000080637925,0.00013322209,0.00008494366],"domain_scores_gemma":[0.9989901,0.0005637894,0.00015411174,0.00011822616,0.00014213752,0.000031524014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012778383,0.0006031182,0.00058625697,0.0005082672,0.00054521713,0.000691849,0.0013519434,0.00059544283,0.00085308676],"category_scores_gemma":[0.003152476,0.0002516072,0.000336917,0.0007425779,0.00086098316,0.0007319305,0.0008349924,0.00047091642,0.0002132888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024512003,0.00018860167,0.00069577456,0.00020268868,0.00010289821,0.00028842615,0.00045177006,0.78338206,0.015512678,0.07742485,0.0015660423,0.1199391],"study_design_scores_gemma":[0.000026867217,0.00008353105,0.00013363508,0.0000111788895,0.000025716998,0.00009270414,0.000032049735,0.9859802,0.0017852506,0.011187128,0.0006259991,0.00001574254],"about_ca_topic_score_codex":0.0018290177,"about_ca_topic_score_gemma":0.0026942536,"teacher_disagreement_score":0.0018290177,"about_ca_system_score_codex":0.0007859801,"about_ca_system_score_gemma":0.0007158107,"threshold_uncertainty_score":0.006757915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12623563,0.0022258942,0.8464233,0.0005430994,0.000095229465,0.000093687464,0.00020445882,0.00061179674,0.023566963],"genre_scores_gemma":[0.97779936,0.0009911583,0.017098457,0.000131856,0.000060075807,0.000092543945,0.00008365474,0.00010120622,0.0036416696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978563,0.0005906762,0.000090476766,0.00020976078,0.00081438525,0.00043837266],"domain_scores_gemma":[0.9913283,0.0049092933,0.000818299,0.00087608094,0.0018187319,0.00024939247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023796412,0.0011604052,0.0012481338,0.0013487289,0.00072517985,0.0016992997,0.0018918954,0.0011689562,0.003202797],"category_scores_gemma":[0.0120520415,0.00047050742,0.00072335836,0.0009370936,0.0016204788,0.0027696735,0.0016668164,0.0018963189,0.00082215876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029998695,0.00008841639,0.0019406573,0.00027754126,0.000078296354,0.0007979293,0.00063935603,0.61709416,0.020839488,0.33938307,0.0020186082,0.0165426],"study_design_scores_gemma":[0.000008681532,0.000032257314,0.00038147834,0.000030122626,0.000018330054,0.00021875706,0.000044808596,0.96642613,0.0021274535,0.030273087,0.0004092989,0.000029592338],"about_ca_topic_score_codex":0.0029844218,"about_ca_topic_score_gemma":0.0011098275,"teacher_disagreement_score":0.003202797,"about_ca_system_score_codex":0.002650033,"about_ca_system_score_gemma":0.0014255777,"threshold_uncertainty_score":0.019227445},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03569803,0.00026455589,0.9590275,0.00015680771,0.000037688013,0.00008124929,0.00004263043,0.00017503295,0.0045165643],"genre_scores_gemma":[0.81208324,0.00041645937,0.18508759,0.000093372895,0.00004330366,0.00014190696,0.00005803884,0.000035652974,0.0020404663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988067,0.00058228185,0.000038041595,0.00011792241,0.00029370893,0.0001613063],"domain_scores_gemma":[0.9988954,0.0005775177,0.00011706323,0.00009578599,0.00024210398,0.000072124276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011373715,0.0008450131,0.0008033479,0.00053304364,0.0004586348,0.0010531568,0.0007335411,0.0008074293,0.001324186],"category_scores_gemma":[0.0028029762,0.00040885922,0.00036411436,0.0006057497,0.00090242986,0.001123412,0.0010301955,0.00062265113,0.0004415317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016290133,0.00007300407,0.00049079896,0.00007982984,0.000023873108,0.00014103408,0.00012315156,0.91491085,0.009781908,0.03767403,0.00063360116,0.03590506],"study_design_scores_gemma":[0.000014894311,0.00007002323,0.000054621956,0.000004872526,0.0000065863564,0.000059803348,0.000016665046,0.99030966,0.0028485765,0.0061436165,0.0004606825,0.000010030551],"about_ca_topic_score_codex":0.001295802,"about_ca_topic_score_gemma":0.0010857536,"teacher_disagreement_score":0.001324186,"about_ca_system_score_codex":0.00092781975,"about_ca_system_score_gemma":0.0011572195,"threshold_uncertainty_score":0.006731868},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024747783,0.0015107947,0.96413577,0.0005639815,0.000064791995,0.000037684757,0.00015029203,0.00034791682,0.008440921],"genre_scores_gemma":[0.92684674,0.0023779022,0.06523115,0.0001891831,0.00012892397,0.00010370156,0.00014151982,0.000075657685,0.004905221],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988852,0.00043892386,0.000055895634,0.00021060278,0.00024098383,0.0001683932],"domain_scores_gemma":[0.9978549,0.0013262962,0.00021346053,0.00024101643,0.00030339582,0.000060896844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013915264,0.0013169583,0.001502885,0.00051754765,0.00054273306,0.0015182969,0.0010761485,0.0014733487,0.0017057087],"category_scores_gemma":[0.0058571864,0.00087553693,0.0005273236,0.0011109489,0.0015091426,0.002267868,0.0010178403,0.0009924802,0.0007040124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019364635,0.000021551254,0.00068924,0.000142476,0.00005493269,0.00054100074,0.0001744534,0.90785426,0.0043680225,0.057087716,0.001482772,0.027389824],"study_design_scores_gemma":[0.0000540224,0.00012042693,0.0003303473,0.000044615706,0.000081915176,0.00047883816,0.00010734338,0.9598783,0.0038613188,0.032931212,0.0020680493,0.00004364395],"about_ca_topic_score_codex":0.0046760975,"about_ca_topic_score_gemma":0.0037161382,"teacher_disagreement_score":0.0046760975,"about_ca_system_score_codex":0.0012796122,"about_ca_system_score_gemma":0.0012358793,"threshold_uncertainty_score":0.009297788},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6670543,0.003158247,0.32342255,0.00064634177,0.000071697534,0.00007409617,0.00017656587,0.00034732977,0.0050487993],"genre_scores_gemma":[0.9939732,0.0004036395,0.0050456724,0.00002820853,0.000022748089,0.000018112127,0.000029505167,0.000013584206,0.00046532296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723357,0.001353056,0.00009303786,0.0003148694,0.0005852314,0.0004202439],"domain_scores_gemma":[0.97219276,0.022941943,0.0019759203,0.0007163418,0.0019465317,0.00022649253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004110435,0.0014398249,0.0011902903,0.00078341377,0.000554357,0.0011272851,0.0008831624,0.0012903055,0.00059345644],"category_scores_gemma":[0.0241134,0.00044031884,0.0003590668,0.00092385773,0.0015009185,0.0015290042,0.0011379517,0.0006894758,0.00013666718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038076934,0.00003748659,0.0019633076,0.000066228335,0.00005347685,0.000266863,0.000081617145,0.9827124,0.003986273,0.0037912955,0.00012857947,0.006531726],"study_design_scores_gemma":[0.000021576026,0.00025040915,0.0007567758,0.000011146826,0.000047168196,0.00020619028,0.000051069994,0.9935231,0.0036048912,0.001396383,0.00011118867,0.000020125977],"about_ca_topic_score_codex":0.0036103053,"about_ca_topic_score_gemma":0.0016414846,"teacher_disagreement_score":0.004110435,"about_ca_system_score_codex":0.001864603,"about_ca_system_score_gemma":0.001066548,"threshold_uncertainty_score":0.02173835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019349415,0.0011704685,0.97480154,0.00019327461,0.00004652928,0.00003208734,0.000012983735,0.00012630419,0.004267318],"genre_scores_gemma":[0.88458204,0.0019080648,0.108077995,0.00012186583,0.000092204864,0.00010945401,0.00004369495,0.00008697572,0.004977793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994869,0.00015025852,0.000028521523,0.00009373348,0.0002097972,0.000030759165],"domain_scores_gemma":[0.99916005,0.00052642985,0.00009345856,0.000080072336,0.00012238309,0.000017635295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064067286,0.00046527162,0.00050083286,0.0004097514,0.0002626414,0.000617185,0.00077823835,0.0004603002,0.0009369971],"category_scores_gemma":[0.002236616,0.00020262631,0.00024942675,0.00058452366,0.00078888657,0.0011126779,0.00058871676,0.00046258463,0.00018919553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017362865,0.00009582857,0.0008649629,0.00046867292,0.000058885213,0.0002947001,0.00039599545,0.48141548,0.08117474,0.18171674,0.0014126495,0.2519277],"study_design_scores_gemma":[0.00002107387,0.00021283004,0.00024737668,0.000023234841,0.00002540351,0.00023156125,0.00005346912,0.9549755,0.011136756,0.027099269,0.0059578875,0.000015589187],"about_ca_topic_score_codex":0.00051996583,"about_ca_topic_score_gemma":0.00063579815,"teacher_disagreement_score":0.0009369971,"about_ca_system_score_codex":0.00044670203,"about_ca_system_score_gemma":0.0002647331,"threshold_uncertainty_score":0.0033882856},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20029277,0.0006937741,0.7948507,0.00013802326,0.00003059446,0.000034928642,0.00006795826,0.00033470237,0.0035564937],"genre_scores_gemma":[0.95189524,0.00037226034,0.04675427,0.000027822853,0.000018333207,0.000020357458,0.00004613334,0.00002870465,0.000836868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990376,0.00031141524,0.00004848143,0.0000909424,0.00041904097,0.00009245465],"domain_scores_gemma":[0.997156,0.0018950396,0.00024824307,0.0003039682,0.00034267677,0.000054078304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013940611,0.00084582996,0.0008054951,0.00028620282,0.0003158498,0.00084114505,0.0008917239,0.0006064802,0.00053324184],"category_scores_gemma":[0.0055218916,0.0002406378,0.000248174,0.00035747688,0.00087287556,0.0011436369,0.00090672297,0.00056735217,0.00021051039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040927093,0.000061025727,0.0012349794,0.0001491821,0.00005103833,0.00041880715,0.00014752017,0.8746003,0.054644946,0.017944662,0.00032492066,0.050013382],"study_design_scores_gemma":[0.000014204368,0.00024484072,0.00039051494,0.000009638436,0.000026809153,0.00024568086,0.000045010103,0.95473975,0.038767055,0.005024205,0.0004747425,0.00001757121],"about_ca_topic_score_codex":0.00086412847,"about_ca_topic_score_gemma":0.0010420221,"teacher_disagreement_score":0.0013940611,"about_ca_system_score_codex":0.00069719343,"about_ca_system_score_gemma":0.0004309209,"threshold_uncertainty_score":0.0073726177},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086334035,0.0055739726,0.87050325,0.0007128257,0.00011356934,0.00010565775,0.0003369042,0.0004439699,0.035875816],"genre_scores_gemma":[0.94566077,0.0035766661,0.046473064,0.00014542206,0.000109914894,0.00021203226,0.00023310873,0.000100326826,0.003488667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980646,0.0006792697,0.00008835279,0.00014050555,0.0006519798,0.00037528333],"domain_scores_gemma":[0.9936492,0.004272488,0.00051742437,0.0003739325,0.0010957175,0.000091279624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002284935,0.0016663697,0.001126128,0.0011422156,0.0010656122,0.0019843848,0.0010170087,0.00092772837,0.0020598294],"category_scores_gemma":[0.010891447,0.00040321774,0.0007481884,0.0012440154,0.0011484601,0.0017193862,0.001609833,0.0012739816,0.0008152261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028883442,0.00008770534,0.001153718,0.000560549,0.000098483746,0.0008060682,0.0006087685,0.6640982,0.020169374,0.25814086,0.0034964252,0.050491072],"study_design_scores_gemma":[0.00001984197,0.00013051328,0.00043979438,0.0001295485,0.000057131983,0.00052952993,0.00024714263,0.9231579,0.008841257,0.06376561,0.0026256442,0.000056053144],"about_ca_topic_score_codex":0.0017898167,"about_ca_topic_score_gemma":0.0018764534,"teacher_disagreement_score":0.002284935,"about_ca_system_score_codex":0.0013654018,"about_ca_system_score_gemma":0.0010611219,"threshold_uncertainty_score":0.012084007},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05164258,0.00036134874,0.9365594,0.00019971584,0.000039496605,0.00006686205,0.00003781455,0.0008462003,0.010246454],"genre_scores_gemma":[0.80281943,0.00023237568,0.19253099,0.00010370227,0.00005585655,0.00007584763,0.000078574165,0.000034902405,0.0040682266],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997533,0.00006563372,0.000011852784,0.000060928913,0.000069511705,0.000038830294],"domain_scores_gemma":[0.9998099,0.000032843942,0.000027144915,0.00006458065,0.00004517985,0.000020369338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002387408,0.00032806903,0.0002495533,0.0002760326,0.00038960107,0.00067998964,0.0009932327,0.00046419777,0.0013567648],"category_scores_gemma":[0.00033461978,0.00015231526,0.0003012803,0.00023656263,0.00049919257,0.0009051537,0.0006469918,0.0004640418,0.00057335617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031901526,0.00013069164,0.002043376,0.00018991172,0.0001198032,0.00046491716,0.0005095708,0.2352139,0.2942658,0.17190509,0.0035346914,0.29130322],"study_design_scores_gemma":[0.000057373327,0.0010680498,0.0025563438,0.00003075583,0.00008882308,0.0014014049,0.00017123448,0.8510517,0.064055055,0.03425084,0.045197025,0.00007139381],"about_ca_topic_score_codex":0.0009835828,"about_ca_topic_score_gemma":0.0016917936,"teacher_disagreement_score":0.0013567648,"about_ca_system_score_codex":0.00063128374,"about_ca_system_score_gemma":0.00046285833,"threshold_uncertainty_score":0.004580319},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1100182,0.00052343536,0.8861931,0.00020328732,0.000012184461,0.000022139973,0.00002264863,0.00007745199,0.0029275452],"genre_scores_gemma":[0.96516657,0.000350955,0.033250015,0.000026545089,0.000016230199,0.00004045443,0.000014586821,0.00002144629,0.0011131379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997243,0.00013333144,0.000008994909,0.000040260744,0.00005549268,0.000037597103],"domain_scores_gemma":[0.9991417,0.0005944996,0.00010300243,0.000039838425,0.0000900893,0.000030914198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086502434,0.00047247304,0.00049851567,0.0002818811,0.00021841109,0.0004817436,0.0005557585,0.00043218362,0.000627189],"category_scores_gemma":[0.0020566834,0.00024516392,0.00026232185,0.0003996266,0.00058770174,0.00095136923,0.0005051808,0.00031229947,0.00013323274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008030037,0.00003602506,0.00032575396,0.000070198985,0.000021688886,0.00010724973,0.00014522046,0.94922554,0.013850137,0.018149875,0.00039735003,0.017590733],"study_design_scores_gemma":[0.000009184919,0.000057012596,0.00009297757,0.0000036413649,0.0000076221277,0.000049146052,0.000031098472,0.9892525,0.0021274113,0.008099137,0.00026434456,0.0000059247623],"about_ca_topic_score_codex":0.00041344712,"about_ca_topic_score_gemma":0.00043223143,"teacher_disagreement_score":0.00086502434,"about_ca_system_score_codex":0.0005193301,"about_ca_system_score_gemma":0.00047455155,"threshold_uncertainty_score":0.0045747757},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04152166,0.0013596127,0.94976807,0.00031238332,0.00007409847,0.000043890086,0.000019055995,0.00018338446,0.0067179026],"genre_scores_gemma":[0.7895518,0.0007143908,0.20664886,0.00015861313,0.000029484345,0.00013130116,0.000040064384,0.0000307882,0.0026947663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997516,0.000114288276,0.000010751549,0.000025617259,0.00008063847,0.000017111724],"domain_scores_gemma":[0.99963164,0.00023787943,0.00003810498,0.000026325191,0.000054563294,0.00001140139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041434276,0.0004034362,0.0004129479,0.00027016754,0.0002557498,0.0005526201,0.0006904494,0.000730376,0.00085241726],"category_scores_gemma":[0.0014249261,0.0001432835,0.00022588173,0.00030512165,0.00046751852,0.0004392507,0.000405259,0.0004893596,0.00014895562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006369873,0.00006205788,0.00044985174,0.0001518661,0.00004597307,0.000120955294,0.00008955556,0.8679593,0.008576962,0.039312907,0.0012782683,0.08188866],"study_design_scores_gemma":[0.000010287794,0.000020082583,0.00006093581,0.000005224979,0.000006121613,0.00001944111,0.000005160054,0.9942887,0.0004940485,0.004340718,0.00074570463,0.0000035975231],"about_ca_topic_score_codex":0.001497354,"about_ca_topic_score_gemma":0.0011779654,"teacher_disagreement_score":0.001497354,"about_ca_system_score_codex":0.000341476,"about_ca_system_score_gemma":0.00035099898,"threshold_uncertainty_score":0.002977252},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020621667,0.009208126,0.90805143,0.0015478021,0.00048179532,0.00008521815,0.0002928769,0.00039319595,0.059317905],"genre_scores_gemma":[0.8695505,0.017132571,0.078157395,0.0016152071,0.0031503874,0.00036679645,0.00058114965,0.0006991016,0.028746808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99554044,0.0012579786,0.00016249059,0.0004710937,0.0019404088,0.0006276857],"domain_scores_gemma":[0.9810141,0.014291293,0.0011296275,0.0011417664,0.0021196418,0.0003036955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056096083,0.0041761813,0.0021410761,0.003692209,0.0011151524,0.0039497344,0.0029365905,0.0017126128,0.006472042],"category_scores_gemma":[0.02553901,0.0009276531,0.0013792732,0.0039081075,0.003203907,0.0051143067,0.0029783484,0.0030451918,0.0014827069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029647158,0.00014178324,0.0008430274,0.0007806454,0.00016183032,0.00043636368,0.0005603447,0.32957736,0.011052237,0.59592736,0.010651542,0.04957106],"study_design_scores_gemma":[0.000019839114,0.00009411768,0.0005291086,0.00015133353,0.00010921111,0.0004084194,0.0000975901,0.7551543,0.0024119425,0.23541516,0.0055401693,0.00006884332],"about_ca_topic_score_codex":0.0021604225,"about_ca_topic_score_gemma":0.0015981459,"teacher_disagreement_score":0.006472042,"about_ca_system_score_codex":0.0029999171,"about_ca_system_score_gemma":0.0017376579,"threshold_uncertainty_score":0.029666781},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4736305,0.0030470334,0.4630956,0.016262712,0.0003712404,0.00018755738,0.001363625,0.0008207747,0.041220956],"genre_scores_gemma":[0.9775095,0.0007464444,0.015707562,0.0003890242,0.00037797686,0.00011844524,0.0002798685,0.00017598458,0.004695115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955924,0.0019441037,0.00017750465,0.0005666885,0.0009909195,0.00072832586],"domain_scores_gemma":[0.91864914,0.07003151,0.002897031,0.0052287513,0.0019261054,0.0012674714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004873024,0.00051779556,0.0012169523,0.0012356279,0.00088326936,0.0035895086,0.001921301,0.0017447842,0.005679753],"category_scores_gemma":[0.03663193,0.0005189001,0.0010392506,0.0014059365,0.002581313,0.008569326,0.0018455891,0.0027703743,0.00046589403],"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.0014566485,0.00014667862,0.0022546398,0.00035677408,0.00012834341,0.00012512952,0.00046750734,0.22957487,0.0050116507,0.71511173,0.007629392,0.037736658],"study_design_scores_gemma":[0.00012638068,0.00010335528,0.0009027998,0.000027351578,0.000060115803,0.000116078205,0.0000883742,0.3927218,0.0018645675,0.6026644,0.0012895635,0.000035108736],"about_ca_topic_score_codex":0.0016653594,"about_ca_topic_score_gemma":0.0013272573,"teacher_disagreement_score":0.005679753,"about_ca_system_score_codex":0.0031928108,"about_ca_system_score_gemma":0.0029489347,"threshold_uncertainty_score":0.02577132},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30685207,0.0031802203,0.6512505,0.0009460508,0.00009274867,0.0001929201,0.00043160672,0.0005034928,0.036550313],"genre_scores_gemma":[0.9873071,0.00073311,0.009717554,0.000041882777,0.000027167724,0.00005022364,0.00007218622,0.000015229092,0.0020355645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986755,0.0005438008,0.000045806923,0.000114369475,0.000377602,0.00024276433],"domain_scores_gemma":[0.99625266,0.0024683836,0.00031438877,0.00017511877,0.00072328624,0.00006622941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019536586,0.0012838348,0.0009778417,0.0007327473,0.00069820706,0.0013505188,0.000725752,0.001220547,0.0021825337],"category_scores_gemma":[0.005093865,0.00036456418,0.00050325185,0.0008935448,0.0011976063,0.0008026845,0.0009501558,0.0005674295,0.00045287627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027472267,0.000031842155,0.0008798355,0.00012535114,0.00006335377,0.00023490524,0.00018308785,0.9572625,0.007559927,0.021621533,0.00068597536,0.0110769905],"study_design_scores_gemma":[0.000011859665,0.00013525852,0.0002907581,0.00001273767,0.000035681802,0.00009768328,0.000040276183,0.9954953,0.0014067284,0.0022293567,0.00022768471,0.000016596996],"about_ca_topic_score_codex":0.007603681,"about_ca_topic_score_gemma":0.0068896967,"teacher_disagreement_score":0.007603681,"about_ca_system_score_codex":0.0021063024,"about_ca_system_score_gemma":0.0014372153,"threshold_uncertainty_score":0.0152823925},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014042839,0.0002489015,0.9792835,0.0001675731,0.00005684795,0.000022910983,0.000019501682,0.0001275595,0.00603042],"genre_scores_gemma":[0.70918626,0.0006481871,0.28718635,0.0002294719,0.00011072583,0.0000902173,0.000047590438,0.000044117045,0.002457141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999706,0.00010419502,0.00000891209,0.000032765696,0.000095507196,0.0000526235],"domain_scores_gemma":[0.99956435,0.00022557515,0.0000593817,0.000058571735,0.000069038986,0.000023137163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041342998,0.00045981977,0.000244456,0.00022675456,0.00024288155,0.00055664167,0.0005063436,0.0004607394,0.001120901],"category_scores_gemma":[0.001329957,0.00014891542,0.00024149953,0.00043724186,0.00064919004,0.0007756009,0.0008508644,0.00075202907,0.00037147503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121595775,0.000109907116,0.0008048553,0.00013379019,0.000031902237,0.00020114092,0.00017948629,0.5618778,0.05734313,0.25205687,0.002224902,0.12491457],"study_design_scores_gemma":[0.0000072608977,0.000081891325,0.000092016635,0.000011582262,0.0000056315807,0.00007167719,0.000015050368,0.9660742,0.0077066957,0.023038875,0.002886542,0.000008616825],"about_ca_topic_score_codex":0.0005184611,"about_ca_topic_score_gemma":0.0007352063,"teacher_disagreement_score":0.001120901,"about_ca_system_score_codex":0.00035511804,"about_ca_system_score_gemma":0.00041100642,"threshold_uncertainty_score":0.0037497878},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029588016,0.00016352361,0.99600875,0.000060530983,0.000008417864,0.000015799384,0.000025803458,0.00012917291,0.0006292549],"genre_scores_gemma":[0.29884535,0.0006172219,0.69694954,0.00014101715,0.000056997655,0.00020485712,0.00020547523,0.000048210666,0.0029313285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870026,0.0005548416,0.00005621466,0.00012899857,0.00049233227,0.0000673586],"domain_scores_gemma":[0.9982248,0.0012211796,0.00012897872,0.00012376254,0.0002746033,0.00002666901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001973949,0.0005016094,0.0009908132,0.00052938005,0.00038537523,0.0011102887,0.0008715114,0.0009250768,0.0012232711],"category_scores_gemma":[0.0067882473,0.00040979713,0.00033229718,0.00073300645,0.00066310645,0.0015842883,0.0011343441,0.0008490159,0.0005546366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015204874,0.000037019585,0.000716773,0.00015403247,0.000036235175,0.00012851741,0.00014501896,0.72908306,0.009862456,0.11559049,0.0020589456,0.14203541],"study_design_scores_gemma":[0.00001009912,0.000016824832,0.00006544639,0.000007693747,0.0000031256657,0.00004754701,0.0000069503103,0.9828792,0.0016829413,0.01439588,0.0008740273,0.000010272735],"about_ca_topic_score_codex":0.0008094951,"about_ca_topic_score_gemma":0.0011696657,"teacher_disagreement_score":0.001973949,"about_ca_system_score_codex":0.0010941369,"about_ca_system_score_gemma":0.0012022204,"threshold_uncertainty_score":0.010439336},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015090557,0.00064301444,0.98298407,0.00012715747,0.000023979448,0.000012300951,0.00001607057,0.00007904013,0.0010237945],"genre_scores_gemma":[0.80074966,0.0013423978,0.1946539,0.00021129436,0.00007679838,0.000100208206,0.00010788218,0.000030676532,0.0027271048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860436,0.00049044995,0.00006170932,0.00020969532,0.0005813746,0.00005245179],"domain_scores_gemma":[0.99774843,0.0013526222,0.00027391006,0.0001900456,0.00041328705,0.000021598447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012791802,0.00043666209,0.0006339871,0.00037145393,0.0002212018,0.00065217353,0.0007146996,0.0008343856,0.0006169786],"category_scores_gemma":[0.0062589403,0.000248697,0.00020967108,0.0005851461,0.0005974083,0.0010887256,0.00076971605,0.000566695,0.000275182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017650069,0.000053476917,0.0011163136,0.00040134476,0.00008089827,0.00044578195,0.00033905733,0.67077786,0.019693809,0.16199017,0.0012144682,0.14371027],"study_design_scores_gemma":[0.000011588071,0.000048551443,0.00015912058,0.000008638956,0.0000064146693,0.00011235898,0.000013290605,0.97922796,0.002038226,0.01777446,0.0005889004,0.0000105272775],"about_ca_topic_score_codex":0.0004391115,"about_ca_topic_score_gemma":0.00034617356,"teacher_disagreement_score":0.0012791802,"about_ca_system_score_codex":0.0005434051,"about_ca_system_score_gemma":0.00052459934,"threshold_uncertainty_score":0.006765008},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005951589,0.006775752,0.9753921,0.0011000239,0.00017003238,0.00008152192,0.000070569244,0.000064649255,0.010393703],"genre_scores_gemma":[0.7058367,0.03926427,0.24026108,0.0011453193,0.002611942,0.0008746006,0.00038120756,0.00044668396,0.009178183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977175,0.0012663883,0.0000973652,0.0002754234,0.0004808674,0.00016238115],"domain_scores_gemma":[0.99402124,0.004702732,0.00044694552,0.00020213328,0.00050343055,0.00012353956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004756118,0.0025533158,0.001768158,0.002227053,0.00061671995,0.0020916546,0.0011595422,0.0013889683,0.0015826464],"category_scores_gemma":[0.0106894905,0.0005696084,0.0011615311,0.0026492039,0.0037060184,0.004092718,0.0026324564,0.002627181,0.00027052403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005847653,0.000038617207,0.0002997319,0.00027982963,0.0001005681,0.000088615365,0.00008306317,0.69206387,0.0012649078,0.27473804,0.0030415847,0.02794267],"study_design_scores_gemma":[0.000020573829,0.00011372814,0.00021618891,0.000113759284,0.000031758576,0.00006397087,0.00003146834,0.7703516,0.0007496358,0.22313789,0.005135855,0.000033515604],"about_ca_topic_score_codex":0.0021265936,"about_ca_topic_score_gemma":0.0009578956,"teacher_disagreement_score":0.004756118,"about_ca_system_score_codex":0.0025429742,"about_ca_system_score_gemma":0.0013264655,"threshold_uncertainty_score":0.0251531},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007591072,0.001198523,0.98031485,0.00016373493,0.00007176857,0.000021715356,0.00007693265,0.00020364439,0.010357841],"genre_scores_gemma":[0.78347695,0.0069977427,0.19418924,0.00049180526,0.0004243578,0.00030663854,0.00027961863,0.00040723162,0.013426417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884146,0.0003931896,0.000051636922,0.000119695316,0.00042209125,0.00017186179],"domain_scores_gemma":[0.99547666,0.0029429093,0.00032321518,0.00056333776,0.0006143662,0.000079487494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022953541,0.0015502239,0.00072314957,0.0015178547,0.00040792197,0.0012061271,0.0012798657,0.0009057425,0.001995929],"category_scores_gemma":[0.01261587,0.00038581726,0.0008366183,0.0011572487,0.0018429557,0.0026389896,0.0012276267,0.0021342612,0.0010702916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004134476,0.000032896904,0.00072955503,0.00018251335,0.000037015776,0.00026571495,0.00025424236,0.45770985,0.0030515427,0.51496613,0.002052633,0.020676631],"study_design_scores_gemma":[0.0000025178254,0.000022120876,0.00023636004,0.000039561364,0.000009680277,0.00011308517,0.000029866329,0.9361038,0.0009889446,0.06083812,0.0016018144,0.00001408112],"about_ca_topic_score_codex":0.0024111161,"about_ca_topic_score_gemma":0.0011778498,"teacher_disagreement_score":0.0024111161,"about_ca_system_score_codex":0.001202882,"about_ca_system_score_gemma":0.0005548251,"threshold_uncertainty_score":0.012139142},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24835774,0.0047368556,0.7128891,0.00059128844,0.00011730193,0.00010830926,0.0006197651,0.00024352717,0.03233603],"genre_scores_gemma":[0.9819272,0.002127383,0.012538621,0.000071171504,0.0000797801,0.00012731412,0.0001378717,0.000048163525,0.0029425144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855036,0.0004998265,0.00005706891,0.00016346457,0.00036581917,0.00036354747],"domain_scores_gemma":[0.99224186,0.005655667,0.00061428105,0.00037319784,0.0008407192,0.0002742323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018435882,0.001149945,0.0007271459,0.0020697608,0.00068391935,0.002049328,0.0014589272,0.0008330569,0.002354225],"category_scores_gemma":[0.009665733,0.0006380766,0.00038589197,0.0014411405,0.0018383021,0.004026014,0.0014871315,0.00089337834,0.00038246324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115035786,0.00003652949,0.000499584,0.00016958016,0.000039644146,0.00024174206,0.0001702835,0.76443803,0.0038632893,0.21801083,0.0011413404,0.0112741105],"study_design_scores_gemma":[0.000011328423,0.00004127067,0.00026791246,0.00004601697,0.000021078535,0.00016629844,0.00006827596,0.90535194,0.0013957934,0.091050826,0.0015526536,0.000026610973],"about_ca_topic_score_codex":0.0015175944,"about_ca_topic_score_gemma":0.00079984876,"teacher_disagreement_score":0.002354225,"about_ca_system_score_codex":0.002280353,"about_ca_system_score_gemma":0.0010392081,"threshold_uncertainty_score":0.016545236},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040053553,0.0005470601,0.99429446,0.00010852485,0.00002521081,0.000020252472,0.000017224707,0.00015612696,0.0008257679],"genre_scores_gemma":[0.5283932,0.0016843405,0.46501327,0.0003022726,0.0001292218,0.00018979532,0.0001025166,0.000046433142,0.004139078],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986626,0.0004299843,0.000071770744,0.00019408157,0.0005443931,0.00009714768],"domain_scores_gemma":[0.99790287,0.0012020209,0.00023334764,0.00022385205,0.0004072489,0.000030653187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001531326,0.0008230382,0.0009653719,0.0008453694,0.00041885677,0.00089149916,0.0009968593,0.0010757738,0.0012759087],"category_scores_gemma":[0.0055179154,0.00045075684,0.00041882962,0.0007961789,0.00070529565,0.0015950348,0.001452719,0.0010661808,0.00053925754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000290399,0.00009269198,0.0008876,0.0004731912,0.00014919194,0.00035920108,0.0006535951,0.38783568,0.03262155,0.16063143,0.0035876837,0.41241768],"study_design_scores_gemma":[0.0000335219,0.00011040554,0.0001721,0.000031546162,0.000027653949,0.00027726108,0.000040704494,0.94877934,0.010801774,0.03412174,0.005563682,0.000040247505],"about_ca_topic_score_codex":0.0008642343,"about_ca_topic_score_gemma":0.0008169295,"teacher_disagreement_score":0.001531326,"about_ca_system_score_codex":0.0007511045,"about_ca_system_score_gemma":0.0010177415,"threshold_uncertainty_score":0.008098543},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027831964,0.1184837,0.8220032,0.00045519372,0.0004006564,0.000086935244,0.000060426995,0.00043202337,0.030245917],"genre_scores_gemma":[0.71102095,0.076275654,0.19192457,0.0006769184,0.0017208395,0.00016047232,0.00018092046,0.00012267694,0.017917056],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919397,0.00018488542,0.000048489015,0.00013631646,0.00037370683,0.00006269436],"domain_scores_gemma":[0.99825937,0.0010898781,0.00012867872,0.00012520974,0.0003568442,0.000039997845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007194613,0.0005758256,0.0006212297,0.0007192954,0.00028612942,0.0015245953,0.00071922137,0.0009061422,0.0026010678],"category_scores_gemma":[0.0021154096,0.0003305193,0.00044057876,0.0009360642,0.0008321857,0.0017498786,0.0009110698,0.0013529571,0.0006362085],"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.00045239576,0.00031724162,0.0010544363,0.0014128453,0.00011552468,0.00033195058,0.00037347878,0.057707697,0.046776526,0.07652198,0.0021491195,0.8127868],"study_design_scores_gemma":[0.00017709512,0.004483542,0.0035779555,0.00089084567,0.00025301505,0.003620444,0.00033881993,0.6253068,0.12579957,0.09310794,0.14211944,0.0003245566],"about_ca_topic_score_codex":0.0003110808,"about_ca_topic_score_gemma":0.0001467539,"teacher_disagreement_score":0.0026010678,"about_ca_system_score_codex":0.00043686986,"about_ca_system_score_gemma":0.0003196217,"threshold_uncertainty_score":0.008701384},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013128903,0.0007701892,0.9835571,0.00024683622,0.000060485716,0.000043857868,0.00003321197,0.00019384688,0.0019656764],"genre_scores_gemma":[0.69901687,0.0011601009,0.29444852,0.00041710414,0.00012459015,0.00019060628,0.00007350167,0.000021974613,0.0045467718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878293,0.0003970749,0.000046717993,0.00019141866,0.00046417137,0.0001177407],"domain_scores_gemma":[0.99889225,0.00058553286,0.00010895787,0.00018543305,0.00019233722,0.000035582878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013126958,0.00072012946,0.0008308827,0.00045529136,0.0006245533,0.0009306428,0.00095474854,0.0012273408,0.00064839737],"category_scores_gemma":[0.0027382907,0.00038935157,0.00032833847,0.00052667985,0.0009522216,0.0015232452,0.0014301485,0.0009923328,0.00033461754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005772925,0.00019803179,0.0020007086,0.0005893785,0.00024241736,0.0011880916,0.00091919693,0.35243097,0.07470944,0.30292332,0.0059083076,0.2583128],"study_design_scores_gemma":[0.000053024305,0.00018245967,0.00015992267,0.000027133792,0.000053853666,0.000465836,0.000041260453,0.94267875,0.017354717,0.03225353,0.006682674,0.000046794852],"about_ca_topic_score_codex":0.0010987353,"about_ca_topic_score_gemma":0.0021848662,"teacher_disagreement_score":0.0013126958,"about_ca_system_score_codex":0.0007956586,"about_ca_system_score_gemma":0.001021402,"threshold_uncertainty_score":0.006942332},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46732306,0.0039074677,0.50427413,0.0006573164,0.00010463538,0.00007659371,0.00016212025,0.0001490204,0.02334571],"genre_scores_gemma":[0.9900933,0.000667076,0.008470751,0.000041483192,0.000026469379,0.000016682792,0.000013953305,0.000006225206,0.0006641303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917114,0.00031667942,0.000026544463,0.00010024915,0.00023894825,0.00014646718],"domain_scores_gemma":[0.99813926,0.0012075618,0.00018840606,0.00016594098,0.00024382345,0.00005510082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011757654,0.0007183676,0.0006441278,0.0004960908,0.0005722288,0.0012313524,0.000692576,0.0006323779,0.0013106489],"category_scores_gemma":[0.002688434,0.00026417966,0.00028502184,0.0007218675,0.0013211828,0.0014643304,0.000838668,0.0005401372,0.00015144359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050326285,0.00006756147,0.0017851399,0.0003153549,0.00012497585,0.0006550165,0.0005403003,0.56955934,0.08046356,0.29545337,0.0010271125,0.049505055],"study_design_scores_gemma":[0.000024327714,0.00016550228,0.0004354753,0.000026464031,0.00003195397,0.00054374174,0.00009156944,0.9577599,0.011454655,0.028565066,0.0008541485,0.000047130154],"about_ca_topic_score_codex":0.001053892,"about_ca_topic_score_gemma":0.0009986126,"teacher_disagreement_score":0.0013106489,"about_ca_system_score_codex":0.0011722675,"about_ca_system_score_gemma":0.000568175,"threshold_uncertainty_score":0.008505464},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112456925,0.0015186442,0.88132405,0.00030317722,0.00014133716,0.00012662799,0.00007156064,0.0006493002,0.0034083363],"genre_scores_gemma":[0.9456337,0.0004173425,0.052821063,0.000063761334,0.000041051597,0.00006696509,0.000040589894,0.000008612896,0.00090686884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993625,0.00021341025,0.00004742823,0.00015410408,0.00014089316,0.000081624254],"domain_scores_gemma":[0.9992563,0.00028508322,0.00012346322,0.000120070246,0.00017334198,0.00004175797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005969017,0.0006719813,0.00047291102,0.00049081806,0.00069967046,0.00040632434,0.0011712996,0.00042668328,0.0007238952],"category_scores_gemma":[0.0015609158,0.0001905679,0.00031596635,0.00065484823,0.0005495289,0.0009605739,0.00077527174,0.00039156593,0.00021857693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011654202,0.0002406372,0.0025990144,0.00038693193,0.0001898431,0.0016970861,0.0009586504,0.29452842,0.23409888,0.06779245,0.0046428028,0.39169994],"study_design_scores_gemma":[0.00009509368,0.00065567286,0.000710887,0.00002497661,0.00013557194,0.0014251596,0.00007901675,0.93404657,0.049537323,0.008462385,0.0047499454,0.000077395],"about_ca_topic_score_codex":0.0013630664,"about_ca_topic_score_gemma":0.0017230592,"teacher_disagreement_score":0.0013630664,"about_ca_system_score_codex":0.00050559844,"about_ca_system_score_gemma":0.0005615866,"threshold_uncertainty_score":0.0036683679},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28317228,0.0017063112,0.7078008,0.00026502105,0.00007963741,0.000057151436,0.000071547365,0.00013049746,0.006716796],"genre_scores_gemma":[0.9755072,0.00034426758,0.022650324,0.000039691895,0.000015697167,0.000028490878,0.000022310918,0.000006693333,0.001385413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996773,0.00011842737,0.000011943323,0.00004242598,0.00009694147,0.000053046697],"domain_scores_gemma":[0.99904126,0.00063012965,0.00011206905,0.000070530026,0.00012041476,0.00002557312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058090256,0.0006016452,0.0004937022,0.00027921333,0.0003057422,0.0006395333,0.0008489103,0.0006462578,0.000651797],"category_scores_gemma":[0.0021708081,0.00020061567,0.0002340798,0.00028064623,0.0005712789,0.0010099693,0.0005836636,0.00031795315,0.00015258548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024064718,0.0000669142,0.001016929,0.00019473358,0.000058430713,0.00065781653,0.0003071425,0.8276131,0.04105657,0.10693278,0.00065917807,0.021195749],"study_design_scores_gemma":[0.00001948998,0.0001154888,0.0001672641,0.000010691827,0.000019899497,0.00023490188,0.000038126716,0.9842239,0.006827161,0.0075522987,0.0007759044,0.00001492732],"about_ca_topic_score_codex":0.0008609733,"about_ca_topic_score_gemma":0.0008672725,"teacher_disagreement_score":0.0008609733,"about_ca_system_score_codex":0.000568845,"about_ca_system_score_gemma":0.0004304231,"threshold_uncertainty_score":0.0041273236},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09817423,0.0005925802,0.8962868,0.0004948826,0.00004792885,0.00005833455,0.000059931463,0.0003171235,0.00396821],"genre_scores_gemma":[0.91474074,0.00037237347,0.08336786,0.00007633226,0.000034539946,0.0000897088,0.000053686177,0.00002841089,0.0012363935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992963,0.00030108605,0.000020059513,0.000070622824,0.00024635287,0.00006564296],"domain_scores_gemma":[0.9979171,0.0011310603,0.00029917687,0.00036449824,0.00023811706,0.000049943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001091292,0.00045356993,0.00043569185,0.0005257642,0.00054971833,0.00047845868,0.0006326187,0.0006024325,0.00067790196],"category_scores_gemma":[0.0041981735,0.00018048158,0.00032037433,0.000548457,0.000993705,0.0013118477,0.0012574826,0.000696751,0.00016810448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024052348,0.000073619936,0.0006172896,0.00013031295,0.000034956483,0.00012378857,0.00022730428,0.8193764,0.02899434,0.08758457,0.0013220917,0.061274722],"study_design_scores_gemma":[0.000029477354,0.00010981398,0.00018844802,0.000015480633,0.000010339672,0.00008831403,0.000039435206,0.96813524,0.007787601,0.022364488,0.0012135535,0.000017867005],"about_ca_topic_score_codex":0.00084169785,"about_ca_topic_score_gemma":0.0012649556,"teacher_disagreement_score":0.001091292,"about_ca_system_score_codex":0.0006331049,"about_ca_system_score_gemma":0.0007469663,"threshold_uncertainty_score":0.005771339},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72493565,0.0020181856,0.2477017,0.0014503591,0.000075889315,0.000073160925,0.00069780124,0.0004046463,0.022642627],"genre_scores_gemma":[0.997282,0.00023951374,0.0015868887,0.000041327803,0.000025781801,0.000047963407,0.00006887524,0.000016327818,0.0006913001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996271,0.0017354819,0.000088225235,0.00036028642,0.0005920522,0.00095290976],"domain_scores_gemma":[0.9697491,0.024812868,0.0017719875,0.0010845152,0.0021486636,0.00043282445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050721215,0.0010783533,0.0018913886,0.0011270022,0.00093065295,0.0020427434,0.0013799702,0.001419583,0.0021293396],"category_scores_gemma":[0.02238259,0.0005587768,0.00052611216,0.0014709025,0.0033854675,0.0023422453,0.0023194114,0.0007953649,0.00034773478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046165969,0.000041029645,0.000999898,0.00011442461,0.00007121474,0.0004031701,0.00022576208,0.95404625,0.0038149199,0.034621976,0.00081961567,0.0043801223],"study_design_scores_gemma":[0.000043292872,0.00010553736,0.0008143001,0.00002899121,0.000038767274,0.0002394886,0.00008878351,0.97477937,0.0021715257,0.021369176,0.00027400846,0.000046786165],"about_ca_topic_score_codex":0.004316253,"about_ca_topic_score_gemma":0.0012982739,"teacher_disagreement_score":0.0050721215,"about_ca_system_score_codex":0.002352897,"about_ca_system_score_gemma":0.0019105605,"threshold_uncertainty_score":0.026824236},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85024273,0.002365774,0.11484843,0.00073275535,0.00008943651,0.00009018268,0.0003488392,0.0004928515,0.030789034],"genre_scores_gemma":[0.99641067,0.00017138157,0.0026257127,0.00002837842,0.000011022545,0.00001928118,0.000059368307,0.000008442674,0.00066577893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983405,0.0005180635,0.00008484901,0.00022202908,0.000490506,0.00034395917],"domain_scores_gemma":[0.99248284,0.004977137,0.0007304665,0.0003424313,0.0013106875,0.0001564553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020707932,0.0013906255,0.0010933914,0.0008465117,0.0008668049,0.0012968929,0.0010467481,0.0015127821,0.0009632256],"category_scores_gemma":[0.007161178,0.00032128982,0.00049369276,0.001112166,0.0014575724,0.0011005098,0.0012533828,0.0004945012,0.00033366663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080327864,0.00008878922,0.0037846006,0.00015356975,0.00011686492,0.0005158472,0.00023608263,0.95149446,0.017121771,0.0094391145,0.0007280777,0.015517669],"study_design_scores_gemma":[0.00006191232,0.00047854314,0.0018847791,0.000021560312,0.00007387862,0.00037159256,0.000090643414,0.9849296,0.007267257,0.004395326,0.00036255963,0.00006243122],"about_ca_topic_score_codex":0.00514286,"about_ca_topic_score_gemma":0.0024523747,"teacher_disagreement_score":0.00514286,"about_ca_system_score_codex":0.0012397948,"about_ca_system_score_gemma":0.0010344209,"threshold_uncertainty_score":0.010951579},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20372996,0.0014605939,0.7796584,0.00031162394,0.0000694808,0.000105456464,0.00007255746,0.00027331576,0.014318633],"genre_scores_gemma":[0.9793553,0.00037765657,0.018589796,0.00003380883,0.000022577318,0.00004115392,0.000026520966,0.000012673222,0.0015406588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917513,0.00022381556,0.000026047988,0.000102643055,0.00034383102,0.00012838667],"domain_scores_gemma":[0.99817145,0.0009246214,0.00024574678,0.0001685559,0.0004427819,0.000046916666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012514998,0.0006365915,0.0005102971,0.0004718209,0.0004757541,0.0007618923,0.0006920528,0.0009075877,0.0011054003],"category_scores_gemma":[0.003697635,0.0002037762,0.0003100797,0.00057797553,0.00083340786,0.00087933143,0.0006458976,0.00041207037,0.00027411812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022276294,0.0000743632,0.001024903,0.00016436934,0.00005241119,0.00029687892,0.00021215665,0.8617478,0.042295482,0.058768257,0.00086561684,0.034274954],"study_design_scores_gemma":[0.000004247764,0.0000918738,0.0001767612,0.0000053926415,0.000009333613,0.00011786046,0.000011853266,0.9947419,0.0020456451,0.0024936215,0.00029420512,0.000007312468],"about_ca_topic_score_codex":0.0014297985,"about_ca_topic_score_gemma":0.0011236013,"teacher_disagreement_score":0.0014297985,"about_ca_system_score_codex":0.0009574759,"about_ca_system_score_gemma":0.0006026346,"threshold_uncertainty_score":0.006946981},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15329567,0.003381712,0.8357225,0.0003376493,0.000075417316,0.0000517118,0.000032314438,0.00025472092,0.0068483814],"genre_scores_gemma":[0.9668909,0.0013927853,0.03104132,0.00004145122,0.000055268218,0.00003294119,0.000012074066,0.000016436097,0.0005168071],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986865,0.0007047753,0.000049261598,0.00013884653,0.00029915207,0.00012140949],"domain_scores_gemma":[0.99511504,0.003510506,0.00052734726,0.0004174948,0.00038234825,0.000047254813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020812915,0.00079385017,0.00069264666,0.000584189,0.0003516025,0.0008109435,0.0009208513,0.0006580311,0.00049173756],"category_scores_gemma":[0.0069034854,0.00025290548,0.00031460318,0.0008361477,0.0010050108,0.0014189199,0.0008392467,0.0005750207,0.00015000967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033407894,0.00009384691,0.0014691275,0.00029772936,0.000105429426,0.00056402094,0.0003636866,0.7710235,0.06319359,0.073500015,0.00083348696,0.08822141],"study_design_scores_gemma":[0.000020093832,0.00022300945,0.0003801914,0.000023994371,0.00005317204,0.00036409323,0.000044885477,0.9621239,0.010248182,0.02511742,0.0013718266,0.000029176692],"about_ca_topic_score_codex":0.00038718697,"about_ca_topic_score_gemma":0.00034041135,"teacher_disagreement_score":0.0020812915,"about_ca_system_score_codex":0.00047718838,"about_ca_system_score_gemma":0.00025951973,"threshold_uncertainty_score":0.011007071},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036964566,0.0009492412,0.95445687,0.00026472285,0.000037557504,0.000043192573,0.00012238717,0.000119576245,0.0070418175],"genre_scores_gemma":[0.89823705,0.0010940047,0.09442369,0.00008920018,0.000067418,0.00012191556,0.00011255481,0.000049410544,0.0058047404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993375,0.00024060624,0.000024411862,0.00009207574,0.00021272444,0.00009258133],"domain_scores_gemma":[0.9993248,0.0004124552,0.000081214064,0.000041139625,0.00012356533,0.000016801894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010683949,0.0011397272,0.00090931886,0.0003852902,0.00030791125,0.001387294,0.00067582773,0.00081890455,0.0019530663],"category_scores_gemma":[0.0018351008,0.00042744458,0.00043370778,0.0005852177,0.00065728585,0.0009493519,0.00070273946,0.0006282125,0.00044835362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056142566,0.000031273088,0.0002128134,0.00009300073,0.00003693412,0.00013254234,0.000066749395,0.9499868,0.00627535,0.030527895,0.00066182937,0.011918707],"study_design_scores_gemma":[0.000009008568,0.000026890537,0.00006327361,0.0000047703543,0.000008746404,0.000036182242,0.000013939522,0.99480647,0.000918948,0.0037855092,0.0003193533,0.0000068387844],"about_ca_topic_score_codex":0.0020218156,"about_ca_topic_score_gemma":0.0020151178,"teacher_disagreement_score":0.0020218156,"about_ca_system_score_codex":0.0010437524,"about_ca_system_score_gemma":0.0006778135,"threshold_uncertainty_score":0.0075730085},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056102954,0.002022529,0.9330905,0.00077397743,0.000055099757,0.00004224895,0.000060257935,0.00009181722,0.0077605434],"genre_scores_gemma":[0.89634943,0.004515493,0.096520096,0.0002248463,0.00010952742,0.00009447907,0.00008486917,0.00005279803,0.0020484703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949765,0.00023388154,0.000014395639,0.00005280037,0.0001440482,0.00005716938],"domain_scores_gemma":[0.99919134,0.000597395,0.00008969898,0.00004666249,0.000056805828,0.000018053432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069643435,0.0007207419,0.00044172007,0.00031136003,0.00028160712,0.00094073324,0.0005719902,0.000712498,0.0011471682],"category_scores_gemma":[0.002385367,0.00048494292,0.0004089754,0.00047971634,0.00079198723,0.0017780546,0.0005033483,0.0011265058,0.00020098328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016302876,0.000028492843,0.00028868453,0.000050558334,0.000008752638,0.000031300726,0.000023915116,0.9703199,0.0016150125,0.01999405,0.00017046019,0.0074525853],"study_design_scores_gemma":[0.0000032137157,0.00002878835,0.00018613737,0.000008653035,0.0000057324123,0.00001510324,0.000015524138,0.98282856,0.00065371656,0.01574097,0.00050905644,0.000004613337],"about_ca_topic_score_codex":0.0029800322,"about_ca_topic_score_gemma":0.0026475578,"teacher_disagreement_score":0.0029800322,"about_ca_system_score_codex":0.00070914446,"about_ca_system_score_gemma":0.0007091549,"threshold_uncertainty_score":0.0059253573},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018391047,0.0040545412,0.9600712,0.0007089683,0.00007370631,0.000054064956,0.00013143994,0.00017622221,0.016338814],"genre_scores_gemma":[0.89158523,0.0087509435,0.08718348,0.00039589155,0.00042994568,0.00036538392,0.00019186962,0.00030924237,0.010787902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977285,0.0012143337,0.00006636119,0.00018416462,0.0005508054,0.00025576918],"domain_scores_gemma":[0.9941573,0.004436457,0.00040578766,0.00021346404,0.0006888155,0.00009821363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034336692,0.0023286652,0.0014995142,0.001293936,0.00062671,0.0021903578,0.0015948822,0.0015005541,0.0036096673],"category_scores_gemma":[0.011371666,0.0008775071,0.0009277668,0.0018858002,0.0017722059,0.0032347806,0.001627301,0.0018944965,0.0012424617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000773741,0.000043602777,0.00033756866,0.00021725448,0.000058794096,0.00023698632,0.00018477031,0.86616725,0.0029137451,0.117290184,0.0015941228,0.010878352],"study_design_scores_gemma":[0.000004853077,0.000022689726,0.00011442307,0.000022947466,0.000011207896,0.000059846207,0.000032615957,0.9677421,0.00040124988,0.031051394,0.00052429456,0.0000123257005],"about_ca_topic_score_codex":0.0021587806,"about_ca_topic_score_gemma":0.0012607402,"teacher_disagreement_score":0.0036096673,"about_ca_system_score_codex":0.0022352587,"about_ca_system_score_gemma":0.00082014495,"threshold_uncertainty_score":0.01815921},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15192412,0.00075945037,0.8314006,0.0004961738,0.00006889009,0.000108307206,0.0001400365,0.00011753934,0.014984916],"genre_scores_gemma":[0.96188086,0.0006550627,0.035232563,0.00007641258,0.000058483616,0.00014256078,0.00006833008,0.000038477665,0.0018472415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678373,0.0019208916,0.000095588235,0.0002458865,0.00046291898,0.0004910202],"domain_scores_gemma":[0.9933503,0.004820372,0.00071033556,0.0003993177,0.00039745565,0.00032220935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033917427,0.0018566162,0.0016623179,0.00078324357,0.000853983,0.0018928427,0.0010879133,0.0013911526,0.001934355],"category_scores_gemma":[0.008567564,0.00083913165,0.000856233,0.00102916,0.0023583544,0.0024238855,0.0024814492,0.0013166518,0.0005547429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031755798,0.00011129085,0.00054164836,0.00015366882,0.000064785505,0.00056591426,0.00022948683,0.8029753,0.004738532,0.18034317,0.0009065576,0.0090521155],"study_design_scores_gemma":[0.000033561144,0.00010460602,0.00010598746,0.000018977675,0.000021957101,0.00016308241,0.00008294058,0.93030113,0.0015275329,0.067185864,0.00042777072,0.000026640253],"about_ca_topic_score_codex":0.0005925713,"about_ca_topic_score_gemma":0.0004985345,"teacher_disagreement_score":0.0033917427,"about_ca_system_score_codex":0.0011700635,"about_ca_system_score_gemma":0.0010110751,"threshold_uncertainty_score":0.017937481},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027409764,0.0022913872,0.96358013,0.0003860564,0.00008847241,0.0000347435,0.00016213841,0.00029125303,0.005755953],"genre_scores_gemma":[0.88708746,0.0052506435,0.09745688,0.00036418074,0.00029852238,0.00014414745,0.00039609883,0.00020156777,0.008800413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799854,0.0004662873,0.000078735975,0.00026229362,0.0009621479,0.00023197939],"domain_scores_gemma":[0.9884863,0.008917331,0.0007809355,0.0005421798,0.0011981112,0.00007518442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024174075,0.0012582295,0.0009915521,0.0011433042,0.0004357539,0.0017037304,0.0012607649,0.0009297963,0.0027561986],"category_scores_gemma":[0.012642276,0.0003795781,0.00069889246,0.001026257,0.0012927041,0.0022597504,0.001056322,0.0012606856,0.0009149143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009641011,0.00003925775,0.001303201,0.00025769652,0.00009441094,0.00027296602,0.0002263909,0.898883,0.0037566044,0.06928197,0.0010752813,0.024712762],"study_design_scores_gemma":[0.0000066152706,0.00003885646,0.00048244762,0.000037327572,0.000029501602,0.00020284383,0.000035051296,0.97938865,0.0021666305,0.01675414,0.0008387793,0.000019073132],"about_ca_topic_score_codex":0.0022092757,"about_ca_topic_score_gemma":0.0017799371,"teacher_disagreement_score":0.0027561986,"about_ca_system_score_codex":0.0017794262,"about_ca_system_score_gemma":0.001158734,"threshold_uncertainty_score":0.012910664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12989365,0.0007313861,0.85156524,0.0003311084,0.00014277743,0.00023526012,0.00021550342,0.00070389896,0.01618121],"genre_scores_gemma":[0.86391234,0.00028634895,0.13011874,0.00017423135,0.000039766706,0.00010906656,0.00016254045,0.000025919613,0.0051710876],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993254,0.00017806541,0.000029381956,0.00010470032,0.00019820748,0.00016421183],"domain_scores_gemma":[0.9990694,0.00026995587,0.00010634529,0.00022210304,0.00023521618,0.00009702029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008745106,0.0006035497,0.0006100165,0.00049135456,0.00062797643,0.0007414794,0.0012255779,0.00071606005,0.0010872165],"category_scores_gemma":[0.0012960773,0.00016818255,0.00029919588,0.0007837278,0.00072879734,0.00085615274,0.0013136276,0.0006707793,0.00034072902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012909811,0.00051205506,0.0034688725,0.00044381496,0.00015931936,0.0019900938,0.0011794531,0.26343855,0.32294038,0.23198737,0.007932192,0.16465701],"study_design_scores_gemma":[0.00013385301,0.0008516777,0.000674069,0.000026259473,0.0000693183,0.0017255612,0.00012374081,0.8904282,0.07500142,0.013881171,0.016998015,0.00008669243],"about_ca_topic_score_codex":0.0008232449,"about_ca_topic_score_gemma":0.0012192009,"teacher_disagreement_score":0.0012255779,"about_ca_system_score_codex":0.0006648084,"about_ca_system_score_gemma":0.00101536,"threshold_uncertainty_score":0.0048235655},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026119556,0.00012397279,0.9962218,0.000036607827,0.00001531259,0.000018856088,0.000013380381,0.00005522954,0.0009028727],"genre_scores_gemma":[0.3549141,0.0008671128,0.6392754,0.00017468192,0.00008888783,0.00034061933,0.0001334055,0.000050499937,0.0041552954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871624,0.0005276075,0.000054501736,0.00023103462,0.0003742338,0.00009643621],"domain_scores_gemma":[0.99833435,0.00070308667,0.00024950586,0.00021252022,0.0004507879,0.000049787366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019750078,0.0013597382,0.0008555211,0.00040004606,0.0002605362,0.00094717543,0.0014366747,0.0012396199,0.0017715548],"category_scores_gemma":[0.0037695516,0.0005010226,0.00075917086,0.0006836949,0.00083484006,0.0013348961,0.0008523981,0.0008084852,0.0008651782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025062668,0.00008381094,0.00047234134,0.00020456547,0.00015043173,0.00014121339,0.00017631536,0.834441,0.013283405,0.040504184,0.0014148327,0.10887721],"study_design_scores_gemma":[0.00010487833,0.00020103186,0.00016305911,0.000018790222,0.00005637785,0.00016028575,0.00003492464,0.98128855,0.0049919863,0.011059336,0.0018855045,0.00003527965],"about_ca_topic_score_codex":0.00072531606,"about_ca_topic_score_gemma":0.0010959014,"teacher_disagreement_score":0.0019750078,"about_ca_system_score_codex":0.0005997796,"about_ca_system_score_gemma":0.0007464283,"threshold_uncertainty_score":0.010444999},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5060499,0.0016544155,0.4740354,0.0005985054,0.000101084406,0.000082946375,0.0002930584,0.000498501,0.016686104],"genre_scores_gemma":[0.9907329,0.00021305156,0.008445488,0.000031501262,0.000012391394,0.000019207915,0.00004044032,0.000014071263,0.0004909902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997804,0.00096099754,0.00007026548,0.00016513752,0.0006863252,0.00031328097],"domain_scores_gemma":[0.9863892,0.010784812,0.00068706635,0.00063686096,0.0013650759,0.00013696092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032739302,0.0010022484,0.0006472308,0.0005671089,0.0004059449,0.00087440846,0.0006013474,0.0010102735,0.0009210764],"category_scores_gemma":[0.0131956795,0.00023466058,0.000220205,0.00061982777,0.0012545795,0.00130785,0.0010747685,0.000645333,0.00020240348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045318395,0.00004881558,0.0012646418,0.00009648815,0.000032429827,0.00012813725,0.00012188174,0.9460965,0.00866247,0.02332899,0.00044348754,0.019322934],"study_design_scores_gemma":[0.000013714667,0.0001200392,0.00034964678,0.0000112487505,0.000008810816,0.00006473881,0.000015721005,0.9902042,0.004104053,0.0049242903,0.00016577562,0.000017818818],"about_ca_topic_score_codex":0.0035911514,"about_ca_topic_score_gemma":0.0023347083,"teacher_disagreement_score":0.0035911514,"about_ca_system_score_codex":0.001175246,"about_ca_system_score_gemma":0.00097148906,"threshold_uncertainty_score":0.017314434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029912347,0.00039930336,0.96716255,0.00010689005,0.00003141528,0.000039342383,0.0000127650155,0.00015917991,0.002176244],"genre_scores_gemma":[0.858522,0.00053477695,0.1385487,0.00009588324,0.00005128287,0.00016811461,0.000047962036,0.000023595665,0.00200782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989085,0.0004610438,0.00003618165,0.00012624831,0.0003588199,0.000109247565],"domain_scores_gemma":[0.9984956,0.00085636036,0.0002045917,0.00018729648,0.00022715237,0.000029061197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012798114,0.0005052244,0.0005601376,0.00044748795,0.00037335936,0.0005066292,0.00096460275,0.00055821176,0.00043282247],"category_scores_gemma":[0.002919054,0.00022171828,0.00038337582,0.0005914239,0.0010020197,0.0010451672,0.0008402594,0.0004834491,0.00018443515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021384888,0.00007247303,0.0007908632,0.00018693453,0.00007890194,0.0004823073,0.00031055624,0.79289526,0.0338819,0.09924716,0.0009102685,0.070929594],"study_design_scores_gemma":[0.000019687197,0.000072328694,0.00008600376,0.000011853818,0.00001810868,0.00011743196,0.000018652427,0.9865649,0.0044821464,0.007477472,0.0011128222,0.000018753202],"about_ca_topic_score_codex":0.0016223761,"about_ca_topic_score_gemma":0.0013873898,"teacher_disagreement_score":0.0016223761,"about_ca_system_score_codex":0.0005114868,"about_ca_system_score_gemma":0.00048905535,"threshold_uncertainty_score":0.0067684054},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66933143,0.0005768332,0.32323048,0.00023100387,0.000030002253,0.000064955035,0.00011227827,0.00015212488,0.006270931],"genre_scores_gemma":[0.99117786,0.00013954271,0.0078010764,0.000017871722,0.000008546876,0.000020611305,0.000020925727,0.0000049207547,0.00080864783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990631,0.00035317737,0.0000403664,0.00008641132,0.00029965327,0.00015738132],"domain_scores_gemma":[0.98609483,0.011080179,0.0010274039,0.00037443388,0.0012780408,0.00014517049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018060809,0.0009546457,0.0008091539,0.00049618067,0.0004694157,0.0007828294,0.00076968304,0.001083867,0.00042228057],"category_scores_gemma":[0.011128356,0.00028914184,0.00032492803,0.0008055181,0.0014168533,0.0012392824,0.0005825168,0.00044809468,0.00014932649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015117507,0.000019102823,0.0010019994,0.000053587453,0.000029337694,0.00045405666,0.00009416459,0.9838869,0.0038812477,0.006823509,0.00008135708,0.0035235903],"study_design_scores_gemma":[0.000011053258,0.00008430407,0.00023059489,0.000004825671,0.000013233851,0.00014012415,0.000018080233,0.9961444,0.0016321486,0.0016624593,0.000050959068,0.000007799369],"about_ca_topic_score_codex":0.005420608,"about_ca_topic_score_gemma":0.004169017,"teacher_disagreement_score":0.005420608,"about_ca_system_score_codex":0.00079056894,"about_ca_system_score_gemma":0.0008983835,"threshold_uncertainty_score":0.0107780695},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039993275,0.0005094034,0.95680773,0.000100463716,0.000019275554,0.000021446642,0.00001342496,0.0000659908,0.0024689678],"genre_scores_gemma":[0.92156965,0.00032210152,0.07686002,0.000041286497,0.00002075578,0.00005302171,0.000015195292,0.000013349113,0.0011046901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944454,0.00028009427,0.000017988874,0.000048000442,0.00014894987,0.000060450904],"domain_scores_gemma":[0.99952316,0.00030367158,0.00004363329,0.00005781971,0.00005814496,0.000013632803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081835146,0.00038902304,0.00042086295,0.00024494922,0.00041129685,0.0005623523,0.00045862971,0.0005155745,0.00046816742],"category_scores_gemma":[0.0024670816,0.00018133111,0.00024109414,0.000541261,0.000702556,0.0007099542,0.0006021943,0.00026675902,0.00015082548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097577446,0.000036599045,0.0003878186,0.000043956526,0.000016448805,0.0001194623,0.000112852504,0.90680593,0.0053223707,0.039930116,0.00059338426,0.046533488],"study_design_scores_gemma":[0.0000062817726,0.000030413468,0.00004677832,0.000002526927,0.0000043137197,0.000023802513,0.000015716261,0.990625,0.0007078748,0.008071193,0.0004625638,0.000003513651],"about_ca_topic_score_codex":0.0020802955,"about_ca_topic_score_gemma":0.0030233962,"teacher_disagreement_score":0.0020802955,"about_ca_system_score_codex":0.0005818908,"about_ca_system_score_gemma":0.0007774201,"threshold_uncertainty_score":0.004327953},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08977079,0.0009149064,0.89880145,0.0003285514,0.000037834758,0.00010834274,0.00008335065,0.000066633926,0.009888234],"genre_scores_gemma":[0.89938587,0.0011383486,0.09342889,0.00008810098,0.000052867013,0.00025081434,0.000047335303,0.00003324793,0.0055745933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991115,0.00047338314,0.00003964257,0.00013640508,0.00010696433,0.00013215828],"domain_scores_gemma":[0.998511,0.001020119,0.00021530349,0.00005548102,0.00012449324,0.00007355076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015391968,0.0013391931,0.0013660874,0.0006536374,0.0005907687,0.001224785,0.0011236062,0.0012148948,0.002383196],"category_scores_gemma":[0.0031017088,0.0006408506,0.00060303684,0.0010938455,0.0015203274,0.0015198026,0.0012244134,0.00055915344,0.00034226032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001562061,0.00008530515,0.00032875102,0.00011919568,0.00006312236,0.00021673215,0.0001300287,0.92216563,0.0029937131,0.05363363,0.0007453416,0.019362377],"study_design_scores_gemma":[0.00002636501,0.000071619506,0.00008445562,0.0000067307024,0.000018953948,0.000043503103,0.00004855663,0.97996235,0.0005681761,0.018789377,0.00036778804,0.000012102803],"about_ca_topic_score_codex":0.0016800043,"about_ca_topic_score_gemma":0.0017122274,"teacher_disagreement_score":0.002383196,"about_ca_system_score_codex":0.0012447318,"about_ca_system_score_gemma":0.0006628758,"threshold_uncertainty_score":0.009031236},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0856303,0.0011134199,0.9018879,0.00033436745,0.00014017767,0.00009400283,0.00007169085,0.00013119158,0.010596904],"genre_scores_gemma":[0.92510116,0.0009970502,0.06680908,0.00010324244,0.0001055737,0.00010299413,0.00006046328,0.000020731755,0.0066998247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954456,0.00015984314,0.000020400965,0.00007895201,0.00014937263,0.000046763427],"domain_scores_gemma":[0.9984274,0.0009154694,0.00017500565,0.00020481805,0.00023443213,0.000042893193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078356155,0.00054154504,0.00052926404,0.00036255032,0.00035179962,0.00059968187,0.00092685135,0.0008126763,0.0011633354],"category_scores_gemma":[0.0025407244,0.00014807336,0.00045365017,0.00049883133,0.00068203406,0.0012249629,0.00065793487,0.00044374162,0.0002975775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000177114,0.0000835511,0.0012524261,0.00013529156,0.00007409095,0.0006256182,0.00015960558,0.8273269,0.021071235,0.11184559,0.001317946,0.035930738],"study_design_scores_gemma":[0.000019261686,0.00008217508,0.00015412706,0.0000051354673,0.000018525727,0.00018755966,0.000020734498,0.9829736,0.0020758586,0.013151154,0.0013013859,0.000010488808],"about_ca_topic_score_codex":0.00092511595,"about_ca_topic_score_gemma":0.0007852774,"teacher_disagreement_score":0.0011633354,"about_ca_system_score_codex":0.00050949,"about_ca_system_score_gemma":0.00031051695,"threshold_uncertainty_score":0.0041439533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07678519,0.001439644,0.9160606,0.0001861254,0.00005924579,0.00008023956,0.00005303167,0.0002813547,0.005054515],"genre_scores_gemma":[0.83746725,0.0007697584,0.15843146,0.00010032426,0.00003286381,0.00011220578,0.000068442605,0.00001448769,0.0030033167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952614,0.000121933765,0.000030862455,0.00007650516,0.00018484426,0.000059804413],"domain_scores_gemma":[0.99876416,0.00038755138,0.00020095146,0.000292847,0.0003143624,0.000040140996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000656932,0.00074600626,0.0005735103,0.00055324985,0.00046878387,0.00069380016,0.0013558704,0.00083238236,0.0006847007],"category_scores_gemma":[0.0015838434,0.00022406424,0.00031954917,0.0006824092,0.0005393377,0.0011807171,0.0010521209,0.0004746726,0.00039643192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004450579,0.00020046321,0.0013743528,0.00037208715,0.00017511446,0.0009250925,0.00076148415,0.42675698,0.19268605,0.13232839,0.0023638965,0.24161103],"study_design_scores_gemma":[0.000054061315,0.00035730697,0.00036747463,0.00003130178,0.00008874628,0.0009106576,0.00008705285,0.9320227,0.039370265,0.020395827,0.0062273145,0.00008728629],"about_ca_topic_score_codex":0.0007316345,"about_ca_topic_score_gemma":0.0012868728,"teacher_disagreement_score":0.0013558704,"about_ca_system_score_codex":0.0004307533,"about_ca_system_score_gemma":0.00037249617,"threshold_uncertainty_score":0.0034742355},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0542969,0.0013900117,0.93778986,0.00043237585,0.00007670926,0.000073058254,0.000028644807,0.00026415865,0.005648338],"genre_scores_gemma":[0.9362014,0.00096412346,0.06028859,0.00013090181,0.00010840071,0.00013495047,0.00003695789,0.000018408682,0.00211627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872905,0.00059675996,0.000035890447,0.00016624025,0.00039767078,0.0000744137],"domain_scores_gemma":[0.99885654,0.00050277676,0.00018436756,0.00024950423,0.00016167058,0.000045199573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013569439,0.0003797694,0.00055206916,0.00043913155,0.00054717803,0.0006479439,0.0007211905,0.0006819691,0.00034704362],"category_scores_gemma":[0.0023494533,0.0003114084,0.0004441733,0.0006011798,0.00084650563,0.0010408354,0.000943826,0.00047160732,0.00015206797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017250897,0.00009484696,0.00077991345,0.00018018438,0.00011005567,0.00035817237,0.0002854352,0.74611,0.04028256,0.11855049,0.0021179835,0.09095788],"study_design_scores_gemma":[0.00003000324,0.00018662287,0.0002538267,0.000011641859,0.000024541583,0.00014256513,0.00003389928,0.95052594,0.0041090995,0.041702528,0.0029578237,0.00002156924],"about_ca_topic_score_codex":0.00069905334,"about_ca_topic_score_gemma":0.00080886786,"teacher_disagreement_score":0.0013569439,"about_ca_system_score_codex":0.00061550504,"about_ca_system_score_gemma":0.0006837646,"threshold_uncertainty_score":0.00717628},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7498926,0.0019043939,0.23660637,0.00027617655,0.000031285756,0.000042097658,0.00011415122,0.00026457442,0.010868406],"genre_scores_gemma":[0.99678695,0.00027157846,0.0024180813,0.000010115162,0.000009445125,0.000008838316,0.00001532458,0.000010014819,0.0004697237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991571,0.0003026065,0.000027268683,0.00008326942,0.00025100145,0.0001788011],"domain_scores_gemma":[0.9953512,0.0031473746,0.00052795286,0.00023693402,0.00064209587,0.00009454923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010649083,0.0010166406,0.0008212137,0.00070397917,0.00043271523,0.0010849233,0.0007421457,0.00085809117,0.0012082101],"category_scores_gemma":[0.0061706435,0.000312443,0.00046437213,0.0006627751,0.0013480798,0.0007692578,0.0007680184,0.0005768201,0.0002453351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023966003,0.00002290804,0.0022267783,0.000094946474,0.000081542545,0.0004721376,0.00020312524,0.9711784,0.010425454,0.0096183205,0.00016521291,0.0052715554],"study_design_scores_gemma":[0.000009525481,0.00014851641,0.0012502283,0.000012484059,0.000048057886,0.00022625239,0.00006062423,0.9940057,0.001984592,0.0020929328,0.00014197224,0.000019193269],"about_ca_topic_score_codex":0.005206878,"about_ca_topic_score_gemma":0.0028929256,"teacher_disagreement_score":0.005206878,"about_ca_system_score_codex":0.001503384,"about_ca_system_score_gemma":0.00059749023,"threshold_uncertainty_score":0.010907829},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46475095,0.001969417,0.51381767,0.0007589782,0.00005684183,0.000099067,0.00022912589,0.00034193485,0.01797602],"genre_scores_gemma":[0.9951368,0.00022861187,0.003580299,0.000031220567,0.000027315542,0.00002434662,0.000038111757,0.000016946118,0.00091646385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978891,0.00098547,0.000056176395,0.00017584825,0.00051011844,0.0003833048],"domain_scores_gemma":[0.9888159,0.008679909,0.00056622113,0.0004998733,0.001243128,0.00019494486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029109255,0.0010343174,0.0011213175,0.0006701988,0.0005867623,0.0017045358,0.00089423725,0.00081464765,0.0023735194],"category_scores_gemma":[0.010174824,0.00041526806,0.00043588667,0.0010182176,0.0011590879,0.0010994374,0.0013482022,0.00046696246,0.0003009582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043106184,0.00003898624,0.0012960222,0.0001004408,0.000068152716,0.00014731828,0.00014647744,0.9560868,0.0062851575,0.020720812,0.00053870346,0.014140128],"study_design_scores_gemma":[0.000010389467,0.0001658165,0.0005211799,0.000007609576,0.00002476498,0.00009507993,0.000040886975,0.99377596,0.00096556876,0.0042368197,0.00014426955,0.000011548142],"about_ca_topic_score_codex":0.0024798973,"about_ca_topic_score_gemma":0.0016580138,"teacher_disagreement_score":0.0029109255,"about_ca_system_score_codex":0.0014576981,"about_ca_system_score_gemma":0.0010213319,"threshold_uncertainty_score":0.015394628},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019263459,0.00057371636,0.9938845,0.00010125005,0.00004350178,0.000028945453,0.000028805478,0.00006992276,0.0033430418],"genre_scores_gemma":[0.59046435,0.0026009148,0.39376518,0.00017910714,0.00026100152,0.00050168356,0.000115492345,0.00009251529,0.0120198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943215,0.00023442938,0.000021863218,0.000079818106,0.00017617694,0.000055447425],"domain_scores_gemma":[0.9996848,0.00014183838,0.00002862345,0.000030420839,0.00008912322,0.000025155507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008709034,0.000868806,0.0008129838,0.0004328658,0.000599455,0.001234829,0.0015387507,0.00085579784,0.0021829356],"category_scores_gemma":[0.001172383,0.00028827618,0.00053524075,0.0007459753,0.0007691596,0.0010898915,0.00084629026,0.0010719401,0.0007322273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033156786,0.00006843879,0.00015896327,0.00011841378,0.000041903553,0.00035968074,0.00021817777,0.6489049,0.0049485257,0.29427224,0.003283562,0.04759194],"study_design_scores_gemma":[0.000008775873,0.000036659992,0.000048950038,0.000013911831,0.00001269594,0.00009267486,0.000031798434,0.9579842,0.0005063153,0.03626774,0.0049849227,0.000011367302],"about_ca_topic_score_codex":0.0026237774,"about_ca_topic_score_gemma":0.002736972,"teacher_disagreement_score":0.0026237774,"about_ca_system_score_codex":0.0011079294,"about_ca_system_score_gemma":0.0009882518,"threshold_uncertainty_score":0.00803864},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007026174,0.00025477677,0.9885069,0.0001880341,0.000020870868,0.000026521953,0.00003452602,0.000061668674,0.0038805068],"genre_scores_gemma":[0.47382566,0.0018023179,0.5140691,0.00025284666,0.00014207442,0.00030292405,0.00023544594,0.00021967143,0.009149949],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995209,0.00018830033,0.00001556184,0.00007821974,0.00011921742,0.000077693534],"domain_scores_gemma":[0.99887985,0.0008564163,0.000062662635,0.00005209948,0.00011781155,0.000031236967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000942106,0.0012309683,0.0009322109,0.0003314416,0.0003430919,0.0013781427,0.00064074155,0.0010717624,0.002266219],"category_scores_gemma":[0.0029952442,0.00035985463,0.0007306447,0.0007636237,0.0007549943,0.0010273737,0.0009493043,0.0018397481,0.0005771275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077095385,0.00009786284,0.00028220282,0.0001986918,0.000023522385,0.000095033,0.00010812602,0.8668383,0.0042576035,0.07265184,0.0023132353,0.053056438],"study_design_scores_gemma":[0.000009194983,0.00001799947,0.00004002168,0.0000070299916,0.0000033139847,0.000024713496,0.000014524186,0.98716646,0.0009843484,0.011098353,0.00062998023,0.000004089845],"about_ca_topic_score_codex":0.0021504653,"about_ca_topic_score_gemma":0.0018860014,"teacher_disagreement_score":0.002266219,"about_ca_system_score_codex":0.0008942185,"about_ca_system_score_gemma":0.0012333344,"threshold_uncertainty_score":0.0075812936},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057126586,0.00008551236,0.9926536,0.00006186103,0.00002195293,0.000048716363,0.0000282148,0.0002290392,0.0011584428],"genre_scores_gemma":[0.27084193,0.0001811581,0.7254868,0.0001272612,0.000034034278,0.0002274096,0.00025305376,0.00010238244,0.0027459848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993838,0.00015572585,0.00003019407,0.0001534922,0.00016809515,0.000108751796],"domain_scores_gemma":[0.99915385,0.0003240495,0.000112127644,0.00013328789,0.0002209773,0.000055800083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005837929,0.000798526,0.00097214046,0.00084803795,0.0009554351,0.0008005598,0.0014898678,0.0009547239,0.001870433],"category_scores_gemma":[0.0021724973,0.00039553447,0.00049740286,0.001172144,0.0005755197,0.00097350386,0.0013764933,0.0007845351,0.0008699347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116449235,0.00006390337,0.00040830576,0.00009621104,0.00003940345,0.00007277623,0.00015554567,0.8111981,0.009774852,0.030337084,0.0032983283,0.14443903],"study_design_scores_gemma":[0.000012767717,0.000029432293,0.00008143429,0.000005278424,0.0000049114724,0.000057463847,0.00003721169,0.98856956,0.0018791542,0.00803633,0.0012748791,0.000011620161],"about_ca_topic_score_codex":0.0026312985,"about_ca_topic_score_gemma":0.003401177,"teacher_disagreement_score":0.0026312985,"about_ca_system_score_codex":0.0011580327,"about_ca_system_score_gemma":0.0016442373,"threshold_uncertainty_score":0.008402109},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04825673,0.0010050158,0.92658097,0.00059447397,0.0001637289,0.00015071478,0.00018756436,0.0017429907,0.021317873],"genre_scores_gemma":[0.8258815,0.00075460714,0.16315266,0.00020327096,0.00007563428,0.00021918777,0.00021019099,0.000125898,0.009377102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961096,0.00011705172,0.000013683811,0.00003530985,0.0001440453,0.0000788929],"domain_scores_gemma":[0.99922085,0.0004200514,0.000079108955,0.00012604076,0.000115020775,0.000038856426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074031967,0.0003201963,0.00027394097,0.0005198858,0.00043764533,0.0004799453,0.0008292905,0.00038720196,0.0029048065],"category_scores_gemma":[0.0025481984,0.000115381845,0.0001664541,0.0006872382,0.0005985669,0.0011322869,0.0010749246,0.000449628,0.00034753844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043478457,0.00014261497,0.0010523438,0.0002106313,0.00004205788,0.0002740625,0.00021028318,0.49428484,0.024809087,0.12985842,0.016953493,0.33172736],"study_design_scores_gemma":[0.000033015745,0.00009265228,0.00019716925,0.000015987693,0.000009995553,0.00008793181,0.000032370986,0.9645604,0.006175152,0.021379106,0.0074011493,0.000015022572],"about_ca_topic_score_codex":0.0033548945,"about_ca_topic_score_gemma":0.004891838,"teacher_disagreement_score":0.0033548945,"about_ca_system_score_codex":0.00064866093,"about_ca_system_score_gemma":0.0008691699,"threshold_uncertainty_score":0.009717524},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033516383,0.006983749,0.021398954,0.042037234,0.025684562,0.00023948248,0.002113201,0.0018934004,0.8962978],"genre_scores_gemma":[0.04866111,0.0049880333,0.0061429734,0.012412502,0.0062740217,0.00022820932,0.0025167929,0.00060032954,0.91817594],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969332,0.00054373965,0.00014830053,0.0006927634,0.0012137512,0.00046817487],"domain_scores_gemma":[0.99351656,0.00079513073,0.00034342014,0.0012017955,0.002635978,0.0015071707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027530564,0.00093862513,0.00068311096,0.001682414,0.0024428405,0.005102991,0.002185699,0.00294572,0.299583],"category_scores_gemma":[0.011084511,0.00029698428,0.0007254342,0.0012443395,0.0014028136,0.0032436177,0.004338152,0.00253356,0.14624046],"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.00023774656,0.00006531818,0.0009714533,0.00030673086,0.000023071652,0.00040713846,0.00043516784,0.00049809134,0.0013081182,0.14343455,0.6195175,0.23279515],"study_design_scores_gemma":[0.000011595456,0.000020785375,0.0002011143,0.00011673508,0.000006008729,0.00025618373,0.00009835294,0.00035733712,0.0003663362,0.01090635,0.98764926,0.000010031558],"about_ca_topic_score_codex":0.0027960911,"about_ca_topic_score_gemma":0.0029102778,"teacher_disagreement_score":0.299583,"about_ca_system_score_codex":0.0029080678,"about_ca_system_score_gemma":0.004279287,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02725833,0.0004255969,0.96522254,0.00041182796,0.00004222088,0.00006606299,0.000095241536,0.00017927685,0.00629891],"genre_scores_gemma":[0.89912146,0.0009165899,0.09519083,0.00020765133,0.00006953545,0.00033749331,0.00019312714,0.00004995218,0.0039132237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991198,0.00040305898,0.000023624185,0.00007939011,0.00026155036,0.00011265427],"domain_scores_gemma":[0.9968784,0.0021547144,0.00028356386,0.00022862354,0.00039839337,0.000056427867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015012702,0.0005424987,0.00046685006,0.00047487125,0.00033075415,0.0007124722,0.0008075174,0.00057003397,0.0015731294],"category_scores_gemma":[0.0058518522,0.00025698097,0.00025796166,0.000684642,0.0010879723,0.0010473671,0.00084189227,0.0010085367,0.00034511436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009955758,0.000023663737,0.00022268695,0.000064719374,0.000011916976,0.000096744596,0.000086996384,0.87685335,0.00274259,0.10370395,0.0012048123,0.014889036],"study_design_scores_gemma":[0.000007646294,0.000026307873,0.0000445122,0.000010112261,0.0000031759403,0.000019846882,0.000014201551,0.97953254,0.00057911,0.019285437,0.00046976114,0.0000072881817],"about_ca_topic_score_codex":0.0032615794,"about_ca_topic_score_gemma":0.0035960877,"teacher_disagreement_score":0.0032615794,"about_ca_system_score_codex":0.0012561673,"about_ca_system_score_gemma":0.0010330412,"threshold_uncertainty_score":0.009114206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03515134,0.00061796035,0.96244806,0.00012263775,0.000026298212,0.00004614996,0.000020777923,0.00013417467,0.0014326066],"genre_scores_gemma":[0.88041157,0.00038393063,0.11726656,0.00005814426,0.00004261933,0.00010010831,0.000028181585,0.000026541346,0.0016824328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833834,0.000943603,0.000056573164,0.00018359938,0.00030676374,0.00017113538],"domain_scores_gemma":[0.9986634,0.00088245975,0.00014680575,0.0001469838,0.00010882389,0.0000514731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016447094,0.001110534,0.0011307122,0.00043318883,0.00037103193,0.00084692513,0.0010104304,0.00087809225,0.00094513356],"category_scores_gemma":[0.0030419219,0.0004117458,0.00037147783,0.0007617351,0.0011248427,0.0014502034,0.0013514123,0.0005523486,0.00029153124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032880544,0.00010168535,0.0005766158,0.00015609137,0.00008408485,0.00027710412,0.000207374,0.8793172,0.016179476,0.031774227,0.0008986093,0.07009869],"study_design_scores_gemma":[0.00004917801,0.00013137405,0.00013896989,0.0000058339565,0.000017014894,0.00010913501,0.000024160841,0.98486555,0.003074098,0.010810391,0.0007562024,0.000018065888],"about_ca_topic_score_codex":0.0003991248,"about_ca_topic_score_gemma":0.00050192245,"teacher_disagreement_score":0.0016447094,"about_ca_system_score_codex":0.00055928243,"about_ca_system_score_gemma":0.00038692742,"threshold_uncertainty_score":0.008698165},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07232412,0.001563881,0.9216596,0.00046073567,0.000058432797,0.00005444126,0.00010974021,0.00019260394,0.003576488],"genre_scores_gemma":[0.93699634,0.0009775632,0.058747545,0.00009377095,0.00011339968,0.00014456135,0.000091377835,0.000051910632,0.0027835676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880254,0.00053272326,0.000059714857,0.00017653589,0.0002936063,0.00013480766],"domain_scores_gemma":[0.9951839,0.0037486989,0.00035552162,0.00024705185,0.0003821363,0.00008264963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020452247,0.00101373,0.0015416611,0.0009332956,0.00070174795,0.0012631094,0.0012015377,0.0011895433,0.0010115635],"category_scores_gemma":[0.00829283,0.0008900727,0.0003421504,0.0013402496,0.0013071477,0.0015058775,0.0011737853,0.0005714241,0.00028629124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003004758,0.00005007075,0.0007720416,0.00013510854,0.00005142197,0.00027032132,0.0002845686,0.90298665,0.005438043,0.048598625,0.0017700233,0.039342575],"study_design_scores_gemma":[0.000031129093,0.00005465734,0.00018114901,0.000009806429,0.00001878785,0.000055688015,0.000032257918,0.9671358,0.0010415278,0.031120913,0.00030546502,0.000012907666],"about_ca_topic_score_codex":0.0017995285,"about_ca_topic_score_gemma":0.002874874,"teacher_disagreement_score":0.0020452247,"about_ca_system_score_codex":0.0008732662,"about_ca_system_score_gemma":0.0009674408,"threshold_uncertainty_score":0.010816336},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5441625,0.0029332973,0.4377808,0.00064516417,0.00006670136,0.000073880765,0.0001363875,0.0004420696,0.013759187],"genre_scores_gemma":[0.9920258,0.00049177185,0.00698123,0.000045636287,0.000029502284,0.00002442138,0.000028529685,0.000024009949,0.00034909393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776137,0.0010975772,0.000056294317,0.00013366948,0.0006362077,0.00031484896],"domain_scores_gemma":[0.9769588,0.019549582,0.0011908275,0.00079761265,0.0013761035,0.00012700802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036746573,0.0012645478,0.00095851644,0.0006867314,0.0005237552,0.000970871,0.0005189837,0.0011235356,0.0008411959],"category_scores_gemma":[0.03035279,0.00036052594,0.00031060696,0.00083686947,0.0017452228,0.0013758045,0.0011991588,0.00074943644,0.00022069155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022932485,0.00003484993,0.0012079519,0.000094526535,0.00004714134,0.00016005182,0.00016629364,0.971384,0.006410886,0.009673527,0.0002178775,0.010373574],"study_design_scores_gemma":[0.000013592529,0.00014674851,0.00071057316,0.000021937763,0.000025971043,0.00011211987,0.00003609462,0.9933216,0.0026337635,0.002832881,0.00012921532,0.000015529493],"about_ca_topic_score_codex":0.0024425385,"about_ca_topic_score_gemma":0.0015787182,"teacher_disagreement_score":0.0036746573,"about_ca_system_score_codex":0.001064423,"about_ca_system_score_gemma":0.00093084585,"threshold_uncertainty_score":0.019433677},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004066277,0.0007413504,0.9920854,0.0003114231,0.00006766065,0.00003501706,0.000013452611,0.000040057803,0.002639302],"genre_scores_gemma":[0.51594555,0.0031297824,0.4716235,0.0006857967,0.00042509683,0.0006856061,0.000115321825,0.0001449502,0.007244362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990564,0.00042121208,0.000037847207,0.00010670048,0.00029866924,0.0000790813],"domain_scores_gemma":[0.99942833,0.00027854447,0.00008576096,0.00005118531,0.00012859986,0.000027560995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002194358,0.0014209002,0.0010239722,0.00074108946,0.0005084722,0.0014222615,0.0015242638,0.0014066189,0.001565935],"category_scores_gemma":[0.0023954154,0.00048435805,0.0010867002,0.0011904615,0.0009803846,0.0017393428,0.0017614723,0.0012783519,0.00032248447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024542036,0.0000539449,0.0002377402,0.00008901469,0.00008247978,0.000081662045,0.000052455598,0.935398,0.001928539,0.044572465,0.00081918156,0.01665993],"study_design_scores_gemma":[0.000006098812,0.000029625615,0.00004546523,0.00000561888,0.000011697256,0.00001882853,0.0000069114394,0.991748,0.00041466145,0.006906837,0.00080022507,0.000005973565],"about_ca_topic_score_codex":0.0016126559,"about_ca_topic_score_gemma":0.0010478866,"teacher_disagreement_score":0.002194358,"about_ca_system_score_codex":0.0010180552,"about_ca_system_score_gemma":0.0010330077,"threshold_uncertainty_score":0.011605024},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15404929,0.0007948712,0.8379089,0.0001942423,0.00002347103,0.000049436476,0.000048805665,0.00021213076,0.00671872],"genre_scores_gemma":[0.9593777,0.0005698059,0.039108794,0.000034645298,0.000017390737,0.000046152843,0.000024727879,0.000024138619,0.0007965603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986071,0.0007469451,0.000036955753,0.00011119609,0.0003386136,0.00015936371],"domain_scores_gemma":[0.99570626,0.0032667145,0.0003168318,0.00028389436,0.00039239382,0.000033990524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017691118,0.00081568694,0.0005789853,0.0004697071,0.00031146305,0.0006243328,0.0007578824,0.00067886687,0.0006042536],"category_scores_gemma":[0.0068533225,0.00020988668,0.00026194772,0.00074559473,0.0010890653,0.0010215957,0.0009144502,0.000539099,0.00021835572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026878377,0.00006700019,0.0009202303,0.0001895279,0.000032351876,0.00043124813,0.0002559155,0.86527944,0.042277873,0.04263257,0.0005462257,0.047098763],"study_design_scores_gemma":[0.000012011253,0.00009759945,0.00014515339,0.000016495404,0.000014182804,0.00014908164,0.00002626072,0.98256946,0.010919659,0.0055403993,0.0004961082,0.000013654619],"about_ca_topic_score_codex":0.0012916108,"about_ca_topic_score_gemma":0.0012208906,"teacher_disagreement_score":0.0017691118,"about_ca_system_score_codex":0.0006311496,"about_ca_system_score_gemma":0.00053707795,"threshold_uncertainty_score":0.0093560815},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16447222,0.0054413136,0.79338866,0.0007631795,0.000093660434,0.00008981349,0.0005254295,0.0004242355,0.034801498],"genre_scores_gemma":[0.9696497,0.0033999227,0.024730854,0.00012775252,0.00009289532,0.0001835602,0.00020289469,0.00009837815,0.0015139885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972677,0.0010700837,0.000092588205,0.0002673358,0.00068351143,0.0006187804],"domain_scores_gemma":[0.9848518,0.011905687,0.0010908983,0.0008934452,0.0010876022,0.00017055962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003300596,0.0017699811,0.0016877081,0.0016445372,0.00080381625,0.0020794848,0.0015813961,0.0012546644,0.0021561873],"category_scores_gemma":[0.020301698,0.00056121766,0.00097632065,0.0017642741,0.0027734796,0.0034715238,0.0016310674,0.0016545573,0.0005956006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011376058,0.000042738728,0.000541927,0.00031931273,0.00005199624,0.0004072635,0.00024687592,0.78522706,0.0055952966,0.1991462,0.00078227825,0.007525353],"study_design_scores_gemma":[0.000010763477,0.00004730973,0.00029587117,0.00009597079,0.000020363892,0.0002389286,0.00008509209,0.92776686,0.0028558113,0.06787264,0.00066856365,0.00004197614],"about_ca_topic_score_codex":0.0021841635,"about_ca_topic_score_gemma":0.0010040705,"teacher_disagreement_score":0.003300596,"about_ca_system_score_codex":0.0022121894,"about_ca_system_score_gemma":0.0014268842,"threshold_uncertainty_score":0.017455399},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.823292,0.0017362471,0.17192985,0.00013930816,0.000025918234,0.000048266313,0.00004660955,0.0001126159,0.0026691987],"genre_scores_gemma":[0.9969568,0.00018361057,0.0026899287,0.000008045066,0.0000051720863,0.000008546721,0.0000044454505,0.0000018950853,0.00014149612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909747,0.00042696722,0.000042934837,0.000092504546,0.00018800636,0.00015218106],"domain_scores_gemma":[0.99420124,0.0045728367,0.0005415191,0.0002006802,0.00040155012,0.0000822193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015951943,0.00083964114,0.00062837696,0.0005942448,0.00038263027,0.00068172574,0.0007005085,0.0006539754,0.0002540096],"category_scores_gemma":[0.0061973,0.00027334405,0.00026605037,0.0005624539,0.0008840801,0.0012909127,0.0006342016,0.00027608208,0.000050184768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017387267,0.000026513186,0.0010437864,0.000063691965,0.00003172865,0.0002056088,0.000046651036,0.98293465,0.004147408,0.005031257,0.000056425422,0.0062384782],"study_design_scores_gemma":[0.000013840499,0.00018155841,0.00038901618,0.0000062921886,0.000022954779,0.00007080091,0.000023913508,0.9955226,0.0016694042,0.0020145283,0.00007675601,0.00000825563],"about_ca_topic_score_codex":0.0026820519,"about_ca_topic_score_gemma":0.002629641,"teacher_disagreement_score":0.0026820519,"about_ca_system_score_codex":0.0010486601,"about_ca_system_score_gemma":0.00044556483,"threshold_uncertainty_score":0.008436322},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07092773,0.008340939,0.87421805,0.0023594026,0.00023407109,0.0002832185,0.0004961624,0.0003284994,0.04281196],"genre_scores_gemma":[0.85687035,0.008240173,0.12622434,0.0005859863,0.00033929295,0.00040183435,0.00029800314,0.00011688851,0.0069230944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99717593,0.0012412781,0.00012264137,0.00039006284,0.0007508554,0.00031922315],"domain_scores_gemma":[0.99478936,0.0036076205,0.00042743405,0.00057652796,0.0004660249,0.0001330482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030785862,0.0024916017,0.0016800553,0.0015781327,0.0009135193,0.0016940121,0.0013708416,0.0014615608,0.0026159598],"category_scores_gemma":[0.014280578,0.00079620816,0.00062209973,0.0017028231,0.0038010187,0.0035778093,0.002628498,0.0028498215,0.0006696491],"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.0006584324,0.00007742533,0.00038280996,0.0003074061,0.00007495294,0.000277302,0.00035651572,0.27453795,0.0068118605,0.66174525,0.003637133,0.051133096],"study_design_scores_gemma":[0.00012115271,0.0002567294,0.00035927596,0.00021859168,0.00006958781,0.00040061367,0.00012836892,0.6980817,0.008422479,0.28638223,0.005433863,0.0001254064],"about_ca_topic_score_codex":0.0017463762,"about_ca_topic_score_gemma":0.0015748987,"teacher_disagreement_score":0.0030785862,"about_ca_system_score_codex":0.0024741031,"about_ca_system_score_gemma":0.002051746,"threshold_uncertainty_score":0.017950952},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060207855,0.0008818333,0.92333996,0.0004642353,0.00006469951,0.00010200244,0.00008274925,0.00012420914,0.014732423],"genre_scores_gemma":[0.9593123,0.00055627123,0.035223365,0.00009369628,0.000053141182,0.00013404308,0.00005235614,0.000039267572,0.0045354497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879515,0.00043862985,0.0000262824,0.00010465365,0.00045677237,0.00017848509],"domain_scores_gemma":[0.99631727,0.0021686072,0.00032283997,0.00029452774,0.0007838666,0.00011283874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002116219,0.0009969377,0.0008650483,0.00082744105,0.000766314,0.0013937093,0.0016344095,0.001557212,0.002817922],"category_scores_gemma":[0.0051153796,0.00043367862,0.0006799741,0.000996989,0.0017305064,0.0016062856,0.0013074391,0.000938344,0.00040671267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075193464,0.00002951532,0.00023294304,0.000092414775,0.000029760942,0.00019245764,0.00012208248,0.8817331,0.0036524965,0.1069385,0.0006796355,0.0062219207],"study_design_scores_gemma":[0.000007265359,0.00002153626,0.000050497856,0.000006478221,0.0000065426684,0.00004022344,0.000013101976,0.9924251,0.00033025572,0.0068828086,0.00020950532,0.000006702756],"about_ca_topic_score_codex":0.003141816,"about_ca_topic_score_gemma":0.0019122761,"teacher_disagreement_score":0.0033497803,"about_ca_system_score_codex":0.0033497803,"about_ca_system_score_gemma":0.0017023125,"threshold_uncertainty_score":0.02430445},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09574961,0.000564371,0.8983588,0.00039278044,0.00002631894,0.000047101763,0.00004445383,0.00013028254,0.0046862597],"genre_scores_gemma":[0.91529846,0.0007727534,0.08055459,0.00016722374,0.000038408238,0.00012850894,0.00004848935,0.000075154654,0.002916431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926955,0.0003082193,0.000018695078,0.000093946015,0.00018440386,0.00012521136],"domain_scores_gemma":[0.99455655,0.0040959367,0.0004407059,0.0003116663,0.00039095854,0.00020411584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015750455,0.00084321457,0.00060461974,0.00091152877,0.0005607225,0.0008673328,0.0011440493,0.00075539266,0.0010547568],"category_scores_gemma":[0.007856157,0.00047669103,0.00031433903,0.00068301463,0.00217664,0.0024507816,0.0014055321,0.0010235085,0.00014573842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009021352,0.000027282851,0.00042370043,0.000073441,0.00002480302,0.00011371347,0.00017805914,0.73139274,0.0065237256,0.24400045,0.0005284127,0.01662353],"study_design_scores_gemma":[0.000018784085,0.000065050575,0.0002474417,0.000023910305,0.000015027211,0.000093125826,0.000061078244,0.87221974,0.002474967,0.12371693,0.0010364118,0.000027519098],"about_ca_topic_score_codex":0.0017443233,"about_ca_topic_score_gemma":0.0018431514,"teacher_disagreement_score":0.0017443233,"about_ca_system_score_codex":0.0015244473,"about_ca_system_score_gemma":0.00090406113,"threshold_uncertainty_score":0.011060715},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19093794,0.0062251873,0.7685241,0.0013750843,0.00013192566,0.000080115075,0.00016373691,0.0003652233,0.032196682],"genre_scores_gemma":[0.9841738,0.0016780816,0.010072279,0.00006214272,0.00008879598,0.00003919905,0.00004878131,0.000037874797,0.0037989693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990177,0.00040811507,0.000031578926,0.00008777741,0.00027786766,0.00017700536],"domain_scores_gemma":[0.9917778,0.006126415,0.00079738133,0.0002803068,0.00088874943,0.00012948696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016437897,0.0011361608,0.0012986388,0.0009586845,0.0006720889,0.0014734287,0.0013612197,0.0016494517,0.0021700705],"category_scores_gemma":[0.009594932,0.0006124043,0.0005803063,0.0014724756,0.0015046535,0.0019154915,0.0009099763,0.00096142944,0.00049874955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078563295,0.000029606572,0.0009536787,0.00015546352,0.000051406892,0.0010266834,0.00029355515,0.93072563,0.003690668,0.055960592,0.0008161779,0.00621788],"study_design_scores_gemma":[0.0000032023993,0.000022264341,0.00023403062,0.000012204065,0.000014732527,0.00024121258,0.000030209816,0.99461985,0.00027694192,0.0042773085,0.00025895887,0.000009022129],"about_ca_topic_score_codex":0.0027598762,"about_ca_topic_score_gemma":0.0024216175,"teacher_disagreement_score":0.0027598762,"about_ca_system_score_codex":0.002042273,"about_ca_system_score_gemma":0.0008367817,"threshold_uncertainty_score":0.014817834},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76865834,0.0028296995,0.22436889,0.00025935634,0.00004498757,0.000024245148,0.00013691057,0.00023036523,0.00344724],"genre_scores_gemma":[0.9947758,0.00057112274,0.004368572,0.000022601203,0.000016223647,0.000008192837,0.000024768156,0.000015421549,0.00019717118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997166,0.0009828102,0.00020090064,0.0002381476,0.0010820866,0.00033006244],"domain_scores_gemma":[0.971894,0.020943122,0.0028547696,0.0017804585,0.0023669715,0.00016062344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00364603,0.0010737267,0.0010505745,0.0008372092,0.0006285321,0.001490505,0.00063138636,0.0011491894,0.00046507845],"category_scores_gemma":[0.021976369,0.00041154335,0.00033810237,0.00076019164,0.0012271485,0.0019435753,0.0010221993,0.0008479987,0.00016670157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005855854,0.00006627839,0.005377361,0.00021659535,0.00009957301,0.0010457343,0.00033594837,0.9181841,0.032453608,0.0088214865,0.00022501632,0.032588683],"study_design_scores_gemma":[0.000016867449,0.000440874,0.004018403,0.00004656093,0.00009728956,0.00082629,0.00013949822,0.95766085,0.031591635,0.004719254,0.00036607924,0.00007642465],"about_ca_topic_score_codex":0.0016977829,"about_ca_topic_score_gemma":0.0022757861,"teacher_disagreement_score":0.00364603,"about_ca_system_score_codex":0.0009375334,"about_ca_system_score_gemma":0.0007807974,"threshold_uncertainty_score":0.019282281},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037031338,0.000860708,0.9591016,0.000103214996,0.000033604687,0.00003504694,0.00001676648,0.00014743104,0.0026701852],"genre_scores_gemma":[0.7894714,0.0008514645,0.20662314,0.00011162458,0.00007596522,0.00008467157,0.000039087547,0.000022056493,0.0027207318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990791,0.00032013207,0.00003400673,0.00007952251,0.0003896466,0.00009741266],"domain_scores_gemma":[0.9986493,0.0008196587,0.00016743504,0.000117456824,0.00022101404,0.000025106574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094903173,0.0006311069,0.00063935225,0.00045113213,0.00041920852,0.000678037,0.00094042264,0.0010061043,0.00043016346],"category_scores_gemma":[0.0024936232,0.00030815703,0.00042442573,0.0005580787,0.0006896901,0.00081368716,0.0007273486,0.00056985056,0.0002746405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031263844,0.000095644034,0.0016969907,0.00030468576,0.0001253605,0.0010154875,0.0008100312,0.6057676,0.1050907,0.10623182,0.001199482,0.17734957],"study_design_scores_gemma":[0.000025721865,0.0002230029,0.00025413674,0.00001812298,0.000025254398,0.0005142769,0.000023155519,0.9700188,0.016894419,0.01015658,0.0018132603,0.00003326029],"about_ca_topic_score_codex":0.000726229,"about_ca_topic_score_gemma":0.00089307333,"teacher_disagreement_score":0.0010061043,"about_ca_system_score_codex":0.00045542637,"about_ca_system_score_gemma":0.00056405313,"threshold_uncertainty_score":0.005019009},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018394679,0.00041035775,0.9784087,0.00007997946,0.000032457247,0.00003433502,0.000027582966,0.00013350525,0.002478461],"genre_scores_gemma":[0.805868,0.00080214837,0.18857011,0.00006237939,0.00004651807,0.00013053484,0.00007395059,0.000033890516,0.0044124834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997669,0.00007347812,0.000009831124,0.000049636114,0.00006593475,0.00003429659],"domain_scores_gemma":[0.99966514,0.00020534555,0.000037864058,0.000022120856,0.000057216872,0.000012347575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048519953,0.0008279707,0.00065884273,0.00027952497,0.0003087914,0.000668703,0.00070549303,0.0008043967,0.002129602],"category_scores_gemma":[0.0011928378,0.00026301254,0.0003479951,0.0004701136,0.00051394134,0.00080788694,0.00048770857,0.00064286403,0.00048225455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048472797,0.000027343938,0.00015714236,0.000065586566,0.000012653184,0.00005791495,0.000029152781,0.96401525,0.003403385,0.0059468327,0.0004076262,0.025828648],"study_design_scores_gemma":[0.00000502856,0.000016344156,0.000027573702,0.0000020234747,0.0000030623426,0.0000104265255,0.0000037263392,0.99833125,0.0004604334,0.0009815111,0.00015598984,0.0000025655488],"about_ca_topic_score_codex":0.0026444006,"about_ca_topic_score_gemma":0.002757692,"teacher_disagreement_score":0.0026444006,"about_ca_system_score_codex":0.00059499405,"about_ca_system_score_gemma":0.00062171806,"threshold_uncertainty_score":0.007124245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029610425,0.0003363657,0.9601923,0.00015688696,0.000022195163,0.000032044107,0.000030188554,0.00013681955,0.009482697],"genre_scores_gemma":[0.9088682,0.0006133797,0.08435183,0.0001295809,0.00006499898,0.0000875423,0.00004484521,0.000030444397,0.0058092074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999326,0.00020335817,0.000019560539,0.000081189464,0.00026937702,0.00010056634],"domain_scores_gemma":[0.9992538,0.00039795335,0.00011416972,0.00010092849,0.00010927344,0.00002394584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056264846,0.0006978638,0.0005852702,0.00028858442,0.00055127277,0.00088812393,0.00078471494,0.0005999866,0.0011920484],"category_scores_gemma":[0.0013517039,0.0002490598,0.00047037963,0.00052704645,0.00089229504,0.0010753184,0.00095102447,0.00078943896,0.00039820207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006295518,0.0000553487,0.00024434525,0.00008213574,0.000031630472,0.00016598776,0.0001300374,0.89839655,0.011321153,0.060920134,0.00072545605,0.027864235],"study_design_scores_gemma":[0.0000069797456,0.00004170065,0.000047407033,0.0000046684363,0.000007788251,0.000052411087,0.000015830468,0.9893281,0.0025020821,0.007326248,0.00065827376,0.000008488143],"about_ca_topic_score_codex":0.0026510262,"about_ca_topic_score_gemma":0.0029193177,"teacher_disagreement_score":0.0026510262,"about_ca_system_score_codex":0.00089104095,"about_ca_system_score_gemma":0.00084139145,"threshold_uncertainty_score":0.006465018},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15927023,0.0050856713,0.80820835,0.0011122209,0.00012305981,0.00010125192,0.00021393146,0.0001591354,0.025726167],"genre_scores_gemma":[0.9669728,0.002675168,0.022444656,0.00020496556,0.000255194,0.00012736485,0.00014466503,0.000072857256,0.0071023307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842095,0.00065879937,0.000042342286,0.00012572687,0.0004442034,0.00030799222],"domain_scores_gemma":[0.99064094,0.0073650046,0.0004178979,0.0003513882,0.0010687035,0.00015593202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031018222,0.0013837604,0.0013603857,0.0017836187,0.0008085037,0.0022029947,0.0013464963,0.0011891259,0.0034022324],"category_scores_gemma":[0.009123146,0.00077899074,0.00089086994,0.0021628097,0.002046461,0.0021492785,0.0016740494,0.0011023628,0.0005736319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030983763,0.00009766335,0.0012427024,0.00023171115,0.00015019551,0.00033158532,0.00049639,0.7463365,0.012094404,0.20921758,0.0023183106,0.027173206],"study_design_scores_gemma":[0.000029172103,0.00010414294,0.0005206062,0.00002911701,0.000040073293,0.00021753702,0.00007281958,0.9427277,0.0009185329,0.054660298,0.0006452506,0.000034744302],"about_ca_topic_score_codex":0.0017910482,"about_ca_topic_score_gemma":0.0015491984,"teacher_disagreement_score":0.0034022324,"about_ca_system_score_codex":0.0025467663,"about_ca_system_score_gemma":0.0009982417,"threshold_uncertainty_score":0.018478215},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35255376,0.031233894,0.40669876,0.0143147735,0.0011691551,0.00022236982,0.00028856407,0.00008870477,0.19342996],"genre_scores_gemma":[0.97373646,0.0056914655,0.009709988,0.0002745142,0.0004995555,0.00009043905,0.000051293067,0.000020670564,0.009925671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953663,0.00022413046,0.000011281015,0.00006219547,0.00010978692,0.000055959186],"domain_scores_gemma":[0.9975096,0.0017645448,0.00022329293,0.00007533339,0.0002765482,0.0001505647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007429127,0.00045302528,0.0003468868,0.00086378603,0.001078525,0.001999792,0.0008127251,0.0013484309,0.0040869014],"category_scores_gemma":[0.004747049,0.0003062381,0.00039465443,0.0011427167,0.0012732411,0.0020413694,0.0007961182,0.0011434719,0.0002321946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027515827,0.000034000557,0.001744735,0.000115262774,0.00003965371,0.00037791207,0.00028975346,0.31550935,0.00093741535,0.66534775,0.0031052835,0.0124712875],"study_design_scores_gemma":[0.000012588308,0.000045326404,0.00085085985,0.000076509205,0.000017364577,0.00022020147,0.00031335975,0.7798521,0.00022473586,0.20351759,0.014855888,0.000013525043],"about_ca_topic_score_codex":0.0041803597,"about_ca_topic_score_gemma":0.001962089,"teacher_disagreement_score":0.0041803597,"about_ca_system_score_codex":0.0015536663,"about_ca_system_score_gemma":0.0005662871,"threshold_uncertainty_score":0.013672054},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029116048,0.00016772609,0.9683896,0.00019079387,0.0000119188635,0.000030128613,0.000024060835,0.00008166531,0.0019881292],"genre_scores_gemma":[0.85959816,0.00029343783,0.137665,0.00007702212,0.000046873814,0.00018480489,0.00005086334,0.000052095947,0.0020317794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990883,0.00051031273,0.000020661282,0.0000822847,0.00018963158,0.00010894923],"domain_scores_gemma":[0.9987337,0.0009855779,0.00009586131,0.000067928544,0.00007623193,0.000040805524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015409567,0.000844329,0.0008684343,0.0005474475,0.00043164694,0.0008906955,0.001021043,0.0010759014,0.0011221076],"category_scores_gemma":[0.0046873186,0.00052392145,0.00050585665,0.0009272855,0.00095714343,0.0013543468,0.001245444,0.00065909466,0.00019616507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000948312,0.000059667145,0.00023220258,0.00005462269,0.000023600625,0.000071623326,0.00010071958,0.9291954,0.00262454,0.04154909,0.0007160413,0.025277592],"study_design_scores_gemma":[0.000009623786,0.000018344394,0.000020355767,0.0000018785034,0.0000036309693,0.0000072872012,0.00000770611,0.98544204,0.0003840146,0.013928935,0.00017394008,0.0000022203483],"about_ca_topic_score_codex":0.0014515726,"about_ca_topic_score_gemma":0.0013753879,"teacher_disagreement_score":0.0015409567,"about_ca_system_score_codex":0.0008677577,"about_ca_system_score_gemma":0.00073125353,"threshold_uncertainty_score":0.008149445},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08053152,0.005619063,0.9048507,0.0008050437,0.00039268984,0.000105731255,0.000060835635,0.00056253816,0.0070718867],"genre_scores_gemma":[0.93679893,0.001223247,0.060441695,0.00015312879,0.00010489467,0.00009300663,0.000051242485,0.000014059132,0.0011197737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995826,0.00013132974,0.000025206724,0.000041143292,0.00014273162,0.000076909055],"domain_scores_gemma":[0.99911886,0.00040022758,0.00008378711,0.000114307695,0.00021968214,0.00006319591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012665959,0.00029860713,0.00031388924,0.00048326756,0.00042221154,0.00080212177,0.0011772626,0.00052548037,0.00039490245],"category_scores_gemma":[0.0027978362,0.00018197249,0.00023396578,0.00042670098,0.00064285705,0.0007205461,0.00087873463,0.00061528827,0.00013125676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057136355,0.00016040326,0.0026525175,0.0006514308,0.0001182625,0.000936355,0.0006585021,0.3224311,0.050226558,0.22513515,0.005599863,0.39085856],"study_design_scores_gemma":[0.00006498423,0.00017206723,0.0003825635,0.00003489363,0.00004246726,0.00021184867,0.00009430422,0.93482417,0.0061828294,0.04833814,0.009616101,0.00003573232],"about_ca_topic_score_codex":0.0025131605,"about_ca_topic_score_gemma":0.0021349206,"teacher_disagreement_score":0.0025131605,"about_ca_system_score_codex":0.00073519896,"about_ca_system_score_gemma":0.00083438115,"threshold_uncertainty_score":0.006698489},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15342635,0.00052102556,0.84230936,0.0002500232,0.00002472875,0.000041404965,0.00004694984,0.00020287682,0.0031771278],"genre_scores_gemma":[0.94261014,0.00022965191,0.055314556,0.000055732176,0.000019165538,0.00004795931,0.00004265378,0.000016940003,0.0016632113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906534,0.00031757646,0.000046501,0.00015422466,0.0002727384,0.00014364313],"domain_scores_gemma":[0.9955336,0.0031073887,0.00046615745,0.00035042208,0.0004798155,0.00006263913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012977213,0.00065107987,0.0005960674,0.00032760834,0.00047633584,0.00051207823,0.00059418764,0.00085318997,0.00073759374],"category_scores_gemma":[0.0078826295,0.00028879775,0.00030345848,0.00051992474,0.000964855,0.0012069925,0.0007367781,0.00051978027,0.00019834754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017025627,0.000033572254,0.0009663499,0.00006166091,0.000024950543,0.0001565366,0.00022794693,0.9433262,0.0065021776,0.01873799,0.00029427608,0.029498149],"study_design_scores_gemma":[0.0000101384185,0.00006059803,0.00016683138,0.000005327018,0.000010079687,0.00008436504,0.000021808593,0.9921928,0.0033524574,0.0038380239,0.00024815192,0.000009360511],"about_ca_topic_score_codex":0.0042409324,"about_ca_topic_score_gemma":0.003512623,"teacher_disagreement_score":0.0042409324,"about_ca_system_score_codex":0.0010031033,"about_ca_system_score_gemma":0.0011216331,"threshold_uncertainty_score":0.0084325075},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061066594,0.000071613336,0.93443656,0.00016697,0.0000346825,0.00007361019,0.000023541459,0.0009655206,0.0031609333],"genre_scores_gemma":[0.8284867,0.000055474684,0.170018,0.000101102225,0.000021217556,0.00008915342,0.00003133719,0.000049136877,0.0011477872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993001,0.00028550517,0.000029812352,0.00006731015,0.0002022719,0.00011496257],"domain_scores_gemma":[0.9975313,0.0013864472,0.00018630878,0.00046158856,0.0003229819,0.00011134134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014045447,0.00033502866,0.00032873717,0.0003147061,0.0004435422,0.0006995558,0.0008840856,0.00054423115,0.0015462243],"category_scores_gemma":[0.0043930393,0.0001513089,0.00022683736,0.00027337557,0.000833971,0.0011417957,0.0011354933,0.0006834939,0.00015299517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006339572,0.00017347927,0.0019478953,0.000085587155,0.00003628235,0.00018740953,0.00023115276,0.74293363,0.030274823,0.079384245,0.0023376504,0.1417738],"study_design_scores_gemma":[0.000022783153,0.000081951606,0.00006277392,0.00000514899,0.0000048858756,0.000047685797,0.000013493823,0.9837684,0.008428469,0.0063461964,0.0012122305,0.000005882451],"about_ca_topic_score_codex":0.0015341649,"about_ca_topic_score_gemma":0.0016369248,"teacher_disagreement_score":0.0015462243,"about_ca_system_score_codex":0.00072405115,"about_ca_system_score_gemma":0.0011075642,"threshold_uncertainty_score":0.0074279904},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09916447,0.00087133585,0.89634645,0.00018139911,0.00010733949,0.000092292445,0.000018487312,0.00034882777,0.0028694682],"genre_scores_gemma":[0.94181746,0.00034824634,0.056917593,0.000077080374,0.000046831352,0.00006458913,0.00002195758,0.000023435638,0.00068282685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990839,0.00038895864,0.00003736726,0.000054773678,0.0003227731,0.00011220976],"domain_scores_gemma":[0.9967816,0.0016994838,0.00034535176,0.00044614737,0.0006327592,0.00009476261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001828305,0.00042864608,0.0003475028,0.00064428896,0.00046265166,0.0004577028,0.00079542515,0.0003601436,0.00027261116],"category_scores_gemma":[0.005364235,0.00021221998,0.00025219755,0.00073044904,0.00080630253,0.001037052,0.000884659,0.00046875124,0.00006683796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003599706,0.00016905161,0.0032721593,0.00014729131,0.00009546517,0.0005477914,0.0003721813,0.74548155,0.046407513,0.04238266,0.0012370588,0.15952726],"study_design_scores_gemma":[0.000021701086,0.00013332836,0.0003963865,0.000017103763,0.000035773515,0.0002386982,0.000043030934,0.9796371,0.009697661,0.008283182,0.0014723184,0.000023759543],"about_ca_topic_score_codex":0.002485838,"about_ca_topic_score_gemma":0.0030027453,"teacher_disagreement_score":0.002485838,"about_ca_system_score_codex":0.0005808397,"about_ca_system_score_gemma":0.0010789206,"threshold_uncertainty_score":0.0096690655},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029692484,0.0041293744,0.94329625,0.0021929268,0.00018526596,0.00032783666,0.0001594849,0.00017532651,0.01984112],"genre_scores_gemma":[0.85855204,0.0070555373,0.109123595,0.0005834117,0.000724389,0.0009938137,0.00017645411,0.000122010744,0.022668704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976634,0.0011098528,0.00008731008,0.00018226024,0.0005960214,0.00036119393],"domain_scores_gemma":[0.9962037,0.0021731972,0.0006484866,0.00023673204,0.0005437943,0.00019410452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053928355,0.0016444746,0.0018764017,0.0023256547,0.0010778927,0.002611014,0.0036021087,0.003601479,0.004877861],"category_scores_gemma":[0.012146232,0.0010861518,0.0018241291,0.002063911,0.0019775906,0.004946068,0.0020146968,0.0024824433,0.00074532937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096649135,0.00014491715,0.00080821133,0.00019169589,0.00006122051,0.00042176555,0.00021268679,0.23194234,0.0021211014,0.7476057,0.0030002932,0.013393466],"study_design_scores_gemma":[0.000035486486,0.000061117535,0.00022972193,0.00004467635,0.00002974909,0.00019278412,0.00004969289,0.8981127,0.00032921438,0.09855715,0.0023274936,0.0000302389],"about_ca_topic_score_codex":0.0037460504,"about_ca_topic_score_gemma":0.0014582096,"teacher_disagreement_score":0.0053928355,"about_ca_system_score_codex":0.0036312237,"about_ca_system_score_gemma":0.002371085,"threshold_uncertainty_score":0.028520405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078974985,0.0011126691,0.9141363,0.00021797212,0.000040902036,0.00003439885,0.00010197419,0.00016880599,0.0052120765],"genre_scores_gemma":[0.938117,0.0013981706,0.057180062,0.000053716994,0.00004317805,0.00004971403,0.00010022591,0.00004523623,0.0030126397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989191,0.00028763554,0.00006790811,0.00012894343,0.0004819682,0.000114471586],"domain_scores_gemma":[0.99398476,0.004235764,0.0005372028,0.0004398598,0.00075181277,0.00005058971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025828567,0.0010080789,0.00086985005,0.000788255,0.0003894724,0.0014506433,0.0010209049,0.0009195923,0.0012729804],"category_scores_gemma":[0.010834131,0.000244632,0.0004743659,0.00082811347,0.0009849806,0.0016372389,0.001177219,0.0007587771,0.00030359623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012729118,0.000022528431,0.00086776854,0.00012431816,0.00003192499,0.00013832026,0.00015090087,0.9244925,0.004539895,0.04529628,0.00032295875,0.02388544],"study_design_scores_gemma":[0.000004387591,0.000029085833,0.000183156,0.000015103036,0.000011768989,0.00008246579,0.000023898468,0.9898956,0.0018902197,0.0076761236,0.00017694214,0.000011197996],"about_ca_topic_score_codex":0.0028319398,"about_ca_topic_score_gemma":0.0016105054,"teacher_disagreement_score":0.0028319398,"about_ca_system_score_codex":0.0013149838,"about_ca_system_score_gemma":0.0009139956,"threshold_uncertainty_score":0.013659656},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012113148,0.00039665453,0.9769686,0.001698208,0.00017643538,0.00005724479,0.000049409362,0.000078581914,0.008461749],"genre_scores_gemma":[0.91163665,0.0009464791,0.07640703,0.0006245812,0.0006019564,0.00027108754,0.000051903568,0.00007356849,0.00938677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728215,0.001249574,0.00011781284,0.0003128556,0.00082072325,0.00021697345],"domain_scores_gemma":[0.9903768,0.007250374,0.0006395514,0.0006041313,0.0008979204,0.00023131359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003995653,0.0010746757,0.0010277579,0.0018982169,0.001047895,0.0026835368,0.0032313524,0.0024801146,0.0025209903],"category_scores_gemma":[0.015752073,0.00070010003,0.0010066667,0.0016680419,0.0056996103,0.004399426,0.0027595626,0.002389883,0.00023092951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004753936,0.00005826216,0.00020828121,0.0000902679,0.00003536648,0.00008640821,0.0001937547,0.29462808,0.0015804346,0.68940854,0.0014075759,0.0122554945],"study_design_scores_gemma":[0.000018394456,0.000047036076,0.000054649154,0.000015560887,0.000016833435,0.000033967623,0.000033379987,0.73168004,0.0005921695,0.26659065,0.00089692196,0.000020358419],"about_ca_topic_score_codex":0.0025732424,"about_ca_topic_score_gemma":0.001580864,"teacher_disagreement_score":0.003995653,"about_ca_system_score_codex":0.0021500539,"about_ca_system_score_gemma":0.001632224,"threshold_uncertainty_score":0.021131277},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37636647,0.0035333636,0.613026,0.00022176425,0.00005507521,0.000045503333,0.00009363517,0.0001968465,0.006461354],"genre_scores_gemma":[0.98566854,0.0010534179,0.012466648,0.00002312811,0.000024364219,0.000019639132,0.000018792014,0.0000046265664,0.0007208543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996507,0.00014270854,0.000013979576,0.00005545432,0.00008591817,0.000051254],"domain_scores_gemma":[0.9988832,0.0006671695,0.0001641351,0.00011401533,0.00015053843,0.000021083073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005482976,0.0004362674,0.0004987448,0.00031448592,0.00028233702,0.0005919628,0.00037522105,0.00033088378,0.00044886165],"category_scores_gemma":[0.0011801055,0.00013213557,0.00018544894,0.000402837,0.0006351216,0.000670685,0.0003645701,0.00021455588,0.00010396489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003309501,0.000052121475,0.0024453716,0.00037575772,0.00010178209,0.0007325656,0.00037036085,0.68968076,0.09722316,0.12674394,0.00086517836,0.08107799],"study_design_scores_gemma":[0.000012773357,0.00016840674,0.0005266353,0.0000093699155,0.000029543547,0.00028971644,0.000041312924,0.9773498,0.008354614,0.011597208,0.0016006925,0.000020035206],"about_ca_topic_score_codex":0.0010395428,"about_ca_topic_score_gemma":0.00096248573,"teacher_disagreement_score":0.0010395428,"about_ca_system_score_codex":0.00041610422,"about_ca_system_score_gemma":0.00032333905,"threshold_uncertainty_score":0.0030190349},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007746971,0.00016149308,0.99087465,0.000078250996,0.000012447749,0.000028651115,0.00001677723,0.00006972523,0.0010111422],"genre_scores_gemma":[0.74138296,0.0009491094,0.25403172,0.00014215373,0.000056765726,0.00041166236,0.000077311386,0.00006586327,0.0028823947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998321,0.0009376993,0.00007011161,0.00021480418,0.00031275052,0.00014361046],"domain_scores_gemma":[0.9989059,0.00063833,0.0001337557,0.000084617226,0.00017842471,0.000058997015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017408562,0.001411111,0.0010588821,0.00039624207,0.00023743801,0.0010398191,0.00093950063,0.0011215066,0.00086199323],"category_scores_gemma":[0.0030977097,0.00074122474,0.00046732917,0.0007014795,0.0009127137,0.0013021481,0.0011653939,0.0007501724,0.00043628822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009438392,0.000050206054,0.00031484241,0.00011889662,0.00004751492,0.00011237095,0.000085917214,0.93212485,0.010869887,0.016561262,0.0005755991,0.039044317],"study_design_scores_gemma":[0.00002173267,0.00008798417,0.00007866785,0.0000063818725,0.000012237982,0.000050147166,0.000017708026,0.9915979,0.0025147437,0.005061218,0.0005394245,0.000011787193],"about_ca_topic_score_codex":0.00061582477,"about_ca_topic_score_gemma":0.0008207846,"teacher_disagreement_score":0.0017408562,"about_ca_system_score_codex":0.0005698807,"about_ca_system_score_gemma":0.0009393221,"threshold_uncertainty_score":0.009206653},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062989146,0.00064144994,0.9335167,0.00011814335,0.00013991707,0.00007345572,0.0000249854,0.0008061683,0.001689973],"genre_scores_gemma":[0.7473601,0.0005359149,0.24889381,0.000116501586,0.000109112756,0.000070047725,0.00005861275,0.00006203589,0.0027939468],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951065,0.00009041181,0.000040811068,0.000114991606,0.0001738444,0.000069183836],"domain_scores_gemma":[0.999032,0.00018206194,0.00021870591,0.0001977836,0.00030805494,0.000061404695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056186016,0.0005523344,0.0005101499,0.00054007076,0.00038959997,0.0008516922,0.00083883625,0.00057314767,0.001108858],"category_scores_gemma":[0.0013553759,0.0002870133,0.000328294,0.00033488145,0.00042802704,0.0017470613,0.0009588224,0.0006109623,0.0003446302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057823234,0.000253805,0.0016633703,0.0003360416,0.00018453764,0.0006357963,0.0004532276,0.083381735,0.5782432,0.026671628,0.0017901727,0.30580828],"study_design_scores_gemma":[0.00007540438,0.00066203746,0.00073272624,0.000028320392,0.00015117286,0.00055857765,0.00006541938,0.72906446,0.2537202,0.0039154217,0.010967931,0.00005834723],"about_ca_topic_score_codex":0.00042569684,"about_ca_topic_score_gemma":0.00063316704,"teacher_disagreement_score":0.001108858,"about_ca_system_score_codex":0.00044506206,"about_ca_system_score_gemma":0.000305623,"threshold_uncertainty_score":0.003709495},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028165815,0.000676239,0.96281636,0.00048604386,0.00008583447,0.00008938115,0.00010340607,0.00015720728,0.0074197273],"genre_scores_gemma":[0.7729455,0.0013202128,0.21937166,0.00022701299,0.00007901185,0.00022649161,0.000102278,0.00003083356,0.0056969672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952674,0.00016402078,0.000023006061,0.000051781022,0.000158765,0.00007581131],"domain_scores_gemma":[0.9991146,0.00039134093,0.00006914027,0.00020371478,0.00018810824,0.000033090695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001016689,0.0007004003,0.0005225022,0.00041185357,0.00053054723,0.00078110147,0.00092549203,0.0008458872,0.0018363686],"category_scores_gemma":[0.001946441,0.00019014353,0.0005543013,0.0004931382,0.00126351,0.0014079483,0.0010835469,0.00079926255,0.00037661096],"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.00017231336,0.000049789658,0.00029354796,0.000112481066,0.000032618493,0.00017657099,0.00021434421,0.26474705,0.007920389,0.67868716,0.002027406,0.045566373],"study_design_scores_gemma":[0.000044062945,0.00008482079,0.00008112937,0.00001944062,0.000026103817,0.00017569344,0.000030700518,0.877417,0.0055128764,0.11320657,0.0033582135,0.000043357973],"about_ca_topic_score_codex":0.002096254,"about_ca_topic_score_gemma":0.002931662,"teacher_disagreement_score":0.002096254,"about_ca_system_score_codex":0.0008018322,"about_ca_system_score_gemma":0.0014163421,"threshold_uncertainty_score":0.0061432123},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19568701,0.00031882405,0.8007616,0.00034475714,0.00007082469,0.000116331896,0.000016123375,0.00020905981,0.002475483],"genre_scores_gemma":[0.9692546,0.00011223033,0.029861562,0.00007162165,0.000021673819,0.0000698476,0.00000861451,0.000006127249,0.0005937103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807215,0.0009855804,0.000107653854,0.00026629417,0.00038914772,0.00017906727],"domain_scores_gemma":[0.9922293,0.004975246,0.0008508919,0.00078052154,0.0007999708,0.0003641101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031515544,0.000490389,0.00079034595,0.00062348484,0.00075918133,0.0007043422,0.0012437606,0.0010199973,0.0005366934],"category_scores_gemma":[0.0074334685,0.00026079814,0.00033560777,0.00056865206,0.0012688695,0.0016742048,0.0015581471,0.0009241803,0.000111661604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014294529,0.0007506677,0.009449448,0.00038067685,0.0003011838,0.0015412804,0.0017011346,0.41446626,0.12930828,0.20822127,0.0028456359,0.22960468],"study_design_scores_gemma":[0.0001144477,0.00039382448,0.0008441617,0.00001771204,0.000059982798,0.00035238324,0.000068711495,0.9605963,0.009441292,0.026491754,0.0015682034,0.000051264928],"about_ca_topic_score_codex":0.00050849176,"about_ca_topic_score_gemma":0.0003940182,"teacher_disagreement_score":0.0031515544,"about_ca_system_score_codex":0.0006427189,"about_ca_system_score_gemma":0.00066812424,"threshold_uncertainty_score":0.016667187},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07101296,0.0006920711,0.91065097,0.0011941055,0.0001177535,0.00013355237,0.0002841392,0.00033990634,0.015574615],"genre_scores_gemma":[0.9420621,0.0006670412,0.04213642,0.00018957717,0.00008602886,0.00019141019,0.00015846988,0.00008938984,0.014419561],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922705,0.00021658333,0.000028774246,0.00010743556,0.00028504714,0.00013505788],"domain_scores_gemma":[0.9975242,0.0015284817,0.00021853832,0.00017741845,0.0004353849,0.00011593485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011019161,0.0006887652,0.0007176638,0.0007164369,0.00074271346,0.0015538565,0.0020184433,0.0012700676,0.0034350976],"category_scores_gemma":[0.005358986,0.00033284377,0.00049144466,0.00087467814,0.0013238083,0.002604654,0.0012234137,0.0013788043,0.00041146018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000886521,0.00003182916,0.0004037392,0.000050515526,0.000010517947,0.00015506563,0.00011400341,0.8621359,0.0014726985,0.12458438,0.0016127405,0.009340041],"study_design_scores_gemma":[0.000004058773,0.000006637006,0.000023866316,0.0000018109714,0.0000024988046,0.000017510814,0.0000065427143,0.9933193,0.00011844474,0.0062482273,0.00024825506,0.00000293368],"about_ca_topic_score_codex":0.011105347,"about_ca_topic_score_gemma":0.0054049953,"teacher_disagreement_score":0.011105347,"about_ca_system_score_codex":0.0023821385,"about_ca_system_score_gemma":0.0012352566,"threshold_uncertainty_score":0.022081435},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011815001,0.0011108734,0.979543,0.00052499067,0.00013156548,0.00004400726,0.00014678841,0.00014077718,0.00654299],"genre_scores_gemma":[0.67255336,0.0045995708,0.2945954,0.0010314282,0.0014195238,0.00053490046,0.0006887024,0.00032876854,0.024248324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974414,0.0011379916,0.000096194504,0.0005548053,0.00052683486,0.00024268225],"domain_scores_gemma":[0.994719,0.0029941238,0.00073060684,0.0006394842,0.0005371382,0.0003795652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005344105,0.0011549911,0.0015561885,0.0030168032,0.0009468704,0.00283774,0.0030419827,0.0019480935,0.0070509715],"category_scores_gemma":[0.014887295,0.0005982022,0.002638745,0.0019095097,0.0027073284,0.004323177,0.0025174026,0.0039155562,0.0011842145],"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.000014606171,0.000013897966,0.00033069073,0.00005412534,0.000038304737,0.000090361085,0.00009958155,0.050621722,0.0005343355,0.94255865,0.0008480652,0.0047956766],"study_design_scores_gemma":[0.000011338219,0.000027964661,0.00022683684,0.000022503325,0.000019859874,0.00007542326,0.000051391395,0.40799457,0.00015758509,0.58757806,0.003811825,0.000022619472],"about_ca_topic_score_codex":0.0042640353,"about_ca_topic_score_gemma":0.0020301861,"teacher_disagreement_score":0.0070509715,"about_ca_system_score_codex":0.0024898814,"about_ca_system_score_gemma":0.0016767461,"threshold_uncertainty_score":0.028262675},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41994184,0.0023453995,0.56375176,0.0007607607,0.000046253866,0.00007410199,0.0002108969,0.00036356723,0.012505424],"genre_scores_gemma":[0.9931536,0.00034412465,0.0054254234,0.000040026807,0.000024333744,0.000036263293,0.00004528457,0.00001953916,0.00091133534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971008,0.0013868391,0.000070095666,0.00024677347,0.00080567633,0.00038982727],"domain_scores_gemma":[0.9820154,0.01388103,0.0013257003,0.00086919375,0.0017499896,0.00015874676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004411179,0.0013124332,0.0010961012,0.0008792996,0.00054681074,0.00122227,0.0010801768,0.0012406553,0.000890024],"category_scores_gemma":[0.021334402,0.0004957769,0.00037843222,0.00090654625,0.0019368633,0.0017583518,0.0017232226,0.00065730495,0.00026168686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007157145,0.000015515758,0.0006125997,0.000040206294,0.000027606859,0.00008626005,0.000085108695,0.98511803,0.0015972597,0.009184625,0.00012619644,0.003034999],"study_design_scores_gemma":[0.000008408582,0.00006894481,0.00036918916,0.0000093376275,0.000014105085,0.00006918654,0.000028485229,0.9936978,0.0010499217,0.0045518815,0.00011928398,0.000013509628],"about_ca_topic_score_codex":0.0035869651,"about_ca_topic_score_gemma":0.0015559366,"teacher_disagreement_score":0.004411179,"about_ca_system_score_codex":0.0018629318,"about_ca_system_score_gemma":0.0009749477,"threshold_uncertainty_score":0.023328781},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03684602,0.0011781098,0.95669436,0.00027415119,0.000049300437,0.000024964427,0.000039355244,0.0000791761,0.004814556],"genre_scores_gemma":[0.949508,0.0011981077,0.045902655,0.00010021774,0.000089725094,0.000060039223,0.000029814544,0.000014534992,0.0030969123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958605,0.00021356957,0.000010830691,0.000044611614,0.00009097896,0.000053950564],"domain_scores_gemma":[0.9994997,0.00029226218,0.000051261217,0.00003682596,0.00009592514,0.000024038965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006435847,0.000614793,0.00044729302,0.00026661842,0.0003054028,0.0006229152,0.0006267076,0.0007781664,0.00066690886],"category_scores_gemma":[0.0009675375,0.00021560914,0.00039247554,0.00048745808,0.00072529877,0.0007386386,0.0004811305,0.00046912808,0.00021487707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035818124,0.000021251592,0.00030667745,0.000039077666,0.000023458218,0.00013251841,0.0000578226,0.95227236,0.0033732434,0.035440132,0.00032241322,0.0079753455],"study_design_scores_gemma":[0.0000043516065,0.00002534703,0.000077390345,0.000002514926,0.0000070950314,0.000020256479,0.000016924292,0.9944305,0.00027920117,0.004862443,0.00026999446,0.0000040634804],"about_ca_topic_score_codex":0.0036259862,"about_ca_topic_score_gemma":0.0039082933,"teacher_disagreement_score":0.0036259862,"about_ca_system_score_codex":0.0008298292,"about_ca_system_score_gemma":0.00047549384,"threshold_uncertainty_score":0.007209778},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008855971,0.00031274615,0.98719877,0.00015654594,0.000038607377,0.000035308378,0.000044696077,0.00011267132,0.0032447143],"genre_scores_gemma":[0.7435369,0.0012495538,0.24449833,0.00035255786,0.00019176294,0.0005144234,0.00021954782,0.00011551827,0.0093214605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903095,0.00033650923,0.000041141615,0.00014268809,0.00031015795,0.0001386333],"domain_scores_gemma":[0.99874073,0.0005082683,0.000141632,0.00011257535,0.00045141415,0.000045281304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013023447,0.0010742684,0.00091163995,0.0004661066,0.00058314955,0.0014132351,0.0011191949,0.0013845209,0.0032428564],"category_scores_gemma":[0.002602596,0.00066681573,0.0005185352,0.00090227724,0.00054611923,0.0010909406,0.0011740302,0.00070798973,0.0012714087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026628518,0.00011110701,0.00094250706,0.00029749578,0.00015950901,0.0003191055,0.00039443444,0.7955394,0.043088242,0.04859221,0.0035711378,0.10671848],"study_design_scores_gemma":[0.00003182177,0.00017146081,0.00016818006,0.000024597462,0.000057313006,0.00016869568,0.000060944014,0.9845567,0.0041078883,0.008495473,0.0021278723,0.000029178802],"about_ca_topic_score_codex":0.0014335384,"about_ca_topic_score_gemma":0.0031725033,"teacher_disagreement_score":0.0032428564,"about_ca_system_score_codex":0.0007541476,"about_ca_system_score_gemma":0.0012412127,"threshold_uncertainty_score":0.010848403},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006697072,0.025447201,0.00037545894,0.016998615,0.9499254,0.000018126113,0.00005992726,0.00011727314,0.0069910893],"genre_scores_gemma":[0.0007942664,0.02865114,0.00021604353,0.012051452,0.93129706,0.000016917495,0.00007990806,0.00008340149,0.026809754],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982692,0.00020206168,0.00016361955,0.00029302976,0.00092123164,0.00015087693],"domain_scores_gemma":[0.9910424,0.002394976,0.00039215715,0.0003347215,0.0044140066,0.0014218177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002257439,0.0018450305,0.0016829089,0.0019714227,0.0012920826,0.005719859,0.0018927284,0.0056086346,0.035068236],"category_scores_gemma":[0.008855521,0.0005215063,0.001008637,0.0011459346,0.0012867919,0.0039723055,0.0011118355,0.008983798,0.026968112],"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.00003401826,0.000008625247,0.000016672326,0.00016904372,0.0000055599785,0.00004563173,0.000007523877,0.000026965943,0.00009558415,0.0006023978,0.981831,0.01715704],"study_design_scores_gemma":[0.000010037168,0.000024710736,0.00008413601,0.00017454878,0.000008738642,0.00013771467,0.000016789212,0.00006352209,0.00006594811,0.0005660928,0.99884087,0.000006780156],"about_ca_topic_score_codex":0.0011075035,"about_ca_topic_score_gemma":0.0018623121,"teacher_disagreement_score":0.035068236,"about_ca_system_score_codex":0.0012937308,"about_ca_system_score_gemma":0.0016545344,"threshold_uncertainty_score":0.117314935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3160126,0.0022369686,0.66183853,0.0008952372,0.000066988454,0.00007764071,0.0003635178,0.00035496624,0.018153623],"genre_scores_gemma":[0.991325,0.0004769599,0.006457919,0.0000563699,0.00003645983,0.00005421485,0.00008642746,0.00003029532,0.0014763084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975981,0.0010811462,0.000054469747,0.00018413334,0.0007496055,0.00033259258],"domain_scores_gemma":[0.9778901,0.017934754,0.0013722664,0.0009090408,0.0016274697,0.0002663575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004585879,0.001105237,0.0011993045,0.0011502551,0.0005242739,0.0015497428,0.0013323342,0.0012439514,0.0016633098],"category_scores_gemma":[0.018832337,0.00057020696,0.00047218287,0.0012364491,0.0024988544,0.0017793296,0.0013069658,0.0010168939,0.00031123628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001580483,0.00003807039,0.0010378958,0.00009790866,0.00004777128,0.00035330173,0.00017604492,0.9265945,0.0017604938,0.06508553,0.0006410223,0.0040093367],"study_design_scores_gemma":[0.000016774475,0.00002696856,0.00033173652,0.000011763852,0.000011690029,0.00008543286,0.000039064806,0.9836903,0.00048091038,0.01513767,0.00015465556,0.000013035984],"about_ca_topic_score_codex":0.002446925,"about_ca_topic_score_gemma":0.0010344622,"teacher_disagreement_score":0.004585879,"about_ca_system_score_codex":0.0030250624,"about_ca_system_score_gemma":0.0010588029,"threshold_uncertainty_score":0.024252713},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026914828,0.0007381527,0.96771127,0.0002032818,0.000030170451,0.000023688286,0.000019073306,0.000114984745,0.004244584],"genre_scores_gemma":[0.91676253,0.00053361,0.07786244,0.00006524731,0.000056979985,0.0000963947,0.000025309517,0.000036848243,0.0045606885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993279,0.00039305334,0.0000119688575,0.000062311716,0.0001404271,0.000064446416],"domain_scores_gemma":[0.9987841,0.0010076289,0.00006321204,0.000051479077,0.00007560723,0.000017941926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009696411,0.00047949923,0.0006734077,0.0002363453,0.0002547197,0.000777692,0.0005891001,0.00058617257,0.0012808436],"category_scores_gemma":[0.003227288,0.0003282377,0.00018017311,0.00046416017,0.0006637628,0.000976911,0.00055967196,0.0004743817,0.00029022008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077064375,0.000020087577,0.00022210198,0.000047293153,0.000015588072,0.00006767664,0.000046658755,0.93733484,0.0022207003,0.035201956,0.0006102023,0.024135826],"study_design_scores_gemma":[0.0000083688665,0.000015338848,0.000037644808,0.0000018850425,0.0000023766645,0.000013840709,0.000006142416,0.99192035,0.00030337533,0.0074348096,0.00025373328,0.0000021660794],"about_ca_topic_score_codex":0.0010437036,"about_ca_topic_score_gemma":0.0011064654,"teacher_disagreement_score":0.0012808436,"about_ca_system_score_codex":0.00058700395,"about_ca_system_score_gemma":0.00042983762,"threshold_uncertainty_score":0.005128026},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67404085,0.0009257226,0.31500027,0.001959295,0.00005256779,0.0000601231,0.00013851948,0.00017926963,0.0076434202],"genre_scores_gemma":[0.9930703,0.00025122098,0.0061330507,0.000032101496,0.000018144301,0.000020766112,0.000024515735,0.000014762387,0.0004351332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921775,0.00030671703,0.000021400101,0.00007050355,0.00020662116,0.00017690174],"domain_scores_gemma":[0.98293835,0.014754031,0.0009925544,0.00055287505,0.00052757165,0.00023468456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001878176,0.000509826,0.00043860526,0.0009717613,0.0005074537,0.0007225715,0.0007065897,0.0009630155,0.00074495416],"category_scores_gemma":[0.015806777,0.00031567816,0.00032885157,0.00072959193,0.0016279977,0.0024725078,0.000986816,0.00091095694,0.00007404149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051904775,0.000031188356,0.00090847816,0.000031200227,0.0000132266005,0.00006288336,0.000058006714,0.9694937,0.0022394988,0.023799285,0.00023471133,0.0030759736],"study_design_scores_gemma":[0.000003571831,0.000015857744,0.00028935613,0.0000031446448,0.0000035471355,0.000019223058,0.000018905583,0.99092215,0.00040127613,0.00825551,0.00006209807,0.00000520416],"about_ca_topic_score_codex":0.0054648826,"about_ca_topic_score_gemma":0.0026845846,"teacher_disagreement_score":0.0054648826,"about_ca_system_score_codex":0.001944369,"about_ca_system_score_gemma":0.0009710912,"threshold_uncertainty_score":0.014107406},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02373227,0.0022773878,0.96822315,0.00060416834,0.00014678785,0.00003284889,0.00004239266,0.00024581962,0.0046952516],"genre_scores_gemma":[0.77204573,0.004646691,0.21299392,0.00035410203,0.0005076788,0.00014996511,0.00011979888,0.000074249016,0.009107902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994449,0.00024553333,0.00002825,0.0000662441,0.00018563175,0.000029411683],"domain_scores_gemma":[0.9985876,0.0009048412,0.000112700305,0.000118994605,0.00024615537,0.00002962832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009661585,0.00035761643,0.00046939604,0.0002781092,0.00025903646,0.00079053466,0.00034926273,0.0006915158,0.0020948648],"category_scores_gemma":[0.0028650763,0.000313317,0.00013705544,0.0006796048,0.0006465061,0.0010371262,0.00039977388,0.00043170253,0.0008420728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035647562,0.000064582804,0.00105641,0.00040388206,0.00003999611,0.00035862674,0.00026780728,0.53947175,0.04060791,0.17975771,0.009541416,0.2280734],"study_design_scores_gemma":[0.000032544496,0.0001666255,0.000283094,0.00004261788,0.000013916035,0.00020528738,0.000038243797,0.92796284,0.0060943207,0.057763793,0.007370595,0.000026071697],"about_ca_topic_score_codex":0.0005582631,"about_ca_topic_score_gemma":0.00086415396,"teacher_disagreement_score":0.0020948648,"about_ca_system_score_codex":0.00050828606,"about_ca_system_score_gemma":0.00038578932,"threshold_uncertainty_score":0.007008016},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.624402,0.00080453086,0.364698,0.00023437111,0.000037477566,0.00007805246,0.00007309695,0.00013050863,0.009541989],"genre_scores_gemma":[0.99251586,0.00011588577,0.007005439,0.00000936106,0.0000035513635,0.000008804608,0.0000111775735,0.0000014808663,0.00032842773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975735,0.000091237256,0.000009629119,0.00001740118,0.00008003802,0.000044276796],"domain_scores_gemma":[0.9995883,0.00023028739,0.000052460124,0.000028278344,0.00008735741,0.0000133298745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047436886,0.00044179926,0.00028104841,0.00020238766,0.0003521667,0.00041442495,0.00029007372,0.00029312624,0.00030572762],"category_scores_gemma":[0.00089081685,0.000094921954,0.00026601308,0.00030203754,0.0002876993,0.00029929573,0.00031629726,0.00016004633,0.000071324546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001332491,0.000087802735,0.003989399,0.00012202043,0.000059199454,0.00071162585,0.0002128815,0.90350914,0.045783505,0.020741276,0.0004189815,0.024230942],"study_design_scores_gemma":[0.000006747888,0.00016071984,0.0004972531,0.0000043479317,0.000022520973,0.00014909828,0.00006420096,0.9895622,0.007116762,0.0020013393,0.0004042036,0.000010458852],"about_ca_topic_score_codex":0.00302812,"about_ca_topic_score_gemma":0.005711247,"teacher_disagreement_score":0.00302812,"about_ca_system_score_codex":0.0005100381,"about_ca_system_score_gemma":0.0004009232,"threshold_uncertainty_score":0.006021023},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.526331,0.00069547974,0.46790752,0.00014010949,0.000024521869,0.000024754461,0.00006119775,0.00013552632,0.0046799425],"genre_scores_gemma":[0.9837123,0.0002597519,0.015335561,0.0000118041335,0.000007336206,0.000009733522,0.000011965771,0.000003896482,0.0006475684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996506,0.00014593011,0.000018342747,0.00003308276,0.00011181841,0.00004028182],"domain_scores_gemma":[0.99880636,0.00080836355,0.00017875913,0.000085250926,0.00009558292,0.000025719708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065777026,0.0003793408,0.0004851024,0.00025214226,0.00021009211,0.00054727134,0.00042696117,0.00037703628,0.00050521165],"category_scores_gemma":[0.001735155,0.00019940261,0.00024654693,0.0004032128,0.0005156071,0.0007189165,0.00072747306,0.00030604782,0.00009050744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031540194,0.000042730382,0.0012277595,0.00017838097,0.000066777626,0.00057390006,0.0002883216,0.8404069,0.07466727,0.046763998,0.00022268105,0.03524588],"study_design_scores_gemma":[0.0000050932117,0.000059643746,0.00015340901,0.000004513351,0.000013151504,0.000050627972,0.000020215906,0.99039453,0.00606772,0.0030726579,0.00015124655,0.000007173462],"about_ca_topic_score_codex":0.00083583186,"about_ca_topic_score_gemma":0.0012126231,"teacher_disagreement_score":0.00083583186,"about_ca_system_score_codex":0.0005364643,"about_ca_system_score_gemma":0.0002730086,"threshold_uncertainty_score":0.0038924217},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031278655,0.0007533441,0.9643385,0.00015811459,0.000047621797,0.000047242866,0.000018026718,0.00012404923,0.0032343334],"genre_scores_gemma":[0.8506542,0.00084921654,0.1450145,0.0001186342,0.000056592,0.00020068735,0.00003908598,0.00006727161,0.0029998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939966,0.00021195112,0.000022366132,0.000083868,0.00020279213,0.00007930911],"domain_scores_gemma":[0.9991928,0.0004365809,0.00013580454,0.000030315849,0.0001735612,0.000031017014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012108997,0.0008281427,0.00042502457,0.00044863473,0.00033985768,0.0008170397,0.00079384143,0.0004913487,0.0009234568],"category_scores_gemma":[0.0018736342,0.0004741103,0.000341567,0.00045082605,0.00069126184,0.00073446054,0.0008024303,0.00058331824,0.00015868993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036143232,0.000022813998,0.000187486,0.00005123857,0.00002013839,0.000038012433,0.00003609329,0.9728448,0.0042437473,0.006660151,0.00021830632,0.015641188],"study_design_scores_gemma":[0.0000063015354,0.00004131657,0.000039845774,0.0000031920833,0.0000058732567,0.000009381697,0.0000064086435,0.99732375,0.0009406388,0.0013698391,0.00024984847,0.000003537286],"about_ca_topic_score_codex":0.0027329235,"about_ca_topic_score_gemma":0.00307662,"teacher_disagreement_score":0.0027329235,"about_ca_system_score_codex":0.0010118783,"about_ca_system_score_gemma":0.0011976132,"threshold_uncertainty_score":0.0073417425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053085882,0.00058356643,0.94136614,0.000215062,0.00004287602,0.000046914334,0.00011796614,0.00025498602,0.0042865677],"genre_scores_gemma":[0.94855,0.00057091325,0.047752544,0.00007613835,0.000044082477,0.000080681,0.0000832609,0.000024400953,0.0028179563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946195,0.00016947348,0.00001709801,0.00007787268,0.00019267554,0.00008086897],"domain_scores_gemma":[0.99900705,0.00047829698,0.00018530231,0.00011399173,0.00018441556,0.000030923064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006102473,0.0004951934,0.0006951241,0.00022185869,0.00031219705,0.00059024245,0.00063229835,0.00056972704,0.0011399406],"category_scores_gemma":[0.0016719111,0.0003067448,0.0003522062,0.00047260406,0.0009056708,0.000861478,0.00053994596,0.00058853754,0.0003482885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028869414,0.00008091066,0.0004470402,0.00014951482,0.000037989572,0.0002418665,0.00012574463,0.88698655,0.03158514,0.054144464,0.0015408957,0.024371108],"study_design_scores_gemma":[0.000012175722,0.000049984625,0.000082501145,0.0000041598614,0.000006457874,0.000036953457,0.000007440407,0.99421966,0.0021709136,0.0031433527,0.00025895046,0.000007488472],"about_ca_topic_score_codex":0.002931931,"about_ca_topic_score_gemma":0.0031771965,"teacher_disagreement_score":0.002931931,"about_ca_system_score_codex":0.0009573528,"about_ca_system_score_gemma":0.0007471424,"threshold_uncertainty_score":0.0069461465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062691905,0.0023562121,0.87479776,0.0061349166,0.0005972714,0.00008746799,0.0004616897,0.0004535489,0.05241923],"genre_scores_gemma":[0.9157862,0.0025975446,0.06997871,0.0010788132,0.00086516887,0.00023220095,0.0004512366,0.00014117385,0.00886886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813724,0.00055763964,0.00005931637,0.00034004968,0.0006450584,0.000260707],"domain_scores_gemma":[0.9942297,0.0031304937,0.00068302517,0.00094330497,0.00072061113,0.0002929111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015885624,0.0006571618,0.0008190797,0.001264466,0.0015358867,0.0028998111,0.0014308923,0.0021795148,0.004783044],"category_scores_gemma":[0.010359583,0.00035968554,0.0006457831,0.0022634217,0.00426067,0.0065728375,0.003052797,0.0028665548,0.00064572867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008355311,0.000022031885,0.00017520758,0.00008640208,0.00000898248,0.00007767111,0.00016863196,0.029132435,0.0009637847,0.9520088,0.0033389926,0.013933609],"study_design_scores_gemma":[0.000019101666,0.000042792173,0.00012237063,0.000035580248,0.000011946007,0.00015555997,0.00010244223,0.1266865,0.0014945042,0.8648018,0.0065048723,0.000022535958],"about_ca_topic_score_codex":0.0016138447,"about_ca_topic_score_gemma":0.00073766825,"teacher_disagreement_score":0.004783044,"about_ca_system_score_codex":0.0019789482,"about_ca_system_score_gemma":0.0012094773,"threshold_uncertainty_score":0.016000867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005560937,0.00017864219,0.99299735,0.00007923963,0.000016538906,0.000026806205,0.000021265561,0.00006284203,0.0010563175],"genre_scores_gemma":[0.5259717,0.0008247117,0.469509,0.00017906644,0.00012352245,0.0003281198,0.00014769312,0.00004614046,0.0028699774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892104,0.0005156346,0.000060796327,0.00016215461,0.000261792,0.00007859665],"domain_scores_gemma":[0.99823135,0.0010216964,0.00029901002,0.00014744811,0.00026811394,0.00003237094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013018226,0.001198036,0.0007190282,0.00038199426,0.00035189537,0.0005425649,0.0007989895,0.0009840933,0.0014479217],"category_scores_gemma":[0.0047796704,0.0005144145,0.00043973877,0.0004902511,0.0006405886,0.00095353264,0.0006012781,0.0007736731,0.00054684666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020490188,0.00009049713,0.00064962055,0.0002418729,0.00007762526,0.00014050744,0.00024430218,0.7902815,0.016939513,0.03995318,0.0013888566,0.14978771],"study_design_scores_gemma":[0.00003624521,0.00017738047,0.0002078203,0.000030190751,0.00003449862,0.00011292573,0.00002061868,0.9853092,0.004526368,0.007901378,0.0016217005,0.000021754915],"about_ca_topic_score_codex":0.0010328739,"about_ca_topic_score_gemma":0.0012324689,"teacher_disagreement_score":0.0014479217,"about_ca_system_score_codex":0.00056718837,"about_ca_system_score_gemma":0.00090189563,"threshold_uncertainty_score":0.0068848133},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010119638,0.0002485193,0.9842971,0.00009377352,0.0000284,0.00006430378,0.00013818826,0.00009633993,0.0049136924],"genre_scores_gemma":[0.6773361,0.0016981707,0.31299964,0.0004510215,0.00017098391,0.00037249783,0.000465379,0.00008599949,0.0064202677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994566,0.00016177633,0.000031283394,0.00010592305,0.00017618747,0.000068197834],"domain_scores_gemma":[0.998816,0.0005594792,0.00017048421,0.00019703923,0.00020842397,0.000048675753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006821456,0.0008385753,0.00065960834,0.00053848146,0.00034386013,0.00072298694,0.00088298786,0.00068274647,0.0018159576],"category_scores_gemma":[0.0024439413,0.00023074463,0.00046379195,0.00053502066,0.0006733256,0.0014438619,0.0007472596,0.00094522897,0.0004883366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117240015,0.00007090319,0.00045768436,0.00020642854,0.000051850388,0.00035854356,0.0003176376,0.31077337,0.01805569,0.57726914,0.003668355,0.0886533],"study_design_scores_gemma":[0.000027376242,0.00014993199,0.0002134932,0.00003900962,0.000022866292,0.00045768716,0.000042233714,0.7439167,0.003954679,0.24253604,0.008604482,0.000035399527],"about_ca_topic_score_codex":0.00079529214,"about_ca_topic_score_gemma":0.00084836694,"teacher_disagreement_score":0.0018159576,"about_ca_system_score_codex":0.00057938165,"about_ca_system_score_gemma":0.00065659493,"threshold_uncertainty_score":0.006074965},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027929667,0.00034195086,0.9700684,0.0001015952,0.000042565705,0.000029540412,0.000025835927,0.00012378134,0.0013367939],"genre_scores_gemma":[0.89059037,0.0003952673,0.107355714,0.000062641135,0.000039403712,0.00006656715,0.00006258601,0.00003618061,0.0013913437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966466,0.000110957626,0.000017277158,0.00006057815,0.00009031491,0.000056226567],"domain_scores_gemma":[0.9992237,0.00041588378,0.00010159865,0.00005837564,0.00015822388,0.000042183117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007974097,0.00052691635,0.00057567516,0.0003328298,0.00053284195,0.00063853414,0.0010715032,0.00037789217,0.00095486135],"category_scores_gemma":[0.0019506754,0.00021598978,0.00027601127,0.00069404446,0.0004228276,0.0009870365,0.00057962054,0.00065272726,0.00017282827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009727686,0.00007534104,0.0004404874,0.00007715602,0.000025683174,0.00007297647,0.00013647106,0.9146382,0.009607944,0.027839754,0.0013705029,0.04561814],"study_design_scores_gemma":[0.0000048374213,0.000022449067,0.000034049197,0.0000014203179,0.0000030135996,0.0000084231215,0.000007254831,0.9976476,0.0004646328,0.0015719561,0.00023142634,0.000003017551],"about_ca_topic_score_codex":0.0052433186,"about_ca_topic_score_gemma":0.0072858036,"teacher_disagreement_score":0.0052433186,"about_ca_system_score_codex":0.0010752053,"about_ca_system_score_gemma":0.0016066686,"threshold_uncertainty_score":0.010425627},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015125405,0.00067994226,0.97848266,0.00019318218,0.00009972828,0.00009927508,0.00007209642,0.00032573464,0.004921971],"genre_scores_gemma":[0.7547442,0.0011955447,0.23610137,0.00020243933,0.00009062613,0.00027979448,0.00014396707,0.000048120986,0.0071938904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999483,0.00016540183,0.000028597999,0.000045119956,0.00020124823,0.000076655364],"domain_scores_gemma":[0.99894565,0.0003132544,0.000103048435,0.0001725396,0.0004203496,0.000045190543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007140345,0.00061655656,0.0004941113,0.0005821599,0.00069886283,0.0005291046,0.0008872882,0.0008047026,0.0012269795],"category_scores_gemma":[0.0024390668,0.00019509438,0.0004149604,0.00089770276,0.00079857203,0.00087865716,0.0007929164,0.00057212624,0.00053965196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004576399,0.000092944865,0.0007317362,0.00036625683,0.00009495527,0.000884529,0.0004144726,0.43602708,0.06182526,0.182084,0.0066442825,0.3103769],"study_design_scores_gemma":[0.000048660564,0.00021324675,0.0001593642,0.000036522877,0.00005659364,0.0005721588,0.00003182221,0.9529341,0.015350809,0.022096334,0.008423101,0.000077293946],"about_ca_topic_score_codex":0.0025092163,"about_ca_topic_score_gemma":0.0029305373,"teacher_disagreement_score":0.0025092163,"about_ca_system_score_codex":0.0005807816,"about_ca_system_score_gemma":0.001328207,"threshold_uncertainty_score":0.0049892664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18650165,0.0033422478,0.7881413,0.0009469855,0.00010616801,0.00007803011,0.00004227851,0.00006880763,0.020772584],"genre_scores_gemma":[0.96856993,0.0029795307,0.025482459,0.00019248427,0.0001431897,0.000103277016,0.000027877095,0.000031505067,0.0024697022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983834,0.0009007688,0.000034143788,0.00012341456,0.0003491762,0.00020907751],"domain_scores_gemma":[0.99334925,0.0052818367,0.0004712472,0.0003113996,0.00046582092,0.000120316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022278437,0.0007480415,0.00064226147,0.00052409555,0.00063191156,0.00094950065,0.0009140265,0.0009025532,0.00094564166],"category_scores_gemma":[0.0070518856,0.00026384386,0.0003795262,0.00076913537,0.002608383,0.002155738,0.0013707797,0.000759916,0.0002770004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011917747,0.00006695114,0.0014347011,0.00022908265,0.00007696907,0.00053468306,0.00060720573,0.60685706,0.007984782,0.3636224,0.00111187,0.017355125],"study_design_scores_gemma":[0.000023846498,0.00022831907,0.00048632172,0.00004333108,0.000038439768,0.00034001083,0.00017335972,0.8420926,0.0018859205,0.1526755,0.001978938,0.000033509827],"about_ca_topic_score_codex":0.0007029186,"about_ca_topic_score_gemma":0.00046130168,"teacher_disagreement_score":0.0022278437,"about_ca_system_score_codex":0.00081530464,"about_ca_system_score_gemma":0.0005268787,"threshold_uncertainty_score":0.01178211},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007983525,0.00075797533,0.9844914,0.0001902618,0.000027731057,0.000044517805,0.000016852686,0.00007047197,0.006417225],"genre_scores_gemma":[0.670461,0.0024353785,0.31433874,0.00022947097,0.00013647354,0.00032268694,0.00007464283,0.00014233291,0.011859313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989041,0.0006845703,0.00002861812,0.000113655005,0.0002007019,0.000068399444],"domain_scores_gemma":[0.9985409,0.0011714573,0.000098972734,0.000050071343,0.000121058605,0.000017616014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001670421,0.001954596,0.0010873812,0.00054055103,0.00031286242,0.0014071019,0.00089995906,0.0015949064,0.0021174133],"category_scores_gemma":[0.0037133726,0.0006121779,0.0008897713,0.0008681133,0.0014362404,0.0011065596,0.0011235318,0.0010636953,0.0007819814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011797473,0.000056304416,0.00012968077,0.000252982,0.00008193346,0.00010349846,0.00013386353,0.9287007,0.006138093,0.039103836,0.000982835,0.024198316],"study_design_scores_gemma":[0.000017423743,0.000102024664,0.000063707696,0.000019138393,0.00001548013,0.000041087893,0.000022601715,0.9825204,0.0021106591,0.014064547,0.0010103727,0.000012448079],"about_ca_topic_score_codex":0.0007810839,"about_ca_topic_score_gemma":0.0006253014,"teacher_disagreement_score":0.0021174133,"about_ca_system_score_codex":0.0010709924,"about_ca_system_score_gemma":0.00048037714,"threshold_uncertainty_score":0.008834124},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0878781,0.0008161555,0.89427155,0.00092648226,0.00028895747,0.0003166257,0.00014635609,0.0014536888,0.013902046],"genre_scores_gemma":[0.90046144,0.0002688855,0.09138117,0.0002418593,0.00006493584,0.00016602612,0.00013584025,0.000028867664,0.007250969],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994098,0.00016790708,0.000041781113,0.00007276902,0.00023468719,0.000072978204],"domain_scores_gemma":[0.9990068,0.0002592907,0.00013150844,0.00021302528,0.0003580478,0.000031359563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005802341,0.00029504177,0.00025482025,0.0003614815,0.00048589308,0.000400307,0.00057539897,0.00043021698,0.0017287659],"category_scores_gemma":[0.0015537085,0.000104764935,0.00015486167,0.0003536157,0.0003249305,0.0011042011,0.000700361,0.00054539304,0.0005122132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010534555,0.00028905013,0.0031576632,0.00051779643,0.00007987885,0.0011794145,0.00078784465,0.07014019,0.38854337,0.16277678,0.022031123,0.3494434],"study_design_scores_gemma":[0.00009726694,0.00046849367,0.0012969407,0.00007633586,0.00008886738,0.0012968641,0.00009481904,0.77872807,0.16404523,0.014620267,0.03910391,0.00008299379],"about_ca_topic_score_codex":0.0012236043,"about_ca_topic_score_gemma":0.0013540921,"teacher_disagreement_score":0.0017287659,"about_ca_system_score_codex":0.0008105696,"about_ca_system_score_gemma":0.00072796055,"threshold_uncertainty_score":0.005881071},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10613638,0.00027354684,0.8902883,0.00015221283,0.00001354693,0.00004541582,0.000065382446,0.00015031158,0.0028748831],"genre_scores_gemma":[0.87009686,0.000309038,0.12709206,0.000034708784,0.000019251753,0.00014353721,0.000053230822,0.000027757656,0.002223502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995908,0.00020721758,0.000018124818,0.00005597247,0.00007184321,0.000056050565],"domain_scores_gemma":[0.99919754,0.00059674645,0.000059643688,0.000054602675,0.000068381174,0.000023028335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008019583,0.0005723226,0.00067162886,0.0003266864,0.00030697678,0.0005343439,0.0006104652,0.0004991309,0.0008755974],"category_scores_gemma":[0.0026335195,0.00029856953,0.00020280627,0.00043820348,0.000607686,0.00087715144,0.0006406753,0.0002954412,0.00021579217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013577496,0.000034291752,0.00024422744,0.000045320925,0.000013939906,0.00011376969,0.00016491201,0.92995894,0.0061530275,0.027780233,0.00058701343,0.034768477],"study_design_scores_gemma":[0.000023479357,0.00003995638,0.00007475856,0.0000035886158,0.000008725049,0.00003629282,0.000026054497,0.9819728,0.0027012376,0.014722133,0.00038458453,0.000006355968],"about_ca_topic_score_codex":0.0015141302,"about_ca_topic_score_gemma":0.0017456723,"teacher_disagreement_score":0.0015141302,"about_ca_system_score_codex":0.00062022154,"about_ca_system_score_gemma":0.0005141581,"threshold_uncertainty_score":0.0045000315},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009011498,0.0005747062,0.98823684,0.00014819407,0.000028493747,0.000031772586,0.00006148672,0.00018355492,0.0017233888],"genre_scores_gemma":[0.60445017,0.0013436843,0.38879398,0.00020415874,0.0000904937,0.00019705169,0.0002663771,0.00005160106,0.00460247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878305,0.0005135166,0.0000645249,0.00013865379,0.00039202505,0.0001081954],"domain_scores_gemma":[0.9972453,0.0017944645,0.0002583999,0.00028538372,0.000374062,0.00004224551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001870433,0.0009076275,0.0010608849,0.0006137988,0.00032155763,0.0012914219,0.0012069409,0.0012430808,0.0017509635],"category_scores_gemma":[0.0063494756,0.00058238965,0.0005380187,0.00073217007,0.00080996926,0.0017582738,0.0011067848,0.0013148873,0.0006690928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002974673,0.00006068984,0.00057026505,0.0001715062,0.000059265705,0.00023768916,0.00018960792,0.82286924,0.008348523,0.0864678,0.0020668912,0.0786611],"study_design_scores_gemma":[0.000016561802,0.000031633015,0.000081850114,0.000008589528,0.0000074852915,0.00006658131,0.000007889278,0.98778605,0.0014038987,0.009661142,0.0009138624,0.000014410374],"about_ca_topic_score_codex":0.001467852,"about_ca_topic_score_gemma":0.0016617397,"teacher_disagreement_score":0.001870433,"about_ca_system_score_codex":0.0011509965,"about_ca_system_score_gemma":0.0014727862,"threshold_uncertainty_score":0.009891927},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1683077,0.0019451665,0.8153323,0.0002788651,0.000083993255,0.00008897756,0.00025184895,0.0009670067,0.012744135],"genre_scores_gemma":[0.9467727,0.00058814173,0.05087191,0.00009582745,0.000021817777,0.000036425245,0.00009603953,0.000009710513,0.0015074566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996604,0.00013954398,0.000021344606,0.000054576412,0.000067506866,0.00005673983],"domain_scores_gemma":[0.9996983,0.00006449533,0.00004675117,0.00008476329,0.00008739685,0.000018449151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003709688,0.0006156531,0.00038521894,0.00023280155,0.0002932006,0.00038646403,0.0006342427,0.00047801493,0.0010644596],"category_scores_gemma":[0.0006550758,0.00014110438,0.00026275087,0.00036322334,0.0002613303,0.00040855125,0.00042602708,0.00021228757,0.0004866405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001025477,0.00014590884,0.0067155464,0.00034800157,0.00018048137,0.0012507869,0.00039139055,0.39274958,0.2224798,0.07851602,0.006790534,0.2894064],"study_design_scores_gemma":[0.000078287296,0.00090097176,0.0016999707,0.000026250784,0.00013373447,0.0024504864,0.00013358546,0.9231628,0.04640656,0.007993655,0.016919743,0.000093904804],"about_ca_topic_score_codex":0.0016694623,"about_ca_topic_score_gemma":0.0028866492,"teacher_disagreement_score":0.0016694623,"about_ca_system_score_codex":0.0002713716,"about_ca_system_score_gemma":0.00039107352,"threshold_uncertainty_score":0.0035609603},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9381083,0.00074460177,0.05460137,0.0002446689,0.000028972516,0.00003764686,0.00010168472,0.00012906051,0.006003694],"genre_scores_gemma":[0.9972306,0.00015467177,0.0022106394,0.000017837714,0.0000065981676,0.000008669464,0.00002484401,0.0000053484264,0.0003407291],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984017,0.0007121301,0.000083867235,0.00015604547,0.000328821,0.0003173207],"domain_scores_gemma":[0.98557067,0.010341652,0.0014703139,0.00076085224,0.0015819044,0.00027469252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029832714,0.0011640037,0.0007776475,0.0006201861,0.00056757935,0.0010356407,0.0012914472,0.0009930042,0.0006472492],"category_scores_gemma":[0.010936662,0.00025577174,0.0003339887,0.0007220175,0.0014286342,0.0015355137,0.00092960376,0.00042265654,0.00015753116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007905606,0.000094768206,0.0034651367,0.00018251725,0.000091175774,0.0008352576,0.00026677185,0.94951147,0.021641467,0.009374862,0.00029192388,0.013454105],"study_design_scores_gemma":[0.00003240201,0.00052365114,0.0017793113,0.00001453965,0.00006198182,0.00041815653,0.00015097312,0.98182034,0.010082274,0.0049372083,0.00014653806,0.00003264182],"about_ca_topic_score_codex":0.0030200174,"about_ca_topic_score_gemma":0.004104277,"teacher_disagreement_score":0.0030200174,"about_ca_system_score_codex":0.0011679884,"about_ca_system_score_gemma":0.000733747,"threshold_uncertainty_score":0.01577723},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09798401,0.0002825312,0.8921921,0.00085962244,0.0001297915,0.0001704259,0.000017903805,0.00019153314,0.0081721],"genre_scores_gemma":[0.9055683,0.00013390962,0.09159231,0.00014319377,0.00004908664,0.00013310088,0.000009215387,0.000026770458,0.002344124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977087,0.0015314678,0.00006779892,0.00014894137,0.00035468547,0.00018847967],"domain_scores_gemma":[0.99646026,0.002101372,0.00046897942,0.00032316387,0.00037364668,0.00027257696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005183567,0.00053850043,0.0007405621,0.00058346224,0.00072067045,0.0015924635,0.001652045,0.0015159335,0.0024544962],"category_scores_gemma":[0.01023784,0.00039401557,0.0004692468,0.00054295757,0.002241254,0.0027315996,0.0018233297,0.001207758,0.00029188942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042874907,0.00017295394,0.0011379767,0.0001411687,0.00006600562,0.00038009736,0.00040861045,0.3367972,0.0100480635,0.60976344,0.0022749866,0.038380757],"study_design_scores_gemma":[0.00014483566,0.00021479922,0.00014913868,0.000019295514,0.000026606134,0.00015460138,0.00008058298,0.7944254,0.0027867677,0.19921984,0.0027498063,0.000028245395],"about_ca_topic_score_codex":0.00042675246,"about_ca_topic_score_gemma":0.000275496,"teacher_disagreement_score":0.005183567,"about_ca_system_score_codex":0.00070355326,"about_ca_system_score_gemma":0.0010086442,"threshold_uncertainty_score":0.027413607},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018155644,0.009142525,0.9543585,0.0006908893,0.0005189862,0.000028167173,0.000118081516,0.00016124938,0.016825901],"genre_scores_gemma":[0.6960685,0.013368497,0.2721614,0.00069025875,0.0014946632,0.00014372467,0.00029056033,0.00007708655,0.015705235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994392,0.00017647768,0.000018338853,0.00009007832,0.00018139541,0.000094387586],"domain_scores_gemma":[0.99917644,0.0004284217,0.00006134244,0.0001305271,0.00016671441,0.00003649309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071158254,0.00071635353,0.0006069394,0.0006930174,0.00034191448,0.0011281655,0.0005871763,0.00067493145,0.0014684973],"category_scores_gemma":[0.001596039,0.0003082017,0.00046663583,0.0013671429,0.0006554217,0.0011261362,0.0012240474,0.0012071553,0.0005383224],"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.00022408426,0.000074998716,0.0016877329,0.00035542945,0.00020191244,0.00075336965,0.00026585752,0.30030128,0.038206976,0.43238735,0.0087326495,0.21680835],"study_design_scores_gemma":[0.00002720154,0.00008253376,0.00086937915,0.000053226402,0.00005981045,0.00060207275,0.00006766845,0.86673516,0.0050724633,0.11389351,0.012489176,0.000047703787],"about_ca_topic_score_codex":0.0008427873,"about_ca_topic_score_gemma":0.0011458101,"teacher_disagreement_score":0.0014684973,"about_ca_system_score_codex":0.0005747172,"about_ca_system_score_gemma":0.00043650746,"threshold_uncertainty_score":0.0049126744},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4504377,0.0023803525,0.540353,0.0002921694,0.000024550405,0.000050793853,0.00009094846,0.00012348988,0.0062470003],"genre_scores_gemma":[0.9785622,0.00042805547,0.020277137,0.00002866382,0.000008446063,0.00002176025,0.000017016991,0.0000041925,0.00065257255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941206,0.00024241731,0.00002720638,0.00007968248,0.0001401053,0.00009863921],"domain_scores_gemma":[0.9981426,0.0013088123,0.00020738973,0.00013529616,0.00017654464,0.000029317946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010012358,0.0006300518,0.0005310838,0.00050444074,0.00048702824,0.00070121617,0.0005697425,0.00069240277,0.0002714495],"category_scores_gemma":[0.0027357463,0.00026320972,0.00028643652,0.0005135297,0.0005830578,0.0011276568,0.0005959149,0.00031992077,0.00010791941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027479397,0.000059260165,0.0031956665,0.00019564503,0.000079175385,0.0010432753,0.00042941765,0.8497619,0.038898144,0.052567333,0.00038136216,0.053114012],"study_design_scores_gemma":[0.000018284343,0.00018436725,0.0007673091,0.000017817796,0.00004217072,0.00035629136,0.00010156172,0.9737912,0.0066055404,0.017296733,0.00079674035,0.00002199151],"about_ca_topic_score_codex":0.0015027749,"about_ca_topic_score_gemma":0.0023616112,"teacher_disagreement_score":0.0015027749,"about_ca_system_score_codex":0.0007835557,"about_ca_system_score_gemma":0.00028713865,"threshold_uncertainty_score":0.0056851506},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055584256,0.00007419615,0.94193697,0.00020658787,0.00001695128,0.000070136455,0.000031937245,0.000075860604,0.0020031184],"genre_scores_gemma":[0.9494688,0.000091286514,0.048067655,0.00009360759,0.000019829684,0.00013745207,0.000030247505,0.000013978002,0.002077178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850273,0.0006368037,0.000049769747,0.00029181733,0.0003181962,0.00020077496],"domain_scores_gemma":[0.9974699,0.0016154612,0.00041655716,0.00012842941,0.00019833042,0.00017134842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016323538,0.0008379966,0.001127197,0.00038640198,0.00045667923,0.00083148654,0.001602513,0.0010567291,0.0008263497],"category_scores_gemma":[0.0041823788,0.00037649463,0.0004679996,0.00051109394,0.001630402,0.0012811275,0.0012470251,0.0010377849,0.00012678743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011628632,0.00006703917,0.0004507689,0.000043253945,0.00004276768,0.00011495576,0.0000839318,0.966241,0.0020018122,0.019417616,0.00027303773,0.011147439],"study_design_scores_gemma":[0.000020982645,0.00004115249,0.000093984076,0.0000028707143,0.000007699366,0.00002405259,0.000009380915,0.9940037,0.0003934098,0.0052678427,0.00012719745,0.00000762335],"about_ca_topic_score_codex":0.0024558415,"about_ca_topic_score_gemma":0.0020061638,"teacher_disagreement_score":0.0024558415,"about_ca_system_score_codex":0.0011991011,"about_ca_system_score_gemma":0.0012347815,"threshold_uncertainty_score":0.008700073},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17283048,0.002829265,0.7997632,0.00042237842,0.000096091535,0.00004876267,0.000103831175,0.00043120264,0.02347488],"genre_scores_gemma":[0.97971755,0.0006952887,0.017105823,0.000069712085,0.000055787594,0.000039673807,0.000033675602,0.000033770444,0.0022487515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985909,0.00060449727,0.000028243365,0.00012569096,0.0004160291,0.00023460093],"domain_scores_gemma":[0.9963503,0.0025386098,0.00043701156,0.0002696451,0.00033970122,0.000064751555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012086952,0.0010976436,0.0009402363,0.0004910497,0.00039835888,0.0013225544,0.00063590746,0.00088342035,0.0025285375],"category_scores_gemma":[0.0031450118,0.00035120096,0.0007390449,0.0008976442,0.0010421969,0.0012083965,0.00091028726,0.0008372822,0.0005802645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011569738,0.000020261814,0.00034657767,0.000055512584,0.00006828281,0.00015884332,0.00004844609,0.9652905,0.0073712673,0.016596688,0.00037965752,0.009548194],"study_design_scores_gemma":[0.000009994668,0.000086067004,0.00022995214,0.000009848221,0.000030509314,0.00010624552,0.000016643608,0.98837376,0.0033509172,0.0072607026,0.00051088224,0.000014473601],"about_ca_topic_score_codex":0.00087224244,"about_ca_topic_score_gemma":0.00055198936,"teacher_disagreement_score":0.0025285375,"about_ca_system_score_codex":0.0010026657,"about_ca_system_score_gemma":0.00033305262,"threshold_uncertainty_score":0.008458853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011868293,0.00055283826,0.98595923,0.00005997541,0.000027550443,0.000037963127,0.000010048555,0.00017170899,0.0013123848],"genre_scores_gemma":[0.6949143,0.0005582341,0.30253148,0.00013185732,0.00008341515,0.0001100872,0.00002923387,0.000021592532,0.0016197474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992004,0.00030970384,0.000040518873,0.00012158474,0.00023768749,0.00009018159],"domain_scores_gemma":[0.9991487,0.00042862803,0.00013953548,0.00015579986,0.000097109456,0.00003018055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071374397,0.00079237565,0.0006350838,0.00051810837,0.0005390718,0.00080444955,0.0015097859,0.0007301032,0.0013975538],"category_scores_gemma":[0.0026221666,0.00025126463,0.00038744623,0.0006027656,0.00049967814,0.0010925807,0.0010227984,0.000881028,0.0003651534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003748744,0.00023705245,0.00044843252,0.00033792277,0.00013333031,0.00027085797,0.00038598396,0.43563557,0.03706083,0.07073575,0.0017958612,0.45258355],"study_design_scores_gemma":[0.00007447901,0.00020668835,0.00022082853,0.000019051928,0.000050765815,0.0002927244,0.000033593347,0.9624239,0.009821642,0.024052415,0.0027644401,0.00003941478],"about_ca_topic_score_codex":0.00042489046,"about_ca_topic_score_gemma":0.00066028634,"teacher_disagreement_score":0.0015097859,"about_ca_system_score_codex":0.00041871844,"about_ca_system_score_gemma":0.00037635435,"threshold_uncertainty_score":0.004675269},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015390394,0.0012049095,0.9801782,0.0001683239,0.00006481855,0.00004687926,0.000017158887,0.00022768031,0.0027016778],"genre_scores_gemma":[0.914465,0.0011994952,0.08109452,0.00011330558,0.00007245363,0.00018263962,0.00006300237,0.000036463254,0.0027731068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919134,0.00026775518,0.00003065982,0.00010093355,0.00033683423,0.00007246097],"domain_scores_gemma":[0.99881184,0.00069131947,0.000111091045,0.0000732907,0.00028538174,0.000027032635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010901329,0.00048318514,0.0005604428,0.00087923295,0.0006185816,0.0006153766,0.0013013373,0.0006258857,0.0006219222],"category_scores_gemma":[0.0032227477,0.00020399822,0.00038245574,0.0011025388,0.0008515234,0.00054259546,0.0005163572,0.0005634559,0.00017466971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010281643,0.000057229077,0.00033757993,0.00018850194,0.000057499936,0.000104920735,0.0002535572,0.85858375,0.013426768,0.057471078,0.0022917856,0.06712451],"study_design_scores_gemma":[0.0000104183855,0.000059852147,0.00010269299,0.000008848143,0.000011561294,0.000030182182,0.000016379638,0.99211264,0.0009603081,0.005658161,0.0010170505,0.000011808393],"about_ca_topic_score_codex":0.008360473,"about_ca_topic_score_gemma":0.0071768,"teacher_disagreement_score":0.008360473,"about_ca_system_score_codex":0.0012069381,"about_ca_system_score_gemma":0.0011290852,"threshold_uncertainty_score":0.016623616},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04449053,0.0013403937,0.9487903,0.00057085854,0.000056871108,0.000054029093,0.00006125575,0.00013814666,0.0044975714],"genre_scores_gemma":[0.86173487,0.00095203164,0.13317798,0.00012217202,0.000055504166,0.000119796314,0.00006588248,0.000054897457,0.003716949],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994405,0.00025370126,0.000015469368,0.00010953719,0.00010159714,0.0000791801],"domain_scores_gemma":[0.99907994,0.0006462135,0.00013276185,0.000037684942,0.00007342792,0.000029857989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015443205,0.0013484117,0.0010610936,0.00049950485,0.00073054375,0.0010651042,0.0010277858,0.0011513815,0.0012566359],"category_scores_gemma":[0.0022197508,0.0004981834,0.00041001767,0.0008852822,0.0011177757,0.0016677505,0.00094630447,0.0008140928,0.00015204477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004423042,0.000014786383,0.00011088583,0.00004166956,0.0000121161875,0.000042537275,0.000026807615,0.981454,0.0006139989,0.010735664,0.00022273703,0.0066805943],"study_design_scores_gemma":[0.0000062697127,0.000012731519,0.000023994919,0.0000022863348,0.0000032462106,0.000007344746,0.000007456333,0.99631065,0.0002442862,0.0031981925,0.00018082882,0.0000027449391],"about_ca_topic_score_codex":0.0064583384,"about_ca_topic_score_gemma":0.0042993985,"teacher_disagreement_score":0.0064583384,"about_ca_system_score_codex":0.0019140817,"about_ca_system_score_gemma":0.0010411518,"threshold_uncertainty_score":0.013887703},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47304448,0.0032284134,0.4979736,0.0016679291,0.00010023077,0.000047918697,0.00004122373,0.00015169739,0.023744557],"genre_scores_gemma":[0.98996335,0.00044862836,0.008422125,0.000049570786,0.000036618683,0.00001573842,0.000009060406,0.00001026659,0.0010446203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995437,0.0002064939,0.000007958207,0.000039541286,0.00011272905,0.00008946837],"domain_scores_gemma":[0.99611485,0.0032271056,0.00017137759,0.00015379823,0.00025897118,0.00007387629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011717734,0.00040669675,0.0003638668,0.00038813343,0.0004628923,0.000647826,0.0006391768,0.0006864729,0.0011125591],"category_scores_gemma":[0.0063070864,0.00021633563,0.00020568671,0.0005270821,0.0008979329,0.001565621,0.0009271345,0.00051046174,0.00012841396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004953799,0.00012805851,0.0013863797,0.00016462339,0.000063113,0.0002833646,0.0003976107,0.79435295,0.01309423,0.1270223,0.0012337533,0.06137824],"study_design_scores_gemma":[0.0000345253,0.00018036629,0.00040962268,0.000011948122,0.000027348977,0.00008630843,0.00016610623,0.9656542,0.0019087583,0.030359352,0.0011510084,0.000010547972],"about_ca_topic_score_codex":0.0021623322,"about_ca_topic_score_gemma":0.0017855545,"teacher_disagreement_score":0.0021623322,"about_ca_system_score_codex":0.00071402115,"about_ca_system_score_gemma":0.00040570582,"threshold_uncertainty_score":0.0061969757},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13416442,0.00074102415,0.859584,0.00015972964,0.000035581474,0.000035244495,0.000051076328,0.0002606765,0.0049682753],"genre_scores_gemma":[0.9785014,0.0003052285,0.019961558,0.000027402117,0.00002091244,0.000029842085,0.00004313594,0.000039012204,0.0010714678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896276,0.00034548764,0.000034473018,0.00007166317,0.0004427827,0.00014290224],"domain_scores_gemma":[0.9964856,0.002242721,0.00030661086,0.0003332123,0.0005682643,0.000063580366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016962594,0.00086261233,0.00085532997,0.0007675707,0.00028481105,0.0009895783,0.0008005439,0.00087685516,0.0008970231],"category_scores_gemma":[0.0069018668,0.00024424656,0.00054773665,0.00080390775,0.0012678795,0.0014669724,0.0008503088,0.0007903761,0.0002144859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040523806,0.000011024251,0.00028396634,0.000028388442,0.000018319084,0.00006347134,0.000041770432,0.9743033,0.0032010274,0.016144127,0.00012022287,0.0057438244],"study_design_scores_gemma":[0.0000018920683,0.000016163196,0.00008673234,0.0000020609116,0.0000024354024,0.000024783909,0.0000048940833,0.99724704,0.0005315308,0.0020262771,0.000051192725,0.000004928335],"about_ca_topic_score_codex":0.0024248427,"about_ca_topic_score_gemma":0.0011791459,"teacher_disagreement_score":0.0024248427,"about_ca_system_score_codex":0.0015159306,"about_ca_system_score_gemma":0.0011768742,"threshold_uncertainty_score":0.010998845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0098602455,0.00027726707,0.9883416,0.00007724308,0.000012164572,0.00001644649,0.000026601305,0.000059770857,0.0013285758],"genre_scores_gemma":[0.8676715,0.00077350566,0.12794791,0.00008114796,0.000059796595,0.00019407162,0.00011296587,0.00005860609,0.003100466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992434,0.00031614947,0.00003585018,0.00013769777,0.00020288014,0.00006408527],"domain_scores_gemma":[0.9988715,0.00076792546,0.00016925292,0.00006785419,0.00010187685,0.000021579415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013519182,0.0011066076,0.0009912635,0.00039188896,0.0002830035,0.0010305253,0.0006223551,0.0010132032,0.00088264246],"category_scores_gemma":[0.0027433531,0.00050887826,0.00052696356,0.0006398918,0.000748561,0.0009908666,0.0008770825,0.00075190945,0.0002517003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016645252,0.00000935213,0.00009175211,0.000034980385,0.000017545715,0.00004850926,0.00003325796,0.9825812,0.0011490554,0.0070798276,0.00015242449,0.008785427],"study_design_scores_gemma":[0.000004379633,0.000030218574,0.00005337674,0.000002846709,0.0000049869286,0.000013900273,0.000007295217,0.9957873,0.0004256385,0.003452851,0.00021307512,0.000004048274],"about_ca_topic_score_codex":0.001539594,"about_ca_topic_score_gemma":0.0012055197,"teacher_disagreement_score":0.001539594,"about_ca_system_score_codex":0.0007526198,"about_ca_system_score_gemma":0.0008059012,"threshold_uncertainty_score":0.007149756},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18118994,0.0043821605,0.8007336,0.00062379235,0.00006769733,0.000046369067,0.00009400646,0.00043647847,0.012425883],"genre_scores_gemma":[0.9857142,0.0009910496,0.011674406,0.00006842978,0.00003968858,0.00004535095,0.000029213274,0.000037954418,0.0013997453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974637,0.0012323682,0.00006262335,0.00016172514,0.00081338076,0.00026624076],"domain_scores_gemma":[0.9921383,0.0060249036,0.0005133228,0.00046035464,0.00078317255,0.00007990108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038121843,0.00079660694,0.000853353,0.0010774051,0.0005724969,0.0016343606,0.0011695103,0.0010311484,0.00072707975],"category_scores_gemma":[0.015861342,0.000500035,0.00031596242,0.0011221381,0.0015510538,0.0025649713,0.00090501097,0.000565093,0.00032415605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006547127,0.00003797808,0.00063842203,0.00007834772,0.000031295855,0.00018095982,0.0002132545,0.88593376,0.0038642995,0.097610414,0.00046992337,0.01087586],"study_design_scores_gemma":[0.0000103612865,0.00005087985,0.000305997,0.000016583363,0.0000150844135,0.000093666386,0.000055858578,0.95559275,0.0011617399,0.042157944,0.0005234645,0.000015636258],"about_ca_topic_score_codex":0.0020217462,"about_ca_topic_score_gemma":0.0010098456,"teacher_disagreement_score":0.0038121843,"about_ca_system_score_codex":0.0015589027,"about_ca_system_score_gemma":0.00080992916,"threshold_uncertainty_score":0.020160973},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04721089,0.0020961524,0.93894583,0.0007571544,0.000054733333,0.000064233216,0.00012100129,0.00018433081,0.010565648],"genre_scores_gemma":[0.8754274,0.00316301,0.115031466,0.00015819923,0.00011263383,0.00021122246,0.0001725882,0.00018633243,0.0055371756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987632,0.00046512904,0.00003093392,0.000095348725,0.0004715886,0.00017380984],"domain_scores_gemma":[0.9859299,0.011533444,0.0008472539,0.00051187957,0.00095094263,0.00022649356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026324664,0.0010103057,0.00086543616,0.0010558134,0.0005378838,0.0017188075,0.001276789,0.0011806525,0.0020972905],"category_scores_gemma":[0.015601763,0.00047702828,0.00045910585,0.0013031786,0.001915095,0.0025678924,0.0017442078,0.0015640751,0.000372038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008239678,0.00004143028,0.00035352728,0.00009432497,0.000019813739,0.000059052672,0.0001104125,0.8874705,0.0022568326,0.09858772,0.0008355195,0.010088565],"study_design_scores_gemma":[0.000010902236,0.000026086196,0.00007717955,0.000013449453,0.0000056915114,0.000035452063,0.000027664388,0.975044,0.0011101811,0.023226209,0.00041427664,0.000008883646],"about_ca_topic_score_codex":0.0035173097,"about_ca_topic_score_gemma":0.0020307582,"teacher_disagreement_score":0.0035173097,"about_ca_system_score_codex":0.002630898,"about_ca_system_score_gemma":0.0015629141,"threshold_uncertainty_score":0.019088626},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026536971,0.00038912133,0.9629942,0.0006831851,0.000079744386,0.00017156191,0.00008714533,0.00010460651,0.008953354],"genre_scores_gemma":[0.8756512,0.0010736142,0.11537356,0.00026881509,0.00014036475,0.00075909815,0.00013138962,0.000031242074,0.0065706503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631613,0.0019939996,0.00014106212,0.000517512,0.00063999434,0.00039119832],"domain_scores_gemma":[0.9971374,0.0020628273,0.00030011914,0.000108677705,0.0002523656,0.0001386014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037469796,0.0019754686,0.0018180679,0.00082981214,0.0011937801,0.0024115476,0.002710076,0.0032058796,0.0026436436],"category_scores_gemma":[0.006528939,0.00070157147,0.0016357345,0.0010169278,0.0029743153,0.0040981015,0.0013216276,0.002042136,0.00047003073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017243456,0.000118381846,0.00043668546,0.00015021747,0.00008643021,0.0005435983,0.0004768346,0.42462292,0.0022752269,0.5565283,0.0015608695,0.013028184],"study_design_scores_gemma":[0.0000754258,0.00013778574,0.00010278158,0.000018794599,0.000033357952,0.00011822216,0.000049546557,0.86589015,0.00037659565,0.13177447,0.0013828236,0.00004001092],"about_ca_topic_score_codex":0.0054555917,"about_ca_topic_score_gemma":0.0041272324,"teacher_disagreement_score":0.0054555917,"about_ca_system_score_codex":0.0026877758,"about_ca_system_score_gemma":0.0028288807,"threshold_uncertainty_score":0.01981622},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008620908,0.00024059738,0.9896291,0.00018139815,0.000019758441,0.00002979978,0.000046779314,0.00017191294,0.001059667],"genre_scores_gemma":[0.5462355,0.0009073483,0.44773892,0.00026460143,0.00007182252,0.00028731392,0.00024878158,0.00008117783,0.0041645356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990305,0.00037118263,0.000047936555,0.00011609684,0.00035344632,0.00008084532],"domain_scores_gemma":[0.99698764,0.0016796582,0.0003519038,0.000508898,0.00041129402,0.00006054178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016032158,0.00069784356,0.0008385817,0.0009391606,0.00048745406,0.00092139276,0.0012748867,0.0007904511,0.0016265669],"category_scores_gemma":[0.006689733,0.0002631179,0.00047507155,0.001695612,0.0012032882,0.0017881128,0.002029138,0.0013245645,0.0005519226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035008971,0.00006489994,0.00066874287,0.00026177845,0.000054980464,0.00028125173,0.0003934468,0.5172203,0.01747622,0.29987547,0.002843948,0.16050881],"study_design_scores_gemma":[0.000039509676,0.000050795283,0.00011406616,0.000026950069,0.000013176782,0.00011920096,0.00002172563,0.931204,0.0070440504,0.059211258,0.00213106,0.000024181465],"about_ca_topic_score_codex":0.0013317639,"about_ca_topic_score_gemma":0.0011670247,"teacher_disagreement_score":0.0016265669,"about_ca_system_score_codex":0.0011338417,"about_ca_system_score_gemma":0.0010197131,"threshold_uncertainty_score":0.008478701},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024449725,0.00027032165,0.97138613,0.00018998419,0.000129992,0.00013289787,0.000035647136,0.00081873353,0.0025865645],"genre_scores_gemma":[0.8278458,0.00021698214,0.16669124,0.00027747755,0.00012074997,0.00030802566,0.00009104531,0.00003281888,0.0044158925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886465,0.00030381727,0.00007054063,0.00017750834,0.00044068205,0.00014290398],"domain_scores_gemma":[0.99827266,0.0007524387,0.00016294928,0.00024604655,0.00049020804,0.00007578214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015511675,0.0005789381,0.00067788933,0.0006086502,0.0004043296,0.0004383422,0.0016300784,0.0008556577,0.0008583741],"category_scores_gemma":[0.0034548517,0.00021077291,0.00030234377,0.0006027449,0.0006150687,0.0008695123,0.0010519666,0.001231329,0.0002135829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075852964,0.0005832734,0.0017231667,0.00023770436,0.00014072118,0.0005278426,0.00035980775,0.5220244,0.04402719,0.03360928,0.0059695556,0.39003858],"study_design_scores_gemma":[0.000023285858,0.00014044401,0.00017032618,0.0000042417178,0.000013807852,0.00008231528,0.000005745642,0.994286,0.0024549975,0.0019203259,0.0008871761,0.0000113026945],"about_ca_topic_score_codex":0.0022427228,"about_ca_topic_score_gemma":0.002606927,"teacher_disagreement_score":0.0022427228,"about_ca_system_score_codex":0.0004928955,"about_ca_system_score_gemma":0.000829155,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5658654,0.002040013,0.363269,0.00061696937,0.00005695213,0.000051689654,0.000095031035,0.00033970026,0.06766533],"genre_scores_gemma":[0.99222493,0.00024949544,0.0060711266,0.000027135202,0.00001231179,0.000013140511,0.0000098949895,0.000011100754,0.0013808071],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993099,0.00023649792,0.000012706541,0.00008463449,0.00019768623,0.00015864277],"domain_scores_gemma":[0.9979634,0.0013732587,0.00014291564,0.00026342977,0.00020197072,0.00005499877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091425295,0.00065057154,0.00042008838,0.0005958266,0.00037641195,0.0011031586,0.00070295075,0.0007536537,0.002158229],"category_scores_gemma":[0.0037750674,0.00024804982,0.00031789922,0.00087060506,0.0015442338,0.0009297928,0.00087093696,0.00045704746,0.0003705489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015375607,0.00021107927,0.0024678502,0.00017516792,0.0001454179,0.00064450304,0.00069966674,0.58814424,0.06924971,0.23085593,0.0018469909,0.10402191],"study_design_scores_gemma":[0.0001894082,0.0005988826,0.0023621637,0.00006217368,0.00012179565,0.0008973213,0.00027952224,0.839078,0.035364863,0.11650196,0.0044676154,0.00007623122],"about_ca_topic_score_codex":0.00083535333,"about_ca_topic_score_gemma":0.0007765264,"teacher_disagreement_score":0.002158229,"about_ca_system_score_codex":0.0008999389,"about_ca_system_score_gemma":0.0005201996,"threshold_uncertainty_score":0.00721997},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89773107,0.00024997618,0.09634603,0.00004557169,0.00001675573,0.00018328596,0.0011484765,0.0004695352,0.0038092718],"genre_scores_gemma":[0.98567146,0.00023445494,0.013002564,0.000013922142,0.000016141836,0.00006784628,0.0006039434,0.000016656952,0.00037304533],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99937856,0.00020306208,0.000035326124,0.000067072055,0.00027028465,0.00004554408],"domain_scores_gemma":[0.997799,0.0012035245,0.0003571158,0.00023454904,0.00036196187,0.00004393701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046576816,0.00052711024,0.00025364562,0.00072169997,0.00037958295,0.0003086319,0.0003437487,0.0003359173,0.00044426834],"category_scores_gemma":[0.0019740805,0.00016430965,0.00011351871,0.0009604819,0.00045329522,0.0003136347,0.00028415525,0.00030578155,0.00024109874],"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.00095756043,0.00046609456,0.16511752,0.00077742647,0.0001742651,0.0011285509,0.0018174119,0.26505375,0.44286272,0.003092557,0.0013371872,0.11721505],"study_design_scores_gemma":[0.00006705617,0.004989683,0.25390726,0.00007219892,0.00030107424,0.00272554,0.001302415,0.30315408,0.4227362,0.0020130891,0.008535408,0.00019595068],"about_ca_topic_score_codex":0.0010844134,"about_ca_topic_score_gemma":0.002138725,"teacher_disagreement_score":0.0010844134,"about_ca_system_score_codex":0.00024317697,"about_ca_system_score_gemma":0.0001755873,"threshold_uncertainty_score":0.0024632215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020645598,0.10922601,0.66231453,0.012900509,0.00319786,0.00023025382,0.00015528266,0.00026782605,0.1910621],"genre_scores_gemma":[0.8050058,0.07238967,0.08315619,0.0027569234,0.003760653,0.0007276196,0.00020169381,0.00007526813,0.03192609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975139,0.0012984956,0.00009263474,0.0002816665,0.0006349021,0.00017842809],"domain_scores_gemma":[0.9975769,0.0016122835,0.00018838434,0.00024160532,0.000280181,0.00010066787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019881441,0.0007466645,0.00079323835,0.00077044516,0.001469403,0.002384153,0.0010120735,0.0025966454,0.0022624752],"category_scores_gemma":[0.004393719,0.0002977469,0.00036192805,0.0014154831,0.003238836,0.00274202,0.0023615921,0.0021103565,0.00075203454],"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.000013752541,0.000015411491,0.00022561094,0.0002377694,0.0000231936,0.0001956015,0.00031578823,0.012103086,0.0008149643,0.9436184,0.005468,0.036968425],"study_design_scores_gemma":[0.000020243613,0.00007723432,0.0002545549,0.0001768459,0.00002363966,0.00050973246,0.0001584993,0.032214478,0.0005429803,0.8888515,0.077136695,0.000033532604],"about_ca_topic_score_codex":0.00082417694,"about_ca_topic_score_gemma":0.0006284165,"teacher_disagreement_score":0.0025966454,"about_ca_system_score_codex":0.0010701678,"about_ca_system_score_gemma":0.0010227872,"threshold_uncertainty_score":0.010514438},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035012312,0.0004117276,0.95763296,0.00020499306,0.000063169864,0.000060310573,0.00007265276,0.000109658766,0.006432282],"genre_scores_gemma":[0.69941217,0.00078446977,0.29397765,0.00015271085,0.00007796666,0.00029889643,0.00024055304,0.00005529091,0.0050003678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996177,0.00010162465,0.000009666063,0.00003433489,0.0001892086,0.00004749177],"domain_scores_gemma":[0.99890316,0.0005896634,0.00010991916,0.00012049507,0.0002407029,0.00003615124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046730464,0.00032518958,0.00023664543,0.0004226926,0.000448134,0.0004987605,0.00036340207,0.00047953625,0.0009464374],"category_scores_gemma":[0.0022662922,0.00015029371,0.0002558144,0.0004907701,0.00069565495,0.0004414168,0.0006217056,0.00055114087,0.00029154288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016354113,0.000039724808,0.000623213,0.00018430945,0.000022988828,0.00027785372,0.00030364838,0.2514319,0.022063067,0.6283134,0.0037447345,0.09283153],"study_design_scores_gemma":[0.00003315759,0.00010052298,0.00018570965,0.00004041088,0.000014642969,0.00029392377,0.00004481005,0.8625487,0.010988735,0.117984906,0.007728709,0.000035757144],"about_ca_topic_score_codex":0.0018491967,"about_ca_topic_score_gemma":0.0017512509,"teacher_disagreement_score":0.0018491967,"about_ca_system_score_codex":0.00064661726,"about_ca_system_score_gemma":0.0014047065,"threshold_uncertainty_score":0.004691601},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009500466,0.0028061492,0.9439322,0.00086560246,0.00078224833,0.00023155942,0.00028756264,0.0002979836,0.0412963],"genre_scores_gemma":[0.5628298,0.0060694027,0.39978004,0.001481275,0.00060848444,0.0012012158,0.001000058,0.000101160476,0.02692857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942684,0.00018783586,0.000028188804,0.00006483502,0.00020581628,0.00008638929],"domain_scores_gemma":[0.9990056,0.00037580286,0.00007397602,0.0002144578,0.00030554028,0.000024558614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056846323,0.0004893272,0.00043117197,0.000841454,0.0005713827,0.0009415025,0.0008866493,0.0007479435,0.0035608981],"category_scores_gemma":[0.0023633465,0.00012771375,0.00025218385,0.0014844425,0.00062262564,0.0008230747,0.0011093678,0.00072623347,0.0010519911],"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.00016166877,0.00006233766,0.00045624547,0.0003568651,0.000035796653,0.00028098363,0.00015545118,0.11587327,0.013833128,0.5363343,0.012461477,0.31998855],"study_design_scores_gemma":[0.000060513757,0.00014692347,0.00036702838,0.00018412467,0.000040473526,0.0006638284,0.000055871686,0.71122265,0.00957253,0.17643182,0.1011974,0.000056800807],"about_ca_topic_score_codex":0.001617479,"about_ca_topic_score_gemma":0.001720706,"teacher_disagreement_score":0.0035608981,"about_ca_system_score_codex":0.00073214923,"about_ca_system_score_gemma":0.0009265525,"threshold_uncertainty_score":0.0119124055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02884483,0.00090248167,0.9655476,0.00031976964,0.0000768117,0.00006626991,0.000079126046,0.00023773144,0.00392543],"genre_scores_gemma":[0.7330688,0.0012795173,0.26012015,0.0003024579,0.00010941749,0.00022505247,0.00018070337,0.000049238763,0.004664541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991487,0.0002790192,0.000039205544,0.000095074654,0.00035685295,0.000081086386],"domain_scores_gemma":[0.9978192,0.0010217384,0.00025500596,0.00038862115,0.00045059522,0.00006479966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078548887,0.000647265,0.0005614873,0.00064212165,0.00048021437,0.0009821343,0.0007898679,0.00082352426,0.0013688704],"category_scores_gemma":[0.0033187084,0.00021472634,0.00035996185,0.0006869186,0.00089424406,0.0011518652,0.00097205944,0.0009642862,0.0005555043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047350622,0.000150291,0.0016512568,0.0007396433,0.00011193481,0.0007884233,0.00039933843,0.3844309,0.052557856,0.35890827,0.0033521254,0.19643643],"study_design_scores_gemma":[0.00008307621,0.0002100791,0.00036343926,0.000055276596,0.000057697693,0.00057678827,0.00003693149,0.90572876,0.021661777,0.06342739,0.0077217626,0.000076967066],"about_ca_topic_score_codex":0.0009035553,"about_ca_topic_score_gemma":0.0010450175,"teacher_disagreement_score":0.0013688704,"about_ca_system_score_codex":0.0006903083,"about_ca_system_score_gemma":0.00087864,"threshold_uncertainty_score":0.0050085783},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21656737,0.00041379713,0.77721137,0.00028353406,0.000053324056,0.00006658709,0.000060053415,0.00025863864,0.005085275],"genre_scores_gemma":[0.94758445,0.00013650743,0.050951548,0.000039779232,0.000017976083,0.00004542693,0.000024529982,0.0000059945796,0.0011937236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997664,0.00008030528,0.000010259987,0.000030369085,0.00007405213,0.000038681515],"domain_scores_gemma":[0.9996768,0.000110147266,0.00006266337,0.000042286847,0.00008001937,0.000028068578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003653935,0.00036169108,0.0002778423,0.00018431315,0.00041157828,0.0005103817,0.0004861458,0.0003961214,0.00072825997],"category_scores_gemma":[0.0006887472,0.0001583897,0.00025126294,0.00026215133,0.00030556298,0.00045598284,0.00071808114,0.00045654192,0.00019627431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003663789,0.00016871456,0.0040134913,0.00019656209,0.00010951726,0.0016849209,0.0003485673,0.72069716,0.13566904,0.026840543,0.0020062835,0.10789882],"study_design_scores_gemma":[0.000010737043,0.000058073587,0.00019732527,0.000004683662,0.000013896647,0.00012075397,0.000019081432,0.9934089,0.004306595,0.0012386538,0.00060992606,0.000011301969],"about_ca_topic_score_codex":0.001441831,"about_ca_topic_score_gemma":0.0015506822,"teacher_disagreement_score":0.001441831,"about_ca_system_score_codex":0.0004648487,"about_ca_system_score_gemma":0.00039297968,"threshold_uncertainty_score":0.0033726692},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06003603,0.00045259413,0.9342242,0.00016498017,0.00004576539,0.00006916644,0.00003470029,0.0002573627,0.0047152084],"genre_scores_gemma":[0.8394842,0.00031045737,0.15897802,0.00004902854,0.000030156962,0.000058500897,0.000026919637,0.000013352853,0.0010494482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993728,0.00024633532,0.000038884948,0.000086161985,0.0001982458,0.000057687426],"domain_scores_gemma":[0.9994473,0.00023347553,0.00009727929,0.000101679165,0.00009579185,0.000024497504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007509273,0.0005165312,0.0006271295,0.00038393668,0.00052646926,0.00044998626,0.000596774,0.00037697263,0.001086762],"category_scores_gemma":[0.0013415305,0.00021213603,0.0003308715,0.00041900232,0.00079480384,0.0008820208,0.00062407047,0.00046553978,0.00024491487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073864806,0.00017620489,0.0017089752,0.00037466665,0.0001635723,0.0005284622,0.0006612033,0.2619437,0.23745699,0.25152206,0.0020324043,0.24269317],"study_design_scores_gemma":[0.000062284096,0.00034048167,0.00031569297,0.000026699021,0.000083719984,0.00044165767,0.00005541115,0.9439898,0.036718797,0.014829777,0.0030883732,0.00004728506],"about_ca_topic_score_codex":0.00061527244,"about_ca_topic_score_gemma":0.0010537093,"teacher_disagreement_score":0.001086762,"about_ca_system_score_codex":0.00045699062,"about_ca_system_score_gemma":0.00066997146,"threshold_uncertainty_score":0.0039713383},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05092974,0.00030132628,0.9467504,0.00013083119,0.00003314145,0.00006862531,0.000045236997,0.00018731019,0.0015533159],"genre_scores_gemma":[0.88494444,0.00041013228,0.113157496,0.00007699704,0.000018705963,0.00016091882,0.00008392719,0.000031950978,0.0011153694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948126,0.00019161771,0.000020246982,0.000038778584,0.0002125863,0.00005557276],"domain_scores_gemma":[0.9978683,0.0011904873,0.0003134945,0.00032344466,0.0002657454,0.000038564544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001103725,0.00031020507,0.0003269347,0.00041695114,0.00030279814,0.0003664271,0.0005733499,0.00034398193,0.0005991743],"category_scores_gemma":[0.0037296521,0.00018417262,0.00022316282,0.00047874064,0.000804176,0.00073084317,0.00069662626,0.0005068337,0.00011166629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030302754,0.00006123943,0.00092341355,0.0002454214,0.00005250059,0.00030151906,0.00031648536,0.7130412,0.04088074,0.16546378,0.0014461516,0.07696459],"study_design_scores_gemma":[0.000020027606,0.00008594733,0.00020021047,0.000024563224,0.000012363021,0.000104888226,0.000018883566,0.9735536,0.005913472,0.018994378,0.0010521093,0.000019592831],"about_ca_topic_score_codex":0.0017338927,"about_ca_topic_score_gemma":0.0020954371,"teacher_disagreement_score":0.0017338927,"about_ca_system_score_codex":0.0006310759,"about_ca_system_score_gemma":0.0012493267,"threshold_uncertainty_score":0.0058371425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01894776,0.00057732646,0.9775948,0.00011416819,0.000033476612,0.00004268217,0.00002469555,0.00012590327,0.0025391649],"genre_scores_gemma":[0.9139952,0.00044322704,0.08287192,0.000056952176,0.000030092078,0.00014018313,0.000032546384,0.000025985932,0.0024038525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939406,0.00022649328,0.000024990446,0.00010422184,0.00016719644,0.000083005296],"domain_scores_gemma":[0.999226,0.0004791552,0.00009071473,0.000058422054,0.00011992985,0.000025742956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092663907,0.00071671413,0.0008578558,0.00037050524,0.0004937379,0.0007851173,0.00096401107,0.0007062151,0.0013616644],"category_scores_gemma":[0.002140534,0.00029903447,0.00029381624,0.00047788347,0.00061089033,0.0008963119,0.00079211936,0.0005426828,0.0002663199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009732683,0.000048217185,0.00014403672,0.00006354122,0.000022143944,0.00010475127,0.00007038868,0.94565624,0.0044419146,0.017557768,0.00074617274,0.031047557],"study_design_scores_gemma":[0.0000095834675,0.000022137838,0.000027113503,0.0000020791906,0.0000034079883,0.000016242142,0.000010498604,0.9957267,0.00057018717,0.0033298188,0.0002774038,0.000004853623],"about_ca_topic_score_codex":0.0021646258,"about_ca_topic_score_gemma":0.0025179524,"teacher_disagreement_score":0.0021646258,"about_ca_system_score_codex":0.0010610516,"about_ca_system_score_gemma":0.00072852615,"threshold_uncertainty_score":0.007698536},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023517238,0.0005544693,0.974638,0.00007920259,0.000028613445,0.00002226219,0.000015885144,0.00011215284,0.0010320753],"genre_scores_gemma":[0.8101141,0.00090916373,0.18704379,0.00008268005,0.000081658916,0.000063338426,0.000044652978,0.000024674911,0.0016359562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981041,0.00090216415,0.00007178344,0.0002943087,0.00046752827,0.00016015882],"domain_scores_gemma":[0.9980635,0.0011158634,0.00030595134,0.00019727722,0.00026966707,0.00004770509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019569378,0.0009059186,0.0012155923,0.00060107437,0.0005023264,0.0008467775,0.0008933767,0.0016177223,0.0003739186],"category_scores_gemma":[0.005115481,0.00036489344,0.0006077764,0.0008221051,0.0017512478,0.0021120904,0.0014360688,0.00072180317,0.00023579093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004216992,0.00006979806,0.0009614002,0.00038744224,0.00010997523,0.0008036018,0.00038495328,0.70909,0.026014624,0.1926932,0.0010791793,0.067984104],"study_design_scores_gemma":[0.000018123537,0.00007857519,0.00009131029,0.0000073642327,0.000017631206,0.00025285044,0.000022826507,0.97462475,0.005302936,0.019083744,0.00046186004,0.00003797721],"about_ca_topic_score_codex":0.00059360516,"about_ca_topic_score_gemma":0.00033876236,"teacher_disagreement_score":0.0019569378,"about_ca_system_score_codex":0.00062151335,"about_ca_system_score_gemma":0.0006096459,"threshold_uncertainty_score":0.010349393},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03587199,0.00039692107,0.9625951,0.00014675022,0.000019038389,0.000026507007,0.00003063936,0.00017132737,0.0007417874],"genre_scores_gemma":[0.77036536,0.0009138203,0.2269498,0.00007803654,0.000051434778,0.00009191584,0.00007578904,0.000032729997,0.0014410825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926156,0.00038752257,0.000027534015,0.00009095029,0.00017702005,0.000055389028],"domain_scores_gemma":[0.9970642,0.002306883,0.00026477588,0.00012958693,0.00019374337,0.0000408522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016252433,0.0006226191,0.0007310208,0.0004499929,0.00042003332,0.0007769727,0.00048196065,0.0009744044,0.0005572376],"category_scores_gemma":[0.0071359174,0.00036206745,0.0003645197,0.0004780509,0.00089726964,0.0011287385,0.0008895861,0.0006108336,0.00020043881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017521488,0.00003151876,0.00066541537,0.00008927415,0.00003127479,0.00009031107,0.00008377474,0.9468367,0.0063364324,0.014382043,0.0004988809,0.030779148],"study_design_scores_gemma":[0.000007365869,0.000023952198,0.00009176992,0.000003060824,0.000004524036,0.000025737792,0.00000881126,0.9949228,0.001912653,0.0028661056,0.0001238611,0.000009367541],"about_ca_topic_score_codex":0.002139809,"about_ca_topic_score_gemma":0.0017810641,"teacher_disagreement_score":0.002139809,"about_ca_system_score_codex":0.0007160256,"about_ca_system_score_gemma":0.0010568937,"threshold_uncertainty_score":0.008595169},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051942687,0.0014994357,0.92701596,0.0015569474,0.000072232695,0.00013876305,0.00029718305,0.0001977788,0.017279044],"genre_scores_gemma":[0.88597435,0.0017379343,0.107681654,0.00032336815,0.00016071802,0.00023519172,0.00013568344,0.00008272502,0.0036684193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99686146,0.0013493199,0.00015753071,0.000386192,0.0009283912,0.0003171561],"domain_scores_gemma":[0.99241066,0.005654256,0.0005807842,0.0007661871,0.00046896283,0.000119156735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00369299,0.0014041101,0.0013069373,0.0011484869,0.0008621057,0.001804108,0.0009840112,0.0020839889,0.0021944477],"category_scores_gemma":[0.014452131,0.00049889646,0.0005039335,0.0013979485,0.0022083183,0.0028649918,0.0021205381,0.001838807,0.0006008653],"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.00069724914,0.00008472923,0.00069708296,0.00035990935,0.0000738877,0.0005008325,0.0004476093,0.41563198,0.036674503,0.48930034,0.0027408218,0.052791115],"study_design_scores_gemma":[0.00010382297,0.00044505304,0.0006494018,0.00009365804,0.00006008285,0.0010691725,0.00009268376,0.8217932,0.020569725,0.15210734,0.0029042328,0.00011162611],"about_ca_topic_score_codex":0.0009196833,"about_ca_topic_score_gemma":0.00070391136,"teacher_disagreement_score":0.00369299,"about_ca_system_score_codex":0.0015338719,"about_ca_system_score_gemma":0.0010580568,"threshold_uncertainty_score":0.019530594},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060707256,0.0005587558,0.92598075,0.0002959043,0.000093799536,0.00007714253,0.00020416938,0.0004722093,0.011609975],"genre_scores_gemma":[0.723241,0.0009213361,0.25979972,0.0002590341,0.00009408007,0.00019247376,0.00057575246,0.00010850248,0.014808105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997651,0.000046706653,0.000009414336,0.000025237114,0.00010999407,0.000043521526],"domain_scores_gemma":[0.9992366,0.00025106693,0.000060297505,0.00020032708,0.00022522219,0.000026555066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005482263,0.0005213952,0.00028466148,0.00045816458,0.00039301507,0.00057388924,0.0006049074,0.00041031756,0.0027256396],"category_scores_gemma":[0.0017935683,0.00016652491,0.0001940325,0.00050975697,0.00039970412,0.0006832835,0.00087553356,0.00083251006,0.00045644032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080490985,0.00016217379,0.0014810736,0.00029677997,0.000068017325,0.00048497345,0.00047381385,0.19652955,0.2189313,0.13021484,0.0066956724,0.44385692],"study_design_scores_gemma":[0.00003555904,0.0001902744,0.00087682536,0.000058556707,0.000042527114,0.00030730775,0.000050099203,0.9073811,0.058436733,0.024616746,0.007973371,0.000030845476],"about_ca_topic_score_codex":0.00242259,"about_ca_topic_score_gemma":0.0050224653,"teacher_disagreement_score":0.0027256396,"about_ca_system_score_codex":0.0006449552,"about_ca_system_score_gemma":0.00090643484,"threshold_uncertainty_score":0.00911814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032459885,0.00047302185,0.9645769,0.0001965066,0.000030088164,0.00003754116,0.00001138536,0.00006109224,0.0021535798],"genre_scores_gemma":[0.9499534,0.0004193889,0.047574326,0.00006934289,0.00006443036,0.00011080423,0.000020891835,0.000019793484,0.0017675658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988524,0.0005626225,0.000038690145,0.0001463875,0.00028987185,0.00011009768],"domain_scores_gemma":[0.99754876,0.0017705722,0.00027174092,0.00014214008,0.00019875739,0.00006803793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018776897,0.000807347,0.0008242441,0.00043183027,0.00052370154,0.00083638873,0.0010532658,0.0008420335,0.0006251599],"category_scores_gemma":[0.004995041,0.0003440316,0.00034852567,0.0008507347,0.0014302295,0.0011766355,0.0009112361,0.00055877306,0.00014212172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006200415,0.000043120326,0.0002630309,0.000056276636,0.000026260068,0.00013432818,0.00010263159,0.95755,0.0018278384,0.024806954,0.00027329405,0.014854227],"study_design_scores_gemma":[0.000016105576,0.000036483056,0.000048938353,0.0000023870866,0.0000058006626,0.000019137924,0.000013261739,0.9880723,0.0003088269,0.011240906,0.00023227435,0.0000036013112],"about_ca_topic_score_codex":0.0020265635,"about_ca_topic_score_gemma":0.0016212859,"teacher_disagreement_score":0.0020265635,"about_ca_system_score_codex":0.0008616988,"about_ca_system_score_gemma":0.0009009216,"threshold_uncertainty_score":0.009930313},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19619,0.00062732643,0.7999382,0.00015475012,0.000017399414,0.00003238555,0.000019018631,0.00006683292,0.002954072],"genre_scores_gemma":[0.9843859,0.0001768798,0.014745699,0.00001758631,0.000008665482,0.000021359849,0.000004426355,0.000004358113,0.0006350376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995938,0.00020511248,0.000011653707,0.000058158003,0.00008707368,0.00004419767],"domain_scores_gemma":[0.9989579,0.00076079834,0.000116664974,0.00004887884,0.00009275804,0.000022955415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007688737,0.00046813014,0.000355582,0.0003054788,0.00028846916,0.00047930225,0.0005769438,0.0006391783,0.00034546817],"category_scores_gemma":[0.002901728,0.00024002853,0.00019868276,0.00040312533,0.0007769161,0.0007311371,0.00052126945,0.0002872953,0.00007195249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004698064,0.000022424616,0.00043267326,0.000033970813,0.000013798524,0.000119001255,0.00009960667,0.96565497,0.0049631484,0.017293682,0.000100186655,0.0112196095],"study_design_scores_gemma":[0.000007119088,0.000034490546,0.00008950272,0.0000024484423,0.000004402899,0.000026943799,0.000017502076,0.9922736,0.000653998,0.0067409277,0.00014505173,0.0000039061947],"about_ca_topic_score_codex":0.0009028836,"about_ca_topic_score_gemma":0.0008104433,"teacher_disagreement_score":0.0009028836,"about_ca_system_score_codex":0.00052553526,"about_ca_system_score_gemma":0.0002556664,"threshold_uncertainty_score":0.004066229},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056225946,0.0005582157,0.9905413,0.00017489068,0.000075609205,0.0000492236,0.00001237563,0.0000906672,0.0028751246],"genre_scores_gemma":[0.6233633,0.0021209342,0.36639038,0.00037684175,0.00033163116,0.00025256685,0.00006258638,0.00012827167,0.006973372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987318,0.0005414943,0.000057174246,0.00014156633,0.00039556014,0.0001324618],"domain_scores_gemma":[0.99803334,0.001036907,0.00016410465,0.00027472453,0.00041870438,0.00007227821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002766175,0.0010125875,0.0011642965,0.0010303819,0.00084742124,0.001784242,0.0024641883,0.0014161047,0.0017297422],"category_scores_gemma":[0.0034787713,0.00067972793,0.0011553509,0.0012170769,0.0011822714,0.0023162332,0.002214623,0.0012369645,0.00034741865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112691756,0.00016027685,0.00047714508,0.00019089259,0.00018502353,0.00020345504,0.00023651106,0.7702903,0.012299955,0.16249466,0.002328233,0.051020756],"study_design_scores_gemma":[0.000006377428,0.000042969485,0.000056802757,0.0000092141045,0.000035180143,0.000051134306,0.000018674307,0.98769104,0.0011507464,0.010263849,0.0006598246,0.000014195531],"about_ca_topic_score_codex":0.0016874694,"about_ca_topic_score_gemma":0.0024149928,"teacher_disagreement_score":0.002766175,"about_ca_system_score_codex":0.0011050613,"about_ca_system_score_gemma":0.0010214209,"threshold_uncertainty_score":0.014629126},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4348683,0.002746151,0.55181783,0.00052972935,0.00006939726,0.0000714176,0.00014152395,0.0004798756,0.009275719],"genre_scores_gemma":[0.9906241,0.0003735942,0.008204557,0.000023285615,0.000016630196,0.000015254747,0.000029078969,0.000014683364,0.0006988316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982868,0.0007303513,0.00005052339,0.0001458677,0.0005754612,0.00021087824],"domain_scores_gemma":[0.99455196,0.003827932,0.00045159584,0.00029315535,0.0007987863,0.000076635486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023191485,0.00089637376,0.000826003,0.00070069404,0.0005859302,0.0011879327,0.00063641224,0.0008276677,0.0010326476],"category_scores_gemma":[0.006337588,0.00029091787,0.00038960885,0.0005835112,0.0010571309,0.0009017289,0.00089566596,0.0004895299,0.00020490722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000398045,0.00005913533,0.002424099,0.00017812065,0.00011833131,0.0005145225,0.00030191007,0.9091227,0.026678687,0.031223295,0.00069671747,0.028284468],"study_design_scores_gemma":[0.000010261979,0.00009757236,0.00051122357,0.000013115473,0.000027804463,0.00017427013,0.000037474594,0.991683,0.0045707966,0.0026581527,0.00019933065,0.000016968635],"about_ca_topic_score_codex":0.002962409,"about_ca_topic_score_gemma":0.0026227215,"teacher_disagreement_score":0.002962409,"about_ca_system_score_codex":0.0014800203,"about_ca_system_score_gemma":0.0009871564,"threshold_uncertainty_score":0.012264967},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05285147,0.00062962755,0.94258606,0.00027472398,0.00004572528,0.00003674641,0.00006436808,0.00010278577,0.003408418],"genre_scores_gemma":[0.91220343,0.0004980957,0.08369483,0.00006234441,0.00008741731,0.00011001561,0.00005059755,0.000029034401,0.003264245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991698,0.00038660888,0.000040393825,0.00011796899,0.00016697028,0.00011821158],"domain_scores_gemma":[0.99767774,0.0017475721,0.0001526028,0.00013317745,0.0002369946,0.000051919105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013918749,0.00052902446,0.0009417744,0.0006137421,0.00050701445,0.0009910483,0.0009359479,0.0009010951,0.0010877366],"category_scores_gemma":[0.005765629,0.0005149254,0.00032411463,0.0013737647,0.00082329905,0.0013363142,0.0008919575,0.00050608115,0.00025263362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002328069,0.0000687457,0.00053768774,0.00009007576,0.000041326028,0.00007080026,0.00016049948,0.89115304,0.0033392017,0.02548928,0.0012483058,0.07756825],"study_design_scores_gemma":[0.000025142721,0.000036400714,0.00011361633,0.0000047402887,0.000011234316,0.00002818898,0.000023985222,0.978803,0.0006401551,0.019993821,0.00031361502,0.0000061097976],"about_ca_topic_score_codex":0.0029297003,"about_ca_topic_score_gemma":0.0035346297,"teacher_disagreement_score":0.0029297003,"about_ca_system_score_codex":0.0005534252,"about_ca_system_score_gemma":0.0010898935,"threshold_uncertainty_score":0.007360995},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013731291,0.00077284855,0.9823982,0.00015188755,0.000041591004,0.000026170224,0.00004553699,0.00007955201,0.0027528554],"genre_scores_gemma":[0.5980723,0.0019772148,0.39531538,0.0001760479,0.000114954375,0.00018264183,0.0001683004,0.00003505332,0.003958144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994899,0.00018668048,0.000019814419,0.00005090669,0.00022115113,0.00003158379],"domain_scores_gemma":[0.9993709,0.00024186536,0.00008972494,0.00012546589,0.00015532367,0.000016717971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041209784,0.0003958383,0.00026154617,0.00025152878,0.00021780074,0.00047781307,0.0003167629,0.00041488052,0.0009228025],"category_scores_gemma":[0.0021744075,0.00013332603,0.0001682066,0.00050205144,0.00045838783,0.00039617976,0.00041005498,0.0004879764,0.00039336554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013549005,0.000046156056,0.0006403781,0.0002245906,0.000037331392,0.000138158,0.0001230368,0.3119292,0.036899306,0.46410304,0.0032428342,0.18248066],"study_design_scores_gemma":[0.00003235551,0.00011017004,0.00022375202,0.0000250055,0.000018911504,0.00017218488,0.000015269034,0.90130424,0.010693997,0.07848733,0.008895124,0.000021728512],"about_ca_topic_score_codex":0.00094155996,"about_ca_topic_score_gemma":0.0018177025,"teacher_disagreement_score":0.00094155996,"about_ca_system_score_codex":0.00059348805,"about_ca_system_score_gemma":0.00093949534,"threshold_uncertainty_score":0.0043060184},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49342233,0.0037299388,0.4886111,0.0006357104,0.0000590762,0.000050925802,0.00022366,0.00067531865,0.012591918],"genre_scores_gemma":[0.9926779,0.00062328356,0.005886999,0.000043049997,0.000046254314,0.000026571222,0.00006644786,0.000034486504,0.00059505255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832946,0.0006022246,0.000068531044,0.0001476012,0.00061620737,0.00023590766],"domain_scores_gemma":[0.9767348,0.019323068,0.0016164762,0.0008353143,0.0012987556,0.00019161195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026970406,0.0007847774,0.0011221856,0.0010626349,0.0007906205,0.0011815678,0.00082076585,0.0011604241,0.0014610627],"category_scores_gemma":[0.027641427,0.00043435837,0.00035106592,0.0010834603,0.0019055415,0.0023124162,0.0012834388,0.00095556205,0.00030478294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027670062,0.000089259716,0.0066770217,0.0002939511,0.000073947405,0.00080983696,0.0006184804,0.8853733,0.0072956164,0.076307945,0.0009662873,0.021217791],"study_design_scores_gemma":[0.000017060096,0.00009344182,0.0027172617,0.000039515337,0.000034728524,0.00066838,0.00014265266,0.9650468,0.0025741267,0.028252741,0.00037919355,0.000034155597],"about_ca_topic_score_codex":0.0019149256,"about_ca_topic_score_gemma":0.0011438036,"teacher_disagreement_score":0.0026970406,"about_ca_system_score_codex":0.0017344061,"about_ca_system_score_gemma":0.00091341836,"threshold_uncertainty_score":0.014263451},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030064113,0.0007929575,0.95083255,0.00028505814,0.00009792325,0.000102544705,0.0000823984,0.00030952625,0.01743296],"genre_scores_gemma":[0.9216676,0.0006157504,0.07007206,0.00022796635,0.000067091496,0.0002072935,0.000078615914,0.000027266373,0.00703633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991124,0.00026661903,0.000031693195,0.00013326775,0.00030070008,0.00015522783],"domain_scores_gemma":[0.9987251,0.00062419474,0.00013749726,0.0002658384,0.000190974,0.000056346973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072315056,0.0006701033,0.000569521,0.0005764782,0.00074159034,0.0007956966,0.0012004977,0.00068533624,0.0011232359],"category_scores_gemma":[0.0020802289,0.00021179872,0.00034318678,0.00089985784,0.00064574066,0.0010726695,0.0019373039,0.00043402083,0.00031760323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047543627,0.0002324805,0.0017615729,0.000353199,0.00018039717,0.0014986155,0.00086459477,0.4512998,0.05594256,0.21531764,0.012608153,0.2594656],"study_design_scores_gemma":[0.000046957957,0.00020226714,0.0003915707,0.000029367553,0.00004835389,0.0010289856,0.00015576305,0.90481913,0.009716237,0.06549402,0.018013922,0.000053435204],"about_ca_topic_score_codex":0.00071249553,"about_ca_topic_score_gemma":0.0013260432,"teacher_disagreement_score":0.0012004977,"about_ca_system_score_codex":0.00038463934,"about_ca_system_score_gemma":0.00065171934,"threshold_uncertainty_score":0.0038244724},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18167405,0.0010387737,0.7979049,0.00084237655,0.000054087675,0.000096639975,0.00010493182,0.0007398915,0.01754433],"genre_scores_gemma":[0.9315729,0.00043214872,0.06427648,0.00009205343,0.00005072312,0.00010951347,0.00008274114,0.000084570114,0.0032987883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833846,0.0006154365,0.00005426794,0.00019443312,0.0005216787,0.0002757865],"domain_scores_gemma":[0.9886254,0.00893704,0.00070643245,0.0009894666,0.000548192,0.0001935204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013556115,0.00038912747,0.00077323354,0.00055501104,0.00057805347,0.0013772261,0.0010422217,0.0006885697,0.002151761],"category_scores_gemma":[0.010878213,0.00029789028,0.0002781492,0.0008763624,0.0013139328,0.0015713008,0.00088503596,0.00066305813,0.00036754084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056606345,0.00008238354,0.0010409236,0.00028033773,0.000048210142,0.00016006497,0.00023737425,0.7453332,0.019075423,0.17684112,0.0028136517,0.05352126],"study_design_scores_gemma":[0.000063643136,0.000075340766,0.00032107538,0.000014206123,0.000023587678,0.000071043694,0.0000389713,0.9474784,0.0054400126,0.04464853,0.0018134299,0.000011796747],"about_ca_topic_score_codex":0.0022133738,"about_ca_topic_score_gemma":0.0017799058,"teacher_disagreement_score":0.0022133738,"about_ca_system_score_codex":0.0017524294,"about_ca_system_score_gemma":0.00095317524,"threshold_uncertainty_score":0.012714863},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20340012,0.009526295,0.76692736,0.002884517,0.000535048,0.00012986944,0.00041442813,0.0006780183,0.01550438],"genre_scores_gemma":[0.96381384,0.003234438,0.027446477,0.00033490977,0.0002430688,0.0001520697,0.00027934657,0.00025212587,0.0042436626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979995,0.00055863196,0.00006447465,0.00026261952,0.00052931387,0.00058551],"domain_scores_gemma":[0.9724512,0.022748154,0.001449048,0.0006852891,0.0022264447,0.0004398047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030622198,0.0015090788,0.0009865236,0.0013891449,0.00085481384,0.0014612699,0.0014036575,0.00085512176,0.002756634],"category_scores_gemma":[0.021029236,0.00057815865,0.000479387,0.0010316814,0.0018634434,0.002961753,0.0013162751,0.0019934135,0.00037020535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061481935,0.00008636799,0.0022634405,0.0002690141,0.000069707,0.00029467556,0.00027885195,0.8609466,0.010068331,0.10065299,0.003249756,0.021205423],"study_design_scores_gemma":[0.000013438649,0.00006313299,0.00031027207,0.00003074161,0.000025055466,0.00009550068,0.000060888247,0.981904,0.0022155934,0.014566103,0.0006914772,0.000023931363],"about_ca_topic_score_codex":0.0057506473,"about_ca_topic_score_gemma":0.005015852,"teacher_disagreement_score":0.005986808,"about_ca_system_score_codex":0.005986808,"about_ca_system_score_gemma":0.0026392732,"threshold_uncertainty_score":0.04343754},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25621673,0.0067269374,0.6983202,0.0014205836,0.00011246602,0.00007811511,0.00015447762,0.00015735414,0.03681311],"genre_scores_gemma":[0.9774506,0.0021791281,0.018975597,0.00014515658,0.00012406633,0.000045317418,0.000030310395,0.00003472109,0.0010151637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789786,0.001071706,0.000044481512,0.00018817448,0.00042652333,0.00037131066],"domain_scores_gemma":[0.99447733,0.004475348,0.00032092808,0.00023411136,0.0003574828,0.00013492332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030810444,0.0014963242,0.0010190697,0.0009252469,0.00086248573,0.002281588,0.00080731895,0.0011730733,0.0015052045],"category_scores_gemma":[0.011531639,0.00057614036,0.00033576376,0.0012101682,0.0021862076,0.0027629605,0.001651541,0.0009906617,0.00030366165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005653026,0.0000710004,0.001130362,0.00026670197,0.00006782476,0.000501877,0.00035279308,0.65413207,0.014995243,0.29603812,0.0012592506,0.030619456],"study_design_scores_gemma":[0.000037771915,0.00017213842,0.0005060684,0.00007297688,0.000034564608,0.00041959906,0.00012095752,0.90221757,0.0043467167,0.09100204,0.0010043713,0.00006513306],"about_ca_topic_score_codex":0.0013093406,"about_ca_topic_score_gemma":0.0011005102,"teacher_disagreement_score":0.0030810444,"about_ca_system_score_codex":0.0018842688,"about_ca_system_score_gemma":0.00085172907,"threshold_uncertainty_score":0.0162943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028986016,0.0017794635,0.9670483,0.00031389276,0.000044580425,0.00003573035,0.000039053946,0.00012651332,0.0016264372],"genre_scores_gemma":[0.896364,0.0013879574,0.10064317,0.00011645753,0.00006813898,0.00009567858,0.000035345853,0.000041182957,0.0012480791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984396,0.0008670767,0.000071711285,0.00014081529,0.00037806045,0.00010284489],"domain_scores_gemma":[0.996617,0.0025541654,0.00022759133,0.00028134807,0.00027415837,0.000045607732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021008223,0.0005878673,0.0007774286,0.0004366904,0.00044938203,0.0011512701,0.0007883969,0.0006918553,0.0010881014],"category_scores_gemma":[0.008567807,0.00032377124,0.000174855,0.0008366239,0.0014814918,0.0020469353,0.0007433794,0.000732346,0.00021021995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023870285,0.00003928624,0.0003811308,0.000102566955,0.00002200241,0.0000466577,0.00012548215,0.86488664,0.006026183,0.071374305,0.00068878883,0.05606826],"study_design_scores_gemma":[0.000015280402,0.000038760518,0.0000915917,0.0000131666775,0.000007175946,0.000022644606,0.000015084904,0.97177505,0.0023462898,0.025208201,0.0004542846,0.000012420723],"about_ca_topic_score_codex":0.0012932973,"about_ca_topic_score_gemma":0.0015496992,"teacher_disagreement_score":0.0021008223,"about_ca_system_score_codex":0.0011160313,"about_ca_system_score_gemma":0.0008618281,"threshold_uncertainty_score":0.011110365},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20034303,0.00066794216,0.7768284,0.0003801815,0.0003164157,0.00016451164,0.0002277132,0.00032926103,0.020742603],"genre_scores_gemma":[0.71410805,0.0007157978,0.27520356,0.00022200494,0.00011022633,0.00022842389,0.00040876478,0.00006311309,0.008939984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996202,0.000059579816,0.000027667185,0.000054825978,0.0001773787,0.000060244598],"domain_scores_gemma":[0.9993143,0.00014202682,0.00013077377,0.00014064553,0.00016662279,0.00010552445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003018219,0.0002650263,0.00037592908,0.0007261954,0.00044199743,0.00063253316,0.00044102146,0.0004305015,0.0009885799],"category_scores_gemma":[0.0010971162,0.00021511756,0.00039734188,0.00049552624,0.00084388256,0.0006236997,0.0010194285,0.00082753645,0.00027995728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006680441,0.000056812645,0.00062468974,0.0000898147,0.000019405923,0.00024693873,0.00021621419,0.039418824,0.029648859,0.8772772,0.0016003866,0.050734133],"study_design_scores_gemma":[0.0001247754,0.00040046705,0.0006272934,0.000071663824,0.000043734457,0.0010960221,0.00014989577,0.43433332,0.081724495,0.43019363,0.051107805,0.00012685375],"about_ca_topic_score_codex":0.00032770642,"about_ca_topic_score_gemma":0.00031074113,"teacher_disagreement_score":0.0009885799,"about_ca_system_score_codex":0.00044533686,"about_ca_system_score_gemma":0.0007655939,"threshold_uncertainty_score":0.003307104},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19740544,0.0012073176,0.7859119,0.00065341016,0.00006201322,0.000073171315,0.00015111489,0.00021824389,0.014317336],"genre_scores_gemma":[0.98802906,0.000375418,0.009780689,0.00003843642,0.000026177462,0.000054630364,0.00003869088,0.000025966217,0.0016309654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999401,0.000268293,0.00001458961,0.000053237716,0.00016262429,0.0001003318],"domain_scores_gemma":[0.9978204,0.0014381957,0.00026046595,0.000089127774,0.00034754665,0.000044283912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001450628,0.0006499119,0.0005243981,0.0006924506,0.00039365512,0.00070434023,0.001075364,0.0010684538,0.0007464319],"category_scores_gemma":[0.005108555,0.00029456144,0.0004441576,0.00062917033,0.0007940438,0.0012942374,0.0007022819,0.000565343,0.0001929039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016065524,0.000008644899,0.00025309215,0.000013529701,0.000005394353,0.000025590745,0.000031951997,0.98849165,0.00051691575,0.009072859,0.00012162954,0.0014427045],"study_design_scores_gemma":[5.664818e-7,0.000004146938,0.00003707967,0.000001245797,9.888355e-7,0.0000043318596,0.0000027177616,0.9988225,0.0000528475,0.001039584,0.00003244588,0.0000014876264],"about_ca_topic_score_codex":0.0057973303,"about_ca_topic_score_gemma":0.0024980477,"teacher_disagreement_score":0.0057973303,"about_ca_system_score_codex":0.001783634,"about_ca_system_score_gemma":0.00057827303,"threshold_uncertainty_score":0.012941241},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04935315,0.0012899518,0.947755,0.00011777756,0.00004668303,0.00007910212,0.00003431578,0.0002030946,0.0011208993],"genre_scores_gemma":[0.72447073,0.00086881267,0.27271694,0.000066313165,0.00006727354,0.0001207546,0.000067224864,0.000024157,0.001597848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983339,0.0006229258,0.00007600777,0.0002369504,0.0005947476,0.00013547576],"domain_scores_gemma":[0.9929992,0.005038262,0.0005186381,0.00044346834,0.00091592624,0.000084525695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030381514,0.0010733579,0.0010114479,0.0006599086,0.00036685003,0.0008109701,0.0010917359,0.0013089104,0.0008793045],"category_scores_gemma":[0.010158815,0.0004631189,0.00041848977,0.0004760855,0.00081882614,0.002035493,0.0012353372,0.00093139586,0.00016757299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007058853,0.00017974884,0.0019218894,0.0002614612,0.00019181246,0.00013567584,0.00023110889,0.79538995,0.011716839,0.017438369,0.00065118226,0.17117603],"study_design_scores_gemma":[0.000021532742,0.00016109133,0.00031154897,0.0000064393407,0.00002958957,0.000078912744,0.000013127826,0.9937536,0.004264962,0.0010416443,0.00029449194,0.000023035787],"about_ca_topic_score_codex":0.002739675,"about_ca_topic_score_gemma":0.002432722,"teacher_disagreement_score":0.0030381514,"about_ca_system_score_codex":0.0007678717,"about_ca_system_score_gemma":0.00090754236,"threshold_uncertainty_score":0.016067505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044691075,0.00030486946,0.95152694,0.00015689968,0.000026052918,0.000055485336,0.000028054315,0.00010252765,0.0031081699],"genre_scores_gemma":[0.8766287,0.00041210462,0.12007384,0.00005738334,0.00005469737,0.0002454112,0.000057040368,0.000029728719,0.002441139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972114,0.0014854387,0.000092837436,0.0003751428,0.0004958756,0.00033939906],"domain_scores_gemma":[0.9943031,0.004158569,0.00045219256,0.00058905303,0.00032836586,0.00016881271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037985493,0.0008364636,0.0011304391,0.0007410213,0.00077422545,0.0013093381,0.0016984184,0.0015451469,0.0010103538],"category_scores_gemma":[0.009795737,0.00049018126,0.0006507117,0.0010246392,0.0020002497,0.0022307828,0.0019114936,0.0006727986,0.00030413276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024386554,0.00006703501,0.00076392293,0.00010863115,0.000055349974,0.0003444763,0.00020362846,0.85945076,0.0052123717,0.10816793,0.000768074,0.024613906],"study_design_scores_gemma":[0.0000464781,0.00009011193,0.00009191508,0.000008228719,0.000021109301,0.00009585204,0.00003239194,0.9529516,0.0017199139,0.044219166,0.00070797687,0.000015283835],"about_ca_topic_score_codex":0.0010036778,"about_ca_topic_score_gemma":0.0008111619,"teacher_disagreement_score":0.0037985493,"about_ca_system_score_codex":0.0008089306,"about_ca_system_score_gemma":0.000977012,"threshold_uncertainty_score":0.020088851},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14843272,0.0012213317,0.84604394,0.00025642823,0.00008525817,0.00010560138,0.00006655751,0.0002958862,0.0034922448],"genre_scores_gemma":[0.9405249,0.00049126387,0.057349555,0.000054118886,0.000033720546,0.000069177404,0.000036691665,0.000011047841,0.0014294795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995074,0.00018892612,0.000030788146,0.00009500689,0.00011432772,0.000063482395],"domain_scores_gemma":[0.9987704,0.00072890177,0.00017968658,0.00013538309,0.00015360133,0.000032041746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091537344,0.00077921903,0.0005445329,0.00040527695,0.00030878608,0.00074823154,0.0012975786,0.00070108083,0.00054682087],"category_scores_gemma":[0.0025485624,0.00023059729,0.00031815207,0.0004782193,0.00055616495,0.0015387426,0.00060231227,0.0003578538,0.00012828471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031765626,0.00010386054,0.00097400934,0.00015017031,0.00008163303,0.00059343176,0.00018450595,0.86284107,0.032003894,0.059847668,0.00056468026,0.042337492],"study_design_scores_gemma":[0.000042697153,0.00016967377,0.00013861756,0.0000073660344,0.000039122337,0.00016240985,0.000016186796,0.98474264,0.005958272,0.0077963984,0.0009067345,0.000019892334],"about_ca_topic_score_codex":0.0012980334,"about_ca_topic_score_gemma":0.001656082,"teacher_disagreement_score":0.0012980334,"about_ca_system_score_codex":0.0006021547,"about_ca_system_score_gemma":0.00069010694,"threshold_uncertainty_score":0.0048410296},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28461555,0.0009929256,0.7102115,0.00034553753,0.00003650942,0.00004076923,0.000060765095,0.00025133346,0.003445093],"genre_scores_gemma":[0.9786599,0.0002595136,0.019677365,0.000034764314,0.000016687005,0.000028765382,0.000020266265,0.000013318792,0.0012893366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986994,0.0005500738,0.000048017744,0.00015808867,0.00036936146,0.00017514182],"domain_scores_gemma":[0.9934448,0.005130594,0.00060136657,0.00022962676,0.000524858,0.00006879014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015624646,0.0006602247,0.0007320065,0.00043800028,0.0004593889,0.0006407785,0.0005547582,0.0008771619,0.0005471384],"category_scores_gemma":[0.008546416,0.0004772516,0.00023894188,0.0004988798,0.0013803252,0.0015021276,0.0007082246,0.0004941148,0.00012345424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118704345,0.000017464647,0.0007387667,0.000031305746,0.000018104247,0.00014834535,0.00011737904,0.9722606,0.002568691,0.015052319,0.00014361076,0.008784659],"study_design_scores_gemma":[0.000009217333,0.00003701378,0.00012881088,0.0000036181098,0.000009654727,0.000051953644,0.000014437548,0.9946741,0.0016281116,0.0033381109,0.000097255004,0.000007773106],"about_ca_topic_score_codex":0.004793104,"about_ca_topic_score_gemma":0.0028843444,"teacher_disagreement_score":0.004793104,"about_ca_system_score_codex":0.001136955,"about_ca_system_score_gemma":0.0009577049,"threshold_uncertainty_score":0.009530425},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045699268,0.00020882841,0.99410135,0.000050787763,0.000032910466,0.000034595752,0.0000127186695,0.00011150629,0.00087733765],"genre_scores_gemma":[0.31503794,0.0005322078,0.67981637,0.0000802903,0.00010081375,0.00015172332,0.000051161933,0.000038109294,0.0041914787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995832,0.00015173163,0.00002096669,0.000082600156,0.00013632706,0.000025146208],"domain_scores_gemma":[0.9996604,0.00015521122,0.000034898603,0.000061019367,0.000073045245,0.000015406087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005368213,0.000637573,0.0004763626,0.0003497884,0.0003696155,0.00043529578,0.00093161996,0.0007470378,0.0013187552],"category_scores_gemma":[0.0010469032,0.00017791997,0.0004541386,0.00030085378,0.00034032244,0.000788175,0.00046137685,0.00044988672,0.0004994329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031249577,0.00017324359,0.0011019959,0.0003680926,0.00016446538,0.00066296995,0.00030047758,0.29729593,0.14310479,0.1086916,0.0044236644,0.44340026],"study_design_scores_gemma":[0.000040090246,0.00018993422,0.00019600824,0.000010564804,0.000040281557,0.0006429171,0.000019040783,0.9689086,0.017148856,0.007026927,0.0057398044,0.000037012866],"about_ca_topic_score_codex":0.00046289846,"about_ca_topic_score_gemma":0.00068784493,"teacher_disagreement_score":0.0013187552,"about_ca_system_score_codex":0.0002898581,"about_ca_system_score_gemma":0.00038869015,"threshold_uncertainty_score":0.004411638},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013002684,0.00017073061,0.98476034,0.00008475839,0.000019638297,0.00004512165,0.000020340793,0.000091888534,0.001804607],"genre_scores_gemma":[0.6379394,0.00060822716,0.35690346,0.00013105653,0.00007133742,0.00021680597,0.00008612111,0.000048673137,0.0039948565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890447,0.00039174643,0.000067841094,0.00018988404,0.00033856157,0.00010745426],"domain_scores_gemma":[0.9980757,0.00092737225,0.00044227266,0.00013836872,0.0003589056,0.000057308862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012516839,0.0014638864,0.00088394404,0.0003850409,0.00032061175,0.001045124,0.0010685837,0.00080051215,0.001321646],"category_scores_gemma":[0.0035435506,0.0005740594,0.00051402336,0.00049129926,0.0006830078,0.0012750324,0.00081870164,0.0007290627,0.0005671178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019937329,0.00010601782,0.00050451624,0.00028808424,0.000087487686,0.00027134322,0.00024734018,0.82200104,0.03915975,0.044507757,0.0007515699,0.09187577],"study_design_scores_gemma":[0.000034951918,0.00021706085,0.00014031901,0.000020093876,0.000029833247,0.00012800717,0.000033336855,0.98022115,0.010782442,0.0070550577,0.0013143459,0.00002347228],"about_ca_topic_score_codex":0.00072267524,"about_ca_topic_score_gemma":0.0013024544,"teacher_disagreement_score":0.0014638864,"about_ca_system_score_codex":0.00049730594,"about_ca_system_score_gemma":0.0009691598,"threshold_uncertainty_score":0.0066196322},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4101896,0.00044812405,0.58607906,0.00014139118,0.000052757692,0.000051442166,0.00003215036,0.0005107637,0.0024946535],"genre_scores_gemma":[0.9838029,0.00006496111,0.015745033,0.000015231471,0.000008077524,0.000012468656,0.000008354271,0.000012054923,0.00033083328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997111,0.00006848885,0.00002166429,0.000051534567,0.00008185153,0.00006529919],"domain_scores_gemma":[0.9981876,0.0010679732,0.00027555553,0.00020387078,0.00021268158,0.000052370327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007251629,0.00032328666,0.00024344097,0.0003412661,0.0003045137,0.00041407804,0.0005735464,0.00015935133,0.0003958332],"category_scores_gemma":[0.003187311,0.00013177733,0.000080255355,0.00030426905,0.000453728,0.0008849288,0.00057083427,0.00030941673,0.000043103566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014686566,0.00024623226,0.0059660827,0.00014262427,0.000043272907,0.00033033904,0.00044211035,0.45241806,0.23248081,0.053173948,0.0009126339,0.25237527],"study_design_scores_gemma":[0.000018996692,0.00016334145,0.0005354904,0.000006454884,0.000015115152,0.00009181641,0.000029361878,0.96046674,0.034573693,0.00359047,0.00049432233,0.000014250134],"about_ca_topic_score_codex":0.0007856457,"about_ca_topic_score_gemma":0.00095023285,"teacher_disagreement_score":0.0007856457,"about_ca_system_score_codex":0.00049947674,"about_ca_system_score_gemma":0.0004901724,"threshold_uncertainty_score":0.003835082},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046365563,0.00086279435,0.9457071,0.00029269783,0.000032452426,0.00004107045,0.0000403405,0.00014802412,0.006509947],"genre_scores_gemma":[0.96098775,0.0008332814,0.03521232,0.00010441235,0.00007656452,0.00012000106,0.000040580286,0.00002980631,0.002595347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989374,0.0005343365,0.000028669612,0.00010845822,0.00024439013,0.00014674173],"domain_scores_gemma":[0.9987676,0.0008378894,0.000111096095,0.00007552361,0.00017940356,0.000028458922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016939444,0.00089334475,0.0009258219,0.00047723725,0.0005493127,0.0010643192,0.000758119,0.00086209463,0.0012701912],"category_scores_gemma":[0.004108577,0.00032722534,0.00038273731,0.001330268,0.0011471731,0.0010149969,0.00089763565,0.0006368264,0.0003817995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012746727,0.000043195276,0.00047645485,0.00016102343,0.000048689293,0.0002558807,0.0003133672,0.8776077,0.01084536,0.08240141,0.0017128706,0.026006585],"study_design_scores_gemma":[0.000010437293,0.000037101618,0.00011841545,0.0000065803965,0.000009165559,0.000041833864,0.000022952861,0.9810081,0.0009205431,0.017295321,0.0005221246,0.0000074991117],"about_ca_topic_score_codex":0.0015077824,"about_ca_topic_score_gemma":0.0011531343,"teacher_disagreement_score":0.0016939444,"about_ca_system_score_codex":0.0013213728,"about_ca_system_score_gemma":0.00066921144,"threshold_uncertainty_score":0.009587288},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10188254,0.0024244904,0.888305,0.00036764983,0.00006631514,0.000052030253,0.00016989827,0.0002921859,0.0064398935],"genre_scores_gemma":[0.9440346,0.0019456613,0.049288273,0.00010637269,0.00008090787,0.0000872355,0.00020491402,0.0000775836,0.0041745054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985514,0.00043662076,0.00006173641,0.00018718907,0.0005853306,0.00017768468],"domain_scores_gemma":[0.9905021,0.0064678,0.0009457305,0.00049510854,0.001496787,0.00009255563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029846034,0.0012716504,0.0013359993,0.0009903956,0.00044367922,0.0018024619,0.0011440455,0.0011940474,0.002454348],"category_scores_gemma":[0.012032152,0.000303069,0.0005405652,0.00082386174,0.0012996658,0.0021590116,0.0013818134,0.0009567459,0.000601651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001802804,0.000054467728,0.0012961128,0.0002806772,0.00008603868,0.00027977847,0.00025831044,0.90278774,0.0065973867,0.06659488,0.0006394114,0.02094494],"study_design_scores_gemma":[0.0000060114867,0.000056571098,0.0003343622,0.000021398335,0.00002250848,0.00015044621,0.000038793558,0.9873217,0.002084376,0.0096352585,0.0003098417,0.000018724877],"about_ca_topic_score_codex":0.0018999468,"about_ca_topic_score_gemma":0.0013664615,"teacher_disagreement_score":0.0029846034,"about_ca_system_score_codex":0.0014077325,"about_ca_system_score_gemma":0.001034552,"threshold_uncertainty_score":0.015784264},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04160245,0.00066655653,0.9560242,0.000088529654,0.000018431527,0.000015176811,0.000019142448,0.0001458871,0.0014195293],"genre_scores_gemma":[0.80198336,0.00068498513,0.19405062,0.00010520638,0.00007111516,0.000049159928,0.000043622367,0.000013407828,0.0029984906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999572,0.00013054317,0.00001890229,0.00006820181,0.00017113455,0.000039244194],"domain_scores_gemma":[0.9996043,0.00018558452,0.000052029878,0.00005117484,0.000095519885,0.000011314867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069899706,0.00040113213,0.00054195814,0.00022045895,0.00020269628,0.00043221266,0.00081714324,0.00081933575,0.00052660506],"category_scores_gemma":[0.0011928469,0.00025097924,0.00023297698,0.00032128766,0.00031822154,0.00071160664,0.0007275462,0.000511273,0.00031517688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005654289,0.00011380368,0.0022396862,0.00045314347,0.00013628794,0.0010675977,0.0004447855,0.40335777,0.29716876,0.05578405,0.0017376149,0.23693112],"study_design_scores_gemma":[0.00003329063,0.00027935617,0.00040356204,0.000015599433,0.000048517424,0.0005594369,0.000034713805,0.95092136,0.040503502,0.004937099,0.002239319,0.000024297065],"about_ca_topic_score_codex":0.00027761166,"about_ca_topic_score_gemma":0.00040237053,"teacher_disagreement_score":0.00081933575,"about_ca_system_score_codex":0.00019704274,"about_ca_system_score_gemma":0.0003126328,"threshold_uncertainty_score":0.00369668},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28841797,0.005181109,0.6887458,0.0034822954,0.000052224048,0.00014333024,0.000357586,0.00024949212,0.01337023],"genre_scores_gemma":[0.9432353,0.0027297381,0.051042393,0.00018732101,0.00008566527,0.0002466074,0.00026082929,0.00007066445,0.0021416328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802667,0.0012552724,0.0000573008,0.00015035742,0.00028832012,0.00022200077],"domain_scores_gemma":[0.952308,0.041406456,0.0031664257,0.0012850247,0.0014986685,0.00033543972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074786413,0.0010658696,0.0012295048,0.0016517155,0.0008503809,0.001935086,0.0018155962,0.001850965,0.0027997526],"category_scores_gemma":[0.049803745,0.000822147,0.0009689854,0.0024248313,0.002581755,0.0050023533,0.0014316958,0.0029711456,0.0003052453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007575351,0.00012399304,0.0034541278,0.00013607508,0.000057974987,0.000091164664,0.00020564915,0.8490322,0.00023733769,0.1341847,0.0019176947,0.010483352],"study_design_scores_gemma":[0.000012533655,0.000017506705,0.00039367838,0.000021259393,0.000009625617,0.000027108968,0.00003980844,0.93751043,0.000082818115,0.061552368,0.00032191622,0.000011076313],"about_ca_topic_score_codex":0.0068267477,"about_ca_topic_score_gemma":0.0040483484,"teacher_disagreement_score":0.0074786413,"about_ca_system_score_codex":0.0028954768,"about_ca_system_score_gemma":0.0011689606,"threshold_uncertainty_score":0.039551318},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101080775,0.00059435447,0.89342684,0.00020369378,0.000036066318,0.00009284631,0.000047272206,0.00020352601,0.004314614],"genre_scores_gemma":[0.91432935,0.00031736752,0.08310867,0.00007510522,0.000021384809,0.00009232966,0.00003413745,0.00003707183,0.0019846493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912494,0.00026295302,0.000034808967,0.00014228339,0.00026931232,0.0001657205],"domain_scores_gemma":[0.994932,0.003417765,0.0005351357,0.0004529807,0.00047504148,0.00018709776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014952224,0.0008509885,0.00057509524,0.00081384805,0.0005499607,0.0008233696,0.0013947948,0.00058234885,0.0011473628],"category_scores_gemma":[0.00758662,0.00037798137,0.0002605695,0.00057178334,0.0015947986,0.0021307606,0.0018081005,0.0010947775,0.00013729677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029573758,0.000108265434,0.001005064,0.00018544172,0.000051630235,0.00026169943,0.00045566174,0.7392842,0.02647424,0.16423939,0.00092347653,0.066715196],"study_design_scores_gemma":[0.000029102663,0.00015312227,0.00036960738,0.00003549881,0.000026709213,0.00020875054,0.00010818934,0.9428834,0.011649017,0.04291372,0.0015846984,0.00003814184],"about_ca_topic_score_codex":0.0014796504,"about_ca_topic_score_gemma":0.0020959626,"teacher_disagreement_score":0.0014952224,"about_ca_system_score_codex":0.001330839,"about_ca_system_score_gemma":0.0011094555,"threshold_uncertainty_score":0.009655952},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06197836,0.0015640485,0.93217784,0.00021228519,0.000068927395,0.000052179337,0.000051103383,0.00018601897,0.0037091654],"genre_scores_gemma":[0.9317806,0.00089657167,0.06513676,0.00007899167,0.000045266843,0.00006425009,0.000031043222,0.000025480187,0.0019410092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993556,0.000285639,0.000023377994,0.00013818106,0.0001192317,0.00007800889],"domain_scores_gemma":[0.99904794,0.0005436587,0.0001672956,0.00009459245,0.000118176424,0.000028320392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013019757,0.00079437986,0.0008472577,0.00044084573,0.0003639044,0.00093313283,0.0016503251,0.00092162064,0.0009709214],"category_scores_gemma":[0.0024991492,0.0003131002,0.0004404887,0.00066081044,0.0007182696,0.001643943,0.0007055861,0.0005127713,0.00023298986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023913228,0.00006934078,0.00045159674,0.00021434657,0.00006705002,0.00047896954,0.00019700784,0.88825685,0.017686775,0.06822988,0.0006557828,0.023453265],"study_design_scores_gemma":[0.000015890328,0.00008646927,0.00009136032,0.000011112158,0.00002707192,0.00012681645,0.000019828673,0.9888598,0.0026674983,0.007442546,0.0006348395,0.000016806307],"about_ca_topic_score_codex":0.0012075894,"about_ca_topic_score_gemma":0.0011366811,"teacher_disagreement_score":0.0016503251,"about_ca_system_score_codex":0.0008724577,"about_ca_system_score_gemma":0.0004568726,"threshold_uncertainty_score":0.006885588},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043763213,0.00039060667,0.9507752,0.00018254052,0.000047529116,0.00007849451,0.000018184803,0.00020784291,0.004536413],"genre_scores_gemma":[0.8261991,0.00027806568,0.17190224,0.00005750541,0.00003651549,0.0001570746,0.000022635088,0.00005146706,0.0012952292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833184,0.00088689907,0.00006331189,0.00014943433,0.00041894146,0.00014965539],"domain_scores_gemma":[0.9931404,0.0052397335,0.0003629736,0.0007863233,0.00040299818,0.00006751089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034310892,0.00047863592,0.00041693862,0.00037244803,0.00048288357,0.0008127131,0.00088996254,0.0006612587,0.0011894703],"category_scores_gemma":[0.014884534,0.00028603806,0.00018078988,0.00065669883,0.0015323192,0.001339454,0.0008383644,0.00079582125,0.00019034217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012331562,0.000052652005,0.00047502664,0.00008506534,0.000017308,0.00005245684,0.00012138747,0.83250606,0.0041143014,0.117475964,0.0005100089,0.044466455],"study_design_scores_gemma":[0.000016294283,0.000051704174,0.0000666387,0.000011744213,0.000004263447,0.000029361643,0.000020572461,0.97002685,0.0019405559,0.02710655,0.000719381,0.000006016422],"about_ca_topic_score_codex":0.001587553,"about_ca_topic_score_gemma":0.0018458123,"teacher_disagreement_score":0.0034310892,"about_ca_system_score_codex":0.0010862092,"about_ca_system_score_gemma":0.0012742395,"threshold_uncertainty_score":0.018145561},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024534127,0.0005187399,0.97259074,0.00014423198,0.000048646572,0.00007572289,0.000018398207,0.00014530055,0.0019241248],"genre_scores_gemma":[0.79699576,0.00063497655,0.19890401,0.00014863747,0.00006598478,0.000095907264,0.000043339707,0.000021869817,0.0030894876],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994854,0.00014333098,0.000021622433,0.00005916402,0.0002517097,0.00003872552],"domain_scores_gemma":[0.9991309,0.00035887913,0.00015909309,0.00015847269,0.00017554464,0.0000171103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010770516,0.00052670547,0.00040345656,0.00039208512,0.00031805987,0.00060791743,0.000866,0.0007135948,0.0010317772],"category_scores_gemma":[0.0021599457,0.00015465922,0.0002890341,0.00036797067,0.0006271797,0.001069381,0.0005954845,0.00067923666,0.00040380575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046976283,0.00019468981,0.0013818425,0.00056103297,0.00017185611,0.00066220894,0.00040546595,0.1994872,0.33775577,0.14824626,0.0016292344,0.30903465],"study_design_scores_gemma":[0.00005689722,0.0014217165,0.00068786845,0.000050084644,0.00009579899,0.0013876507,0.00007251189,0.8317116,0.13411492,0.020061912,0.010270182,0.00006886587],"about_ca_topic_score_codex":0.00031916462,"about_ca_topic_score_gemma":0.00044262296,"teacher_disagreement_score":0.0010770516,"about_ca_system_score_codex":0.00028536527,"about_ca_system_score_gemma":0.00038260693,"threshold_uncertainty_score":0.0056960583},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003376204,0.001113647,0.98660856,0.00025217148,0.0000953048,0.000090584035,0.00011961666,0.00019936461,0.008144477],"genre_scores_gemma":[0.45353702,0.0043082773,0.5217393,0.00046502106,0.00029629786,0.0004987973,0.00030813308,0.00013609751,0.01871109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987269,0.0003880863,0.00006524934,0.0003669437,0.00027827654,0.00017452272],"domain_scores_gemma":[0.99919945,0.00025286432,0.00007158397,0.00014819251,0.00025591234,0.0000721183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013685933,0.0019150705,0.0013443058,0.0009242575,0.0014219235,0.0022692776,0.0030116676,0.0020029873,0.0039610732],"category_scores_gemma":[0.0015378337,0.00054047554,0.0009885898,0.0010026495,0.0017595517,0.0033251701,0.0027321891,0.0019783145,0.0017404079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020037215,0.00007652271,0.00035303822,0.00034091584,0.00009103942,0.00090211333,0.00040132637,0.33291155,0.013268968,0.568139,0.008160005,0.075155094],"study_design_scores_gemma":[0.000077898956,0.00039214554,0.0001518646,0.0000955952,0.0001552738,0.0010863174,0.0001957853,0.8317679,0.0063885036,0.123368554,0.03617879,0.0001413304],"about_ca_topic_score_codex":0.0054133297,"about_ca_topic_score_gemma":0.006399387,"teacher_disagreement_score":0.0054133297,"about_ca_system_score_codex":0.001696463,"about_ca_system_score_gemma":0.0024274383,"threshold_uncertainty_score":0.013251126},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07768179,0.00095599424,0.9161189,0.00023114198,0.000052608022,0.000072096846,0.00004985965,0.00022115519,0.0046163877],"genre_scores_gemma":[0.8132187,0.00040851734,0.18376155,0.000111193986,0.000047354162,0.00013254132,0.000040206207,0.00001209017,0.0022678943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992716,0.0003498385,0.000029417408,0.000087859684,0.00019464584,0.00006662438],"domain_scores_gemma":[0.9994754,0.00016146217,0.000113300855,0.00008201005,0.0001404769,0.000027326269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006214642,0.0005470849,0.00051672745,0.0004571322,0.00035582343,0.00055657513,0.00095964636,0.0007173236,0.0006555201],"category_scores_gemma":[0.0010611083,0.00021375177,0.00021026726,0.0005849623,0.00056340086,0.00061544543,0.00075242197,0.00039281917,0.0003670291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067675026,0.00015249064,0.002147988,0.00035039868,0.00019375588,0.0007198921,0.00073438446,0.50173515,0.16614914,0.110562906,0.0027498647,0.21382731],"study_design_scores_gemma":[0.00004971242,0.00036098587,0.00024552573,0.000026058166,0.000040222232,0.00048141112,0.000043306343,0.9592041,0.024226226,0.010867649,0.004410217,0.000044664594],"about_ca_topic_score_codex":0.0005248924,"about_ca_topic_score_gemma":0.00077891053,"teacher_disagreement_score":0.00095964636,"about_ca_system_score_codex":0.0004848535,"about_ca_system_score_gemma":0.0003130435,"threshold_uncertainty_score":0.0035178661},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053635273,0.0004254739,0.9413352,0.00021599754,0.000016582622,0.00005832821,0.00004543814,0.000091350325,0.0041763484],"genre_scores_gemma":[0.82426286,0.0010046968,0.1703668,0.000088821806,0.000036597023,0.00017741395,0.000041614145,0.00003457671,0.00398668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994567,0.0002239446,0.000030432207,0.0000944166,0.0001385113,0.00005599064],"domain_scores_gemma":[0.99938095,0.00037463306,0.000098584984,0.000041615993,0.00009024744,0.0000138228115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010280322,0.00096676894,0.00064478064,0.0003321768,0.00032488097,0.0008037561,0.0005249012,0.0010516389,0.0020081918],"category_scores_gemma":[0.0018857878,0.0004717669,0.00044930814,0.0002922364,0.0007992907,0.0010753911,0.0006307223,0.00053025346,0.00075902476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031059977,0.00005452454,0.00069453183,0.00029197286,0.00006751232,0.00031062955,0.00035025016,0.74422246,0.12670475,0.09219806,0.000553511,0.034241132],"study_design_scores_gemma":[0.00004007474,0.00015669664,0.0002411799,0.00003586834,0.00006607901,0.00021050294,0.00005032528,0.9426234,0.026208598,0.028386576,0.0019425926,0.00003823864],"about_ca_topic_score_codex":0.00040563234,"about_ca_topic_score_gemma":0.0007714844,"teacher_disagreement_score":0.0020081918,"about_ca_system_score_codex":0.0009112839,"about_ca_system_score_gemma":0.0006469708,"threshold_uncertainty_score":0.006718099},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018010663,0.00054658076,0.9801207,0.00011588028,0.000030217358,0.000026322616,0.000016460574,0.00013919736,0.0009940225],"genre_scores_gemma":[0.5532029,0.0007332476,0.44324803,0.0002217865,0.00007126858,0.00008395705,0.0000624267,0.000033801454,0.0023424977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994449,0.0001668004,0.000021273885,0.00007720738,0.0002459334,0.000043860407],"domain_scores_gemma":[0.9991387,0.00041555706,0.00008527473,0.00015234345,0.00017302069,0.000034969722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009688206,0.0004451643,0.00066583557,0.00039238707,0.00028470735,0.00062179036,0.0005352377,0.0007942183,0.0005886225],"category_scores_gemma":[0.0024551407,0.00022535767,0.00034087527,0.0003665801,0.00075863925,0.0008511977,0.0009074728,0.0006423104,0.00033630728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044529236,0.00012216956,0.0024361515,0.00048206598,0.0002039466,0.0005803098,0.00029805655,0.16967377,0.2764528,0.22407348,0.0020927174,0.32313913],"study_design_scores_gemma":[0.000036928974,0.0006082984,0.00059572957,0.000032409076,0.00008328448,0.0010543563,0.000029525236,0.9066401,0.0649736,0.018514972,0.0073628975,0.00006782601],"about_ca_topic_score_codex":0.0002132278,"about_ca_topic_score_gemma":0.00037620802,"teacher_disagreement_score":0.0009688206,"about_ca_system_score_codex":0.00033663205,"about_ca_system_score_gemma":0.00056782825,"threshold_uncertainty_score":0.0051236153},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54430306,0.0023017377,0.4430705,0.0004024997,0.000065331114,0.000027267246,0.00012080531,0.0003479337,0.009360831],"genre_scores_gemma":[0.9977799,0.0001837744,0.0017426573,0.000018501267,0.000010791715,0.000006290976,0.00001388909,0.000004910124,0.00023918308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876785,0.0004731418,0.000042119424,0.0001154415,0.0003521484,0.00024929302],"domain_scores_gemma":[0.9948775,0.0038383054,0.00043220323,0.00027129744,0.00047319898,0.00010751712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018692457,0.00081123604,0.0007347812,0.00049088267,0.00048410072,0.0010427724,0.0007355788,0.00072885636,0.0005490551],"category_scores_gemma":[0.0061428905,0.00029299967,0.0002905121,0.0006075019,0.0012032664,0.00084985275,0.00075228105,0.00040309943,0.00013741123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019935858,0.000030047362,0.0018351137,0.00006696598,0.00004305556,0.00030528707,0.00009245403,0.97306144,0.0044731223,0.009946706,0.00035823218,0.009588282],"study_design_scores_gemma":[0.000008657033,0.000064273176,0.0005242315,0.0000043592863,0.000017466253,0.000116507836,0.000028731256,0.99548256,0.00084815756,0.002815231,0.00008013188,0.000009731451],"about_ca_topic_score_codex":0.0031511246,"about_ca_topic_score_gemma":0.002476028,"teacher_disagreement_score":0.0031511246,"about_ca_system_score_codex":0.0013322054,"about_ca_system_score_gemma":0.0007306899,"threshold_uncertainty_score":0.009885609},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0513337,0.0038399743,0.9329534,0.0004895489,0.000065030894,0.00007032474,0.000104711246,0.00025610928,0.0108871],"genre_scores_gemma":[0.9560942,0.0029672242,0.037596345,0.00008904547,0.00018767711,0.00011126098,0.00008547141,0.000048874434,0.0028198212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747807,0.001217362,0.000079463854,0.00027809374,0.00069650094,0.0002506308],"domain_scores_gemma":[0.9942154,0.0042985464,0.00047923505,0.00025083014,0.0006653939,0.000090564565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002560508,0.0013507303,0.001212138,0.0009507612,0.0006295366,0.001626275,0.001036185,0.0010106965,0.0022691654],"category_scores_gemma":[0.011301856,0.00056962715,0.00043028116,0.0016286589,0.0013192847,0.0022452136,0.001140746,0.0007204325,0.0005001985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008254581,0.000021496018,0.00072010193,0.00013365505,0.000035334968,0.00019283548,0.00011801755,0.9206931,0.0021876937,0.0584439,0.00074135314,0.016630024],"study_design_scores_gemma":[0.0000050150143,0.000046693905,0.00021473298,0.000011547603,0.000010213589,0.000095538955,0.000023050814,0.9875086,0.0004973488,0.011108787,0.0004678881,0.000010613628],"about_ca_topic_score_codex":0.0023800682,"about_ca_topic_score_gemma":0.0012843381,"teacher_disagreement_score":0.002560508,"about_ca_system_score_codex":0.0017031052,"about_ca_system_score_gemma":0.00072852516,"threshold_uncertainty_score":0.01354146},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17018488,0.001341508,0.81780493,0.0005810508,0.000044901284,0.00005763125,0.00007617103,0.0001905381,0.00971838],"genre_scores_gemma":[0.97498804,0.0005098394,0.023612626,0.000051212948,0.000023809695,0.0000372644,0.000020555071,0.000018276305,0.000738374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982967,0.0009400787,0.000037433085,0.0001134562,0.00034784045,0.00026445728],"domain_scores_gemma":[0.9939567,0.0048725666,0.00035709736,0.00029720025,0.00038609628,0.0001302575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027384106,0.0009994084,0.000899437,0.0005655791,0.0005564489,0.0010940514,0.00078396266,0.00071321195,0.00073370885],"category_scores_gemma":[0.006425764,0.00043887127,0.00039942816,0.00090787484,0.0019467738,0.0012026179,0.0013564683,0.00061403343,0.00016906994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002547094,0.00006412539,0.0009716561,0.00010091601,0.00006574757,0.0003253774,0.00019487647,0.8795969,0.009766337,0.09282773,0.0005376259,0.015294045],"study_design_scores_gemma":[0.000018002687,0.0000746753,0.00014289533,0.0000086727405,0.000019329818,0.00005602638,0.000022915314,0.9835085,0.0018192824,0.014065607,0.00025183285,0.000012183028],"about_ca_topic_score_codex":0.0021913,"about_ca_topic_score_gemma":0.002552091,"teacher_disagreement_score":0.0027384106,"about_ca_system_score_codex":0.0009994716,"about_ca_system_score_gemma":0.0011798228,"threshold_uncertainty_score":0.014482319},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016288448,0.14120823,0.64475054,0.027054105,0.0022464707,0.00013758386,0.00010431105,0.00010428469,0.16810608],"genre_scores_gemma":[0.61186635,0.2241014,0.11675947,0.0041209343,0.006991125,0.0006335552,0.00015633702,0.000108623826,0.0352622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975821,0.0012935913,0.00009919921,0.00021679213,0.0005781534,0.00023012435],"domain_scores_gemma":[0.99753404,0.0018202852,0.00012895906,0.0001430753,0.00027312976,0.00010052531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004358151,0.00093413366,0.0012598293,0.0010712428,0.0013675048,0.0045609325,0.0018865374,0.0032287086,0.0030204915],"category_scores_gemma":[0.004142351,0.0007103785,0.0009628045,0.0027041247,0.006068864,0.0066294805,0.0021624197,0.0052529178,0.00081123837],"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.0000050038157,0.000012614334,0.000058967205,0.00010128399,0.0000065976583,0.000042633554,0.000122561,0.0075421175,0.00012231286,0.9780106,0.0013486913,0.012626558],"study_design_scores_gemma":[0.0000046080927,0.000014855852,0.000059004906,0.00011146111,0.0000032242558,0.000058703394,0.00014493124,0.016553655,0.00007080413,0.9656281,0.017339235,0.000011530449],"about_ca_topic_score_codex":0.0014422361,"about_ca_topic_score_gemma":0.0009678698,"teacher_disagreement_score":0.0045609325,"about_ca_system_score_codex":0.0021853705,"about_ca_system_score_gemma":0.0019413558,"threshold_uncertainty_score":0.0230484},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002298252,0.0003841045,0.99525297,0.00018053077,0.000019501858,0.000020997559,0.0000148458275,0.00004046247,0.0017883765],"genre_scores_gemma":[0.36652756,0.0023252647,0.62514734,0.00020238088,0.0001593806,0.000500516,0.00010494065,0.00011701362,0.0049155727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993284,0.00038425726,0.000020933318,0.00006598545,0.00015214062,0.000048306105],"domain_scores_gemma":[0.999295,0.000503359,0.00007654848,0.00003711009,0.000067589426,0.000020363295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018015819,0.0012463032,0.00081384723,0.00042670037,0.00036746447,0.0012578677,0.0013703952,0.0014019923,0.0011593081],"category_scores_gemma":[0.0029326587,0.000596706,0.0007470894,0.00087594375,0.00088542135,0.0014771317,0.0013457637,0.0014944217,0.00027435238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001464351,0.000025163832,0.000082634004,0.000069996,0.000013224843,0.000040499217,0.0000355381,0.945924,0.00053624023,0.041538954,0.00045006128,0.0112689985],"study_design_scores_gemma":[0.0000037486632,0.000012142507,0.000012097798,0.0000060359935,0.0000028121153,0.0000063517637,0.0000059546455,0.9916644,0.000107281645,0.007675674,0.000500776,0.0000027160522],"about_ca_topic_score_codex":0.0020144207,"about_ca_topic_score_gemma":0.0022380105,"teacher_disagreement_score":0.0020144207,"about_ca_system_score_codex":0.0007397484,"about_ca_system_score_gemma":0.0010373074,"threshold_uncertainty_score":0.0095278025},"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":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010849043,0.111534394,0.028669422,0.26221555,0.20661582,0.00010025694,0.000641115,0.00044542263,0.38869303],"genre_scores_gemma":[0.064002536,0.14344805,0.024564702,0.20793015,0.18302897,0.00036828,0.0011567803,0.0007418568,0.37475863],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986401,0.00039164873,0.00008546806,0.00020009813,0.0005730133,0.0001096919],"domain_scores_gemma":[0.9959122,0.0015010836,0.00016248105,0.00059270737,0.0017158858,0.000115634284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022098466,0.0006411811,0.0006492031,0.0015406683,0.0019153384,0.003582215,0.0016038159,0.00757247,0.02269194],"category_scores_gemma":[0.011384662,0.00045480125,0.000578156,0.0018478674,0.004097465,0.005065121,0.0011724962,0.008503203,0.008193988],"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.000018532055,0.000011226034,0.00006592736,0.00018460907,0.000019740033,0.000068543675,0.00013206949,0.00034604978,0.00019436113,0.3800215,0.5538849,0.06505259],"study_design_scores_gemma":[0.000008815745,0.000009475591,0.00019637616,0.0003144337,0.000010924503,0.00015163187,0.00004668869,0.00038337588,0.00018340547,0.12838602,0.8702871,0.000021751677],"about_ca_topic_score_codex":0.008314674,"about_ca_topic_score_gemma":0.009409331,"teacher_disagreement_score":0.02269194,"about_ca_system_score_codex":0.0019013906,"about_ca_system_score_gemma":0.002174101,"threshold_uncertainty_score":0.07591206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19581167,0.007768041,0.7592248,0.0007875019,0.00012343946,0.00006384624,0.0005237501,0.0003532681,0.035343703],"genre_scores_gemma":[0.98008233,0.0047268714,0.011907329,0.0001043294,0.00017530133,0.000102307,0.00019706259,0.00008052039,0.0026240342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901056,0.00034814014,0.00003652623,0.00008619016,0.00025324314,0.00026531378],"domain_scores_gemma":[0.9920515,0.006165067,0.0004929862,0.0004073866,0.0007614867,0.000121466386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018423593,0.0011749275,0.00084567524,0.0016749263,0.00058361824,0.0013158132,0.00090168905,0.0006087906,0.0019017707],"category_scores_gemma":[0.009650674,0.00039343382,0.00052736554,0.0014875904,0.00249131,0.0019190054,0.0012917822,0.0010739712,0.00048958213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008010817,0.00003819351,0.0010518824,0.00022652453,0.00006245189,0.000375228,0.00030401268,0.76198995,0.0046359384,0.21607994,0.0016255635,0.013530179],"study_design_scores_gemma":[0.000004764209,0.00002544288,0.00059718254,0.00006781443,0.000031784344,0.00014039392,0.000063012456,0.9312498,0.0022137226,0.06455085,0.0010235528,0.000031692998],"about_ca_topic_score_codex":0.004500783,"about_ca_topic_score_gemma":0.0025087937,"teacher_disagreement_score":0.004500783,"about_ca_system_score_codex":0.0021822772,"about_ca_system_score_gemma":0.001142467,"threshold_uncertainty_score":0.015833616},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039331,0.0008113593,0.9578142,0.00014448952,0.000017875687,0.000024446383,0.000038944796,0.00015299462,0.0016647623],"genre_scores_gemma":[0.89272505,0.0014095509,0.10326468,0.00005329631,0.000035503163,0.000107398366,0.00005178623,0.00005421734,0.0022984387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993772,0.00023412291,0.00001634531,0.00010072401,0.00014281244,0.0001288023],"domain_scores_gemma":[0.9989274,0.00076310075,0.00012995595,0.000051884243,0.000096475735,0.000031257823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009345756,0.00075589994,0.0006729881,0.00053042837,0.00042180685,0.000698972,0.0005909326,0.0006015492,0.0005678594],"category_scores_gemma":[0.0029353618,0.00047737124,0.00028391072,0.0011155163,0.0012455988,0.00089500914,0.00093285687,0.0006452137,0.00013471373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001863027,0.00000839905,0.00015386194,0.000023617893,0.000005974911,0.000031956162,0.000018924158,0.9793474,0.0011316157,0.0095200995,0.00018563948,0.0095539065],"study_design_scores_gemma":[0.000003682942,0.00001661064,0.00006509539,0.0000038443086,0.0000037725572,0.00001546378,0.000013069023,0.9906345,0.00071974506,0.008252736,0.00026590587,0.000005608243],"about_ca_topic_score_codex":0.005169526,"about_ca_topic_score_gemma":0.004013109,"teacher_disagreement_score":0.005169526,"about_ca_system_score_codex":0.0013624169,"about_ca_system_score_gemma":0.0016364347,"threshold_uncertainty_score":0.010278881},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02281305,0.00046286496,0.9729086,0.00021954582,0.000052349504,0.00007328771,0.00011735985,0.00025135407,0.0031015289],"genre_scores_gemma":[0.701728,0.0006720074,0.29283732,0.00019973234,0.000055284385,0.00021951666,0.00022566128,0.00004329495,0.004019162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892706,0.00033658557,0.00006268963,0.00010723495,0.00044432032,0.0001221837],"domain_scores_gemma":[0.99811494,0.00074124866,0.00019451624,0.00041936047,0.00046539915,0.0000646242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016869716,0.0010045713,0.00079177896,0.00074529427,0.00044450237,0.0008811308,0.0013195204,0.0007913162,0.001139706],"category_scores_gemma":[0.0041977307,0.00033054955,0.0006254078,0.00068391254,0.0012040668,0.0020822908,0.0016714901,0.0010191746,0.00035436387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049889856,0.000118462136,0.0015838855,0.0002865908,0.00015684182,0.00038182977,0.00037762074,0.56971073,0.032322258,0.2339809,0.0024108829,0.15817119],"study_design_scores_gemma":[0.000038012386,0.00015035366,0.00018640145,0.000040008268,0.00006286266,0.00020982875,0.000033005268,0.94305074,0.018173464,0.035189312,0.0028001165,0.0000659113],"about_ca_topic_score_codex":0.002556361,"about_ca_topic_score_gemma":0.0040487368,"teacher_disagreement_score":0.002556361,"about_ca_system_score_codex":0.0010106965,"about_ca_system_score_gemma":0.0011917163,"threshold_uncertainty_score":0.008921683},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11846903,0.0007165159,0.87383884,0.0004679903,0.000040578485,0.000032959004,0.00015201796,0.00012351763,0.006158625],"genre_scores_gemma":[0.97337073,0.0007803047,0.024024503,0.00007832987,0.000045779772,0.00005067765,0.000060474908,0.000022174376,0.0015669835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987859,0.00046034445,0.000037251844,0.00016675418,0.00033996382,0.00020974666],"domain_scores_gemma":[0.9947043,0.003722346,0.0007413034,0.0003244917,0.00038459923,0.0001230122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017901208,0.0010834752,0.0010812893,0.0005673781,0.0005521662,0.0010573242,0.0012086453,0.0008917608,0.0011504183],"category_scores_gemma":[0.0067475135,0.0003839519,0.0004427014,0.001117765,0.0023024804,0.0017156026,0.0016472766,0.0011425714,0.00030727196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035068078,0.000043527267,0.0009711274,0.00016663922,0.00009022819,0.00071876973,0.00028471887,0.7400117,0.009178142,0.23720342,0.0007217918,0.010259338],"study_design_scores_gemma":[0.000029784824,0.00007946863,0.0002532746,0.00001392171,0.00004259848,0.0002673557,0.000062953535,0.9552166,0.0031699585,0.04023105,0.0006089446,0.000024097219],"about_ca_topic_score_codex":0.0012875188,"about_ca_topic_score_gemma":0.0008142708,"teacher_disagreement_score":0.0017901208,"about_ca_system_score_codex":0.0011334475,"about_ca_system_score_gemma":0.0006619276,"threshold_uncertainty_score":0.009467185},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30310297,0.0010830635,0.6902111,0.0002584011,0.000040312705,0.00004068041,0.000041229356,0.00015724859,0.005064969],"genre_scores_gemma":[0.9744946,0.00030224392,0.024056822,0.000034430002,0.000015145771,0.000013915252,0.000018710594,0.0000063010766,0.0010578985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999684,0.00009034216,0.000009721445,0.000048010013,0.00011544628,0.00005240154],"domain_scores_gemma":[0.99863666,0.0009830035,0.00010119056,0.00007366377,0.00018920758,0.000016312213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006387563,0.00040541237,0.00040039018,0.00016313461,0.0001994994,0.00037530277,0.00024635848,0.0005029974,0.0009254378],"category_scores_gemma":[0.0021922209,0.00011346233,0.00022500535,0.00024933854,0.00037620548,0.0005725283,0.00024212385,0.0002853424,0.0002132213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031333606,0.00008539289,0.0024126966,0.00019538072,0.00008930154,0.00029772604,0.00018097235,0.8720411,0.05770087,0.018305156,0.00039043158,0.047987647],"study_design_scores_gemma":[0.000011823479,0.00013289167,0.0005362981,0.000007833407,0.000018989569,0.00012090073,0.000026443751,0.98653364,0.010241927,0.0018911966,0.00046795848,0.000010206405],"about_ca_topic_score_codex":0.0012703357,"about_ca_topic_score_gemma":0.0014370476,"teacher_disagreement_score":0.0012703357,"about_ca_system_score_codex":0.00045765017,"about_ca_system_score_gemma":0.0004312071,"threshold_uncertainty_score":0.0033780932},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008788418,0.00059964025,0.986427,0.0001154097,0.000045420722,0.000029028372,0.000014370634,0.000071688824,0.003909053],"genre_scores_gemma":[0.6978612,0.0017586648,0.2944556,0.00016955267,0.00016062862,0.00026147274,0.000099548524,0.000044847915,0.005188527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940324,0.00029942387,0.000022845677,0.00007370851,0.00015891001,0.000041840252],"domain_scores_gemma":[0.9989808,0.00054900825,0.000110856454,0.0001581171,0.0001652423,0.000035893747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079998444,0.00050864596,0.00048952637,0.0004930743,0.00036191076,0.0005341473,0.000547733,0.0007450752,0.0022389882],"category_scores_gemma":[0.0029920863,0.00021240681,0.00031211312,0.00066910015,0.0007685708,0.001123846,0.0011170491,0.00069174945,0.00063837075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019385359,0.000043074815,0.00046422082,0.00031597223,0.000058929993,0.00035622093,0.0004440481,0.45393452,0.027054092,0.3554553,0.0022688229,0.15941104],"study_design_scores_gemma":[0.00005048971,0.00029601838,0.00018686744,0.00005511946,0.000025647283,0.000510234,0.00006897572,0.85565597,0.008512136,0.11948411,0.015114988,0.00003939958],"about_ca_topic_score_codex":0.00018872294,"about_ca_topic_score_gemma":0.00015335433,"teacher_disagreement_score":0.0022389882,"about_ca_system_score_codex":0.00047751755,"about_ca_system_score_gemma":0.00035261002,"threshold_uncertainty_score":0.007490158},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008713566,0.00029396563,0.98962104,0.000078233956,0.000014097624,0.000027597624,0.000027580127,0.000079169506,0.001144706],"genre_scores_gemma":[0.584371,0.0009203344,0.41052234,0.00011908983,0.00006006435,0.00020098509,0.00012669383,0.00005445429,0.0036250034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991788,0.00038657588,0.000035771503,0.0001727849,0.00015565961,0.00007042192],"domain_scores_gemma":[0.9991561,0.00048698523,0.00011158344,0.00008256368,0.00013116332,0.000031602583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013200364,0.001018762,0.0012412965,0.00030569118,0.00033534341,0.001138065,0.0010818379,0.0010797525,0.0016840509],"category_scores_gemma":[0.0024434365,0.000530234,0.0005590578,0.0005510471,0.00076092075,0.0018154632,0.0009533169,0.0008665242,0.00050214236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111718924,0.00003386951,0.00029207775,0.00013996291,0.000056569388,0.00020152297,0.00010644406,0.9305856,0.0054813568,0.024987387,0.00056464213,0.037438817],"study_design_scores_gemma":[0.000013795255,0.00006552496,0.00004074338,0.000007953948,0.00001571028,0.00006921792,0.00001561942,0.989574,0.0018554262,0.0077308286,0.00060358463,0.0000075821927],"about_ca_topic_score_codex":0.0008916087,"about_ca_topic_score_gemma":0.0013243884,"teacher_disagreement_score":0.0016840509,"about_ca_system_score_codex":0.00056764425,"about_ca_system_score_gemma":0.0007602296,"threshold_uncertainty_score":0.006981075},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048540886,0.0004523792,0.99313813,0.00008813932,0.000021076354,0.000033318687,0.00003850327,0.000058267255,0.0013160805],"genre_scores_gemma":[0.58645266,0.0025010603,0.40505394,0.00017564917,0.00013869799,0.00038710816,0.00032933784,0.00009139338,0.0048702066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987274,0.0005541216,0.0000593003,0.00017126674,0.0003705864,0.00011725716],"domain_scores_gemma":[0.9969348,0.002038708,0.00018313731,0.00017233996,0.00059718575,0.00007390297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001977058,0.0007365391,0.0010907619,0.0005892984,0.0003641614,0.001093743,0.0011864151,0.00080742355,0.002426958],"category_scores_gemma":[0.0070677064,0.0004331704,0.00036366394,0.0012907924,0.0009058383,0.0017856166,0.0009797119,0.0007730581,0.0005221128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013978063,0.000039254766,0.00042856517,0.00020659025,0.000029737721,0.00010128625,0.00014151764,0.8146409,0.0041243727,0.099972636,0.0028480515,0.077327386],"study_design_scores_gemma":[0.000021322776,0.000045813933,0.000051739713,0.000014301352,0.000006264504,0.00004357369,0.000016867642,0.9794719,0.0007351052,0.01869175,0.0008914778,0.000009781102],"about_ca_topic_score_codex":0.0030099868,"about_ca_topic_score_gemma":0.0017403358,"teacher_disagreement_score":0.0030099868,"about_ca_system_score_codex":0.0013791827,"about_ca_system_score_gemma":0.00113272,"threshold_uncertainty_score":0.010455787},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06581242,0.00029615674,0.92911583,0.00022023932,0.000058910693,0.00007020065,0.000026975267,0.00018862245,0.0042106034],"genre_scores_gemma":[0.94629914,0.00022252442,0.052231085,0.00008389446,0.000054823184,0.00006057191,0.000025897625,0.000018906187,0.0010030876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994241,0.00024817404,0.000031346044,0.000082574166,0.00013688777,0.00007697207],"domain_scores_gemma":[0.9982139,0.0012014288,0.00015331866,0.00018111446,0.00018232845,0.0000680097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008330497,0.00047639667,0.00047128645,0.00032194686,0.00030501344,0.0005141652,0.0007809385,0.00050155417,0.0012582252],"category_scores_gemma":[0.0035720652,0.0001238907,0.00026775073,0.00036468657,0.000668805,0.00093976076,0.00046711403,0.0006423851,0.00015249515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002859111,0.00014130565,0.0011156363,0.00016505452,0.00006412998,0.00030998676,0.00022576246,0.6171845,0.013425681,0.19390929,0.0024867265,0.17068598],"study_design_scores_gemma":[0.000020948133,0.00009859155,0.00014535812,0.0000070789247,0.000013193452,0.00009706061,0.000013749197,0.97303456,0.0013550916,0.024073241,0.0011295349,0.000011603584],"about_ca_topic_score_codex":0.0007745414,"about_ca_topic_score_gemma":0.00062950986,"teacher_disagreement_score":0.0012582252,"about_ca_system_score_codex":0.00049563183,"about_ca_system_score_gemma":0.0006284272,"threshold_uncertainty_score":0.0044056177},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0843723,0.00037196645,0.9121572,0.00018951845,0.000026619433,0.000045258257,0.000046348847,0.00017857907,0.002612266],"genre_scores_gemma":[0.97989035,0.00015135079,0.019218381,0.000038106977,0.000018595712,0.000037844624,0.0000181594,0.0000065659065,0.0006207335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947506,0.00012176322,0.00002982889,0.00011047911,0.00014027189,0.00012268499],"domain_scores_gemma":[0.9993943,0.00031440597,0.00011655743,0.00006738947,0.00007831336,0.000029053837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045946005,0.0006085971,0.00063834974,0.00026631178,0.0005070756,0.0006593959,0.0008373357,0.00047869547,0.0005902],"category_scores_gemma":[0.0015520176,0.00022891533,0.000285917,0.00037494072,0.0006759752,0.0008085727,0.0007268071,0.00041492577,0.00018439401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010704573,0.00003745312,0.00070335565,0.00007167176,0.000041724477,0.00030243333,0.00013609747,0.93211716,0.013103921,0.018729236,0.00062522886,0.034024734],"study_design_scores_gemma":[0.000008139554,0.00003144112,0.00011290616,0.0000028138181,0.000011861234,0.000057199508,0.000018578889,0.99477,0.0013943992,0.003323756,0.00026183235,0.000007053486],"about_ca_topic_score_codex":0.0026110986,"about_ca_topic_score_gemma":0.0029245466,"teacher_disagreement_score":0.0026110986,"about_ca_system_score_codex":0.0006951284,"about_ca_system_score_gemma":0.00061165297,"threshold_uncertainty_score":0.005191803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033260225,0.00019076838,0.99576026,0.000034794488,0.000011660409,0.000010317721,0.0000071943277,0.000048657184,0.0006102638],"genre_scores_gemma":[0.6083705,0.0011235565,0.38691685,0.00014771146,0.00008210458,0.00023195232,0.00006632832,0.00005076899,0.003010282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893457,0.0005036448,0.000042038562,0.00015827466,0.0002909346,0.0000705032],"domain_scores_gemma":[0.9991285,0.00047712907,0.00014422974,0.000083038816,0.00014611537,0.000020894053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014757799,0.0010282188,0.00063910254,0.00031294383,0.00020016896,0.0006953027,0.0007134366,0.0010061713,0.0008526158],"category_scores_gemma":[0.0027055794,0.00045054205,0.00052455714,0.0005137481,0.00092223857,0.0009970844,0.0007302747,0.0006318005,0.00036241434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007716275,0.000027036298,0.00017659464,0.00011412009,0.000046885696,0.00006347767,0.000059639264,0.92281663,0.009338822,0.031005073,0.00038581048,0.03588873],"study_design_scores_gemma":[0.00002640082,0.00010251236,0.00007105512,0.000010021002,0.000012344771,0.000038892013,0.000012283518,0.9861152,0.0020614206,0.010756664,0.0007787039,0.000014455477],"about_ca_topic_score_codex":0.0006034873,"about_ca_topic_score_gemma":0.00059146987,"teacher_disagreement_score":0.0014757799,"about_ca_system_score_codex":0.00053604256,"about_ca_system_score_gemma":0.0005344007,"threshold_uncertainty_score":0.0078047514},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1947708,0.0053020264,0.7347116,0.01254191,0.00068460795,0.00051252055,0.0018855623,0.001004952,0.048586003],"genre_scores_gemma":[0.84935474,0.0036009566,0.13296628,0.00090867095,0.0008334602,0.0006712758,0.0013347608,0.0004994591,0.0098303575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955018,0.0020753508,0.00015124244,0.0004760491,0.0010129134,0.00078268],"domain_scores_gemma":[0.96003705,0.036552332,0.001093126,0.0010339171,0.00087245123,0.00041108776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040869126,0.0014397209,0.0026298861,0.0008223013,0.0018297691,0.003386378,0.0021085416,0.0017684064,0.0075307833],"category_scores_gemma":[0.022364412,0.0009520153,0.0011893655,0.0022111181,0.0022835145,0.005987466,0.0025326877,0.0033724047,0.00073313713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005767392,0.00014316873,0.0009626374,0.00031760524,0.00008513667,0.00023588465,0.00021612307,0.868702,0.0012292961,0.09072144,0.008458068,0.028351873],"study_design_scores_gemma":[0.000088647466,0.00003255071,0.00024454395,0.000020924504,0.000019723675,0.000052200452,0.000075885684,0.89779896,0.00028997113,0.10025523,0.0011051985,0.000016205295],"about_ca_topic_score_codex":0.007229837,"about_ca_topic_score_gemma":0.0067729517,"teacher_disagreement_score":0.0075307833,"about_ca_system_score_codex":0.0041715913,"about_ca_system_score_gemma":0.0036825007,"threshold_uncertainty_score":0.030267179},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024079064,0.0005996151,0.97244906,0.000109661385,0.000019493395,0.000037660422,0.000052831005,0.00008562758,0.0025670205],"genre_scores_gemma":[0.7234541,0.0008834874,0.27315775,0.000072966715,0.000038230166,0.00011224518,0.00008616402,0.000029534545,0.0021655653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993673,0.0002881617,0.000036334015,0.00007241632,0.00017742075,0.00005847508],"domain_scores_gemma":[0.9993876,0.00031178794,0.00011550014,0.00007490993,0.0000907932,0.00001947584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008867296,0.0008096536,0.00048757516,0.00035239445,0.00025610824,0.00044119277,0.000519318,0.00038852476,0.0011161556],"category_scores_gemma":[0.0024278655,0.00026386025,0.00026061272,0.0004196981,0.0004858806,0.00075426337,0.0006792649,0.00040842043,0.00025836113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011850272,0.000036822315,0.0004825778,0.00015921515,0.000031442465,0.000057295485,0.00014143222,0.8249733,0.017304085,0.05757875,0.00084185303,0.098274805],"study_design_scores_gemma":[0.000020219795,0.00013550515,0.00017576052,0.00001362446,0.000015514193,0.00004107519,0.00002148629,0.98119056,0.0034698732,0.013249021,0.0016538304,0.0000134680295],"about_ca_topic_score_codex":0.00089853024,"about_ca_topic_score_gemma":0.0018228551,"teacher_disagreement_score":0.0011161556,"about_ca_system_score_codex":0.00086200394,"about_ca_system_score_gemma":0.00058760203,"threshold_uncertainty_score":0.0062543154},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0791778,0.0044544945,0.9132372,0.00037214332,0.0001262466,0.00011014501,0.00004546989,0.0003605724,0.0021158755],"genre_scores_gemma":[0.8622532,0.0021210471,0.1336837,0.00012692441,0.00008172169,0.00012151903,0.00008161219,0.000022317958,0.0015080239],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992669,0.00023714676,0.00004669848,0.0001089045,0.00027313782,0.00006722696],"domain_scores_gemma":[0.99880445,0.0004330919,0.0001835492,0.0002355459,0.00031214047,0.000031124793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011985638,0.00065643975,0.00052509183,0.00053622195,0.0004637407,0.0003791434,0.0011402691,0.0008616003,0.0002246433],"category_scores_gemma":[0.002176145,0.00022681727,0.00041836713,0.0005439488,0.0005964689,0.0009463094,0.0005300976,0.00049040467,0.00012414223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044890694,0.00012139002,0.0019640792,0.0010758823,0.00021197321,0.0015164914,0.0011948189,0.3281094,0.24232079,0.08552287,0.003599095,0.33391434],"study_design_scores_gemma":[0.00011845618,0.0015350429,0.0010363794,0.000084608066,0.00019337653,0.0023909921,0.00017473064,0.89678293,0.056661583,0.022110488,0.018790226,0.00012112093],"about_ca_topic_score_codex":0.0008044921,"about_ca_topic_score_gemma":0.0010566813,"teacher_disagreement_score":0.0011985638,"about_ca_system_score_codex":0.00026748487,"about_ca_system_score_gemma":0.0004912199,"threshold_uncertainty_score":0.006338656},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023549462,0.00063829025,0.9744213,0.00012472192,0.00007580958,0.000040463252,0.000029664647,0.00018664022,0.00093369064],"genre_scores_gemma":[0.9272062,0.00043923076,0.0711656,0.000072135714,0.00008513326,0.00007489791,0.00004870243,0.000022838127,0.00088525977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989737,0.00036386395,0.000044810247,0.00019760727,0.00025406692,0.00016608762],"domain_scores_gemma":[0.9988047,0.0006084493,0.00018065757,0.00013794652,0.00017254832,0.000095739124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013544306,0.00089799927,0.001338047,0.0003767005,0.0006198756,0.0007332458,0.0019366726,0.0008064808,0.000709425],"category_scores_gemma":[0.002705793,0.00042964856,0.00048783154,0.0007695815,0.00076358585,0.0009994416,0.0010800014,0.000734428,0.0001688336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009626645,0.00006569167,0.00029261678,0.000060855124,0.000027441276,0.00009179277,0.000055692333,0.9591861,0.0028215859,0.01137341,0.0005697763,0.025358813],"study_design_scores_gemma":[0.000008573177,0.000021749951,0.00002243446,0.0000011086239,0.0000031288266,0.000010547572,0.000003126366,0.9977233,0.00026393612,0.0017758312,0.00016376933,0.0000026296352],"about_ca_topic_score_codex":0.0029768266,"about_ca_topic_score_gemma":0.0028640549,"teacher_disagreement_score":0.0029768266,"about_ca_system_score_codex":0.0012285507,"about_ca_system_score_gemma":0.0011975494,"threshold_uncertainty_score":0.008913815},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12608989,0.00079549855,0.8702131,0.00022547811,0.000030401858,0.000060082864,0.000046073634,0.00014396041,0.0023955163],"genre_scores_gemma":[0.9551543,0.0003145977,0.04333586,0.00005539042,0.000019553376,0.00007264877,0.000022711512,0.000008055689,0.0010169207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905485,0.0004646942,0.000033651515,0.00015729947,0.000196744,0.00009275749],"domain_scores_gemma":[0.998226,0.0012058943,0.0002569365,0.00012628989,0.00014128751,0.00004370139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013100492,0.0006994385,0.00066712085,0.00044382134,0.000572772,0.00068077777,0.0008949034,0.00064358284,0.0005542606],"category_scores_gemma":[0.0034644837,0.00030636604,0.0002448077,0.00079431775,0.0008563114,0.0011466012,0.0010079027,0.00040790564,0.00014835276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016271164,0.000060858853,0.0007817357,0.00011637708,0.000046839596,0.00040138626,0.0003196397,0.92803204,0.009870749,0.030000394,0.00042327674,0.029783923],"study_design_scores_gemma":[0.000022169277,0.00013428452,0.00016273362,0.000010944215,0.000020740741,0.00012309977,0.00005870855,0.9769026,0.0026904945,0.019059163,0.00080274354,0.000012339614],"about_ca_topic_score_codex":0.0009861891,"about_ca_topic_score_gemma":0.0010661078,"teacher_disagreement_score":0.0013100492,"about_ca_system_score_codex":0.0006578439,"about_ca_system_score_gemma":0.00045895472,"threshold_uncertainty_score":0.006928265},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17796583,0.0012676249,0.81361616,0.0006065446,0.00003837701,0.00006802848,0.00008585429,0.00036602648,0.005985613],"genre_scores_gemma":[0.9791759,0.0004085381,0.019104434,0.00008362372,0.000025402911,0.000073740135,0.000029864594,0.000033577122,0.001064792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981152,0.00075801805,0.000057537247,0.00020757577,0.00059373444,0.00026792788],"domain_scores_gemma":[0.99489045,0.003653451,0.0005100626,0.00038016247,0.00044834983,0.00011748368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002651396,0.0011947817,0.0010518763,0.0006309355,0.0005410041,0.0013929557,0.0013198225,0.00087133574,0.0007049358],"category_scores_gemma":[0.009886434,0.0004539138,0.00023091852,0.0010693673,0.0021201405,0.0018186484,0.0016814531,0.00068931817,0.00018925796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019021111,0.00005381159,0.000390179,0.0000767636,0.00002458154,0.00008599067,0.00015083532,0.9558982,0.0064930157,0.01937755,0.0005364401,0.016722366],"study_design_scores_gemma":[0.000017744642,0.00010215019,0.00014376939,0.000010908454,0.000009716375,0.000039378538,0.00003339719,0.98185664,0.001942322,0.01564387,0.00018953955,0.000010604089],"about_ca_topic_score_codex":0.0017693815,"about_ca_topic_score_gemma":0.0012310997,"teacher_disagreement_score":0.002651396,"about_ca_system_score_codex":0.0018101403,"about_ca_system_score_gemma":0.0009363849,"threshold_uncertainty_score":0.014022052},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034759786,0.00095409673,0.9610038,0.00015154999,0.000026426767,0.000027215712,0.000015034473,0.000054248772,0.0030078643],"genre_scores_gemma":[0.92606723,0.0009084532,0.07086947,0.000052052936,0.00004987788,0.000049628492,0.000016451995,0.000007974777,0.0019788954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971706,0.00010881358,0.000011754468,0.000049679576,0.00008480725,0.000027807317],"domain_scores_gemma":[0.9994629,0.00037284044,0.000055121294,0.000043700413,0.00005534453,0.000009946431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004690185,0.0004987498,0.0003949126,0.00021595931,0.00023543957,0.00053464365,0.000377774,0.00059825776,0.0006269828],"category_scores_gemma":[0.0012962396,0.00016234523,0.00030585763,0.00040676206,0.00051025767,0.0007545139,0.00040352196,0.0003576403,0.00011356094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007897291,0.000074857104,0.0007873359,0.00018113165,0.000049973074,0.00031125726,0.00016225004,0.8844178,0.016824067,0.047419842,0.0004883056,0.049204253],"study_design_scores_gemma":[0.000006541409,0.000040187213,0.00009026943,0.000003775929,0.000006362629,0.00005688022,0.000012190009,0.994558,0.0012591857,0.0034969344,0.0004644576,0.0000052311216],"about_ca_topic_score_codex":0.0010564685,"about_ca_topic_score_gemma":0.0011204077,"teacher_disagreement_score":0.0010564685,"about_ca_system_score_codex":0.00036227528,"about_ca_system_score_gemma":0.00031578925,"threshold_uncertainty_score":0.0026285052},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009473705,0.0008784133,0.9683632,0.0006193736,0.00018820804,0.00012634027,0.000428648,0.0003381786,0.019583965],"genre_scores_gemma":[0.71247584,0.0035671433,0.26357457,0.0009506292,0.0003384085,0.0010063956,0.0014530879,0.00017051467,0.016463343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865377,0.00044125528,0.00006311453,0.00016868768,0.00046190992,0.00021124768],"domain_scores_gemma":[0.9954175,0.0022139992,0.00030419006,0.00094671873,0.000987273,0.00013041831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014086752,0.00078753685,0.00074977824,0.0010246466,0.00080661225,0.0014551807,0.0013389688,0.00081370963,0.0043224464],"category_scores_gemma":[0.0071856803,0.0002901199,0.00051406893,0.0017068238,0.0014732056,0.0022872428,0.0022349758,0.0013501124,0.0011810417],"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.00016310174,0.000026326521,0.00038775743,0.0002096304,0.000032109165,0.0002134881,0.0001768824,0.16469285,0.0035939664,0.73294514,0.010406942,0.08715185],"study_design_scores_gemma":[0.000038711216,0.00006415831,0.00016360775,0.000060303355,0.000019396863,0.00029726827,0.00005151451,0.61952937,0.0019246127,0.36442783,0.013386846,0.000036374357],"about_ca_topic_score_codex":0.0033683905,"about_ca_topic_score_gemma":0.002780662,"teacher_disagreement_score":0.0043224464,"about_ca_system_score_codex":0.0014720963,"about_ca_system_score_gemma":0.0017149836,"threshold_uncertainty_score":0.014460027},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00925216,0.0003166611,0.98985785,0.000059245536,0.0000127678695,0.000014145607,0.000014997942,0.00009797969,0.00037410422],"genre_scores_gemma":[0.7377248,0.0011414477,0.25907934,0.00007718617,0.00006203786,0.00011718423,0.0000550958,0.000037367852,0.0017056232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993123,0.00034977967,0.000029369327,0.00008639604,0.00017715519,0.000044920776],"domain_scores_gemma":[0.99652314,0.0026380261,0.00037537076,0.00015117195,0.00025870182,0.0000535395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012198357,0.00060686155,0.0008531677,0.00037051726,0.00041180965,0.0008436293,0.0006029475,0.0009955359,0.0006979323],"category_scores_gemma":[0.006122488,0.00043016553,0.00034130726,0.00048392286,0.0010974768,0.0011761597,0.0010815931,0.0008514391,0.00026178418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015768784,0.000047732476,0.0004729952,0.00021914368,0.000046747995,0.00014658383,0.0001656109,0.9245492,0.010112293,0.0140732955,0.00064976333,0.04935891],"study_design_scores_gemma":[0.00000770487,0.000033932807,0.00008491219,0.000005231445,0.000005432714,0.0000496689,0.000012197417,0.9939302,0.001785264,0.003857257,0.00021611986,0.000012019496],"about_ca_topic_score_codex":0.0021868558,"about_ca_topic_score_gemma":0.0017367136,"teacher_disagreement_score":0.0021868558,"about_ca_system_score_codex":0.0004223591,"about_ca_system_score_gemma":0.0009090079,"threshold_uncertainty_score":0.0064511895},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18565328,0.0026918538,0.78618574,0.0006255517,0.00013696957,0.00007902388,0.00051076367,0.00037273968,0.023744086],"genre_scores_gemma":[0.97678214,0.0010153298,0.019076247,0.000066972156,0.000045557335,0.00008046521,0.00013108534,0.000039204246,0.002762968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832314,0.00065707153,0.00008388494,0.0001880166,0.00050825905,0.00023951422],"domain_scores_gemma":[0.9945986,0.0037371109,0.00039780026,0.00040240402,0.0007617226,0.00010244035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021927205,0.0013151015,0.0014948879,0.0007501377,0.0007137433,0.0019138384,0.0013213187,0.0010892831,0.0020235223],"category_scores_gemma":[0.007187681,0.000378986,0.0006387572,0.0010932877,0.0010817184,0.0015556559,0.001635201,0.0008804603,0.00052243343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003013792,0.000046183715,0.0011796704,0.00033349296,0.00010239995,0.00046245844,0.0001609233,0.8834234,0.012509666,0.07226883,0.001328908,0.027882574],"study_design_scores_gemma":[0.000016923843,0.00006502096,0.00029422165,0.000023462999,0.00004364432,0.00028931836,0.00004919606,0.9759512,0.0042067086,0.018561589,0.00047082355,0.000028013992],"about_ca_topic_score_codex":0.0013963898,"about_ca_topic_score_gemma":0.0010736361,"teacher_disagreement_score":0.0021927205,"about_ca_system_score_codex":0.0010183025,"about_ca_system_score_gemma":0.00096409465,"threshold_uncertainty_score":0.011596382},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022875363,0.00058934366,0.9714343,0.00012474007,0.00004198781,0.000056241814,0.000049465754,0.00014046092,0.004688061],"genre_scores_gemma":[0.8764745,0.0009329901,0.11954237,0.000065804095,0.000054166983,0.0001555458,0.000042936575,0.000013630213,0.002718195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992004,0.00033201923,0.000035855373,0.0001038363,0.00024240365,0.00008556138],"domain_scores_gemma":[0.998823,0.0006656015,0.00017615841,0.00012717932,0.00017707131,0.000031049625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009853936,0.0011908234,0.00085273606,0.0004197587,0.0006240791,0.0009872627,0.0013501142,0.00089942757,0.0013975644],"category_scores_gemma":[0.0016591073,0.00045009886,0.00059716485,0.00052141707,0.00084127084,0.00095046865,0.00080867676,0.0006802052,0.00043804286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025590658,0.00008084082,0.0008208358,0.00038652096,0.00013827709,0.00076024415,0.00029598305,0.747729,0.039958104,0.14378445,0.0013836324,0.064406246],"study_design_scores_gemma":[0.00001463052,0.00014653709,0.00014354828,0.000021515463,0.000040831357,0.0002839577,0.000028350512,0.9839575,0.0044899248,0.009797788,0.0010476594,0.00002773056],"about_ca_topic_score_codex":0.00083059294,"about_ca_topic_score_gemma":0.0014519631,"teacher_disagreement_score":0.0013975644,"about_ca_system_score_codex":0.0007758859,"about_ca_system_score_gemma":0.0005431522,"threshold_uncertainty_score":0.00562948},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003331272,0.00027035477,0.9948378,0.00009749278,0.000019450417,0.000019777586,0.000015384625,0.00010773062,0.0013006176],"genre_scores_gemma":[0.35324135,0.00088415813,0.64190567,0.0002515983,0.00009771308,0.00045357327,0.00016826708,0.00021325125,0.0027843963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994622,0.00027993016,0.00001928998,0.00007834101,0.00009960507,0.000060596678],"domain_scores_gemma":[0.9987785,0.0009457668,0.0000840536,0.000060822385,0.00010106788,0.000029765153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014684784,0.0015058919,0.0014751675,0.000689109,0.00043686837,0.0011181628,0.0009475856,0.0011918832,0.0017805183],"category_scores_gemma":[0.0034489052,0.0006151478,0.00057690585,0.0009891103,0.0011269335,0.0013849918,0.0010249555,0.0013547847,0.00039588925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033703713,0.000025162613,0.00010132993,0.000040934356,0.000022456245,0.000020921165,0.000035426543,0.95516235,0.00030537363,0.017221605,0.0009206977,0.026109986],"study_design_scores_gemma":[0.00001328139,0.000015235804,0.000027129718,0.0000046595665,0.0000037189925,0.000007739317,0.000007361731,0.98602086,0.00012533892,0.013488247,0.0002829444,0.0000033954295],"about_ca_topic_score_codex":0.0020348732,"about_ca_topic_score_gemma":0.0017904021,"teacher_disagreement_score":0.0020348732,"about_ca_system_score_codex":0.00081084843,"about_ca_system_score_gemma":0.0011224161,"threshold_uncertainty_score":0.0077661276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038969535,0.0007984074,0.9544216,0.00015724376,0.000025007794,0.000047470487,0.000045406166,0.0003016733,0.0052336645],"genre_scores_gemma":[0.9305674,0.0006120382,0.06602723,0.000073094365,0.000042492964,0.00014148741,0.00007757508,0.000026960912,0.0024317086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921596,0.00036323146,0.000019117491,0.00012861694,0.00014725079,0.00012594534],"domain_scores_gemma":[0.99852896,0.0009327108,0.00016278715,0.00017648264,0.00012230122,0.000076752054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012181149,0.0005649081,0.00067582546,0.0005805574,0.00043790136,0.000600155,0.0014092791,0.000585329,0.0016733714],"category_scores_gemma":[0.002655008,0.00027064607,0.00043255067,0.00085733196,0.0009730944,0.0011780704,0.001339313,0.0005606907,0.0002849129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020339435,0.00007937776,0.0006212255,0.00011906379,0.00005138878,0.0002875419,0.00027955856,0.8300279,0.0063372706,0.093909174,0.0021476394,0.06593636],"study_design_scores_gemma":[0.000018144474,0.00008866416,0.00013796618,0.000011272909,0.000018776604,0.00008781792,0.00003045297,0.97518694,0.001294073,0.020617597,0.002496859,0.0000114104805],"about_ca_topic_score_codex":0.0017813805,"about_ca_topic_score_gemma":0.0017537051,"teacher_disagreement_score":0.0017813805,"about_ca_system_score_codex":0.0010522958,"about_ca_system_score_gemma":0.0005650325,"threshold_uncertainty_score":0.0076349378},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105743796,0.00052481354,0.8905787,0.00016149548,0.000025754744,0.00005324901,0.00003604128,0.00010772701,0.0027684656],"genre_scores_gemma":[0.97245455,0.00018066764,0.026400354,0.000027768016,0.000018945988,0.00006636061,0.000011744215,0.000009729678,0.0008298633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990754,0.0003618395,0.00003906045,0.00019752771,0.00016652246,0.0001596417],"domain_scores_gemma":[0.9989612,0.00059708284,0.00016873608,0.00007256605,0.00015191454,0.00004844103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013347504,0.001077012,0.000920318,0.00034285974,0.000425565,0.0011968936,0.0013701518,0.00086646766,0.0008187407],"category_scores_gemma":[0.0026913136,0.00043230975,0.00036585183,0.00044443397,0.0011218683,0.0010829195,0.0011695331,0.0005199537,0.00015362522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020570916,0.000039519444,0.0006300148,0.000087444816,0.00007831651,0.00027214354,0.00024908382,0.95207596,0.0066742348,0.016709562,0.00025357347,0.022724364],"study_design_scores_gemma":[0.00003694692,0.00011955698,0.0001468611,0.000006695173,0.000031766755,0.00006984425,0.000045630495,0.98834574,0.0014567904,0.009464557,0.0002649519,0.0000107206315],"about_ca_topic_score_codex":0.0019512678,"about_ca_topic_score_gemma":0.0019295141,"teacher_disagreement_score":0.0019512678,"about_ca_system_score_codex":0.0005532225,"about_ca_system_score_gemma":0.0007476549,"threshold_uncertainty_score":0.007058978},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007827686,0.00066860166,0.98847955,0.00013582325,0.00003756391,0.000026494523,0.000029088773,0.00015026038,0.0026449019],"genre_scores_gemma":[0.5409493,0.0020659058,0.44857356,0.00036461506,0.00011752651,0.00018949284,0.00015246078,0.000067854235,0.0075193048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993554,0.00019557227,0.000032330805,0.00007747144,0.00029657196,0.000042739262],"domain_scores_gemma":[0.9988745,0.0005414808,0.00011449682,0.00017933792,0.0002727266,0.000017409955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000778406,0.0006037419,0.0005153143,0.000546762,0.00031503537,0.00076358294,0.00071271596,0.00081269414,0.0014497379],"category_scores_gemma":[0.0036953064,0.00027443896,0.00028705708,0.0005970593,0.00056503166,0.0012360187,0.0009780802,0.0008816898,0.00066385197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001602394,0.000062339444,0.000508157,0.00040598624,0.00008546053,0.00023383881,0.0004668715,0.4434235,0.034394495,0.24464658,0.002494265,0.27311823],"study_design_scores_gemma":[0.000023810124,0.000088122964,0.00013995121,0.000046003057,0.000021254047,0.0002560203,0.000035619232,0.9274937,0.009936187,0.05603922,0.0058879275,0.000032117332],"about_ca_topic_score_codex":0.0007203961,"about_ca_topic_score_gemma":0.0008024158,"teacher_disagreement_score":0.0014497379,"about_ca_system_score_codex":0.0004935998,"about_ca_system_score_gemma":0.0009535304,"threshold_uncertainty_score":0.004849851},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11581062,0.00068058516,0.8803343,0.00014013736,0.00002031083,0.000036299654,0.00007413439,0.00015479015,0.002748945],"genre_scores_gemma":[0.9062442,0.00047484788,0.09236482,0.000035708952,0.000017674567,0.00004028558,0.000055513512,0.000012995387,0.0007538941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993038,0.0002450323,0.00003586052,0.00007617687,0.0002737529,0.000065304215],"domain_scores_gemma":[0.99841225,0.00089669356,0.00022032799,0.00015851478,0.00029112544,0.00002111568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083243987,0.0005663219,0.0004225824,0.00026600118,0.0002497218,0.00065028237,0.00045721108,0.0005416906,0.00054845127],"category_scores_gemma":[0.003433206,0.00019597157,0.0001439658,0.00036923817,0.0004713206,0.0005923053,0.00040072663,0.0003651581,0.00022701957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005648195,0.000086084736,0.003007125,0.0003167604,0.00008454152,0.0002659238,0.00034236116,0.7310797,0.10073368,0.04143029,0.0006459631,0.12144277],"study_design_scores_gemma":[0.000013957986,0.00012973334,0.00038990792,0.000021014777,0.000016613469,0.0001753612,0.000022108354,0.9652888,0.029982785,0.0032719478,0.0006694111,0.000018310177],"about_ca_topic_score_codex":0.0015083208,"about_ca_topic_score_gemma":0.002126887,"teacher_disagreement_score":0.0015083208,"about_ca_system_score_codex":0.00050013274,"about_ca_system_score_gemma":0.0006732704,"threshold_uncertainty_score":0.004402399},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043625417,0.0074555757,0.012890134,0.08901671,0.84844065,0.00013523008,0.0036506061,0.0023851367,0.03558969],"genre_scores_gemma":[0.024566978,0.022168145,0.03047998,0.14840226,0.2901558,0.00066634634,0.005825369,0.0050640367,0.4726711],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9921267,0.0015589508,0.0010047202,0.0010474034,0.0038531285,0.0004090468],"domain_scores_gemma":[0.97527826,0.005474437,0.0014117531,0.0017721788,0.0156233525,0.00044005932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004541804,0.0030196686,0.0023081857,0.004067564,0.0037052017,0.0043026614,0.0042957175,0.005553179,0.057041917],"category_scores_gemma":[0.043960217,0.0015025645,0.0028935352,0.003839034,0.0031162673,0.0035121373,0.0021580965,0.01417919,0.045409244],"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.000042687367,0.0000102272115,0.0000322986,0.000092393,0.000010662656,0.000080337224,0.000025658934,0.00021096332,0.00013283445,0.0057223323,0.9888455,0.004794038],"study_design_scores_gemma":[0.000060360537,0.00005932779,0.00082839857,0.0003832321,0.00004535621,0.0003273183,0.00006424029,0.0023263795,0.0010775387,0.017676495,0.97703606,0.000115339004],"about_ca_topic_score_codex":0.03293633,"about_ca_topic_score_gemma":0.02871086,"teacher_disagreement_score":0.057041917,"about_ca_system_score_codex":0.006661257,"about_ca_system_score_gemma":0.004549438,"threshold_uncertainty_score":0.19082421},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015669495,0.00047515568,0.98257625,0.00007330156,0.00002939685,0.000024442303,0.000018256296,0.0001308802,0.001002848],"genre_scores_gemma":[0.8121601,0.0008918968,0.1841925,0.00005885284,0.00007712201,0.00009809906,0.000066099456,0.000027173559,0.0024281675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999493,0.00014085487,0.000028058681,0.000099835146,0.00020107607,0.00003717029],"domain_scores_gemma":[0.99893683,0.00060685544,0.00019741859,0.00008428014,0.00015467819,0.000019904677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006250068,0.000720126,0.000620624,0.0003411155,0.0004767433,0.00055167987,0.0004848024,0.00051352143,0.00082675065],"category_scores_gemma":[0.002832298,0.00026106834,0.00025785077,0.00046899507,0.00037786405,0.00084462506,0.0005490572,0.0005863466,0.00025037382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035769513,0.00006187296,0.002276496,0.00039040938,0.00008677629,0.00056930806,0.00052886404,0.67138785,0.05856166,0.057457052,0.0011920487,0.20712999],"study_design_scores_gemma":[0.000024471052,0.0001879496,0.0002507074,0.000015341719,0.000030746134,0.000220967,0.000040868006,0.9815692,0.011122549,0.004227278,0.0022882444,0.00002172208],"about_ca_topic_score_codex":0.0015009892,"about_ca_topic_score_gemma":0.002255423,"teacher_disagreement_score":0.0015009892,"about_ca_system_score_codex":0.00064683484,"about_ca_system_score_gemma":0.0008597596,"threshold_uncertainty_score":0.004693091},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6450151,0.0024640844,0.33826414,0.0007927357,0.00013551081,0.0004586198,0.00026230878,0.0004414293,0.012166017],"genre_scores_gemma":[0.9789367,0.0003996478,0.020016829,0.000035130037,0.000026355483,0.00007788293,0.00010734517,0.000021831862,0.00037829074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9914341,0.0030192162,0.00034100926,0.0006361181,0.0041313963,0.00043818768],"domain_scores_gemma":[0.9547139,0.030532498,0.0022513673,0.0033034608,0.008664821,0.0005338969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003963904,0.0005720183,0.00054677896,0.0011284385,0.0007842331,0.00095375563,0.0011392799,0.0011006166,0.00038698313],"category_scores_gemma":[0.036681596,0.00029630834,0.00020508394,0.0019933432,0.0013588668,0.002594664,0.0010038548,0.0014178886,0.00014475537],"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.00095539895,0.0010746112,0.038983267,0.0010113182,0.00017943524,0.0005781355,0.0027657964,0.5396906,0.11189964,0.06751116,0.0027462703,0.23260437],"study_design_scores_gemma":[0.000026327843,0.000982859,0.011220526,0.00006641836,0.000032947646,0.00043139586,0.0005328507,0.939865,0.037156135,0.0067713163,0.0028403,0.00007391266],"about_ca_topic_score_codex":0.005124952,"about_ca_topic_score_gemma":0.0018666675,"teacher_disagreement_score":0.005124952,"about_ca_system_score_codex":0.0021038433,"about_ca_system_score_gemma":0.0009128137,"threshold_uncertainty_score":0.02096337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023688482,0.00030011774,0.975156,0.0000874024,0.0000207568,0.000021868633,0.0000054329835,0.000071140304,0.000648732],"genre_scores_gemma":[0.81529236,0.00036080534,0.18275243,0.0000908127,0.00004464681,0.00010810461,0.000025951587,0.000033156517,0.0012918103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914074,0.00035591784,0.000038444185,0.00011069375,0.0002696095,0.00008445409],"domain_scores_gemma":[0.99874985,0.0007395007,0.00014705442,0.00015208012,0.00017519662,0.000036317557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016757933,0.0007253475,0.00067544525,0.0004961636,0.0007568287,0.00072572596,0.001032772,0.00054299796,0.00038715397],"category_scores_gemma":[0.0030716585,0.00043583885,0.00043460628,0.0007884143,0.0007098913,0.0012500605,0.0011391412,0.00049628754,0.00009621593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001432652,0.000070833004,0.00081905205,0.00008866885,0.000084902545,0.00013377583,0.00027226552,0.8581527,0.01294128,0.03766589,0.00096130435,0.08866614],"study_design_scores_gemma":[0.0000094480865,0.000056239856,0.000079832396,0.000003000018,0.000013251617,0.00003637155,0.000017260783,0.9912382,0.0015679774,0.006480803,0.00049182907,0.000005885211],"about_ca_topic_score_codex":0.0010165675,"about_ca_topic_score_gemma":0.0013643313,"teacher_disagreement_score":0.0016757933,"about_ca_system_score_codex":0.00051072915,"about_ca_system_score_gemma":0.00087571546,"threshold_uncertainty_score":0.008862555},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038865067,0.0013061592,0.98519266,0.00030061248,0.00010596803,0.00009141255,0.00011709585,0.00022597458,0.008773605],"genre_scores_gemma":[0.47239125,0.004612639,0.503718,0.00052107195,0.00033224243,0.00047205458,0.00028535954,0.00013909569,0.017528348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884903,0.00034993776,0.00006120754,0.00032452238,0.0002550387,0.00016025711],"domain_scores_gemma":[0.9992667,0.00022405862,0.00007023654,0.00014209145,0.00023109428,0.00006577373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013237963,0.0017494997,0.0012867367,0.0008661815,0.0013777557,0.0022121747,0.0026999947,0.001828466,0.0036671145],"category_scores_gemma":[0.0014567544,0.00051065034,0.0009409021,0.00091465464,0.0016550338,0.003161101,0.0025384766,0.0018875065,0.0016854039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022589692,0.0000798749,0.00037036248,0.00037052535,0.000098521225,0.00097579753,0.00047355876,0.27774987,0.015232045,0.6151465,0.008780209,0.08049677],"study_design_scores_gemma":[0.000092185306,0.00048365167,0.00017412356,0.000117400195,0.00017989686,0.0013201826,0.00023484038,0.8010361,0.0075638425,0.14455076,0.044087686,0.0001592883],"about_ca_topic_score_codex":0.004366661,"about_ca_topic_score_gemma":0.005557517,"teacher_disagreement_score":0.004366661,"about_ca_system_score_codex":0.0015917586,"about_ca_system_score_gemma":0.00216208,"threshold_uncertainty_score":0.012267709},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017845962,0.0003778163,0.97955453,0.00010358595,0.000019208625,0.000020315514,0.000017649769,0.00006815708,0.0019928913],"genre_scores_gemma":[0.8465677,0.00049137935,0.14987734,0.00007559459,0.000043473538,0.00013207877,0.000052800307,0.00004297722,0.0027165965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919087,0.0003808148,0.000021108583,0.00009924176,0.00019762159,0.00011037294],"domain_scores_gemma":[0.99935275,0.00040628124,0.00007693773,0.000057375073,0.000071068964,0.00003552437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010010117,0.0008490013,0.00085438835,0.000356807,0.00051771,0.00084791234,0.00081228616,0.00065974885,0.0007375597],"category_scores_gemma":[0.0016926538,0.0003601086,0.00046490808,0.00087588985,0.00081737724,0.0009807841,0.0010634795,0.00077823136,0.00021067064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054299086,0.00004671522,0.0002364604,0.000046709163,0.000030094265,0.00010794843,0.000055781544,0.9381712,0.00374491,0.02912326,0.00082797883,0.027554639],"study_design_scores_gemma":[0.0000031782595,0.000013312112,0.000028954351,0.0000015463593,0.0000033351803,0.000014280763,0.000006391889,0.99646723,0.00036779695,0.0028278718,0.00026306766,0.0000031311192],"about_ca_topic_score_codex":0.0020210538,"about_ca_topic_score_gemma":0.0019704753,"teacher_disagreement_score":0.0020210538,"about_ca_system_score_codex":0.0007827373,"about_ca_system_score_gemma":0.0008275601,"threshold_uncertainty_score":0.0056792498},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006791757,0.0003464678,0.9909162,0.00007450353,0.000023777811,0.000021713795,0.000027769373,0.00025012944,0.001547693],"genre_scores_gemma":[0.52476203,0.00081956526,0.46761227,0.0001480181,0.00007324485,0.00012628907,0.00019220804,0.00011874434,0.0061477018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990368,0.00035629477,0.000046726607,0.00011320276,0.0003736427,0.00007349172],"domain_scores_gemma":[0.9983907,0.00086995505,0.00016038718,0.0001650576,0.0003602165,0.000053666037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009337247,0.0007904943,0.000798752,0.0005246566,0.00030914074,0.0010713051,0.0008404043,0.000756079,0.0015014168],"category_scores_gemma":[0.0040240563,0.00034094462,0.00033574743,0.00061731477,0.0008045323,0.0010251123,0.0013292782,0.0007491258,0.0008101441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028825965,0.00004318449,0.0006101619,0.00014108724,0.000047974783,0.00019914145,0.00019826634,0.73161614,0.020168286,0.077819765,0.003017905,0.16584988],"study_design_scores_gemma":[0.000008509212,0.00002740959,0.0000685994,0.000007148221,0.0000037792618,0.00006457902,0.00000779974,0.98660856,0.0054137004,0.0067158756,0.0010629485,0.000010917671],"about_ca_topic_score_codex":0.002196767,"about_ca_topic_score_gemma":0.0018564942,"teacher_disagreement_score":0.002196767,"about_ca_system_score_codex":0.0008860881,"about_ca_system_score_gemma":0.0011985261,"threshold_uncertainty_score":0.0064290166},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051915027,0.020487847,0.9158061,0.00032699533,0.00011175643,0.000085955166,0.000066390916,0.00015299056,0.01104695],"genre_scores_gemma":[0.8933003,0.010742638,0.09184423,0.00009835583,0.00016800506,0.00012772184,0.00007056073,0.000045684,0.003602464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996624,0.00014792406,0.000011397739,0.000039444134,0.00009992981,0.000038860213],"domain_scores_gemma":[0.9992607,0.0005032791,0.000071262075,0.00007849586,0.0000679546,0.000018297986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005038076,0.00052749575,0.0004412563,0.00041552327,0.0004974806,0.00072034326,0.0005541053,0.0005040221,0.00083974237],"category_scores_gemma":[0.0018195619,0.00024205114,0.00033583742,0.00075294374,0.00073169405,0.0006777133,0.0004193018,0.0005109057,0.00024331892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023836007,0.00009161855,0.000826057,0.00044004052,0.00007244874,0.00066047197,0.00039417754,0.6081163,0.034924127,0.18868671,0.0039526448,0.16159709],"study_design_scores_gemma":[0.000014119509,0.00016996663,0.0006966605,0.000057859066,0.000052552674,0.00071004225,0.0001066592,0.9256504,0.0057374276,0.058614243,0.008140594,0.00004951975],"about_ca_topic_score_codex":0.0020120295,"about_ca_topic_score_gemma":0.0025645872,"teacher_disagreement_score":0.0020120295,"about_ca_system_score_codex":0.0009257059,"about_ca_system_score_gemma":0.00038079915,"threshold_uncertainty_score":0.00671649},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056517445,0.00083440024,0.990695,0.0002728882,0.00009760054,0.00020828142,0.000011741449,0.00012650328,0.0021017778],"genre_scores_gemma":[0.4966788,0.0019125976,0.4932096,0.0003007699,0.00022646776,0.0020308397,0.0000705521,0.000073414296,0.0054969774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976961,0.0011407168,0.00016170683,0.00020464286,0.0006613488,0.00013540857],"domain_scores_gemma":[0.9969602,0.0015664211,0.00029047922,0.00027936633,0.0007900413,0.00011336733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046242345,0.00072354,0.00073386787,0.0007204603,0.0009265049,0.0018335643,0.0020243938,0.001202011,0.00173259],"category_scores_gemma":[0.0069365753,0.00048791806,0.00049854635,0.000606516,0.001310119,0.0017273353,0.001772244,0.0009618748,0.0004266111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012716875,0.00008146082,0.0006613873,0.00035840424,0.00014191704,0.0004965225,0.0006846481,0.555009,0.009348469,0.34119886,0.0031392493,0.08875285],"study_design_scores_gemma":[0.00004946349,0.00011953847,0.00005704229,0.000036156147,0.000049288697,0.0000951548,0.00007839195,0.940526,0.001545281,0.04878129,0.008645793,0.000016569616],"about_ca_topic_score_codex":0.00089182495,"about_ca_topic_score_gemma":0.0012682967,"teacher_disagreement_score":0.0046242345,"about_ca_system_score_codex":0.0012227858,"about_ca_system_score_gemma":0.001608628,"threshold_uncertainty_score":0.024455547},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09359843,0.0007699182,0.90029013,0.00026732314,0.000044352782,0.0000518634,0.00004027467,0.00015737388,0.004780419],"genre_scores_gemma":[0.8959026,0.00028725364,0.10202598,0.000049508526,0.000035756093,0.000046869885,0.000025349886,0.000007016018,0.0016196417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994997,0.0002458385,0.000014274842,0.00005530372,0.00015560152,0.0000292693],"domain_scores_gemma":[0.999203,0.00050429674,0.000083306935,0.000087722045,0.00009843751,0.00002328343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071329146,0.00045222166,0.00043286767,0.00028676493,0.0002967253,0.0004593046,0.0004912475,0.0005409528,0.0009542125],"category_scores_gemma":[0.0016251798,0.00016462596,0.00018640164,0.0004456137,0.00043985256,0.00059516256,0.00052201777,0.00036990634,0.00024866738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010411267,0.00012077598,0.0015440802,0.00023132774,0.00008012551,0.0008656051,0.00020843574,0.63034993,0.08943426,0.06293352,0.0019326957,0.21125814],"study_design_scores_gemma":[0.000091251124,0.00027622256,0.0002980566,0.000013197008,0.000024268058,0.00037724595,0.000022402734,0.96733654,0.01211114,0.018023433,0.0014126487,0.00001370523],"about_ca_topic_score_codex":0.00032446894,"about_ca_topic_score_gemma":0.0007364349,"teacher_disagreement_score":0.0009542125,"about_ca_system_score_codex":0.00043596022,"about_ca_system_score_gemma":0.0004502737,"threshold_uncertainty_score":0.0037722588},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1575158,0.0033484474,0.80872214,0.0007165314,0.000066639215,0.000035895722,0.00010632476,0.0004667465,0.02902152],"genre_scores_gemma":[0.9735173,0.001403852,0.020907817,0.00013348319,0.00006665645,0.000051377418,0.00007345437,0.000075201744,0.0037709149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987005,0.00036680666,0.00004359912,0.00009509456,0.000651122,0.00014285298],"domain_scores_gemma":[0.99284124,0.005028104,0.00049552985,0.00048097663,0.0010704405,0.00008376505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001985046,0.0006963886,0.00061011064,0.0008372727,0.0003514639,0.0009783948,0.0006293578,0.0009085697,0.0014943349],"category_scores_gemma":[0.016834872,0.0003245197,0.00029132896,0.00069226156,0.0015281243,0.0020166086,0.0009610471,0.0007776623,0.0005146553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014511288,0.0000442387,0.0013161738,0.00015028102,0.000045253164,0.00024642053,0.00036869853,0.79573876,0.010594283,0.16843623,0.0011297081,0.021784814],"study_design_scores_gemma":[0.000006614166,0.000039830746,0.0005218639,0.000026639538,0.000010720157,0.00014057723,0.000040083007,0.957161,0.001715586,0.039843366,0.00047947807,0.000014171527],"about_ca_topic_score_codex":0.0012844097,"about_ca_topic_score_gemma":0.000741531,"teacher_disagreement_score":0.001985046,"about_ca_system_score_codex":0.0016048378,"about_ca_system_score_gemma":0.00070324866,"threshold_uncertainty_score":0.011644006},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58036464,0.0020406274,0.4078723,0.00074405206,0.00014794455,0.00013408253,0.00020770813,0.00057240116,0.007916251],"genre_scores_gemma":[0.98139155,0.00025070817,0.017652785,0.00006405718,0.000011643073,0.00002776835,0.00011384827,0.00002100335,0.0004667216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752825,0.0012685556,0.00007754115,0.00009059844,0.0007739111,0.0002611843],"domain_scores_gemma":[0.9765543,0.018557323,0.0008055212,0.0012169748,0.0025467116,0.0003192609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061056125,0.0005866698,0.00063458463,0.0008543867,0.00034090775,0.0012705759,0.00087456184,0.0011017428,0.0010112595],"category_scores_gemma":[0.021249995,0.00019998371,0.00037945437,0.00081473216,0.00091338006,0.0023734018,0.0016798851,0.00075270125,0.00015434145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011796849,0.00013647584,0.0017108985,0.00009431108,0.00008210887,0.00005931109,0.000042568077,0.93885916,0.00457965,0.012108784,0.00041583058,0.04073121],"study_design_scores_gemma":[0.000019340583,0.00023207958,0.0002765507,0.000008001406,0.000015440479,0.000024289637,0.0000149634425,0.99364024,0.0034236507,0.0022262074,0.00010218433,0.000016953956],"about_ca_topic_score_codex":0.005251573,"about_ca_topic_score_gemma":0.0024976304,"teacher_disagreement_score":0.0061056125,"about_ca_system_score_codex":0.0016799961,"about_ca_system_score_gemma":0.0012916711,"threshold_uncertainty_score":0.03228998},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004690549,0.0421585,0.79672986,0.0051341886,0.004380163,0.000090160676,0.000462023,0.0004951043,0.14585939],"genre_scores_gemma":[0.40220848,0.100058265,0.27754977,0.006012463,0.013560322,0.00092658564,0.0011712268,0.0005876994,0.19792518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939704,0.00017707545,0.000028961103,0.00011163738,0.0002258443,0.000059454032],"domain_scores_gemma":[0.99870706,0.00070241705,0.00008412008,0.0001684496,0.00025338362,0.00008456925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008115074,0.0009811074,0.0012788317,0.0020763641,0.0008582706,0.0023696632,0.0010100256,0.0018275828,0.020613166],"category_scores_gemma":[0.0023972988,0.00038981746,0.0007834037,0.002848758,0.0017945127,0.0024031333,0.001072951,0.0032471872,0.0077657844],"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.00002820468,0.000035249766,0.00028618242,0.00035207887,0.0000345869,0.00018868083,0.00012306569,0.012749009,0.001388779,0.87952614,0.031945597,0.073342375],"study_design_scores_gemma":[0.000012355643,0.000036948855,0.00023942985,0.00013084536,0.000017962342,0.00046806745,0.00006420525,0.076310486,0.0005399413,0.85201204,0.070140995,0.000026747073],"about_ca_topic_score_codex":0.0007452935,"about_ca_topic_score_gemma":0.0005048311,"teacher_disagreement_score":0.020613166,"about_ca_system_score_codex":0.00092802796,"about_ca_system_score_gemma":0.0007523904,"threshold_uncertainty_score":0.068957925},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035711713,0.00061991916,0.95931095,0.0001910253,0.00003768847,0.000076699274,0.000022875287,0.00007306241,0.00395612],"genre_scores_gemma":[0.8994569,0.00063494063,0.096107215,0.000058346304,0.00005941968,0.00015035996,0.000029396002,0.000030762913,0.0034726425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911517,0.00044828115,0.000021807602,0.00012300839,0.00018839954,0.0001033558],"domain_scores_gemma":[0.99882025,0.00086963194,0.00009015295,0.00004124284,0.00015035232,0.000028308265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010220556,0.0010078868,0.001024588,0.00051975175,0.0005013797,0.00085276045,0.0010417606,0.0011046635,0.0011380895],"category_scores_gemma":[0.0034758297,0.00051365164,0.0003798322,0.0007234494,0.0008366083,0.0010008318,0.00083949,0.0005050655,0.00027835878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009214568,0.000046941484,0.00024963255,0.0001041484,0.00004212067,0.00018349472,0.0001216715,0.94098157,0.0035626208,0.024120675,0.0008739225,0.029620968],"study_design_scores_gemma":[0.000012242926,0.000042504445,0.00005064597,0.0000028607265,0.000007593929,0.000028420653,0.000019446503,0.992163,0.0005509771,0.0067920685,0.00032459034,0.0000056047284],"about_ca_topic_score_codex":0.001952505,"about_ca_topic_score_gemma":0.002015608,"teacher_disagreement_score":0.001952505,"about_ca_system_score_codex":0.00079116086,"about_ca_system_score_gemma":0.00067934836,"threshold_uncertainty_score":0.005740285},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8755319,0.0011733269,0.1158867,0.00031043522,0.000053164695,0.000027290112,0.0001084297,0.00019751987,0.0067111496],"genre_scores_gemma":[0.99855834,0.00015184561,0.0009672378,0.0000120565,0.0000073050182,0.0000055752544,0.000011749693,0.000003076676,0.00028278815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992712,0.0002726859,0.000030143112,0.0000848046,0.00013499906,0.00020621979],"domain_scores_gemma":[0.9959997,0.0029131684,0.00033654633,0.00011568118,0.0005014807,0.00013347763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013212872,0.00078667875,0.00087870605,0.0005079873,0.00076057744,0.0010639497,0.00079640275,0.0008534514,0.0006935192],"category_scores_gemma":[0.0036124366,0.00022797548,0.00034556226,0.0005177808,0.0011994466,0.00061283895,0.0008576482,0.00047941168,0.00012825425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007932952,0.00008424341,0.0048119226,0.00017025786,0.00012213133,0.00091446796,0.00033742064,0.9643637,0.009908523,0.006039712,0.0006050268,0.011849369],"study_design_scores_gemma":[0.000015077348,0.0001968873,0.0008809809,0.000007609014,0.0000676471,0.00022747356,0.00011729878,0.9950872,0.0019403959,0.0013662765,0.00007817786,0.00001497716],"about_ca_topic_score_codex":0.010570708,"about_ca_topic_score_gemma":0.0055269054,"teacher_disagreement_score":0.010570708,"about_ca_system_score_codex":0.0012320981,"about_ca_system_score_gemma":0.0010049925,"threshold_uncertainty_score":0.021018326},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0865885,0.0002879043,0.9055202,0.0008898008,0.00006305388,0.00010653629,0.00006192661,0.00018713703,0.0062948023],"genre_scores_gemma":[0.968698,0.00013874301,0.02888132,0.000102407525,0.00004061035,0.000112591675,0.000020484258,0.000036919973,0.001968871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99707425,0.0015580092,0.00007140855,0.00027849563,0.0005730978,0.0004446551],"domain_scores_gemma":[0.9959109,0.0025360493,0.00038174354,0.00045818926,0.000396203,0.0003170523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037368934,0.0012096985,0.0013562732,0.00065687724,0.0010538509,0.002206789,0.00251159,0.002178673,0.0020658604],"category_scores_gemma":[0.01114374,0.00061326695,0.0009472512,0.0008504964,0.0022610743,0.0051214155,0.002261481,0.001816567,0.00035664663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019016984,0.00017891536,0.0010997996,0.00008665961,0.000056591372,0.00032645222,0.0002384759,0.6038847,0.0036666736,0.35986394,0.0020557174,0.028351909],"study_design_scores_gemma":[0.000019220786,0.00005285512,0.00011566297,0.0000066667308,0.000008352963,0.0001057473,0.000026606162,0.8901328,0.00047350657,0.108514376,0.0005278241,0.000016389657],"about_ca_topic_score_codex":0.0014708366,"about_ca_topic_score_gemma":0.0009811022,"teacher_disagreement_score":0.0037368934,"about_ca_system_score_codex":0.0020344297,"about_ca_system_score_gemma":0.0016543202,"threshold_uncertainty_score":0.019762814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015380682,0.00067841366,0.9801522,0.00010290377,0.000055130553,0.00004263374,0.00006499821,0.00015788956,0.0033651625],"genre_scores_gemma":[0.44916368,0.0011067713,0.54548633,0.00009899093,0.000140702,0.00018140767,0.00025919924,0.000046847672,0.0035161145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992136,0.0002587423,0.000042974974,0.00013071708,0.0002867654,0.00006727858],"domain_scores_gemma":[0.99888283,0.00031887426,0.0001801162,0.00024213974,0.0003318371,0.00004418385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006069836,0.00073450676,0.0005513219,0.0005339012,0.0005023477,0.00068367634,0.0007739518,0.00059232535,0.0011154732],"category_scores_gemma":[0.0023621642,0.0002933043,0.000357948,0.0007735308,0.00067783927,0.00093819376,0.0006677531,0.00077991956,0.000526593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026988104,0.0000602085,0.0007936172,0.00023602633,0.000097661985,0.00037007642,0.00035714923,0.52399784,0.043181155,0.22336219,0.003127054,0.20414713],"study_design_scores_gemma":[0.0000585969,0.00030389222,0.0003021577,0.00004746625,0.000053277574,0.00071231124,0.000046546837,0.91104233,0.023946706,0.048552245,0.0148600275,0.00007441598],"about_ca_topic_score_codex":0.0012100771,"about_ca_topic_score_gemma":0.001969397,"teacher_disagreement_score":0.0012100771,"about_ca_system_score_codex":0.00079285714,"about_ca_system_score_gemma":0.0010907344,"threshold_uncertainty_score":0.005752623},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026697252,0.00023684326,0.9655146,0.0002401606,0.000045707948,0.00011444792,0.000070855385,0.00007489647,0.0070052543],"genre_scores_gemma":[0.9035547,0.000596425,0.088190526,0.00012412317,0.000039572573,0.00026604245,0.00009598367,0.00003661911,0.007096045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991165,0.0003666782,0.000033074226,0.00010600076,0.00023610941,0.00014163733],"domain_scores_gemma":[0.99923635,0.00045139962,0.00009797503,0.000038277958,0.0001124569,0.000063553365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093281246,0.0010921292,0.000868741,0.00047301265,0.0005596984,0.0011628832,0.0013455489,0.0008043821,0.001568973],"category_scores_gemma":[0.001832225,0.00034086092,0.00064731593,0.0008768043,0.0011530037,0.0012983425,0.0010367977,0.0010726383,0.0001686616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032130578,0.000027088774,0.00021050927,0.00004427896,0.000014500046,0.00006770317,0.0000423072,0.9588962,0.00078280544,0.03420009,0.0003768833,0.0053054956],"study_design_scores_gemma":[0.0000050761228,0.000012968949,0.000027044925,0.0000015867483,0.0000021674734,0.000008273194,0.000008609672,0.99374074,0.0000882384,0.005884367,0.00021813757,0.000002850683],"about_ca_topic_score_codex":0.01284715,"about_ca_topic_score_gemma":0.009392306,"teacher_disagreement_score":0.01284715,"about_ca_system_score_codex":0.002216084,"about_ca_system_score_gemma":0.0023846477,"threshold_uncertainty_score":0.025544763},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9559779,0.00039441456,0.0389921,0.00013678895,0.000028644043,0.00002249206,0.00007847162,0.00013932893,0.0042298753],"genre_scores_gemma":[0.9981135,0.000075337375,0.0014256276,0.00001542479,0.000005045331,0.0000066448583,0.00001703907,0.0000058191204,0.00033558754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992003,0.0003079902,0.0000245082,0.00006447815,0.00022743717,0.0001753099],"domain_scores_gemma":[0.99228776,0.004984979,0.000527368,0.00023406064,0.0016576061,0.00030833925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015104933,0.0009611286,0.0008169638,0.000712777,0.00069474196,0.00089571375,0.0005597021,0.0011384983,0.00075064297],"category_scores_gemma":[0.0069457754,0.0002616699,0.00032074502,0.00065237744,0.0013528431,0.0006898741,0.0007669108,0.00047331036,0.0001620316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083939516,0.000066768334,0.004275939,0.00008613667,0.00007515905,0.00032127934,0.00018086654,0.9621328,0.021554766,0.0029042324,0.0001987012,0.0073638605],"study_design_scores_gemma":[0.000027878692,0.0002871513,0.0010634534,0.0000067879023,0.000028998542,0.000088717425,0.00004103628,0.99274725,0.0049836067,0.00063315395,0.00006937091,0.000022567188],"about_ca_topic_score_codex":0.010066519,"about_ca_topic_score_gemma":0.0059875883,"teacher_disagreement_score":0.010066519,"about_ca_system_score_codex":0.0009959931,"about_ca_system_score_gemma":0.0012460207,"threshold_uncertainty_score":0.020015836},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13578834,0.0014487762,0.8459391,0.0014290279,0.00009189326,0.000056188917,0.00026689481,0.00011202361,0.014867732],"genre_scores_gemma":[0.93104845,0.0017213844,0.061866775,0.00031620625,0.00021668464,0.00011034583,0.0002575138,0.00011448092,0.0043481593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810165,0.0007803307,0.00008841129,0.00027552655,0.0004481498,0.00030585655],"domain_scores_gemma":[0.9815106,0.01608892,0.0009712191,0.0005438544,0.000656631,0.000228703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003702842,0.000947848,0.0011458697,0.0011583787,0.0006268029,0.0022223885,0.0015455827,0.0016492859,0.0025406785],"category_scores_gemma":[0.024212465,0.00054413493,0.00055794895,0.0013275532,0.00400814,0.0050099846,0.0023496186,0.0018140768,0.00032631663],"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.00022163078,0.00006550712,0.00072648656,0.00014519869,0.000031148436,0.00011616415,0.00023585398,0.28073224,0.0020189693,0.7027032,0.0008312022,0.012172367],"study_design_scores_gemma":[0.000039598144,0.00006277397,0.00022754433,0.000035266574,0.00001184381,0.000058122354,0.000041793515,0.6875391,0.0012696355,0.3102478,0.00043908446,0.000027462676],"about_ca_topic_score_codex":0.0023499173,"about_ca_topic_score_gemma":0.0015973108,"teacher_disagreement_score":0.003702842,"about_ca_system_score_codex":0.0023206065,"about_ca_system_score_gemma":0.0017426743,"threshold_uncertainty_score":0.019582748},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32231072,0.008804959,0.6165623,0.0013741378,0.00012370555,0.00014964005,0.0003222029,0.00036981245,0.049982443],"genre_scores_gemma":[0.98856956,0.0021303284,0.0070183314,0.00008386935,0.00005622319,0.000041495856,0.00007263079,0.000028270526,0.0019992755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989544,0.00038825857,0.000029993242,0.0000682844,0.00034260892,0.000216362],"domain_scores_gemma":[0.99348336,0.004770404,0.00051737844,0.00023137736,0.00092387357,0.00007358183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019482297,0.001294876,0.00083215244,0.0010834818,0.000637546,0.0011455211,0.00080797775,0.000901707,0.0013663775],"category_scores_gemma":[0.010337159,0.00026197344,0.0005046699,0.0011376982,0.0013061787,0.00096403406,0.0009989914,0.0006710847,0.0003786832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008451862,0.000023925006,0.00068866636,0.00008121746,0.000026586418,0.00017365614,0.00012394911,0.9619443,0.004108148,0.025166051,0.00045029444,0.0071286997],"study_design_scores_gemma":[0.0000037722812,0.000074251875,0.00041926093,0.000024612396,0.000017860737,0.00009099422,0.000044652334,0.9935868,0.0010866927,0.004316822,0.00032117686,0.000013037594],"about_ca_topic_score_codex":0.008578061,"about_ca_topic_score_gemma":0.0055694287,"teacher_disagreement_score":0.008578061,"about_ca_system_score_codex":0.0019780067,"about_ca_system_score_gemma":0.0008276118,"threshold_uncertainty_score":0.017056286},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045051677,0.000084329906,0.9942086,0.000030697236,0.000014554311,0.000010676817,0.000009552873,0.000042764244,0.0010936751],"genre_scores_gemma":[0.51651233,0.0005941573,0.4770467,0.00014338686,0.00006585803,0.00020383636,0.000106751344,0.000045479956,0.005281471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937075,0.00019021197,0.000019825684,0.00013804933,0.00021456914,0.000066618915],"domain_scores_gemma":[0.9994814,0.00020115772,0.000073270756,0.000058813424,0.00014855487,0.0000368078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000598476,0.0009042296,0.0007618458,0.00029682973,0.00030844245,0.00069838704,0.0009190496,0.0008068106,0.0015599219],"category_scores_gemma":[0.001128,0.00040142192,0.00042296585,0.0006705556,0.00071472954,0.00083641347,0.00092994963,0.0005383288,0.00060412986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002213529,0.00007166941,0.00050542556,0.0001945683,0.000102451515,0.00019465924,0.00015841388,0.8028226,0.046029773,0.05096927,0.0012500626,0.097479746],"study_design_scores_gemma":[0.000032269632,0.000112421636,0.00011863033,0.000009756259,0.00001774421,0.00008352746,0.000031913878,0.9851821,0.0050762054,0.0077885487,0.0015328667,0.000014088002],"about_ca_topic_score_codex":0.0007921517,"about_ca_topic_score_gemma":0.0009662027,"teacher_disagreement_score":0.0015599219,"about_ca_system_score_codex":0.0004466916,"about_ca_system_score_gemma":0.000566211,"threshold_uncertainty_score":0.0052184463},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03317746,0.0005777575,0.9643437,0.00014822185,0.000079254336,0.000054281583,0.000023367267,0.00011808288,0.0014779953],"genre_scores_gemma":[0.84089375,0.0005402746,0.15658484,0.00013347145,0.00009330008,0.00013343936,0.00006261399,0.00006150232,0.0014968321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998855,0.0005658126,0.00005210708,0.00018887159,0.0002267981,0.000111289686],"domain_scores_gemma":[0.99845505,0.0007062521,0.00024386129,0.00012790298,0.00038667492,0.000080155216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024168326,0.0007700036,0.00067297113,0.00039273527,0.0005006407,0.0010975274,0.0008609187,0.00046835173,0.0011877414],"category_scores_gemma":[0.0029744783,0.0004495219,0.00030516848,0.00045947975,0.00060326443,0.0009729869,0.00078237866,0.0007264457,0.00029905557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012888042,0.00009273874,0.0006352101,0.00008759811,0.00008137049,0.00011557494,0.00012491102,0.9238954,0.013329829,0.016585741,0.0010076282,0.04391523],"study_design_scores_gemma":[0.000012831588,0.000055211218,0.00009189553,0.0000035033672,0.000013043952,0.000023381353,0.000016701091,0.9957203,0.0018028864,0.0017934308,0.0004611339,0.0000057665657],"about_ca_topic_score_codex":0.0014019955,"about_ca_topic_score_gemma":0.0020296683,"teacher_disagreement_score":0.0024168326,"about_ca_system_score_codex":0.0009740077,"about_ca_system_score_gemma":0.0015607695,"threshold_uncertainty_score":0.01278162},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30550343,0.002286076,0.6833886,0.00043169426,0.000042130257,0.000035156965,0.00027577035,0.00033720362,0.007700004],"genre_scores_gemma":[0.9912587,0.00048656377,0.007364968,0.000038115453,0.000028165265,0.000025416239,0.00007069856,0.000027202554,0.000700272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988305,0.0004432606,0.00004648147,0.00013677414,0.0003790702,0.00016393106],"domain_scores_gemma":[0.9930768,0.005467978,0.0005112432,0.0004178298,0.00043082435,0.00009527673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020835288,0.0006060347,0.00095419114,0.0007564955,0.0005353104,0.00094515027,0.0008291028,0.0008750557,0.0011440384],"category_scores_gemma":[0.0101594385,0.00042413778,0.0003592404,0.0010603034,0.0016676212,0.0021190967,0.0010412292,0.0005807124,0.00025466116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000484773,0.000012482696,0.00096386607,0.00005803977,0.000016869735,0.00025390915,0.00011210976,0.97510296,0.0014131898,0.017770572,0.00028412163,0.003963438],"study_design_scores_gemma":[0.000005835417,0.000026452402,0.0005523103,0.000009539716,0.0000075911307,0.00016535085,0.00004520303,0.9876133,0.0003624648,0.011017385,0.00018322056,0.000011329191],"about_ca_topic_score_codex":0.0022460844,"about_ca_topic_score_gemma":0.0016799266,"teacher_disagreement_score":0.0022460844,"about_ca_system_score_codex":0.0020225537,"about_ca_system_score_gemma":0.0005779058,"threshold_uncertainty_score":0.014674664},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.850101,0.002155959,0.13950875,0.00036341202,0.00015030314,0.00044893607,0.000080522164,0.00067438965,0.0065167993],"genre_scores_gemma":[0.98603743,0.00016246621,0.013297261,0.000021687232,0.00001583697,0.000104441686,0.00004515234,0.000013819838,0.00030181254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99552166,0.0022979926,0.00019595605,0.00035059452,0.0012892648,0.00034458336],"domain_scores_gemma":[0.9775244,0.016923036,0.0015047842,0.0012770128,0.0022186171,0.0005522272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068084216,0.0009766318,0.0008123786,0.0012098571,0.0008397167,0.0012364185,0.0012538001,0.001042317,0.000667875],"category_scores_gemma":[0.016569944,0.00031321426,0.00028875394,0.0010017696,0.0010644044,0.0013897609,0.0010517611,0.0008364489,0.00011380116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002284971,0.0010028272,0.005982389,0.00032341815,0.00024799223,0.00017400076,0.00032314053,0.8680494,0.019366687,0.011432649,0.0011773296,0.089635216],"study_design_scores_gemma":[0.000105952095,0.0008287543,0.0005073769,0.000009499246,0.0000330956,0.00005913589,0.000058635025,0.99028814,0.0063892384,0.001367731,0.0003350497,0.000017419909],"about_ca_topic_score_codex":0.0019764418,"about_ca_topic_score_gemma":0.0008341149,"teacher_disagreement_score":0.0068084216,"about_ca_system_score_codex":0.0022430718,"about_ca_system_score_gemma":0.0009715474,"threshold_uncertainty_score":0.03600675},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025140513,0.00045184005,0.993566,0.00011127918,0.00003499605,0.00003137424,0.00002429577,0.000060941256,0.003205261],"genre_scores_gemma":[0.6698078,0.002450841,0.315347,0.00020327012,0.00021418456,0.0004154207,0.00008925382,0.00008352491,0.011388674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993648,0.00025717955,0.000024070105,0.00009987957,0.00018297597,0.0000711493],"domain_scores_gemma":[0.9996432,0.00017098068,0.000037594986,0.000027563978,0.000098977354,0.000021726853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009950185,0.00093661156,0.0009507101,0.00046285128,0.00063105003,0.0011488802,0.0013873905,0.00083274813,0.0019471445],"category_scores_gemma":[0.0013950518,0.0003327825,0.00047967522,0.0006941285,0.0008137771,0.0013048222,0.0008773964,0.0010875646,0.000546682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000456358,0.00007199739,0.00016125874,0.00011460024,0.00003158773,0.00028826695,0.00023301097,0.70406765,0.005008018,0.23786972,0.0026184828,0.04948982],"study_design_scores_gemma":[0.000008440814,0.00004018121,0.000040977662,0.0000088543875,0.00001027361,0.00007145813,0.000031787804,0.97169083,0.0005405589,0.024991378,0.0025548725,0.000010321633],"about_ca_topic_score_codex":0.0028108961,"about_ca_topic_score_gemma":0.0031468887,"teacher_disagreement_score":0.0028108961,"about_ca_system_score_codex":0.001209031,"about_ca_system_score_gemma":0.0009479459,"threshold_uncertainty_score":0.008772194},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24246755,0.0008804886,0.7285828,0.0012449706,0.00021563488,0.000120921555,0.00016618852,0.0012795936,0.025041824],"genre_scores_gemma":[0.8887774,0.00059382775,0.10416544,0.00030035962,0.000096819,0.00010229694,0.0001054273,0.00013841422,0.005719978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988943,0.0004067,0.00005238492,0.0001877263,0.00023204216,0.00022683255],"domain_scores_gemma":[0.9917345,0.0043955497,0.00046307725,0.0024495583,0.00069030095,0.00026697348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011203127,0.00069029443,0.0006843099,0.0008431516,0.0005575922,0.0013893613,0.0015225331,0.0012134388,0.0036661183],"category_scores_gemma":[0.013222039,0.00048126213,0.00046584362,0.0012985071,0.0012791192,0.0020151301,0.0013823425,0.001269526,0.0011239182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025336896,0.0005493181,0.0048221936,0.00048371858,0.00016010403,0.00063003,0.00072386686,0.37696323,0.14478408,0.22397828,0.007275049,0.23709658],"study_design_scores_gemma":[0.00019944725,0.00051875756,0.0013855235,0.00004782732,0.00011208256,0.0011418381,0.00036212092,0.86179966,0.037298914,0.08946591,0.0075983475,0.00006945249],"about_ca_topic_score_codex":0.0004217922,"about_ca_topic_score_gemma":0.0005919348,"teacher_disagreement_score":0.0036661183,"about_ca_system_score_codex":0.00071485905,"about_ca_system_score_gemma":0.00043411582,"threshold_uncertainty_score":0.0122644305},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16009712,0.00027254695,0.8243471,0.0007581041,0.000037008685,0.00011099593,0.0000640428,0.000059524024,0.014253589],"genre_scores_gemma":[0.969438,0.00030141635,0.026048949,0.00012775959,0.00003096976,0.000108260974,0.000024696028,0.00002353549,0.003896431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904007,0.00042657397,0.00002025013,0.000099876925,0.00021014766,0.00020297065],"domain_scores_gemma":[0.99728084,0.0018277359,0.00033042993,0.00014707597,0.00026278428,0.00015119488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017517979,0.0008807405,0.0006663291,0.0007446031,0.00067424326,0.0013642379,0.0015937566,0.0015014282,0.0021714226],"category_scores_gemma":[0.005333599,0.00046198576,0.0006760107,0.00079273817,0.0027583004,0.002933685,0.0012708743,0.0012682225,0.0001848258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071709546,0.000046458437,0.000583939,0.00003811717,0.000031112286,0.00021849858,0.00018610829,0.6739921,0.0028846178,0.31559062,0.00072450185,0.0056322007],"study_design_scores_gemma":[0.000007873099,0.000027228443,0.00009338563,0.0000059301433,0.000006989776,0.000047274243,0.000037816433,0.9472572,0.0002764008,0.051902957,0.00032817177,0.000008778588],"about_ca_topic_score_codex":0.0051989923,"about_ca_topic_score_gemma":0.0030781152,"teacher_disagreement_score":0.0051989923,"about_ca_system_score_codex":0.0023072448,"about_ca_system_score_gemma":0.0013539934,"threshold_uncertainty_score":0.016740382},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050301,0.002122637,0.94288826,0.0001470482,0.000037246824,0.000031870597,0.000019108347,0.00007875165,0.0043741385],"genre_scores_gemma":[0.90209574,0.0040319366,0.09143826,0.000073879826,0.00015338462,0.000064576074,0.00003960276,0.000027284645,0.0020754086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957126,0.00015282888,0.000014000906,0.000032585293,0.00019829803,0.000031144446],"domain_scores_gemma":[0.9994727,0.0003542358,0.000059335838,0.00003535497,0.00007018827,0.00000828476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005233682,0.00072343147,0.0003811598,0.00035239055,0.00025960413,0.00063905923,0.00033244197,0.00041213873,0.00039408167],"category_scores_gemma":[0.0011861101,0.00022163332,0.00043156033,0.00049267587,0.0005310286,0.00049724616,0.00041476544,0.0003220715,0.00018671756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017770512,0.00003831995,0.0019523558,0.0002494577,0.00012571148,0.0006965403,0.00024991465,0.7453802,0.0814234,0.071897745,0.0008683064,0.09694032],"study_design_scores_gemma":[0.000008403255,0.00013621755,0.0004465198,0.000017033064,0.00004595157,0.0003274352,0.000022066126,0.97962934,0.0073423753,0.009985682,0.0020235775,0.000015483378],"about_ca_topic_score_codex":0.00046321453,"about_ca_topic_score_gemma":0.00068115134,"teacher_disagreement_score":0.00072343147,"about_ca_system_score_codex":0.00052247226,"about_ca_system_score_gemma":0.00028623093,"threshold_uncertainty_score":0.0037908554},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02029654,0.0022719195,0.97200745,0.00039154693,0.00013280798,0.00009914497,0.000096704396,0.00050908414,0.0041947826],"genre_scores_gemma":[0.7739049,0.003574112,0.21513604,0.00023767712,0.00014190751,0.0003458168,0.00024511633,0.00009412947,0.006320235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944764,0.00019383148,0.000030955056,0.00005442604,0.0002274941,0.00004567006],"domain_scores_gemma":[0.9986356,0.00071370654,0.00014020823,0.00016486003,0.00030748136,0.00003813176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005851106,0.00046269086,0.00046678333,0.00052837667,0.00044731202,0.00053455756,0.00066553545,0.0009079078,0.0011718057],"category_scores_gemma":[0.0030652669,0.00020502019,0.0004149335,0.00072337594,0.00073754945,0.00071565586,0.0005897549,0.0008333852,0.0004223027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017450542,0.000039034723,0.0007034997,0.0003350087,0.00005121104,0.00036945916,0.000175283,0.77400815,0.01613386,0.112501495,0.0027808077,0.092727765],"study_design_scores_gemma":[0.000013206301,0.000065480104,0.00013147033,0.000021019749,0.000011875729,0.0001119002,0.00001148925,0.97231907,0.0034737869,0.021829559,0.0019953905,0.000015677546],"about_ca_topic_score_codex":0.002945769,"about_ca_topic_score_gemma":0.002668417,"teacher_disagreement_score":0.002945769,"about_ca_system_score_codex":0.00075731095,"about_ca_system_score_gemma":0.0013379111,"threshold_uncertainty_score":0.005857289},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22213288,0.0012866372,0.76851386,0.00025054484,0.000049471313,0.000083720806,0.00006552716,0.00022525659,0.007392082],"genre_scores_gemma":[0.9568726,0.00064407644,0.041141856,0.000028495684,0.000024381949,0.00003727911,0.000019767167,0.0000064055976,0.0012252516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995666,0.00017151957,0.00001774097,0.000055002824,0.00013665059,0.000052469695],"domain_scores_gemma":[0.9989593,0.0006241709,0.00014949887,0.00008230327,0.00016561325,0.000019094288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066499686,0.0008000954,0.00059826265,0.00037616494,0.0004855505,0.0006748195,0.0005891709,0.00069356174,0.00044690992],"category_scores_gemma":[0.001491347,0.0002462068,0.00030755156,0.0005039061,0.0006938408,0.00067509257,0.00046754527,0.0004763034,0.00020719782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028131608,0.00006726239,0.0016803654,0.00026208666,0.00008603228,0.0011887954,0.0003586366,0.843703,0.054305192,0.063054435,0.0006314587,0.034381423],"study_design_scores_gemma":[0.000014192258,0.00016189754,0.0002806068,0.00001022001,0.00003443065,0.00031952554,0.00003887442,0.98790705,0.0048986534,0.005812719,0.00050287985,0.000018979048],"about_ca_topic_score_codex":0.0015159018,"about_ca_topic_score_gemma":0.0021151982,"teacher_disagreement_score":0.0015159018,"about_ca_system_score_codex":0.00068442343,"about_ca_system_score_gemma":0.00037592693,"threshold_uncertainty_score":0.0049659014},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47038814,0.0033270558,0.5086414,0.0005770192,0.00006129946,0.00007485996,0.00019910115,0.00018654202,0.016544519],"genre_scores_gemma":[0.98899966,0.0007448864,0.009125225,0.000023741351,0.000017194841,0.000023182296,0.000043629687,0.000023930957,0.0009986388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924064,0.00024041961,0.000042177475,0.00007640545,0.00030853564,0.0000918367],"domain_scores_gemma":[0.9939709,0.004446637,0.0006233685,0.0003121221,0.00051963725,0.00012742185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013590965,0.0008194533,0.000647651,0.0005608452,0.00030873902,0.0010213265,0.00055707217,0.0005085027,0.0009390979],"category_scores_gemma":[0.007344318,0.00029856185,0.00029420218,0.0005165285,0.0012013442,0.0013088662,0.00093010685,0.0006540465,0.00023565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044267482,0.000059555085,0.0025616754,0.00026092594,0.00008185748,0.00089228124,0.0005840845,0.81564265,0.04105521,0.118774235,0.0006746712,0.01897025],"study_design_scores_gemma":[0.000023547249,0.00010261736,0.00089454156,0.000026012454,0.000022224056,0.00052249775,0.00010545488,0.9565147,0.01181939,0.029204879,0.0007208018,0.000043438955],"about_ca_topic_score_codex":0.0007499808,"about_ca_topic_score_gemma":0.000356299,"teacher_disagreement_score":0.001452975,"about_ca_system_score_codex":0.001452975,"about_ca_system_score_gemma":0.00039788353,"threshold_uncertainty_score":0.010542095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94430065,0.0036467463,0.046502598,0.00024315523,0.000060236136,0.00030090797,0.00021602518,0.0002876088,0.0044420236],"genre_scores_gemma":[0.9916338,0.00091919425,0.0067017223,0.00001790284,0.00001861617,0.00006702757,0.00022730151,0.000017525053,0.00039697508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997253,0.001306002,0.00019927497,0.0001499091,0.0008252522,0.0002665117],"domain_scores_gemma":[0.9894113,0.006920077,0.0011689847,0.00052442343,0.0017051554,0.00027002153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039904052,0.0008433087,0.00062713964,0.001698115,0.00039774735,0.0007348063,0.0007726332,0.00074512383,0.0004926104],"category_scores_gemma":[0.010055876,0.00012499199,0.00021580615,0.0017056868,0.0004985834,0.0012774909,0.0005733789,0.00038784032,0.000110613706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016409889,0.0009917498,0.01562011,0.0009304369,0.0003675639,0.00037977702,0.00027549276,0.8608026,0.02451746,0.0041988725,0.0014787207,0.088796236],"study_design_scores_gemma":[0.000119081815,0.006023426,0.006741798,0.00004841757,0.00019663028,0.0004672065,0.0003704684,0.9632466,0.020246785,0.0010369918,0.001451546,0.00005104778],"about_ca_topic_score_codex":0.0018096389,"about_ca_topic_score_gemma":0.0011831654,"teacher_disagreement_score":0.0039904052,"about_ca_system_score_codex":0.0011301942,"about_ca_system_score_gemma":0.00045616805,"threshold_uncertainty_score":0.02110356},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0640484,0.0006674935,0.9307704,0.0002530407,0.000088243985,0.0000825887,0.00006933461,0.00014770166,0.003872756],"genre_scores_gemma":[0.9552561,0.0002604343,0.04287072,0.00005327001,0.000059749666,0.000082902465,0.000027828126,0.000023043192,0.0013658878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900025,0.0003982107,0.000031797317,0.0001511893,0.00021631125,0.00020225844],"domain_scores_gemma":[0.99822766,0.0010813436,0.0001649979,0.00019287763,0.00021678332,0.00011622213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002053815,0.0007109644,0.0007909992,0.00048232463,0.0009028986,0.0010882388,0.0012223049,0.00067783054,0.0012892858],"category_scores_gemma":[0.0047314195,0.00029429953,0.0003056877,0.0006871203,0.001200743,0.0013700168,0.0009783827,0.00052354735,0.00021073814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013698348,0.00003854316,0.00028271304,0.000038514758,0.000026761745,0.00008172436,0.00007669647,0.92513704,0.0022008363,0.05193999,0.0009842407,0.019056018],"study_design_scores_gemma":[0.000013594902,0.000020419657,0.00005672425,0.0000024887552,0.0000060692355,0.000013548438,0.000015486767,0.9828236,0.0003461923,0.016285274,0.000411473,0.000005144124],"about_ca_topic_score_codex":0.004977178,"about_ca_topic_score_gemma":0.006698309,"teacher_disagreement_score":0.004977178,"about_ca_system_score_codex":0.0023005677,"about_ca_system_score_gemma":0.002135467,"threshold_uncertainty_score":0.016691804},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056479417,0.02776734,0.6115558,0.01429944,0.0017767795,0.00019761469,0.0024354672,0.0008833356,0.28460488],"genre_scores_gemma":[0.8454391,0.024133408,0.081285074,0.0032674295,0.0027667275,0.0009586233,0.002538197,0.0008585517,0.038752917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970848,0.0008755808,0.00007633854,0.00043829568,0.0009151146,0.0006098969],"domain_scores_gemma":[0.98299384,0.012543943,0.00065577263,0.0013536164,0.0017634126,0.0006894574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036579948,0.0019964068,0.0011689679,0.0028984067,0.0016491251,0.0038006774,0.002656394,0.0017128274,0.013612485],"category_scores_gemma":[0.022927497,0.00077641173,0.000820833,0.003370312,0.0027878138,0.007403098,0.0040308563,0.0059624957,0.0025768958],"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.0001620712,0.000045986915,0.00039571186,0.0002521718,0.000055044642,0.0001229259,0.0001937165,0.09120685,0.002104146,0.8377977,0.028985841,0.03867782],"study_design_scores_gemma":[0.00002030393,0.000022736333,0.0003036298,0.00016608616,0.00003635876,0.0000838025,0.000058525726,0.15290423,0.0013382455,0.82433754,0.020699387,0.000029190465],"about_ca_topic_score_codex":0.0041894987,"about_ca_topic_score_gemma":0.0026112986,"teacher_disagreement_score":0.013612485,"about_ca_system_score_codex":0.0046946188,"about_ca_system_score_gemma":0.0015484565,"threshold_uncertainty_score":0.045538306},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042122643,0.0006986651,0.9442583,0.00032912145,0.00010520447,0.0000560165,0.00012275742,0.00043138888,0.011875907],"genre_scores_gemma":[0.7780811,0.00072373636,0.20743519,0.0003270596,0.00009902586,0.00015953631,0.0002466328,0.00007006854,0.012857513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990428,0.0001868051,0.00003900631,0.00008075431,0.0004999164,0.00015060959],"domain_scores_gemma":[0.9969099,0.0014935881,0.00024017837,0.00045230016,0.0008222349,0.000081812956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011198492,0.0007714696,0.0007423649,0.0008044584,0.00079187774,0.0010140162,0.0013068944,0.0010240176,0.0028380004],"category_scores_gemma":[0.004116647,0.00038579814,0.00026130662,0.001746027,0.00078830717,0.0014088348,0.0020407953,0.0009297166,0.0009806748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015334005,0.00040307804,0.0019774733,0.00038872918,0.00012353345,0.0004277958,0.00063655805,0.29716614,0.16436681,0.1406026,0.006999761,0.38537413],"study_design_scores_gemma":[0.000041482952,0.00012229444,0.00027946345,0.000033043143,0.000039507395,0.00028786145,0.000048460803,0.9414491,0.034774486,0.01941739,0.0034647137,0.000042165397],"about_ca_topic_score_codex":0.0011373411,"about_ca_topic_score_gemma":0.0030278408,"teacher_disagreement_score":0.0028380004,"about_ca_system_score_codex":0.00057783036,"about_ca_system_score_gemma":0.0010153629,"threshold_uncertainty_score":0.009494007},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025733745,0.003643699,0.95557064,0.0002648367,0.000065260145,0.000109807625,0.000058653997,0.0002824856,0.014270904],"genre_scores_gemma":[0.7295826,0.0027540643,0.2624608,0.00018081465,0.000052013467,0.0002268908,0.000078662495,0.00005244126,0.0046117078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938333,0.00031498598,0.000020605192,0.00003850394,0.0001948184,0.000047801896],"domain_scores_gemma":[0.9989888,0.00063041155,0.00009797449,0.000079164165,0.00018347737,0.000020065107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010098303,0.0006963139,0.00046678062,0.0007326294,0.0004692672,0.0006564391,0.00074849965,0.0009285171,0.0017651661],"category_scores_gemma":[0.002151163,0.00021305408,0.00030120704,0.00056132383,0.00074826647,0.00095192145,0.00066307804,0.0006076985,0.0005007784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018106987,0.000074590884,0.0003122325,0.00024212663,0.00006372593,0.00029777555,0.00029058798,0.7144635,0.02420743,0.14229183,0.0026260938,0.114949025],"study_design_scores_gemma":[0.000020454843,0.0001413735,0.00008501437,0.0000383393,0.00002655496,0.00023732934,0.000031500316,0.9654316,0.0072489954,0.02260847,0.004103866,0.000026433197],"about_ca_topic_score_codex":0.0012857676,"about_ca_topic_score_gemma":0.0022939001,"teacher_disagreement_score":0.0017651661,"about_ca_system_score_codex":0.00075170887,"about_ca_system_score_gemma":0.00052915857,"threshold_uncertainty_score":0.005905032},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029311277,0.00018638684,0.9674347,0.00012209754,0.000032914486,0.00005375297,0.000031808246,0.00014870163,0.0026783824],"genre_scores_gemma":[0.9069754,0.00013154307,0.09090397,0.00004397271,0.000059466824,0.000111791174,0.000041529023,0.000013950627,0.0017184532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995641,0.00015674756,0.00002495654,0.00007651478,0.00014222474,0.00003539423],"domain_scores_gemma":[0.99951875,0.00014343298,0.00009668284,0.00008467544,0.00013280055,0.000023626764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045885995,0.00038292544,0.0005783866,0.00020164011,0.00054782064,0.0004098942,0.00070943305,0.00036262965,0.0009960391],"category_scores_gemma":[0.0009958755,0.00019534474,0.00018680605,0.00028372832,0.0003600032,0.0005212501,0.00054059946,0.00041058974,0.0002859759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002413999,0.00013133569,0.0008166504,0.0001549478,0.00006677939,0.00022635807,0.00023882481,0.6120325,0.080450825,0.054587167,0.0033583723,0.2476949],"study_design_scores_gemma":[0.000033595064,0.00014397001,0.00025993513,0.000005442338,0.000014128538,0.00014058292,0.000014645416,0.98324746,0.004947981,0.009046073,0.0021290309,0.000017014047],"about_ca_topic_score_codex":0.0005633021,"about_ca_topic_score_gemma":0.0010780488,"teacher_disagreement_score":0.0009960391,"about_ca_system_score_codex":0.00043493617,"about_ca_system_score_gemma":0.000488568,"threshold_uncertainty_score":0.003332138},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039575513,0.00029657214,0.9583767,0.000082565864,0.000023887018,0.000036017314,0.000009268529,0.0001913605,0.0014080649],"genre_scores_gemma":[0.84811294,0.00020152504,0.1500967,0.000071348615,0.00003388133,0.000076614095,0.000020843743,0.000026804331,0.001359304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963593,0.00014292654,0.000018949364,0.00006413919,0.0001005795,0.00003744211],"domain_scores_gemma":[0.9993395,0.00038053686,0.00010723463,0.000073867835,0.000073850584,0.000024968833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047972184,0.00047012346,0.00047903004,0.00025707457,0.00041377105,0.0003619258,0.0011142716,0.00040400287,0.0008553858],"category_scores_gemma":[0.0014417829,0.0002070278,0.00019190574,0.0002590288,0.00052361446,0.00091068837,0.00057234877,0.00042669466,0.00027611735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037084156,0.00012381791,0.00086010294,0.00012697944,0.000045108955,0.00029362197,0.00021788036,0.7281922,0.03577719,0.022556769,0.0008033144,0.21063218],"study_design_scores_gemma":[0.000019909667,0.000080000085,0.00012672582,0.0000060887246,0.000009856272,0.000098136574,0.000019344521,0.9888026,0.0053162775,0.004844007,0.0006655913,0.000011349088],"about_ca_topic_score_codex":0.00051684346,"about_ca_topic_score_gemma":0.0009796466,"teacher_disagreement_score":0.0011142716,"about_ca_system_score_codex":0.00036900153,"about_ca_system_score_gemma":0.00029154567,"threshold_uncertainty_score":0.0028615594},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016720388,0.00030791308,0.981791,0.00008151442,0.0000142429035,0.000017330067,0.0000100926245,0.00008394107,0.0009735227],"genre_scores_gemma":[0.6555789,0.00089599093,0.34095892,0.00012368748,0.00006297561,0.00013187212,0.00004539256,0.00002873768,0.0021734366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992329,0.00028407184,0.00003933296,0.00008660001,0.00028947525,0.00006768101],"domain_scores_gemma":[0.998321,0.0011122224,0.0001715005,0.00016322266,0.00020481848,0.000027175332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010816519,0.00041886317,0.0005146889,0.00031091922,0.00038897982,0.00068867207,0.0007931477,0.0007007599,0.00060969096],"category_scores_gemma":[0.004130842,0.0003244705,0.0002837708,0.00042396292,0.00088665064,0.00078491727,0.0009589941,0.0007168634,0.00021871827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025633443,0.00008125757,0.0011880232,0.00032131892,0.00007757297,0.0005357811,0.0008305157,0.47104678,0.07994793,0.24431239,0.0016069264,0.19979523],"study_design_scores_gemma":[0.000016510046,0.00010309622,0.00019038803,0.000020950944,0.00001492166,0.00020766433,0.000032757398,0.9566003,0.016526457,0.024822148,0.0014397595,0.000025008723],"about_ca_topic_score_codex":0.00042015905,"about_ca_topic_score_gemma":0.00077997154,"teacher_disagreement_score":0.0010816519,"about_ca_system_score_codex":0.00046813546,"about_ca_system_score_gemma":0.00088092976,"threshold_uncertainty_score":0.005720377},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13852741,0.002462014,0.8302649,0.0006286074,0.00007568231,0.0001270977,0.00030042697,0.00043289855,0.027181013],"genre_scores_gemma":[0.97357553,0.0010531595,0.022711003,0.00009532444,0.000040357863,0.00008156324,0.00009988401,0.00004475208,0.002298383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978861,0.000779597,0.00006521611,0.00015215827,0.00081836036,0.0002986795],"domain_scores_gemma":[0.9920521,0.0058532963,0.0005944982,0.0005702435,0.0008376264,0.00009217392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033574703,0.0013824677,0.0013509361,0.0009883149,0.0005832279,0.0014313911,0.0011273919,0.0011292547,0.001792946],"category_scores_gemma":[0.018165857,0.00061398454,0.00048152648,0.00097149564,0.001621326,0.0024920793,0.0015972407,0.0008204448,0.00046332556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080915575,0.000023457469,0.0004392179,0.0000918489,0.00002209431,0.00015118922,0.00011612173,0.93189424,0.0024359736,0.05681477,0.00035328823,0.0075769355],"study_design_scores_gemma":[0.000007376426,0.000033603377,0.00015107488,0.000014972656,0.000008230027,0.00010188399,0.00002732071,0.9828683,0.00076357304,0.015759498,0.0002512155,0.000012913071],"about_ca_topic_score_codex":0.0027158791,"about_ca_topic_score_gemma":0.0018740223,"teacher_disagreement_score":0.0033574703,"about_ca_system_score_codex":0.0021084615,"about_ca_system_score_gemma":0.0016707168,"threshold_uncertainty_score":0.017756224},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028626367,0.0006808082,0.96351177,0.00035748063,0.000037664642,0.000034560115,0.00009761325,0.00030787912,0.006345879],"genre_scores_gemma":[0.9187393,0.0009206209,0.07440584,0.00015082235,0.00006903874,0.000099739795,0.00009717988,0.000034694862,0.0054827416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990232,0.00039683172,0.000040717976,0.00017756647,0.0002351925,0.00012649543],"domain_scores_gemma":[0.99877447,0.000690992,0.0001411017,0.0001825518,0.00017229679,0.000038549537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011908477,0.0011622632,0.0010186892,0.00030089248,0.0003865326,0.0011243444,0.00080660457,0.0011719279,0.0016594424],"category_scores_gemma":[0.0033507165,0.00060964446,0.00044335893,0.0007503583,0.0010677746,0.0020521805,0.0009035527,0.00087161805,0.00090109423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022076353,0.000035210236,0.0006457026,0.00015328533,0.000067651534,0.00043370953,0.00017441629,0.90768707,0.012569721,0.04223333,0.0011354762,0.034643665],"study_design_scores_gemma":[0.000064432585,0.00015655841,0.00025555474,0.000025901025,0.00006179396,0.0003525865,0.000090673195,0.969296,0.007733385,0.020289779,0.0016393004,0.000034021068],"about_ca_topic_score_codex":0.0014759148,"about_ca_topic_score_gemma":0.0015202514,"teacher_disagreement_score":0.0016594424,"about_ca_system_score_codex":0.00084400445,"about_ca_system_score_gemma":0.0007151878,"threshold_uncertainty_score":0.0062978268},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44623145,0.0013662805,0.51435864,0.0068399203,0.0006317702,0.0008426338,0.0006225457,0.0047125556,0.024394173],"genre_scores_gemma":[0.9139497,0.00044659036,0.082493536,0.00016947878,0.000083740684,0.0003250012,0.0003662783,0.00011266994,0.0020528988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965354,0.0016190812,0.000109350534,0.00027790724,0.0008031388,0.0006550619],"domain_scores_gemma":[0.9912709,0.0027558035,0.00041780647,0.0020072735,0.00248154,0.0010666326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073291142,0.0005023999,0.0008047394,0.0008157728,0.0012351802,0.0021937035,0.0023503485,0.0010147507,0.0028636847],"category_scores_gemma":[0.01103128,0.00023063642,0.00023717577,0.00092048594,0.0017778254,0.00500704,0.0017566695,0.0017306587,0.0003814946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039804564,0.0025926977,0.019165419,0.0006999376,0.00026146363,0.0004097741,0.0012292771,0.31422326,0.07187647,0.27272633,0.031355202,0.2814797],"study_design_scores_gemma":[0.00036946937,0.0034851925,0.00386648,0.0001314398,0.00011389051,0.00031061904,0.001478354,0.82502854,0.087837934,0.052241936,0.025006434,0.000129714],"about_ca_topic_score_codex":0.007660247,"about_ca_topic_score_gemma":0.00791308,"teacher_disagreement_score":0.007660247,"about_ca_system_score_codex":0.0021738168,"about_ca_system_score_gemma":0.002590027,"threshold_uncertainty_score":0.038760543},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28315935,0.00021913077,0.6966384,0.0017317858,0.00010917795,0.00023762805,0.00015546866,0.000105021936,0.017644092],"genre_scores_gemma":[0.97600037,0.000102129925,0.019350221,0.00009128521,0.000034440312,0.00010039842,0.000028955417,0.000013937829,0.004278212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858946,0.0008129611,0.000043415042,0.00013797297,0.00024280314,0.00017330593],"domain_scores_gemma":[0.9959848,0.0029959003,0.00028849742,0.00018118613,0.00020750225,0.00034203733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023155613,0.00056943035,0.00095660693,0.0004650508,0.000675962,0.0014553118,0.0016800074,0.0016181845,0.0019231051],"category_scores_gemma":[0.005937787,0.0004180191,0.00043934237,0.0005198947,0.0017042228,0.0021753244,0.0014869219,0.001015913,0.00013128018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062052347,0.00017550807,0.0010007691,0.00011321207,0.000086943546,0.00030732495,0.00029299394,0.6424073,0.0053475793,0.33382234,0.002355319,0.013470155],"study_design_scores_gemma":[0.00006193074,0.00007537196,0.00012703544,0.000004594217,0.000013276552,0.000039778202,0.000040304247,0.9390228,0.00025360816,0.059921462,0.00042794296,0.000012017632],"about_ca_topic_score_codex":0.0019719284,"about_ca_topic_score_gemma":0.0018738857,"teacher_disagreement_score":0.0023155613,"about_ca_system_score_codex":0.0012992925,"about_ca_system_score_gemma":0.0014224707,"threshold_uncertainty_score":0.012246013},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15298057,0.0027591002,0.8343578,0.00049913436,0.00004371694,0.000043354776,0.00025718263,0.00025817446,0.0088009],"genre_scores_gemma":[0.9823079,0.0016038272,0.013457874,0.00007568379,0.00007098777,0.00005280225,0.000110087974,0.000058293128,0.0022625842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904245,0.00036370233,0.000039625054,0.00010180473,0.00029304737,0.00015930369],"domain_scores_gemma":[0.9922537,0.0062407185,0.0005639186,0.00024228453,0.0005985709,0.0001008939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020380062,0.00084398995,0.001090094,0.0010008104,0.00042992018,0.000930806,0.00075647177,0.0007180904,0.0015770677],"category_scores_gemma":[0.007927967,0.00033770196,0.00058076443,0.0010640505,0.0011744832,0.0015184995,0.0009264166,0.0008970581,0.00027048122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041763313,0.000017951592,0.0013971259,0.000085924665,0.00003298033,0.00031878307,0.00013012675,0.9648747,0.0015462216,0.025386402,0.00047934003,0.0056886193],"study_design_scores_gemma":[0.0000018493032,0.000014070723,0.00044026045,0.000007763125,0.000008009736,0.000074398784,0.000035158915,0.99423474,0.00025997014,0.0047656856,0.00015149196,0.000006548345],"about_ca_topic_score_codex":0.0036550334,"about_ca_topic_score_gemma":0.0024690165,"teacher_disagreement_score":0.0036550334,"about_ca_system_score_codex":0.0016360647,"about_ca_system_score_gemma":0.00065999164,"threshold_uncertainty_score":0.011870503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032245167,0.0004117096,0.9585632,0.00040043026,0.00010636768,0.00005237451,0.00016394052,0.00044811345,0.007608675],"genre_scores_gemma":[0.88254595,0.0006312833,0.10760223,0.00014706467,0.000041146595,0.00027129264,0.00021089117,0.00007529301,0.008474751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996872,0.00008701789,0.000016608035,0.00007055362,0.000080929174,0.00005776587],"domain_scores_gemma":[0.99954385,0.00021403299,0.00005560508,0.000054203356,0.00009084325,0.00004146446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002537576,0.00062714505,0.00071547413,0.00044385184,0.00060699694,0.0009606769,0.0013895511,0.0010413622,0.0023233492],"category_scores_gemma":[0.0012018404,0.00035264698,0.0008239646,0.0005841817,0.0009594301,0.00073498394,0.0008401181,0.00088973955,0.0005137324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003592062,0.000021381173,0.00044944236,0.00003758024,0.000019668389,0.00016746405,0.000075814256,0.95161533,0.003436241,0.03624129,0.00081016327,0.0070897257],"study_design_scores_gemma":[0.0000075898674,0.000018019444,0.00004694442,0.0000033921463,0.0000063353814,0.000028222405,0.000008562162,0.9942373,0.00033240946,0.00451902,0.0007859635,0.000006190937],"about_ca_topic_score_codex":0.010128628,"about_ca_topic_score_gemma":0.0068338607,"teacher_disagreement_score":0.010128628,"about_ca_system_score_codex":0.0011058216,"about_ca_system_score_gemma":0.0009329973,"threshold_uncertainty_score":0.020139337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019851752,0.0039740168,0.9421792,0.0046372428,0.0003247746,0.00008054504,0.0001423955,0.0006920474,0.028117985],"genre_scores_gemma":[0.721651,0.007031821,0.26068002,0.0024368044,0.0007461934,0.00028660032,0.0003203374,0.00033499335,0.006512135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9912174,0.0039250064,0.000397173,0.00057014066,0.0034480228,0.00044242234],"domain_scores_gemma":[0.96553147,0.024979746,0.0010236761,0.0046390076,0.0035599913,0.00026606699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00726868,0.001035807,0.0016093564,0.00090185483,0.0013178876,0.003047464,0.001971813,0.002553096,0.003091737],"category_scores_gemma":[0.045050945,0.00072446564,0.0005754919,0.0012869965,0.0037704057,0.0079717515,0.0031094577,0.0034799068,0.002194047],"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.0003508663,0.000071970266,0.0011757206,0.00042630252,0.000063812855,0.000250818,0.0004058508,0.16440248,0.00608193,0.6825963,0.0061399573,0.13803403],"study_design_scores_gemma":[0.00006949175,0.000103253304,0.00015050669,0.00014270398,0.0000208241,0.00068617536,0.000103541825,0.5131337,0.005354632,0.47299573,0.007134248,0.00010517858],"about_ca_topic_score_codex":0.0021192892,"about_ca_topic_score_gemma":0.0017230527,"teacher_disagreement_score":0.00726868,"about_ca_system_score_codex":0.0012361842,"about_ca_system_score_gemma":0.002301289,"threshold_uncertainty_score":0.038440943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2288865,0.0016361973,0.75982827,0.00043881615,0.000108517816,0.00009987267,0.00009499582,0.00014703728,0.008759851],"genre_scores_gemma":[0.97328925,0.0007644203,0.023648648,0.000054613232,0.000055716944,0.000073669355,0.00003752689,0.000028077757,0.0020481134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897337,0.00051212654,0.000024906945,0.00010706589,0.00016582372,0.0002167585],"domain_scores_gemma":[0.9963111,0.0027643796,0.00046985596,0.00014200572,0.00019681199,0.00011585769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017553873,0.00072893593,0.00076370954,0.0005363206,0.0008676378,0.0010070916,0.000987513,0.0008693372,0.0010711082],"category_scores_gemma":[0.004020494,0.00047379627,0.00039522332,0.0011523629,0.0009402918,0.0014231747,0.00087850355,0.0006685634,0.00018583394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008682806,0.00005154686,0.00054735906,0.000080583995,0.000028327004,0.0004612809,0.0001103686,0.9616466,0.0022405654,0.025861088,0.0004804503,0.008404979],"study_design_scores_gemma":[0.000014528818,0.00004922325,0.00013819295,0.0000046369405,0.000011481705,0.00005688935,0.00005696519,0.9925333,0.000442496,0.0060954313,0.0005866575,0.0000101604655],"about_ca_topic_score_codex":0.0050367704,"about_ca_topic_score_gemma":0.0038776873,"teacher_disagreement_score":0.0050367704,"about_ca_system_score_codex":0.0011987579,"about_ca_system_score_gemma":0.0011551671,"threshold_uncertainty_score":0.010014892},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004453951,0.0029265198,0.9809091,0.0011360857,0.00029484334,0.00006361729,0.00014952083,0.00019925703,0.009867043],"genre_scores_gemma":[0.7032336,0.00918597,0.26409274,0.0011380437,0.00064433843,0.00082941994,0.0005142526,0.000107529726,0.02025409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993704,0.00020833868,0.000029970499,0.000057461126,0.00024941747,0.00008437946],"domain_scores_gemma":[0.9985195,0.0007987038,0.000100021476,0.0002526515,0.00029933345,0.000029775372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011810653,0.0005654996,0.00039427614,0.00046837475,0.00050857203,0.00092766114,0.0009562215,0.00084503036,0.0024096936],"category_scores_gemma":[0.0046244035,0.0002587721,0.00023549907,0.001011656,0.00095820596,0.001250612,0.001228174,0.0017570625,0.00072064676],"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.00014355323,0.0000536887,0.00040800858,0.00034577644,0.000040601793,0.00022642233,0.00026391243,0.19828758,0.00879514,0.59033597,0.022313677,0.17878567],"study_design_scores_gemma":[0.000037063022,0.000064087675,0.00023219177,0.000120038625,0.000025927664,0.00017228274,0.000040398394,0.669777,0.0020809297,0.3073908,0.020026235,0.000033009364],"about_ca_topic_score_codex":0.0029813305,"about_ca_topic_score_gemma":0.0040605254,"teacher_disagreement_score":0.0029813305,"about_ca_system_score_codex":0.00101022,"about_ca_system_score_gemma":0.0014331704,"threshold_uncertainty_score":0.00806123},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1082126,0.00082022056,0.8771849,0.00025011937,0.000034877357,0.000042601772,0.000043398704,0.000059979604,0.013351295],"genre_scores_gemma":[0.9692202,0.0006876421,0.027973112,0.00005021035,0.000028991844,0.000063924825,0.00002166063,0.000010864189,0.001943371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994272,0.00032048466,0.000014410997,0.00004041467,0.000116652234,0.00008081643],"domain_scores_gemma":[0.99858737,0.0010567628,0.00015526763,0.00005978917,0.000111856294,0.000029021105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009841594,0.0004139182,0.00033701514,0.00032404205,0.00031895933,0.0005997353,0.00053702167,0.0005348608,0.0009777783],"category_scores_gemma":[0.0026763387,0.00018309682,0.00022411636,0.00064886996,0.0008868035,0.000914,0.0007733201,0.0003923285,0.00013114355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000854797,0.000033324566,0.00070348475,0.000094580784,0.000020071724,0.000271551,0.00017660212,0.74913824,0.00455844,0.22421782,0.00045921264,0.020241125],"study_design_scores_gemma":[0.000011765525,0.00003687024,0.00010054403,0.000008764351,0.000008668408,0.00006322079,0.000031878237,0.96311074,0.0007854321,0.035126507,0.00070768653,0.000007947784],"about_ca_topic_score_codex":0.0017281413,"about_ca_topic_score_gemma":0.0013861234,"teacher_disagreement_score":0.0017281413,"about_ca_system_score_codex":0.0006835955,"about_ca_system_score_gemma":0.00043445427,"threshold_uncertainty_score":0.005204797},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078315064,0.00014479543,0.91503817,0.00023284898,0.00002660308,0.0001121974,0.000041487394,0.00008815533,0.0060006627],"genre_scores_gemma":[0.924226,0.00018911905,0.07191199,0.00008223684,0.000023865325,0.00019433751,0.00006170649,0.00002777894,0.0032829144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937254,0.00028893843,0.00002088919,0.00008289482,0.00011941841,0.00011539315],"domain_scores_gemma":[0.99900526,0.0005988805,0.00012514352,0.000044966717,0.0001042115,0.000121499674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012442411,0.00071377767,0.00079004513,0.0005068801,0.0006910003,0.0008328755,0.0013049142,0.00072476227,0.0010037558],"category_scores_gemma":[0.0026662417,0.00025890462,0.0005895891,0.00052864617,0.0010506165,0.0011384635,0.0013962182,0.0008586723,0.00012974843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013512507,0.000098542405,0.00058347953,0.000046489575,0.0000467849,0.00017494155,0.000192183,0.895075,0.0027646718,0.08381866,0.0010898338,0.015974326],"study_design_scores_gemma":[0.000014602451,0.000027357282,0.00006356647,0.0000024757717,0.0000057706493,0.000020947089,0.000021637366,0.9855299,0.0003061275,0.013623924,0.00037889715,0.0000048042675],"about_ca_topic_score_codex":0.0037253173,"about_ca_topic_score_gemma":0.0029455198,"teacher_disagreement_score":0.0037253173,"about_ca_system_score_codex":0.0013364409,"about_ca_system_score_gemma":0.0012375508,"threshold_uncertainty_score":0.009696603},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018621024,0.000936104,0.9769315,0.00022524419,0.000065422646,0.0000788221,0.00013760409,0.00031477257,0.0026893914],"genre_scores_gemma":[0.80222213,0.0015601875,0.19091468,0.00027356212,0.00008998506,0.00027709815,0.00022775306,0.00004097396,0.00439363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900144,0.00028906311,0.000057303074,0.00010265046,0.00036238667,0.0001872063],"domain_scores_gemma":[0.997389,0.0010674373,0.00026649362,0.00047110056,0.0007164502,0.00008955085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001586234,0.0010189824,0.0009023039,0.0007781791,0.00059807795,0.0008047655,0.001225348,0.0007470798,0.0015243232],"category_scores_gemma":[0.0036300335,0.0003451994,0.00066116476,0.0008305847,0.0010247797,0.0015200604,0.0014349485,0.00092727545,0.00046981027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048593603,0.000115131785,0.00096971076,0.00038115177,0.00016081819,0.00041800615,0.0004487193,0.47796026,0.024304237,0.31558406,0.004963806,0.17420824],"study_design_scores_gemma":[0.00006385702,0.0002203417,0.00019840902,0.000040686024,0.00006705209,0.0003672854,0.00003616575,0.9357275,0.009610936,0.04934506,0.004257232,0.00006546792],"about_ca_topic_score_codex":0.0028128724,"about_ca_topic_score_gemma":0.0040080333,"teacher_disagreement_score":0.0028128724,"about_ca_system_score_codex":0.00089005334,"about_ca_system_score_gemma":0.0016325488,"threshold_uncertainty_score":0.008388877},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028274868,0.01508072,0.9364981,0.000646109,0.00030724102,0.0000484475,0.00023836168,0.0006150105,0.018291125],"genre_scores_gemma":[0.8699165,0.014448116,0.10742502,0.00045986066,0.0011314054,0.00024174507,0.00039731542,0.00026679036,0.0057133976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723023,0.0005426649,0.00016031232,0.00024737953,0.0014437173,0.00037571485],"domain_scores_gemma":[0.98211837,0.01283533,0.0011078066,0.0012126418,0.0025217207,0.0002041247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037705207,0.0017607195,0.001127835,0.0017290275,0.0006714445,0.002622446,0.0011510641,0.0010406312,0.0035215556],"category_scores_gemma":[0.022697493,0.00037639253,0.00058148976,0.0012060595,0.0011893479,0.003922596,0.0019640427,0.0021838995,0.0012915904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042201986,0.00011359431,0.0012810195,0.000696554,0.00014176463,0.00031335605,0.0004983471,0.70679116,0.021541987,0.13130224,0.004882526,0.1320155],"study_design_scores_gemma":[0.000018701576,0.00025695146,0.0011686012,0.00023818169,0.000089037145,0.0005640527,0.00011924261,0.9186946,0.010980569,0.05992373,0.007855797,0.000090498295],"about_ca_topic_score_codex":0.0015559922,"about_ca_topic_score_gemma":0.0015110644,"teacher_disagreement_score":0.0037705207,"about_ca_system_score_codex":0.00229353,"about_ca_system_score_gemma":0.0007789028,"threshold_uncertainty_score":0.019940615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15874611,0.00074516935,0.8373752,0.00017084437,0.000035150377,0.00004014575,0.000060347345,0.00025466812,0.0025722566],"genre_scores_gemma":[0.9309759,0.00042332214,0.066955894,0.00005191295,0.000009048873,0.00006482915,0.000046763584,0.000013931812,0.0014582978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997342,0.00010271978,0.00001439354,0.00005160304,0.000053636162,0.00004333989],"domain_scores_gemma":[0.9993548,0.0003630549,0.00008449039,0.000087565764,0.0000757403,0.000034382116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077204255,0.00041451678,0.00048282233,0.00031108645,0.00035278266,0.0007571565,0.0010548955,0.000568269,0.0007104513],"category_scores_gemma":[0.0010982266,0.00018817061,0.00031173008,0.00032662723,0.00069993094,0.001096787,0.0007834757,0.00038153047,0.0001858389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045390867,0.00007602387,0.00075748324,0.00016235696,0.000066556095,0.0005782458,0.0005469383,0.72543746,0.076261185,0.1545376,0.0007874409,0.04033477],"study_design_scores_gemma":[0.000020622045,0.00011716479,0.00012025273,0.000010216794,0.00002451742,0.00012653151,0.000031371776,0.97579443,0.01020531,0.0122840125,0.0012401396,0.000025428713],"about_ca_topic_score_codex":0.0013049267,"about_ca_topic_score_gemma":0.0011432677,"teacher_disagreement_score":0.0013049267,"about_ca_system_score_codex":0.0005934708,"about_ca_system_score_gemma":0.00053447223,"threshold_uncertainty_score":0.0043059587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42756218,0.009951123,0.49635112,0.0020722428,0.000073428855,0.00010989619,0.0010931148,0.00078102056,0.062005863],"genre_scores_gemma":[0.9901816,0.0018316882,0.0063308366,0.000097032884,0.000054488526,0.000092200484,0.00016382226,0.00007030778,0.0011780465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984164,0.00060359936,0.000056878762,0.000106545725,0.00046784052,0.00034870856],"domain_scores_gemma":[0.9727395,0.022903286,0.0015050708,0.00068763073,0.0018434465,0.0003211315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004063583,0.0010602328,0.0013256972,0.0018875693,0.0008583459,0.001816139,0.0010804711,0.00083150005,0.0017612642],"category_scores_gemma":[0.019572334,0.0005505452,0.00055250496,0.0014839224,0.00251251,0.0017955748,0.0020340106,0.0011383367,0.00032697993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003001173,0.00005648612,0.0011014523,0.00036669828,0.000076980556,0.0006883151,0.000722453,0.83784014,0.006409806,0.13830714,0.0016958835,0.0124345645],"study_design_scores_gemma":[0.000023693248,0.00005997763,0.00086508045,0.00012971932,0.00003369205,0.00028290242,0.00019697704,0.92689884,0.003251231,0.06724722,0.0009643806,0.000046265595],"about_ca_topic_score_codex":0.0033341171,"about_ca_topic_score_gemma":0.0013620154,"teacher_disagreement_score":0.004063583,"about_ca_system_score_codex":0.0022447223,"about_ca_system_score_gemma":0.0009615477,"threshold_uncertainty_score":0.021490514},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005941255,0.00018977244,0.987905,0.00035941164,0.00021393555,0.0002784289,0.00006339726,0.0009366747,0.004112144],"genre_scores_gemma":[0.623005,0.0006003224,0.359993,0.00039882786,0.00029881138,0.0009811675,0.00022734325,0.000119630895,0.014375914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983584,0.0005198538,0.00015220692,0.00021793426,0.0005817524,0.00016984767],"domain_scores_gemma":[0.99836284,0.0005815409,0.00020934832,0.00024018437,0.00045631695,0.00014981255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025966305,0.0005964843,0.0008232747,0.000708991,0.0012571281,0.0015387732,0.0024128465,0.0012919528,0.0052856444],"category_scores_gemma":[0.0054480815,0.00037027043,0.00050341454,0.0008117928,0.0008871568,0.0025727162,0.00245455,0.0015705319,0.0012985863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063069764,0.00030350513,0.0016095034,0.00065096735,0.00007988721,0.00080906064,0.0005119654,0.2173706,0.015938666,0.4784317,0.017851625,0.26581177],"study_design_scores_gemma":[0.00008078072,0.0002694481,0.0002029673,0.000034908422,0.000033981796,0.00031737305,0.00004486812,0.929488,0.0031905381,0.040808883,0.025479155,0.000049029728],"about_ca_topic_score_codex":0.001041145,"about_ca_topic_score_gemma":0.0009083196,"teacher_disagreement_score":0.0052856444,"about_ca_system_score_codex":0.0011976652,"about_ca_system_score_gemma":0.0024632637,"threshold_uncertainty_score":0.017682254},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011464172,0.0017326005,0.98205525,0.00034331885,0.00011813523,0.00005497614,0.000052206113,0.00017043187,0.0040089097],"genre_scores_gemma":[0.8233652,0.004784951,0.16769099,0.00016344349,0.00031723548,0.0003189286,0.00021860082,0.00008348943,0.0030571353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937195,0.0002607294,0.000042282216,0.00007316791,0.00021362262,0.000038229304],"domain_scores_gemma":[0.99891675,0.00056953065,0.00019198934,0.00013710774,0.00014291349,0.000041820764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011189017,0.00039683993,0.00041160535,0.00069418905,0.00044650814,0.00093538983,0.0009938268,0.00054356654,0.001162808],"category_scores_gemma":[0.004479617,0.00017192216,0.0002987663,0.0009903776,0.0008764676,0.0012302715,0.00083588995,0.00068774103,0.00021159241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073352756,0.00002878651,0.00046352323,0.00023587032,0.000029657494,0.0001518938,0.00013313653,0.6310482,0.008189517,0.24659614,0.0020858694,0.110964105],"study_design_scores_gemma":[0.000014346282,0.00005152812,0.00012386042,0.000021961127,0.000009727864,0.00006987857,0.000028355458,0.88974065,0.0009663782,0.10351887,0.0054434617,0.000010974591],"about_ca_topic_score_codex":0.00086817954,"about_ca_topic_score_gemma":0.00066019327,"teacher_disagreement_score":0.001162808,"about_ca_system_score_codex":0.00076472876,"about_ca_system_score_gemma":0.0004804811,"threshold_uncertainty_score":0.0059173703},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12655003,0.00041876957,0.8511503,0.0018020505,0.00014065356,0.00023970948,0.00020798808,0.0001210154,0.019369407],"genre_scores_gemma":[0.9683311,0.00031274624,0.019146308,0.00015796002,0.00009289693,0.0002228439,0.000059607537,0.000023462857,0.011653124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961204,0.002122722,0.000113774164,0.00041284197,0.0007804814,0.00044968355],"domain_scores_gemma":[0.9906555,0.007391828,0.0006410893,0.0002489151,0.0005882391,0.00047437492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042153117,0.001431096,0.0018910663,0.00089801423,0.0008282172,0.0026091596,0.0023192137,0.0023120178,0.0024204913],"category_scores_gemma":[0.009921774,0.0007907087,0.0006580587,0.0012335529,0.0030642224,0.0035022602,0.0018048398,0.0017101942,0.00027509205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049168523,0.00016967994,0.0007548832,0.00012797005,0.00008982633,0.0006100991,0.00027578848,0.7134395,0.0025008253,0.27101892,0.0016432705,0.008877525],"study_design_scores_gemma":[0.00008588014,0.00009148419,0.00013952027,0.000006566207,0.000020102158,0.00007073342,0.00004053775,0.94492877,0.00027223973,0.053919636,0.00040230743,0.000022138309],"about_ca_topic_score_codex":0.0034094898,"about_ca_topic_score_gemma":0.0024783846,"teacher_disagreement_score":0.0042153117,"about_ca_system_score_codex":0.0021377373,"about_ca_system_score_gemma":0.0018585366,"threshold_uncertainty_score":0.022292972},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25900108,0.0047943066,0.69631076,0.0011385098,0.00015404954,0.00010288841,0.0006096021,0.0003690649,0.03751973],"genre_scores_gemma":[0.98261005,0.0013132262,0.0073320586,0.00011269793,0.00008795953,0.00006415941,0.00012993181,0.000049652746,0.008300107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991986,0.0002514902,0.000015937958,0.0000898996,0.00018090713,0.00026314173],"domain_scores_gemma":[0.9971187,0.001779229,0.00028277797,0.000113177266,0.00058800576,0.000118148826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012259632,0.0013240593,0.0012087051,0.0008270965,0.000543714,0.0015190438,0.0014855122,0.0011372019,0.0038275477],"category_scores_gemma":[0.0043084444,0.0005541072,0.0006136064,0.001212511,0.0014597755,0.0016490293,0.0013970023,0.0007884173,0.0005606127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007752166,0.000019839554,0.00043852674,0.00008240813,0.000046953613,0.00032135114,0.00008273074,0.96806866,0.0020715436,0.024404986,0.00096733676,0.0034182412],"study_design_scores_gemma":[0.0000060549737,0.000021658232,0.0001541772,0.0000072983516,0.000013077359,0.000059033693,0.00003684358,0.9954602,0.00021769943,0.0038017763,0.00021301873,0.000009053731],"about_ca_topic_score_codex":0.007633579,"about_ca_topic_score_gemma":0.0048971055,"teacher_disagreement_score":0.007633579,"about_ca_system_score_codex":0.0020807122,"about_ca_system_score_gemma":0.0007504369,"threshold_uncertainty_score":0.015178263},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36103624,0.003202018,0.62144476,0.00075219007,0.00027272623,0.00008894663,0.00028018758,0.0027977976,0.01012516],"genre_scores_gemma":[0.97730255,0.00045951572,0.021024516,0.00009616608,0.0000351141,0.000024561821,0.00005351249,0.000045414552,0.0009587237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986865,0.00048151694,0.00008127489,0.00021369873,0.00022829046,0.00030860316],"domain_scores_gemma":[0.9901788,0.006586809,0.0008676576,0.00135086,0.00080983987,0.00020596238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002302588,0.0014986015,0.00085631385,0.0006501228,0.00049969647,0.0015685674,0.001323768,0.00078152324,0.0021166538],"category_scores_gemma":[0.010735041,0.00041925066,0.0002863879,0.0005980745,0.0009824918,0.0025687218,0.0014524817,0.00074541394,0.0004765356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022640044,0.00029560883,0.0054391213,0.00033858215,0.000164719,0.00059900276,0.00041477347,0.71840286,0.08771575,0.07665912,0.0038481979,0.10385823],"study_design_scores_gemma":[0.00008704903,0.0006185415,0.00088756485,0.000033547018,0.00009207557,0.00040359038,0.0000760113,0.9027066,0.073254846,0.018539313,0.003230876,0.000069963884],"about_ca_topic_score_codex":0.00093608524,"about_ca_topic_score_gemma":0.0008348591,"teacher_disagreement_score":0.002302588,"about_ca_system_score_codex":0.00089134456,"about_ca_system_score_gemma":0.00094573305,"threshold_uncertainty_score":0.012177408},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030602364,0.0006652557,0.9669747,0.0001413562,0.000028305445,0.000034059303,0.000023868148,0.00007708855,0.0014529531],"genre_scores_gemma":[0.9054287,0.0008142883,0.09217206,0.000057865578,0.000045770026,0.00008659886,0.000036021913,0.000021232936,0.0013374005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991435,0.00048189072,0.000027653488,0.00011274196,0.00015193733,0.00008227496],"domain_scores_gemma":[0.9985065,0.0011033223,0.000121963974,0.00008465424,0.00012985709,0.000053625907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012013991,0.0007180045,0.0007553362,0.00042806988,0.0004372527,0.000845672,0.00093162624,0.0007318921,0.0006328328],"category_scores_gemma":[0.0032044917,0.00034442442,0.00038116617,0.0006352088,0.0006503537,0.0011264404,0.0006811354,0.0004674169,0.00018902747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012978862,0.000036582525,0.00041305507,0.00009099692,0.000034862176,0.0002137668,0.00010333322,0.9474753,0.004631383,0.02165844,0.0005602787,0.02465216],"study_design_scores_gemma":[0.000011135922,0.000046550776,0.00006631986,0.000003327343,0.000007708143,0.000048699774,0.000013208456,0.990488,0.0007398801,0.008286623,0.00028286935,0.0000057654734],"about_ca_topic_score_codex":0.0011192722,"about_ca_topic_score_gemma":0.001318661,"teacher_disagreement_score":0.0012013991,"about_ca_system_score_codex":0.00075083255,"about_ca_system_score_gemma":0.0006083432,"threshold_uncertainty_score":0.006353736},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011481481,0.0001918788,0.98668903,0.00007897041,0.000024686775,0.000017609495,0.000012785852,0.00004732433,0.0014561896],"genre_scores_gemma":[0.74872595,0.0005649311,0.24798031,0.00008520614,0.000086424065,0.000112154536,0.000050129867,0.00001339445,0.0023815024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996247,0.0000998904,0.000016653417,0.00006743445,0.00015722282,0.000034097873],"domain_scores_gemma":[0.9993981,0.00028275323,0.000086177475,0.00007893149,0.00013746743,0.000016547572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036346324,0.00041250428,0.00030517022,0.00021940921,0.0002480271,0.00047610025,0.0004255715,0.00045042226,0.0006502154],"category_scores_gemma":[0.0015146278,0.0001476984,0.00026940464,0.00033257733,0.00035395855,0.00045231474,0.00041943893,0.00042089328,0.00021356741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017962215,0.00008254817,0.0009872004,0.00022536004,0.00006788997,0.00050180685,0.00029996596,0.58634096,0.08151449,0.0748722,0.0017693952,0.25315854],"study_design_scores_gemma":[0.000027780767,0.00019212763,0.00019610938,0.000014496394,0.000015522533,0.0001872801,0.000024879566,0.97869027,0.007601278,0.010568563,0.0024679948,0.000013589495],"about_ca_topic_score_codex":0.0005582152,"about_ca_topic_score_gemma":0.0009349296,"teacher_disagreement_score":0.0006502154,"about_ca_system_score_codex":0.00037868196,"about_ca_system_score_gemma":0.00048884517,"threshold_uncertainty_score":0.0027475357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031152913,0.0026585378,0.94755363,0.00055859133,0.000043704313,0.00009876488,0.00031380382,0.00028845094,0.017331544],"genre_scores_gemma":[0.88799715,0.0052360557,0.10060777,0.0003290586,0.00020984167,0.00053023885,0.0003740392,0.0003313884,0.0043845116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761,0.0011500232,0.00007616707,0.00029990706,0.00050615595,0.0003578313],"domain_scores_gemma":[0.9841578,0.012959302,0.0010598693,0.00039579405,0.0011578667,0.00026941308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043900516,0.0027616222,0.0023720495,0.001666595,0.00089202897,0.0032774704,0.0019046185,0.0017410443,0.0038776556],"category_scores_gemma":[0.020265585,0.00084626937,0.0012177223,0.00166953,0.0023445785,0.0031648534,0.0023220808,0.0019826633,0.0012001827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029185496,0.00011661907,0.00047033228,0.0007919187,0.00009206625,0.00048776675,0.00042103473,0.80618536,0.00739551,0.16562763,0.0022079987,0.015911888],"study_design_scores_gemma":[0.000020180503,0.00010973587,0.00017410995,0.00010943906,0.000026438423,0.00016767273,0.00010684805,0.9328738,0.0020431872,0.06317864,0.0011588837,0.000031122025],"about_ca_topic_score_codex":0.0021274479,"about_ca_topic_score_gemma":0.0010442024,"teacher_disagreement_score":0.0043900516,"about_ca_system_score_codex":0.002799951,"about_ca_system_score_gemma":0.0014205823,"threshold_uncertainty_score":0.023217082},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036744002,0.00057861785,0.95820737,0.00022204002,0.00006242825,0.00010310735,0.000021044923,0.00015587003,0.0039055722],"genre_scores_gemma":[0.66183716,0.0009343765,0.33407077,0.00019089677,0.0000868516,0.00011694542,0.00004657542,0.000016441434,0.0026999488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999561,0.0001446791,0.000021813068,0.00005771678,0.00017639081,0.000038466333],"domain_scores_gemma":[0.9996393,0.00015012342,0.00006581175,0.00007661268,0.000053998425,0.000014233849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007884853,0.00073765556,0.00051937887,0.0004543601,0.00038258013,0.0005988494,0.00078597595,0.0009693617,0.00076462526],"category_scores_gemma":[0.0009631022,0.00023312897,0.0005928043,0.0005605272,0.00081145565,0.0013268194,0.0007447047,0.00049770024,0.00038682268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046354067,0.00021146315,0.0028678027,0.0005906464,0.00022229752,0.0012492256,0.00076050934,0.12042448,0.2536135,0.29303613,0.0014202815,0.32514012],"study_design_scores_gemma":[0.00019822842,0.0014677673,0.001535562,0.00009924308,0.00016092666,0.00398493,0.00011483046,0.80078864,0.09425994,0.07511351,0.022112114,0.00016424894],"about_ca_topic_score_codex":0.0003023726,"about_ca_topic_score_gemma":0.00061663415,"teacher_disagreement_score":0.0009693617,"about_ca_system_score_codex":0.00034966788,"about_ca_system_score_gemma":0.00034414267,"threshold_uncertainty_score":0.004169941},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08354025,0.00087429787,0.9098013,0.00029590447,0.000064026426,0.000093089155,0.000027515738,0.00008653733,0.0052170553],"genre_scores_gemma":[0.89103276,0.00082157314,0.10303608,0.00006298039,0.000049508795,0.0001017302,0.00003858026,0.000008406351,0.0048485114],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998042,0.000054568547,0.000011797215,0.000022298687,0.00009399198,0.000013105409],"domain_scores_gemma":[0.9997981,0.00008882868,0.000037238562,0.000026771382,0.000042110067,0.0000070040223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026612394,0.00023768198,0.00023713736,0.00017326356,0.00028199615,0.00041044614,0.00043751558,0.00029660962,0.00064391847],"category_scores_gemma":[0.00047370436,0.00009586864,0.00015726806,0.00017250872,0.0003163977,0.0005209335,0.00029240444,0.00031462568,0.00014061171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033058625,0.00013285635,0.0013145757,0.0006954921,0.00009655979,0.0007499254,0.0005265941,0.21490468,0.3207453,0.24007194,0.0019515521,0.21847998],"study_design_scores_gemma":[0.00006201598,0.00041806075,0.0005098925,0.000023270346,0.000056348003,0.00062276225,0.000041075524,0.9445539,0.02973101,0.016046988,0.007901788,0.0000328623],"about_ca_topic_score_codex":0.00049135496,"about_ca_topic_score_gemma":0.0008030656,"teacher_disagreement_score":0.00064391847,"about_ca_system_score_codex":0.00035026338,"about_ca_system_score_gemma":0.00049644086,"threshold_uncertainty_score":0.0025413632},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055886395,0.00014380469,0.9932054,0.000068915644,0.000013283996,0.000018367298,0.000013544514,0.00007178885,0.0008763338],"genre_scores_gemma":[0.4346347,0.0007313947,0.5603268,0.00016287732,0.00009549985,0.00021085159,0.00010007525,0.000046046094,0.0036917906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990854,0.00034199504,0.000046450525,0.00015461787,0.00030019428,0.000071275674],"domain_scores_gemma":[0.9990068,0.0004417821,0.00013315152,0.00009503921,0.00029919582,0.000024046158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011863908,0.00084509247,0.00064308714,0.0003410581,0.00034525516,0.00094656734,0.0010015172,0.0011130727,0.0012695579],"category_scores_gemma":[0.0021872616,0.00043385147,0.00039989414,0.0003951574,0.0004930473,0.00075531314,0.0006110292,0.0007868617,0.00079350104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004601001,0.00011974257,0.002174685,0.00048680234,0.00014124849,0.00046657652,0.0006715835,0.59775424,0.11134131,0.10614113,0.0022801023,0.17796245],"study_design_scores_gemma":[0.000048369286,0.00031400812,0.00019656801,0.000022583266,0.00004402696,0.00035341436,0.000039499853,0.9719101,0.014687682,0.008273846,0.0040832497,0.000026599544],"about_ca_topic_score_codex":0.00047197315,"about_ca_topic_score_gemma":0.00063568546,"teacher_disagreement_score":0.0012695579,"about_ca_system_score_codex":0.00060771295,"about_ca_system_score_gemma":0.0007314469,"threshold_uncertainty_score":0.006274283},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10622122,0.00041302273,0.8902531,0.00019268252,0.00002032502,0.000035793855,0.000020616444,0.000119706405,0.0027234843],"genre_scores_gemma":[0.96115446,0.00019474413,0.0377716,0.000028940885,0.0000125551305,0.000041357576,0.000009154842,0.000010105191,0.00077710813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933535,0.00038109056,0.0000241909,0.0000726706,0.00010022261,0.00008653541],"domain_scores_gemma":[0.99794966,0.001603668,0.00017194873,0.000099176345,0.00014036294,0.0000352512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011951284,0.0005426089,0.00049174926,0.0002585509,0.00034936948,0.00046704008,0.0006749597,0.00056369416,0.0005788369],"category_scores_gemma":[0.0032673778,0.0002587906,0.00023698815,0.00044284787,0.00080305827,0.00106293,0.00059241743,0.00037919817,0.000107612555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014011089,0.00003980913,0.00063656346,0.00006516904,0.000019763333,0.00015310354,0.00014331074,0.94919044,0.0065067112,0.013312051,0.00026948625,0.029523516],"study_design_scores_gemma":[0.000008783709,0.000047339232,0.000104924766,0.000003409582,0.0000068675076,0.000039628245,0.000015646294,0.9942192,0.0013814275,0.004055825,0.00011243534,0.0000045245547],"about_ca_topic_score_codex":0.0013702993,"about_ca_topic_score_gemma":0.0012445623,"teacher_disagreement_score":0.0013702993,"about_ca_system_score_codex":0.00063954695,"about_ca_system_score_gemma":0.00043192125,"threshold_uncertainty_score":0.006320536},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0136303725,0.00035417583,0.9850795,0.000076031065,0.000011948681,0.0000108013655,0.000022803077,0.00006696204,0.0007473894],"genre_scores_gemma":[0.866796,0.001284298,0.12942378,0.00006816021,0.00005298738,0.00007232052,0.000096412616,0.00002192527,0.0021840795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996159,0.00015949897,0.000013988998,0.00005505187,0.000116811534,0.000038818882],"domain_scores_gemma":[0.999226,0.0005258304,0.000075797594,0.00005961178,0.000097879034,0.000014964286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061028334,0.00048355624,0.00045660156,0.0002978923,0.00025916714,0.00045781993,0.00044911803,0.0005141561,0.00047329953],"category_scores_gemma":[0.0023044094,0.000245152,0.00024259987,0.00034788367,0.00043270117,0.00062215194,0.00054939464,0.000478292,0.00018646778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009437232,0.000026498576,0.0005110945,0.00010409269,0.000037571597,0.00015446913,0.00009003833,0.88428146,0.011327039,0.03147364,0.0010301203,0.070869505],"study_design_scores_gemma":[0.0000025260993,0.00001657027,0.00007427505,0.000003123874,0.0000068395993,0.000032095482,0.0000075012636,0.9943463,0.00163479,0.0034969505,0.0003728325,0.0000061122487],"about_ca_topic_score_codex":0.001963225,"about_ca_topic_score_gemma":0.0021281485,"teacher_disagreement_score":0.001963225,"about_ca_system_score_codex":0.0004554103,"about_ca_system_score_gemma":0.00058185286,"threshold_uncertainty_score":0.0039035678},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5138356,0.0006357175,0.47985953,0.00015436271,0.000039436643,0.000065673004,0.000025213561,0.00009609448,0.005288441],"genre_scores_gemma":[0.99021894,0.00015557928,0.008983807,0.000015098852,0.0000067901565,0.00001078988,0.0000047244703,0.000004053455,0.0006001277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996068,0.00012914964,0.000011874613,0.000042519958,0.00015457941,0.00005504407],"domain_scores_gemma":[0.9985066,0.0010714954,0.00016428302,0.000077668,0.00015409636,0.00002583755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008629707,0.00043764056,0.00032670447,0.00031171466,0.00026830728,0.00044033272,0.00043738904,0.0005662504,0.00032814068],"category_scores_gemma":[0.0028297699,0.0001641737,0.00021802098,0.00033589968,0.0009732173,0.00081787596,0.00040184442,0.00032796894,0.00009066915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023373225,0.00007496446,0.0016560946,0.00016234009,0.0000472789,0.0004787092,0.0005631959,0.8599146,0.06735356,0.047217492,0.00021704347,0.022080936],"study_design_scores_gemma":[0.000012815233,0.00019793471,0.00028800374,0.00000820192,0.000016417338,0.00012387017,0.00003798147,0.98448837,0.009685609,0.004822955,0.00030619183,0.000011668202],"about_ca_topic_score_codex":0.001091517,"about_ca_topic_score_gemma":0.00094138854,"teacher_disagreement_score":0.001091517,"about_ca_system_score_codex":0.0005266969,"about_ca_system_score_gemma":0.0003580277,"threshold_uncertainty_score":0.004563868},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029073918,0.013666236,0.7027149,0.18082324,0.0030085263,0.00015100744,0.0003300908,0.0011326455,0.06909952],"genre_scores_gemma":[0.7498939,0.010249564,0.21666865,0.008390275,0.0024427117,0.00038743604,0.00033242314,0.0005782086,0.011056811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.988345,0.006585382,0.00031247656,0.0010704838,0.0028859605,0.00080065476],"domain_scores_gemma":[0.9472517,0.03605157,0.0020551556,0.0094044795,0.0041415975,0.0010955036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0111701125,0.00092912815,0.00083240104,0.0008919036,0.0015570096,0.004181968,0.002922284,0.0051908623,0.007954271],"category_scores_gemma":[0.0859345,0.0007162907,0.00049135264,0.0011311749,0.008015076,0.016676508,0.003006765,0.0042849598,0.0021799796],"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.00025817347,0.00009539601,0.002393011,0.00044912135,0.00010039312,0.00020174893,0.00054630154,0.03209536,0.001302661,0.79735184,0.027401363,0.1378045],"study_design_scores_gemma":[0.000050511728,0.0000605242,0.00028806625,0.00022289329,0.00001988533,0.00029298183,0.00047568732,0.0284889,0.0011515872,0.9406681,0.02824471,0.000036196492],"about_ca_topic_score_codex":0.0032944775,"about_ca_topic_score_gemma":0.002079946,"teacher_disagreement_score":0.0111701125,"about_ca_system_score_codex":0.0022228367,"about_ca_system_score_gemma":0.002724081,"threshold_uncertainty_score":0.059073925},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051586516,0.0030565062,0.9139131,0.0007307305,0.0002591375,0.00019026973,0.000175423,0.00025088913,0.02983737],"genre_scores_gemma":[0.7827668,0.0072544543,0.1996709,0.00068896473,0.00047325445,0.0002408154,0.00025307832,0.00008425994,0.008567562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989849,0.00034086188,0.000054208962,0.00018309768,0.00031141512,0.00012554451],"domain_scores_gemma":[0.99796104,0.0010192008,0.0001838758,0.00041295902,0.0003648155,0.000058039033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021491568,0.0011201228,0.00094276015,0.0007326175,0.0006690963,0.0008128293,0.00090398063,0.00093955395,0.0017685436],"category_scores_gemma":[0.005242598,0.00022690833,0.0007210445,0.001098133,0.001874579,0.0020599763,0.001072108,0.0014276325,0.00042332688],"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.00009627077,0.000039345694,0.00028007163,0.00014683025,0.000031617445,0.00027939948,0.0003610989,0.21775632,0.007280746,0.70967966,0.0027350984,0.061313506],"study_design_scores_gemma":[0.00002863865,0.00019617628,0.00034108257,0.00004826359,0.000033242777,0.00064914336,0.00010191,0.6656529,0.0034513066,0.3174489,0.0119818365,0.00006660045],"about_ca_topic_score_codex":0.0042355075,"about_ca_topic_score_gemma":0.0026732057,"teacher_disagreement_score":0.0042355075,"about_ca_system_score_codex":0.0011373846,"about_ca_system_score_gemma":0.0010741835,"threshold_uncertainty_score":0.01136595},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089742005,0.0016428981,0.8859101,0.0010697764,0.00055419107,0.0002807517,0.000495641,0.0008221258,0.019482564],"genre_scores_gemma":[0.87729025,0.00063451607,0.11233665,0.00022142068,0.00016844491,0.00015434614,0.00019523725,0.000019599569,0.008979489],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917454,0.00025167485,0.000057186066,0.00016203482,0.00020407332,0.00015047926],"domain_scores_gemma":[0.99917525,0.00023671017,0.00006316869,0.00028157464,0.0001870142,0.00005629474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080265163,0.00101763,0.0010592565,0.0004661968,0.0008672221,0.0011247424,0.00083718926,0.0012759179,0.0017777787],"category_scores_gemma":[0.0010803918,0.00034563555,0.00062141474,0.00081404386,0.00055585464,0.0010193799,0.0009773499,0.00053032703,0.0007762223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012993858,0.00036139032,0.002018432,0.000804484,0.00045972914,0.0021743835,0.00080349174,0.15405464,0.42124867,0.1303141,0.008143893,0.27831745],"study_design_scores_gemma":[0.00024612295,0.0013663347,0.0013418435,0.00006638007,0.00036044003,0.003745952,0.00013839122,0.88206077,0.068260185,0.029935034,0.012193437,0.00028512828],"about_ca_topic_score_codex":0.00076803635,"about_ca_topic_score_gemma":0.0015512864,"teacher_disagreement_score":0.0017777787,"about_ca_system_score_codex":0.0004438664,"about_ca_system_score_gemma":0.00091824,"threshold_uncertainty_score":0.0059472322},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4238331,0.00879983,0.45341572,0.0036326635,0.00045829313,0.00011950753,0.0015809891,0.00042592568,0.10773395],"genre_scores_gemma":[0.9880784,0.0028431616,0.006087008,0.00013004564,0.00018725662,0.000102097656,0.00020793527,0.000047612677,0.002316406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982192,0.0006549624,0.0000348083,0.00016855559,0.0004505962,0.0004717603],"domain_scores_gemma":[0.9831451,0.014159907,0.00067952025,0.00058128545,0.0011447511,0.00028942875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021797328,0.0007759694,0.0010120026,0.0014764379,0.0007522302,0.0024243663,0.0014522418,0.0009258523,0.00496476],"category_scores_gemma":[0.013855253,0.0004601265,0.0003084295,0.0017536602,0.0037048054,0.003083978,0.0016441483,0.0016333285,0.0005129004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006254445,0.00007595684,0.0005579539,0.00030267864,0.000043571737,0.0003533135,0.00029934468,0.49538523,0.0051751384,0.47578105,0.0047521065,0.016648239],"study_design_scores_gemma":[0.00005551487,0.00006543877,0.00042620744,0.00013149339,0.000017023238,0.00015385395,0.00016647816,0.7938418,0.0018545734,0.20132886,0.001904781,0.00005394476],"about_ca_topic_score_codex":0.00453827,"about_ca_topic_score_gemma":0.0016398295,"teacher_disagreement_score":0.00496476,"about_ca_system_score_codex":0.0029721034,"about_ca_system_score_gemma":0.0016946847,"threshold_uncertainty_score":0.021564186},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06315273,0.00057733763,0.90725267,0.0006298018,0.000040987874,0.00006056321,0.00032113676,0.00021472463,0.02775],"genre_scores_gemma":[0.71136564,0.0016915146,0.2722213,0.00039199056,0.00022546129,0.00025692084,0.0007724098,0.00014431436,0.012930324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845445,0.0005305996,0.000078523386,0.00035525588,0.00039990267,0.00018116365],"domain_scores_gemma":[0.9935081,0.0039107674,0.0005154981,0.00096022506,0.0007185066,0.000386801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013353316,0.00050333247,0.00041399492,0.0010650062,0.0008353275,0.001371046,0.0010137574,0.0007793843,0.004603],"category_scores_gemma":[0.0076046493,0.00042498708,0.00054266525,0.0012743511,0.0021443204,0.0049268613,0.0020708553,0.0017822227,0.0005699617],"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.000042601805,0.00001852158,0.0002717737,0.000064396656,0.000005835214,0.000057818062,0.00014214638,0.031005114,0.0021636365,0.9510379,0.0010591956,0.014131135],"study_design_scores_gemma":[0.000013959139,0.000052442443,0.00038885206,0.000037526595,0.000010565267,0.00015989429,0.00006464979,0.17228557,0.0028790152,0.8125762,0.011515249,0.00001611833],"about_ca_topic_score_codex":0.0012882567,"about_ca_topic_score_gemma":0.0011446887,"teacher_disagreement_score":0.004603,"about_ca_system_score_codex":0.0015800099,"about_ca_system_score_gemma":0.0005010262,"threshold_uncertainty_score":0.015398562},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004099399,0.0003015591,0.9933181,0.000087076914,0.000023455574,0.000037645113,0.000031883763,0.000050158043,0.0020507083],"genre_scores_gemma":[0.66812295,0.0027227257,0.32272583,0.00028057487,0.00028675175,0.0006095793,0.00021744799,0.0002770827,0.004757155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986204,0.0006144391,0.00006232017,0.000121615594,0.0004863738,0.00009480488],"domain_scores_gemma":[0.9944746,0.0033423177,0.0006982353,0.00059452903,0.00077973225,0.00011064061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026395305,0.0018809438,0.00085660187,0.0021225016,0.00055618933,0.0013931991,0.0013299083,0.0009857157,0.0015180252],"category_scores_gemma":[0.010755249,0.0004443579,0.0007348204,0.001357931,0.0020391762,0.0028142985,0.0014190868,0.0016876897,0.00047869704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003188959,0.000046019915,0.0008245945,0.00018205206,0.0000798581,0.00014762946,0.00020350341,0.46449095,0.008345314,0.5061661,0.0010467714,0.018435247],"study_design_scores_gemma":[0.0000043800546,0.0000845082,0.00046209578,0.0000356744,0.000017101835,0.00018339639,0.000059655013,0.89913934,0.0031346548,0.09361121,0.0032270055,0.000040911353],"about_ca_topic_score_codex":0.0009534464,"about_ca_topic_score_gemma":0.00048246118,"teacher_disagreement_score":0.0026395305,"about_ca_system_score_codex":0.0016370774,"about_ca_system_score_gemma":0.0009117967,"threshold_uncertainty_score":0.013959348},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029755116,0.0004856504,0.9678899,0.00023089621,0.000022331438,0.000035873552,0.000008217432,0.00012802366,0.0014439969],"genre_scores_gemma":[0.9088807,0.0006019147,0.08920283,0.00007858042,0.00012368191,0.00010125072,0.000019254612,0.000050897197,0.0009408676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798113,0.0010134451,0.00010252451,0.00021689993,0.00053874345,0.00014731406],"domain_scores_gemma":[0.99130076,0.006342342,0.0007033863,0.0008555539,0.0005902958,0.00020772577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028713073,0.000953336,0.0010273238,0.00084231724,0.0007697355,0.0013574816,0.0018888426,0.0016549858,0.000828299],"category_scores_gemma":[0.011659971,0.00041073698,0.00040814973,0.0008098944,0.0014441629,0.0046817423,0.001960465,0.0011646465,0.0001961937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017985512,0.00020400286,0.0015346451,0.0003626499,0.000083322906,0.00024223096,0.00034822297,0.73845506,0.021639165,0.12931359,0.0006532236,0.10698404],"study_design_scores_gemma":[0.000060890776,0.00050369836,0.0006661226,0.000034614997,0.000053561755,0.00038983603,0.00012424702,0.9040777,0.007251648,0.08468981,0.0021061255,0.00004173785],"about_ca_topic_score_codex":0.0002444047,"about_ca_topic_score_gemma":0.0003246048,"teacher_disagreement_score":0.0028713073,"about_ca_system_score_codex":0.00075893867,"about_ca_system_score_gemma":0.00071307464,"threshold_uncertainty_score":0.015185118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051462337,0.0011230512,0.9425765,0.00025099033,0.000037176957,0.00004147136,0.000049132635,0.00009511974,0.0043642293],"genre_scores_gemma":[0.87679803,0.0012461162,0.11990802,0.0000801452,0.00004855432,0.0001317709,0.000044423363,0.000011822658,0.0017311332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974996,0.00012337518,0.0000071836525,0.000022903003,0.0000675189,0.000029032068],"domain_scores_gemma":[0.9992035,0.0005940129,0.000071571696,0.000053702144,0.000059314312,0.00001788963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005055341,0.00045775992,0.00040940917,0.0002434493,0.000399639,0.0006219732,0.00051243027,0.00055744796,0.0008512082],"category_scores_gemma":[0.001112166,0.00015788997,0.00025541108,0.00034013708,0.0004903483,0.00060214003,0.00045968348,0.0004362086,0.00017991217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009726257,0.000076886085,0.0006317234,0.00021511885,0.000048279875,0.000580973,0.00018998263,0.7490318,0.01664434,0.17531139,0.0018861648,0.055286005],"study_design_scores_gemma":[0.000009522086,0.000053933174,0.00009536203,0.0000057554234,0.00000872257,0.00009725374,0.00001434884,0.97651905,0.0014026413,0.020952381,0.0008338573,0.0000073401907],"about_ca_topic_score_codex":0.0006335633,"about_ca_topic_score_gemma":0.0010332764,"teacher_disagreement_score":0.0008512082,"about_ca_system_score_codex":0.0005116857,"about_ca_system_score_gemma":0.00039733865,"threshold_uncertainty_score":0.0037125945},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027868222,0.0041225515,0.75785506,0.0031943496,0.005883609,0.00073073135,0.00207107,0.012191708,0.18608274],"genre_scores_gemma":[0.34531766,0.007815623,0.31471255,0.0013051453,0.0032478082,0.00047706073,0.009533961,0.0029213023,0.3146689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997787,0.000035636847,0.0000123480595,0.000031165735,0.00011647489,0.000025717973],"domain_scores_gemma":[0.99944466,0.00011857564,0.00003738721,0.000097413744,0.0002346815,0.000067214045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040177506,0.000387006,0.0003347129,0.0005927334,0.00034836505,0.00074335816,0.00076729094,0.0005393377,0.030719588],"category_scores_gemma":[0.000901607,0.00012792606,0.00016797645,0.0010902829,0.0004919326,0.0011243492,0.0006804097,0.0006554099,0.008049844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005023268,0.00009665807,0.00061028544,0.00053518993,0.000020774294,0.0004446996,0.00014331695,0.005406577,0.056917097,0.07331821,0.20057945,0.66142535],"study_design_scores_gemma":[0.00014547883,0.0005031017,0.0016417997,0.00013252732,0.000034053886,0.0013406171,0.000094300405,0.12318093,0.08949084,0.026474563,0.75687873,0.000083114166],"about_ca_topic_score_codex":0.0017085985,"about_ca_topic_score_gemma":0.0024262425,"teacher_disagreement_score":0.030719588,"about_ca_system_score_codex":0.0006098072,"about_ca_system_score_gemma":0.00043201642,"threshold_uncertainty_score":0.10276723},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123234004,0.0012244213,0.85962725,0.0016834029,0.00013443462,0.00016410972,0.00044325605,0.0003341755,0.0131550105],"genre_scores_gemma":[0.9626133,0.0011833191,0.024447681,0.00027544014,0.00020378383,0.0002460037,0.00040705473,0.00017570263,0.010447756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997331,0.0010081998,0.00009292812,0.00029631352,0.0007169238,0.0005545947],"domain_scores_gemma":[0.9669493,0.025808934,0.0019361201,0.0013624722,0.0031608688,0.0007822815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004081577,0.00095920713,0.001755495,0.0022178423,0.0011289164,0.0021899785,0.0021761525,0.0022271601,0.005905675],"category_scores_gemma":[0.021648519,0.0012389979,0.0010857519,0.0017202155,0.003278223,0.004109508,0.0020344462,0.0027339514,0.0007393062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010980515,0.0000589333,0.0009682008,0.0000753152,0.00005162341,0.00015453556,0.00023855483,0.5338998,0.0010747743,0.45646533,0.001946315,0.0049567693],"study_design_scores_gemma":[0.000013263414,0.000012893415,0.00020110709,0.000014463839,0.0000102018075,0.000027712327,0.00002582787,0.91967285,0.00017003062,0.07957063,0.00026256288,0.000018460212],"about_ca_topic_score_codex":0.009176007,"about_ca_topic_score_gemma":0.007155014,"teacher_disagreement_score":0.009176007,"about_ca_system_score_codex":0.003055287,"about_ca_system_score_gemma":0.0025146967,"threshold_uncertainty_score":0.022167802},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117610954,0.0021190387,0.8461949,0.00068441185,0.00004898287,0.000057165882,0.00042291183,0.00030308645,0.032558504],"genre_scores_gemma":[0.9055732,0.0020035536,0.0859997,0.0002478613,0.00017009121,0.00022786153,0.00024033853,0.00010205176,0.005435276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992071,0.00020306362,0.000034075954,0.00017753245,0.00021746565,0.00016079642],"domain_scores_gemma":[0.99602675,0.002609606,0.00040896365,0.0004115345,0.0003411331,0.00020206897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016716134,0.00062923995,0.00064231077,0.0010998563,0.0007221558,0.0015375678,0.001207337,0.00065406517,0.0032180303],"category_scores_gemma":[0.005358267,0.00043912674,0.0006214159,0.0009220549,0.001363465,0.003270558,0.0015524952,0.001471563,0.0005382869],"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.00010697105,0.000035272213,0.0004982661,0.00015528612,0.000036238587,0.00017476696,0.000347914,0.09936521,0.014986467,0.86317736,0.0026059605,0.018510388],"study_design_scores_gemma":[0.000023314222,0.00010092767,0.00078962813,0.000063291336,0.000040231225,0.00033006739,0.000085726075,0.45552516,0.0070669744,0.5269392,0.008977759,0.00005762824],"about_ca_topic_score_codex":0.0010567633,"about_ca_topic_score_gemma":0.0006427208,"teacher_disagreement_score":0.0032180303,"about_ca_system_score_codex":0.0013349787,"about_ca_system_score_gemma":0.0005035083,"threshold_uncertainty_score":0.010765374},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08181842,0.002748132,0.8953866,0.0013300737,0.00010655492,0.00010263874,0.00038063104,0.00026377474,0.017863214],"genre_scores_gemma":[0.83908,0.002707014,0.15050364,0.00022359675,0.00025560596,0.00024536933,0.00029520513,0.00008291698,0.006606786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904555,0.00047193744,0.00003069373,0.00010325235,0.0002086284,0.00013981051],"domain_scores_gemma":[0.99818146,0.001288546,0.0001722334,0.00012397429,0.00015632532,0.00007749964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011266228,0.0008715093,0.0009964658,0.00096576416,0.0007427609,0.0014177914,0.0015288455,0.0012549429,0.0028680856],"category_scores_gemma":[0.0049831397,0.00036529684,0.0003204901,0.0015473799,0.00090612745,0.0034194624,0.0014044832,0.0010939655,0.00032811533],"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.0002669448,0.00004839624,0.00023641292,0.00025856058,0.00002543395,0.00010313401,0.00016919419,0.43989938,0.0027436595,0.5066894,0.0055081653,0.04405128],"study_design_scores_gemma":[0.000019788056,0.0000706064,0.00017938922,0.000020359073,0.000010173466,0.00009690731,0.000060319468,0.7950426,0.0010225833,0.19898784,0.0044759517,0.000013485225],"about_ca_topic_score_codex":0.0009817161,"about_ca_topic_score_gemma":0.0010485966,"teacher_disagreement_score":0.0028680856,"about_ca_system_score_codex":0.0020565228,"about_ca_system_score_gemma":0.0004832653,"threshold_uncertainty_score":0.014921188},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008071626,0.19963293,0.78122777,0.0007695806,0.0005235424,0.00014875499,0.000107005944,0.00027921156,0.009239649],"genre_scores_gemma":[0.246822,0.333251,0.40394387,0.0011813792,0.0024531197,0.0005265253,0.00063990033,0.00016462425,0.011017516],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99801934,0.00067691033,0.00020484079,0.00033297107,0.0006689884,0.00009689272],"domain_scores_gemma":[0.99820316,0.0010353524,0.00008915703,0.00028115456,0.00034939864,0.000041849995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020179525,0.00089251524,0.0019402547,0.001482186,0.00085127796,0.0017601924,0.0022151615,0.0013328157,0.0019087511],"category_scores_gemma":[0.0036347292,0.0006562875,0.000596314,0.00602838,0.0008224263,0.0026074366,0.0014435959,0.0011758646,0.0008909468],"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.0002285668,0.00019305383,0.0010089506,0.0022963674,0.0001352409,0.000097681645,0.00017241333,0.048731305,0.006245815,0.058071595,0.0074549895,0.875364],"study_design_scores_gemma":[0.00020737124,0.0013249457,0.0023135392,0.0012138817,0.00045144878,0.0022254342,0.00042523412,0.5797926,0.012776796,0.1350506,0.2640223,0.00019585883],"about_ca_topic_score_codex":0.00081512827,"about_ca_topic_score_gemma":0.0008235054,"teacher_disagreement_score":0.0022151615,"about_ca_system_score_codex":0.0009379543,"about_ca_system_score_gemma":0.00087735965,"threshold_uncertainty_score":0.010672092},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5190077,0.0020479448,0.47127062,0.00053253473,0.00009280146,0.000057785233,0.000095042065,0.00021174166,0.0066838027],"genre_scores_gemma":[0.99483806,0.0002092516,0.004553086,0.000014910426,0.00001595712,0.0000118297585,0.000009134384,0.000007842241,0.00033987648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990662,0.0004270689,0.00003577228,0.00009165881,0.00018021918,0.00019922343],"domain_scores_gemma":[0.9929883,0.005457853,0.0006867508,0.0002608104,0.00036851293,0.00023772343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021571459,0.0005004985,0.00088761124,0.000580147,0.0008200989,0.0013807688,0.00097257405,0.00078662974,0.00044659007],"category_scores_gemma":[0.0064184642,0.00056542415,0.00028275806,0.0009179709,0.00111943,0.0010494266,0.000884418,0.00043040098,0.00008746512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031517743,0.00005003547,0.0018423478,0.00007093836,0.000053562504,0.00079917465,0.00017677338,0.9603372,0.0034434346,0.022223437,0.00050683937,0.010181123],"study_design_scores_gemma":[0.000012379444,0.00003232266,0.0002346457,0.000003182119,0.0000152234325,0.00010204123,0.000036592468,0.993331,0.00047946602,0.005571882,0.00017313755,0.000008010061],"about_ca_topic_score_codex":0.0029126464,"about_ca_topic_score_gemma":0.0030941232,"teacher_disagreement_score":0.0029126464,"about_ca_system_score_codex":0.0014286083,"about_ca_system_score_gemma":0.00090835424,"threshold_uncertainty_score":0.011408269},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030599112,0.000805246,0.96538395,0.0002426817,0.0000861054,0.00004972266,0.000033610653,0.0003113009,0.0024883037],"genre_scores_gemma":[0.90864795,0.00048486431,0.08881139,0.00017338779,0.000047013822,0.00009914903,0.000044621913,0.0000413358,0.0016502413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930906,0.00022929249,0.000026063657,0.000079101,0.00023578966,0.00012073984],"domain_scores_gemma":[0.9981628,0.00079975056,0.00021482217,0.00045795523,0.00028728732,0.00007750898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012831783,0.00056517415,0.00051660556,0.0006000792,0.0007445148,0.00051059754,0.0010768782,0.0006181449,0.0008942001],"category_scores_gemma":[0.0041162753,0.00013504492,0.00034081965,0.00078445923,0.0012418336,0.0014477388,0.0016646229,0.0011176122,0.00015419669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005739858,0.0001142478,0.00092115917,0.00029374662,0.000086781874,0.000423425,0.0007507005,0.4734928,0.054487392,0.24029694,0.004682045,0.22387676],"study_design_scores_gemma":[0.00002146438,0.00016000238,0.00024468845,0.000034368746,0.000031591728,0.00030588714,0.00005770351,0.9488422,0.013396695,0.032417376,0.004434236,0.000053786916],"about_ca_topic_score_codex":0.0021201638,"about_ca_topic_score_gemma":0.0026500192,"teacher_disagreement_score":0.0021201638,"about_ca_system_score_codex":0.00080634333,"about_ca_system_score_gemma":0.001018077,"threshold_uncertainty_score":0.006786227},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5635871,0.0018111502,0.42338204,0.0005028061,0.000025959947,0.000055957567,0.00013229028,0.00020557288,0.010297121],"genre_scores_gemma":[0.99440914,0.00028979784,0.004736282,0.000013586249,0.000009797658,0.000012745462,0.000017849185,0.000011270531,0.0004994093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999345,0.00031742788,0.000021849304,0.00007556194,0.00013099848,0.00010910773],"domain_scores_gemma":[0.9968465,0.0022931357,0.00028330775,0.00015871298,0.00035738226,0.000060991282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012525903,0.0007385566,0.00060497224,0.00036938058,0.00025624014,0.0007611344,0.0005428187,0.00054318015,0.0010278171],"category_scores_gemma":[0.004880396,0.00021353299,0.00024289843,0.0006267871,0.00080824376,0.000843123,0.00058577914,0.00033099923,0.00016489021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012534154,0.000019916728,0.0008018156,0.00006032173,0.000026664415,0.00011236356,0.00006219951,0.9780433,0.0061561354,0.0067022066,0.00019810692,0.0076916874],"study_design_scores_gemma":[0.0000065958484,0.00006970436,0.00041030772,0.0000048463894,0.0000130654735,0.000053491454,0.000027076885,0.9955747,0.0018575256,0.0018802705,0.00009657789,0.000005830427],"about_ca_topic_score_codex":0.0021142322,"about_ca_topic_score_gemma":0.0014506571,"teacher_disagreement_score":0.0021142322,"about_ca_system_score_codex":0.0011195047,"about_ca_system_score_gemma":0.00060332974,"threshold_uncertainty_score":0.008122623},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29008585,0.0023106663,0.68461746,0.00091955,0.00005312072,0.00014096608,0.0004928011,0.0005777514,0.020801859],"genre_scores_gemma":[0.9836336,0.0012132318,0.012747731,0.000055323784,0.000029904631,0.00006961302,0.0000865869,0.00005692008,0.0021070908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992532,0.00027809356,0.000017870809,0.000099303244,0.0001826271,0.00016890216],"domain_scores_gemma":[0.9976342,0.001592089,0.00036141573,0.00013454034,0.00023770497,0.000040016886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011410535,0.0012950678,0.0010494497,0.0006870624,0.0004884637,0.0012046867,0.0010552558,0.00137927,0.0010994263],"category_scores_gemma":[0.004809148,0.0005099251,0.00058200595,0.0010106512,0.001527893,0.0014713051,0.0009338337,0.0008578896,0.000379123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020588557,0.000009977076,0.00022180003,0.00001520139,0.0000052627065,0.000053162148,0.00001718479,0.9940878,0.0013765037,0.0031327808,0.00010502141,0.0009546504],"study_design_scores_gemma":[0.0000035743226,0.000028830189,0.00014250034,0.0000041687003,0.000009042048,0.000038496102,0.00001235013,0.9978849,0.0007263142,0.0010540774,0.00008863351,0.000006974478],"about_ca_topic_score_codex":0.005521242,"about_ca_topic_score_gemma":0.0037172486,"teacher_disagreement_score":0.005521242,"about_ca_system_score_codex":0.0017591857,"about_ca_system_score_gemma":0.0007278239,"threshold_uncertainty_score":0.012763858},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41222152,0.0047702235,0.5489573,0.0006039932,0.000074769894,0.00008306574,0.00026460417,0.0006515202,0.03237303],"genre_scores_gemma":[0.98870486,0.00075684825,0.009303149,0.000031772845,0.000037130492,0.000023371143,0.000048885184,0.000019579162,0.0010744004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976676,0.00094437844,0.00007642513,0.00021701716,0.000728472,0.00036601973],"domain_scores_gemma":[0.99359137,0.004647476,0.0006182573,0.00024481496,0.0007952668,0.00010279408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019935349,0.0015943523,0.0015067933,0.00081369106,0.000613369,0.001581494,0.000981079,0.0014163515,0.0010511086],"category_scores_gemma":[0.007031055,0.000534311,0.00063283707,0.0012731616,0.0016135304,0.0010998243,0.0012528767,0.00065864006,0.00040889432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035418983,0.000035067973,0.0017188496,0.00014627355,0.000102631566,0.0004205521,0.00018470088,0.96104914,0.0123048,0.011577858,0.00037635144,0.0117296325],"study_design_scores_gemma":[0.000008869826,0.00015194235,0.0005975841,0.000014171293,0.00004982509,0.00022730966,0.000038768565,0.9932093,0.0031917628,0.0022741472,0.0002134538,0.000022750342],"about_ca_topic_score_codex":0.003974759,"about_ca_topic_score_gemma":0.0026548796,"teacher_disagreement_score":0.003974759,"about_ca_system_score_codex":0.0015221302,"about_ca_system_score_gemma":0.0010887085,"threshold_uncertainty_score":0.011043847},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025853094,0.00035301418,0.9704763,0.00014774135,0.00002031493,0.000015867672,0.000016102202,0.000048921476,0.0030687037],"genre_scores_gemma":[0.7640003,0.0009421214,0.23138504,0.000111717396,0.000057976915,0.00005988231,0.000040073923,0.000012065285,0.0033907217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997805,0.000078661724,0.000007521657,0.00003064655,0.00006991669,0.000032707972],"domain_scores_gemma":[0.9995302,0.00030422417,0.000046339057,0.000031737065,0.00007695946,0.000010495178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037988578,0.00039186486,0.00032013922,0.00019740907,0.00025854076,0.0003802706,0.00025330196,0.00065761263,0.0009221823],"category_scores_gemma":[0.0010912811,0.00015355111,0.00024860076,0.00038928847,0.00046526897,0.0005616254,0.00031691694,0.0002841417,0.00029431246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010406641,0.000058222344,0.0012035089,0.0001655004,0.00003998637,0.00026611096,0.00017877325,0.78468776,0.05565075,0.06755199,0.0010059961,0.08908733],"study_design_scores_gemma":[0.000009049436,0.00006261022,0.00018879696,0.00000906635,0.000010106588,0.00011873368,0.00003575696,0.98394287,0.0064227274,0.0074827396,0.001705034,0.000012494309],"about_ca_topic_score_codex":0.0008054801,"about_ca_topic_score_gemma":0.0013636305,"teacher_disagreement_score":0.0009221823,"about_ca_system_score_codex":0.00031604525,"about_ca_system_score_gemma":0.00033512292,"threshold_uncertainty_score":0.0030849576},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074717656,0.00070456957,0.921438,0.00014487488,0.000015756908,0.00004222401,0.000024109964,0.00013947253,0.0027734514],"genre_scores_gemma":[0.9403389,0.00029738454,0.058352925,0.000029961591,0.000012778272,0.00005878084,0.000021928628,0.000014150708,0.0008731936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959975,0.00021179288,0.000012172958,0.000043672186,0.0000808991,0.00005170402],"domain_scores_gemma":[0.99974126,0.00016333691,0.000031871474,0.000018981187,0.000031409952,0.0000130916815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005323366,0.00044535575,0.0004708408,0.00026629883,0.00033354768,0.0003978181,0.00044291036,0.00038429978,0.00055961305],"category_scores_gemma":[0.0012351813,0.00022964942,0.00025530445,0.00041701132,0.00037326364,0.00049652794,0.0003988249,0.00026214507,0.00017445034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011339826,0.000039041926,0.00042092742,0.000043682623,0.00001943862,0.00017468134,0.00007375047,0.9366245,0.010046837,0.0065645184,0.00080336514,0.045075893],"study_design_scores_gemma":[0.000006643221,0.00001967655,0.00008731221,0.0000015687566,0.000004966791,0.000020657399,0.000011194138,0.99700004,0.001149417,0.0014844682,0.0002106243,0.0000034019906],"about_ca_topic_score_codex":0.002633667,"about_ca_topic_score_gemma":0.0034572359,"teacher_disagreement_score":0.002633667,"about_ca_system_score_codex":0.000551514,"about_ca_system_score_gemma":0.0005718136,"threshold_uncertainty_score":0.005236745},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28181309,0.0034717564,0.6878367,0.00092711055,0.00015776571,0.00032017997,0.0006960773,0.0008519206,0.023925452],"genre_scores_gemma":[0.9763569,0.0010652179,0.018825881,0.00007851654,0.00007174337,0.000103249586,0.00018298608,0.000057583246,0.0032578716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784315,0.0008571285,0.00011062182,0.00023910952,0.0005558758,0.00039408702],"domain_scores_gemma":[0.99515486,0.0028141702,0.0004322054,0.00051450584,0.0010017301,0.00008260924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003396128,0.0019329204,0.0016735418,0.0013274292,0.00103372,0.0022924228,0.0011769016,0.0016333604,0.0040429747],"category_scores_gemma":[0.0062200245,0.000657086,0.0009221714,0.0016071659,0.0013410565,0.0015974377,0.0015164597,0.00091641414,0.00087018457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012096493,0.00018475563,0.0032893484,0.0005006069,0.00028484454,0.0007268202,0.0006795371,0.8044558,0.04725325,0.09635517,0.001964175,0.043095976],"study_design_scores_gemma":[0.000047419027,0.00026103313,0.0007451486,0.000031627555,0.00012325605,0.000433481,0.00007273695,0.9874441,0.004741677,0.005516478,0.0005290775,0.00005400034],"about_ca_topic_score_codex":0.0044079092,"about_ca_topic_score_gemma":0.003938212,"teacher_disagreement_score":0.0044079092,"about_ca_system_score_codex":0.0018978737,"about_ca_system_score_gemma":0.0014761911,"threshold_uncertainty_score":0.017960608},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06476577,0.00077503466,0.92778367,0.0002195231,0.00006940426,0.0001463659,0.000061730076,0.0002587512,0.005919837],"genre_scores_gemma":[0.8659457,0.0005029618,0.13043997,0.000091987626,0.00006209965,0.00016410176,0.00006435394,0.000037262398,0.0026916075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983772,0.00047677985,0.00006986719,0.00017377482,0.000741207,0.0001611822],"domain_scores_gemma":[0.99604887,0.0019439213,0.0004860837,0.0007460085,0.0006846287,0.000090470116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002580843,0.00070242607,0.0006244289,0.00060571684,0.0004779249,0.0011013797,0.0012958735,0.001056008,0.0018807907],"category_scores_gemma":[0.005714476,0.0002294555,0.00059151015,0.0004911405,0.0011162513,0.0019237897,0.0010714256,0.000943222,0.0003437426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053514034,0.00017657594,0.001405105,0.0004094216,0.00017917917,0.0004796384,0.000444349,0.6181281,0.09820214,0.18946989,0.0016050437,0.0889654],"study_design_scores_gemma":[0.000022309276,0.0002747779,0.00016758675,0.00001283047,0.000031234515,0.00026462355,0.000015781341,0.98431474,0.008600582,0.0049911328,0.0012809107,0.00002345355],"about_ca_topic_score_codex":0.0007054755,"about_ca_topic_score_gemma":0.00060103426,"teacher_disagreement_score":0.002580843,"about_ca_system_score_codex":0.0012476144,"about_ca_system_score_gemma":0.00081783155,"threshold_uncertainty_score":0.013648927},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016559476,0.0014591711,0.9733655,0.0015179164,0.0002104469,0.00009715661,0.00017523099,0.00012984277,0.0064852755],"genre_scores_gemma":[0.83306855,0.005324379,0.14552924,0.001003134,0.0007582277,0.0006225465,0.0004874806,0.00031772951,0.012888801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961075,0.0018316509,0.0001950994,0.0005896787,0.000703729,0.00057231996],"domain_scores_gemma":[0.9759567,0.020687222,0.00078131526,0.0007057471,0.0013964494,0.00047254568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076107155,0.0032769612,0.004015998,0.0024386994,0.0013219223,0.0035270734,0.0025093714,0.004449522,0.004489872],"category_scores_gemma":[0.029075634,0.0018431707,0.0014503062,0.0026331937,0.0057231225,0.0047167796,0.005231923,0.0038375456,0.00048024664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018290535,0.000062127176,0.00030311517,0.00013154579,0.000065819804,0.000099139856,0.0001877048,0.8091746,0.000502837,0.17592837,0.001914579,0.011447262],"study_design_scores_gemma":[0.000035655703,0.000029621928,0.00007503935,0.000032992746,0.000014437387,0.0000179627,0.00003282033,0.913401,0.00018108048,0.085775636,0.00038546615,0.000018292421],"about_ca_topic_score_codex":0.016141366,"about_ca_topic_score_gemma":0.0077363066,"teacher_disagreement_score":0.016141366,"about_ca_system_score_codex":0.004941869,"about_ca_system_score_gemma":0.0049638203,"threshold_uncertainty_score":0.040249765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060636196,0.0005693959,0.9355181,0.00016589055,0.000016296446,0.00002587351,0.000020542762,0.00012472259,0.0029229652],"genre_scores_gemma":[0.9778024,0.00021719221,0.021158012,0.0000347257,0.000015278545,0.000026562277,0.000010497036,0.000009148023,0.00072611135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993537,0.00025050103,0.000034049248,0.00010411173,0.00017636281,0.000081294376],"domain_scores_gemma":[0.9988689,0.00070791465,0.00016244207,0.000100564546,0.000135511,0.000024729936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009548068,0.00061361893,0.00066875113,0.00036205535,0.00042466697,0.0007331001,0.0008055039,0.0005789999,0.00042933697],"category_scores_gemma":[0.002607418,0.0003469146,0.0002391178,0.00061036483,0.0009833013,0.0012561177,0.0009506321,0.0004416224,0.00015089223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008886802,0.000035242112,0.00038593562,0.000063960724,0.000024210027,0.00012329739,0.00018425702,0.94023454,0.0074821706,0.01533249,0.00040106164,0.035644017],"study_design_scores_gemma":[0.000013275218,0.00005700615,0.00013228603,0.0000071630006,0.000011950643,0.000060871633,0.000043104512,0.9855833,0.0020158645,0.011658782,0.00040498003,0.000011357214],"about_ca_topic_score_codex":0.0012244169,"about_ca_topic_score_gemma":0.0016462206,"teacher_disagreement_score":0.0012244169,"about_ca_system_score_codex":0.0005592968,"about_ca_system_score_gemma":0.00057349115,"threshold_uncertainty_score":0.0050495863},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025351228,0.0006718759,0.9714571,0.0001652425,0.000032109456,0.000033520697,0.00002221403,0.00014923008,0.0021174403],"genre_scores_gemma":[0.72068983,0.0017425297,0.27286842,0.00016420311,0.0001441963,0.0001269305,0.00013471821,0.000082562576,0.0040466217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988269,0.00056256197,0.000037909955,0.00009910708,0.0003955356,0.00007798264],"domain_scores_gemma":[0.9957262,0.0036191354,0.00014891983,0.00019001598,0.00028050155,0.000035156598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012825064,0.0006786447,0.0006884837,0.00040879028,0.00044346502,0.00066321297,0.0005512273,0.00079529476,0.0005037772],"category_scores_gemma":[0.0065391604,0.00029769723,0.0002474602,0.00092213444,0.0011452727,0.0011452159,0.0009837502,0.0006976922,0.00019641155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000957963,0.000036989335,0.00039615345,0.00007133805,0.000036560803,0.00011481587,0.0001030225,0.9289113,0.0062976037,0.01727053,0.0005365336,0.046129365],"study_design_scores_gemma":[0.000007341712,0.000025079491,0.00006513276,0.0000041157828,0.0000045577294,0.000032377986,0.000009478337,0.99041325,0.003264245,0.0058768685,0.0002903804,0.000007145562],"about_ca_topic_score_codex":0.0022100138,"about_ca_topic_score_gemma":0.0020055568,"teacher_disagreement_score":0.0022100138,"about_ca_system_score_codex":0.00047704534,"about_ca_system_score_gemma":0.0008226144,"threshold_uncertainty_score":0.006782651},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049808256,0.00080540223,0.9417329,0.00024536374,0.00003793791,0.000040179402,0.00009707679,0.00012806634,0.007104783],"genre_scores_gemma":[0.93310744,0.0017140575,0.06019623,0.00013999894,0.00007095104,0.00011183093,0.00014341311,0.00009406356,0.0044219303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993886,0.00020177921,0.000021674221,0.000054014858,0.0002642955,0.00006970071],"domain_scores_gemma":[0.9958333,0.0031263165,0.00029303378,0.00015993332,0.0005451678,0.00004230507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015682224,0.00093487755,0.0005760701,0.00061421987,0.0002231794,0.0009306539,0.00063654967,0.0005735371,0.002336676],"category_scores_gemma":[0.005669478,0.00022290104,0.00037737607,0.0005034615,0.00093904923,0.0014172926,0.00065723446,0.0006666223,0.0005669216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088321794,0.000033048484,0.0010204688,0.00022448676,0.00003887106,0.00038097549,0.00014099965,0.8992931,0.0047498653,0.07751089,0.00093960244,0.015579349],"study_design_scores_gemma":[0.0000057931456,0.00004126325,0.00027480003,0.000024728159,0.000013639734,0.00019430829,0.000029461573,0.98411995,0.0017272269,0.013187043,0.00037223977,0.000009522379],"about_ca_topic_score_codex":0.000716723,"about_ca_topic_score_gemma":0.0005499392,"teacher_disagreement_score":0.002336676,"about_ca_system_score_codex":0.0008418125,"about_ca_system_score_gemma":0.0006311463,"threshold_uncertainty_score":0.008293688},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37573007,0.0011436931,0.59413385,0.00049836,0.000036567995,0.00007927296,0.00009971307,0.0003511879,0.02792728],"genre_scores_gemma":[0.96966696,0.00039401153,0.028032525,0.000055571763,0.000010577279,0.00005191153,0.000032457785,0.000024310359,0.0017316382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988274,0.0005703235,0.000030779407,0.00007553369,0.000331002,0.00016503266],"domain_scores_gemma":[0.99620664,0.0029545238,0.00025669613,0.00014611424,0.000365589,0.000070388756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018648258,0.00067139236,0.00039128665,0.00038616094,0.0002722439,0.0010908819,0.00036201396,0.0008617464,0.0016783247],"category_scores_gemma":[0.006252051,0.0002480782,0.00018853678,0.0005333992,0.0006712317,0.0010999842,0.0007739058,0.0004496158,0.00034231582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005943361,0.00014323849,0.0022716161,0.00013678696,0.000051622585,0.00016462327,0.0002136583,0.8382755,0.041942228,0.03260283,0.0005807331,0.083022766],"study_design_scores_gemma":[0.000033463257,0.00039948823,0.00055998494,0.000019216037,0.000023107368,0.000119979704,0.00012407829,0.9721519,0.015185541,0.0108154835,0.0005423685,0.000025454468],"about_ca_topic_score_codex":0.0016529119,"about_ca_topic_score_gemma":0.00202252,"teacher_disagreement_score":0.0018648258,"about_ca_system_score_codex":0.0005866373,"about_ca_system_score_gemma":0.00058789505,"threshold_uncertainty_score":0.009862244},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028711904,0.0006523515,0.95883024,0.00028568652,0.00021673486,0.00014638717,0.00009530938,0.0012398667,0.009821525],"genre_scores_gemma":[0.7892466,0.00076304656,0.20554899,0.0002900362,0.000086306616,0.00018783586,0.0002080034,0.00014273945,0.0035265256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999445,0.00020069015,0.000027621238,0.000058553742,0.00017032724,0.00009768533],"domain_scores_gemma":[0.9997298,0.000073845535,0.000029428178,0.000083389335,0.00005102152,0.000032515203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051875325,0.00042724435,0.00029509777,0.00014470721,0.00034095894,0.001240468,0.00093993224,0.0003729883,0.0017488137],"category_scores_gemma":[0.0006782561,0.00018288309,0.00050271366,0.00014299074,0.0005267577,0.0009699816,0.00094677566,0.000924275,0.0003517485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013319687,0.000115420786,0.0022527026,0.00021554559,0.00011514537,0.00038599575,0.0003108371,0.6399462,0.028618872,0.25272167,0.0057278792,0.06945649],"study_design_scores_gemma":[0.000018848741,0.0001164256,0.00036892132,0.000021559754,0.000030735657,0.00014879962,0.000041808547,0.94543856,0.006781436,0.015013425,0.03199781,0.00002172802],"about_ca_topic_score_codex":0.0016027519,"about_ca_topic_score_gemma":0.0016796573,"teacher_disagreement_score":0.0017488137,"about_ca_system_score_codex":0.00056746654,"about_ca_system_score_gemma":0.00089712354,"threshold_uncertainty_score":0.005850315},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026065473,0.00049049297,0.9526523,0.0010368007,0.00016984642,0.00016228881,0.00037142046,0.000224125,0.018827237],"genre_scores_gemma":[0.9140206,0.0009785964,0.06383669,0.00038000123,0.00024389455,0.00057853875,0.00024379363,0.00007740696,0.019640433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987771,0.0004073535,0.000046607445,0.00017496996,0.0003517831,0.00024218846],"domain_scores_gemma":[0.9979122,0.0013045343,0.00020971432,0.00014928835,0.00030346474,0.00012077408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015660177,0.0009608682,0.0009112495,0.0008372439,0.0010157606,0.0020824792,0.0024006034,0.0016995288,0.004358757],"category_scores_gemma":[0.004365923,0.0005654174,0.0006302074,0.0011996278,0.0017241259,0.0028494245,0.0012826255,0.0015978765,0.00067309843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042424916,0.000053442534,0.00031020044,0.00005575767,0.00001600888,0.00034414558,0.000229631,0.3974472,0.001585614,0.59458554,0.0016090019,0.0037211454],"study_design_scores_gemma":[0.000017210252,0.00002068163,0.00007238271,0.000007930071,0.0000074163595,0.000076529,0.00004536797,0.924711,0.00016016931,0.07308221,0.0017851503,0.000014017505],"about_ca_topic_score_codex":0.012276415,"about_ca_topic_score_gemma":0.0072009843,"teacher_disagreement_score":0.012276415,"about_ca_system_score_codex":0.0035433655,"about_ca_system_score_gemma":0.002363767,"threshold_uncertainty_score":0.025709033},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16164944,0.0014606,0.82844174,0.0004277673,0.00009243123,0.00005914961,0.000100207595,0.00016070621,0.007607966],"genre_scores_gemma":[0.969971,0.00029498304,0.028307948,0.00004771157,0.000044829336,0.00004177645,0.000026905438,0.000019983025,0.0012447281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953616,0.00018700752,0.000020330834,0.00007016736,0.00007176403,0.00011461616],"domain_scores_gemma":[0.9987686,0.00087587547,0.0000828294,0.00008298421,0.0001419635,0.00004770921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008914031,0.00043967043,0.0007978118,0.00033724846,0.0005568924,0.0010524729,0.00089417887,0.00056373555,0.0017000668],"category_scores_gemma":[0.0028555861,0.0003337484,0.00023717443,0.00063831935,0.000541416,0.00096973946,0.00083195936,0.00046668568,0.00023851125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051700877,0.0001286771,0.0008497412,0.0001470468,0.0000793019,0.00039184422,0.00018001729,0.8729469,0.016150292,0.03400952,0.001917489,0.07268215],"study_design_scores_gemma":[0.000013798721,0.00003872258,0.00016840354,0.0000045097904,0.000013404811,0.000041249466,0.00002435237,0.9944172,0.0010181513,0.0039862846,0.00026621143,0.000007726721],"about_ca_topic_score_codex":0.0015008821,"about_ca_topic_score_gemma":0.0027372532,"teacher_disagreement_score":0.0017000668,"about_ca_system_score_codex":0.00081050314,"about_ca_system_score_gemma":0.00048542596,"threshold_uncertainty_score":0.005880654},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018158924,0.0002107781,0.980489,0.00008749846,0.000009426099,0.000022465443,0.000015056746,0.00012600799,0.0008808575],"genre_scores_gemma":[0.8013297,0.00028156943,0.19619209,0.000061861625,0.000032786476,0.00011472037,0.000055212724,0.000028600962,0.001903615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993636,0.00029826205,0.000023194172,0.000116251234,0.00012382765,0.00007493914],"domain_scores_gemma":[0.9994382,0.00035340516,0.000073150855,0.00005174376,0.000059708374,0.000023792267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073153165,0.0009601758,0.001074471,0.0003397645,0.00038542395,0.0006666794,0.00084668474,0.0007113429,0.0007738327],"category_scores_gemma":[0.0014350156,0.0003772128,0.00043149083,0.0004847749,0.0006237009,0.00094882114,0.0006941414,0.00062175473,0.0002763818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108589986,0.000052933585,0.00044965575,0.0000663803,0.000035199948,0.00012225354,0.00009401659,0.91747594,0.0038357177,0.009020482,0.0008365455,0.06790233],"study_design_scores_gemma":[0.000014525974,0.000031054748,0.00005506494,0.0000020634989,0.000007993077,0.00003418616,0.000011221496,0.996318,0.0008676184,0.0024530604,0.00020164462,0.0000036410195],"about_ca_topic_score_codex":0.001825922,"about_ca_topic_score_gemma":0.002077142,"teacher_disagreement_score":0.001825922,"about_ca_system_score_codex":0.00064779667,"about_ca_system_score_gemma":0.0005562683,"threshold_uncertainty_score":0.0047001243},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020116806,0.00531654,0.96235335,0.0012900399,0.0002990758,0.00008893753,0.00009936413,0.0005038652,0.009932069],"genre_scores_gemma":[0.81003255,0.004350657,0.17981243,0.00048373212,0.00052544347,0.0003310127,0.00016448765,0.00012803008,0.004171734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99897444,0.00043269736,0.000039888095,0.000054242162,0.0003857154,0.000113043265],"domain_scores_gemma":[0.9960898,0.0025464848,0.00021249324,0.00043598493,0.0006299029,0.00008530543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017735047,0.0006294664,0.0005619459,0.0009208719,0.00090992334,0.0013867135,0.0010305351,0.00087248476,0.0019383766],"category_scores_gemma":[0.008133029,0.0002651082,0.00022650562,0.0010839512,0.0012376591,0.0015222628,0.0010471571,0.001315518,0.00040763005],"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.00023321756,0.000048956856,0.00041463942,0.00030019804,0.000032859898,0.00022878134,0.00034195688,0.3014075,0.00899194,0.56261003,0.00945579,0.11593423],"study_design_scores_gemma":[0.000021899485,0.000058327492,0.00011626775,0.00005931273,0.000012878145,0.00009187235,0.00005230308,0.86445487,0.002356819,0.12541074,0.007349249,0.0000154953],"about_ca_topic_score_codex":0.001705018,"about_ca_topic_score_gemma":0.0018832484,"teacher_disagreement_score":0.0019383766,"about_ca_system_score_codex":0.0012968656,"about_ca_system_score_gemma":0.0015598558,"threshold_uncertainty_score":0.009409428},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12328362,0.0025679541,0.8530991,0.0008082307,0.00009004971,0.00014021536,0.0003052531,0.00025713348,0.019448342],"genre_scores_gemma":[0.966329,0.001463682,0.02838464,0.00016297525,0.00008351195,0.000079384554,0.00012070808,0.000046008096,0.0033301434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991986,0.00027935614,0.000020838563,0.00007798302,0.0002130095,0.0002102245],"domain_scores_gemma":[0.99736065,0.0015421397,0.00028118902,0.00020102362,0.0005269087,0.00008800718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016747781,0.0014116452,0.00090409606,0.00084232807,0.00059683714,0.001269919,0.0010966444,0.0013121589,0.0034065652],"category_scores_gemma":[0.0053796694,0.00036699188,0.0006418848,0.00096590084,0.0020037193,0.0014122591,0.0012554354,0.00090012583,0.00040229745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011605629,0.000025108175,0.0004966033,0.00013352711,0.000037864913,0.00026038164,0.00017678119,0.8822433,0.004044791,0.09606541,0.0012924914,0.015107743],"study_design_scores_gemma":[0.000008113917,0.00004457542,0.00015135095,0.000016856045,0.000012394141,0.00009886349,0.000045239267,0.98613316,0.00039670404,0.012672188,0.00040279294,0.000017758595],"about_ca_topic_score_codex":0.009905019,"about_ca_topic_score_gemma":0.006629211,"teacher_disagreement_score":0.009905019,"about_ca_system_score_codex":0.0019511544,"about_ca_system_score_gemma":0.0013985038,"threshold_uncertainty_score":0.019694686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010309558,0.0005564775,0.98126674,0.00036658635,0.000095686315,0.00007886472,0.00011055995,0.00040651718,0.006809138],"genre_scores_gemma":[0.47087944,0.0020725632,0.5103965,0.00075437775,0.0002428929,0.00048578207,0.00043046754,0.00020920164,0.014528814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992918,0.00022405057,0.000018169909,0.00007171222,0.00027784798,0.00011646292],"domain_scores_gemma":[0.99883765,0.0004970333,0.00015190213,0.00018051163,0.00026656146,0.00006630268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008380648,0.0011348001,0.0006180156,0.00075257535,0.000445725,0.000991463,0.001237345,0.0008788468,0.002855635],"category_scores_gemma":[0.004021699,0.00030736657,0.00035029513,0.0010292227,0.001177689,0.0012979086,0.0016725153,0.0015169733,0.0011350613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033471594,0.00008807942,0.0003979254,0.00021944982,0.00006712587,0.00022251083,0.0001638434,0.46661633,0.013731035,0.34482116,0.011104344,0.1622335],"study_design_scores_gemma":[0.0000713439,0.00016211453,0.00009330164,0.0000640156,0.000031384625,0.0002886616,0.00003447969,0.87898743,0.006192002,0.10202081,0.012012166,0.00004225374],"about_ca_topic_score_codex":0.0016059421,"about_ca_topic_score_gemma":0.0019859634,"teacher_disagreement_score":0.002855635,"about_ca_system_score_codex":0.0010540828,"about_ca_system_score_gemma":0.001962511,"threshold_uncertainty_score":0.009553015},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6778792,0.0019609754,0.30994433,0.00034557242,0.00003457651,0.00006538694,0.00010540339,0.00024273769,0.00942181],"genre_scores_gemma":[0.99462366,0.00028438435,0.004777483,0.000015077987,0.000006393878,0.000011667599,0.000014945191,0.000005954046,0.00026051345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902976,0.00035974343,0.000045010125,0.0000817973,0.00033909184,0.00014466536],"domain_scores_gemma":[0.99483514,0.0036808809,0.0005993297,0.00023816648,0.00059559534,0.000050880924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016810737,0.0006868967,0.0004974927,0.00044698405,0.00042595138,0.00097100984,0.0006250389,0.0008025435,0.0006359039],"category_scores_gemma":[0.0065231696,0.0001962498,0.0002733654,0.00057870947,0.00069078634,0.00061813433,0.0005140175,0.00041566414,0.0001229675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006112129,0.00007876829,0.0049717547,0.00021486389,0.00009120122,0.00046333653,0.00035187489,0.8902988,0.037800312,0.014338433,0.0004094649,0.05037002],"study_design_scores_gemma":[0.000011348328,0.00020938473,0.001189057,0.0000131726165,0.00003157654,0.00015257052,0.000045822126,0.99193525,0.0048690373,0.0013395039,0.00018937778,0.0000138495125],"about_ca_topic_score_codex":0.003302733,"about_ca_topic_score_gemma":0.0034925633,"teacher_disagreement_score":0.003302733,"about_ca_system_score_codex":0.00082186656,"about_ca_system_score_gemma":0.00069078204,"threshold_uncertainty_score":0.00889045},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06001783,0.0006307336,0.93673617,0.00012634211,0.00001537066,0.000026361799,0.000010420085,0.00006306654,0.0023736926],"genre_scores_gemma":[0.93200374,0.0006130317,0.06595261,0.000052934472,0.000030714404,0.000066916786,0.000015637615,0.000015728865,0.0012486939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992705,0.0003654269,0.000025661768,0.00010315009,0.00019136876,0.000043995216],"domain_scores_gemma":[0.9987036,0.00095075445,0.00013618876,0.00009490948,0.000093915914,0.000020622661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015097248,0.00045556948,0.00045850498,0.00041654153,0.00033623673,0.00059246004,0.00078174367,0.0005362595,0.00044820685],"category_scores_gemma":[0.0030991575,0.00026924367,0.00019732871,0.0007210294,0.0013915435,0.0011545934,0.00068495487,0.00035013573,0.00012687779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010193618,0.000044718174,0.0004145238,0.00006461883,0.00001957238,0.00015023755,0.00019762898,0.9033407,0.006585554,0.04607063,0.00026089937,0.04274884],"study_design_scores_gemma":[0.00002123656,0.00017158678,0.00013126037,0.0000072968382,0.000011152611,0.00012553378,0.000049865506,0.96632075,0.0019980874,0.030412477,0.00073872035,0.000012064875],"about_ca_topic_score_codex":0.0005756645,"about_ca_topic_score_gemma":0.00054577034,"teacher_disagreement_score":0.0015097248,"about_ca_system_score_codex":0.00048294524,"about_ca_system_score_gemma":0.00027421588,"threshold_uncertainty_score":0.007984281},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25377876,0.0025767381,0.7346601,0.00029063903,0.00007428337,0.000074350275,0.00018269134,0.0003399402,0.008022628],"genre_scores_gemma":[0.9745914,0.00086730684,0.02256358,0.0000237724,0.00003059542,0.00005780967,0.000053760323,0.000010433122,0.0018014874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928457,0.00034248165,0.000030118403,0.000100876176,0.00016188552,0.00008003665],"domain_scores_gemma":[0.9976418,0.0016584579,0.00029395588,0.00013686591,0.00022825075,0.000040730796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010476011,0.001246137,0.0012556656,0.00051022554,0.000529637,0.0009266108,0.0010055279,0.0010203657,0.0011048655],"category_scores_gemma":[0.0030350636,0.00040565594,0.00042576384,0.0008396391,0.0006958585,0.0013343279,0.0007977867,0.0005200412,0.00033880206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017798894,0.000033259705,0.0007690673,0.0001153144,0.0000631222,0.0004173956,0.000073355004,0.96595466,0.006960552,0.015562932,0.00033128285,0.009541119],"study_design_scores_gemma":[0.000008736572,0.00009417303,0.00015814058,0.000005699425,0.000024235205,0.00013694413,0.000024142195,0.994091,0.0018046268,0.0033498148,0.00029051685,0.000011912667],"about_ca_topic_score_codex":0.0010705389,"about_ca_topic_score_gemma":0.0011385606,"teacher_disagreement_score":0.0012556656,"about_ca_system_score_codex":0.0009862192,"about_ca_system_score_gemma":0.00029379354,"threshold_uncertainty_score":0.0071555376},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071624364,0.00092326745,0.98990446,0.00020691394,0.000027895288,0.000011473583,0.000015604266,0.00005037248,0.0016976355],"genre_scores_gemma":[0.7154934,0.0027787208,0.2758477,0.0002294214,0.00026007614,0.00018207323,0.000075243144,0.000080160564,0.00505328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884486,0.000752745,0.000027342438,0.0001322197,0.00018150726,0.00006127018],"domain_scores_gemma":[0.9992091,0.0005789128,0.00006357904,0.00005651914,0.00007360344,0.000018245219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013238323,0.0007240146,0.00084596535,0.0003074032,0.00023398451,0.0008122822,0.00067657366,0.0011051281,0.0008119472],"category_scores_gemma":[0.0020634367,0.00038115287,0.00040046277,0.00085462857,0.0009325521,0.0012051219,0.00064860284,0.0008177762,0.0002918936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007535669,0.000042881176,0.00016303317,0.00007967448,0.000039574352,0.00006637957,0.00004675997,0.9037193,0.0037384727,0.058697402,0.0009032491,0.032427907],"study_design_scores_gemma":[0.000016658054,0.000033216314,0.00006562133,0.000005153406,0.0000071089744,0.000017938812,0.000009108356,0.97167677,0.00072452094,0.026877388,0.00056003133,0.0000064272635],"about_ca_topic_score_codex":0.0007323292,"about_ca_topic_score_gemma":0.0006889753,"teacher_disagreement_score":0.0013238323,"about_ca_system_score_codex":0.000573098,"about_ca_system_score_gemma":0.00043648086,"threshold_uncertainty_score":0.0070011616},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024456766,0.0006623078,0.96951634,0.0005615157,0.00025036637,0.00033470435,0.00008996228,0.00066305726,0.0034650804],"genre_scores_gemma":[0.8147547,0.0005003487,0.17664015,0.00027701483,0.00016642023,0.00035850226,0.00014574119,0.000046716792,0.007110426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972652,0.0012004158,0.00016093283,0.0002680732,0.0007755846,0.0003296888],"domain_scores_gemma":[0.99608684,0.0012037285,0.0005771929,0.0009574919,0.0008059962,0.00036868374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036805628,0.0006570381,0.0009460466,0.0010373647,0.0011089055,0.0008998356,0.0030073738,0.0010349103,0.0022128136],"category_scores_gemma":[0.005555944,0.0003206643,0.00052501675,0.0010090676,0.0010316938,0.0034208342,0.002999843,0.0018579899,0.0005377759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015399482,0.0006098846,0.001883749,0.00095571554,0.00020352338,0.0011994513,0.0011132674,0.14210653,0.048886918,0.4093852,0.014835564,0.37728027],"study_design_scores_gemma":[0.0003985323,0.0012636201,0.0009556856,0.000109595974,0.0001540521,0.0014199628,0.00020662593,0.8362995,0.018997315,0.10329349,0.036637645,0.00026391164],"about_ca_topic_score_codex":0.0004893291,"about_ca_topic_score_gemma":0.00045959846,"teacher_disagreement_score":0.0036805628,"about_ca_system_score_codex":0.000895007,"about_ca_system_score_gemma":0.0015845544,"threshold_uncertainty_score":0.01946485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032138184,0.0014851165,0.7889137,0.0033914025,0.0010710306,0.00017784818,0.0005794424,0.0002901837,0.17195311],"genre_scores_gemma":[0.7032041,0.0030871783,0.20324807,0.0024805204,0.002482904,0.000672082,0.0008150097,0.00044337806,0.08356674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984363,0.00047220997,0.00008167242,0.00021235288,0.00057927484,0.00021824805],"domain_scores_gemma":[0.99840885,0.00043116754,0.00014110008,0.0004324196,0.00046850357,0.00011798149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014771108,0.0008079019,0.0005089789,0.0021831538,0.00177385,0.0029727507,0.0014032078,0.0018272218,0.0066284104],"category_scores_gemma":[0.003712059,0.00033086233,0.00092972285,0.0014291927,0.004242147,0.004445673,0.0023126132,0.003124997,0.0019907155],"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.0000026525472,0.00000230465,0.000021421441,0.000008161115,8.354352e-7,0.000014535863,0.00005777202,0.00035689058,0.0001423026,0.99756026,0.00044495266,0.0013878712],"study_design_scores_gemma":[0.0000039000356,0.000014717233,0.00004158114,0.000014365317,0.0000029140635,0.00010912098,0.000034608383,0.004444273,0.0002599352,0.9819031,0.013163356,0.000008164327],"about_ca_topic_score_codex":0.0006797353,"about_ca_topic_score_gemma":0.00045725732,"teacher_disagreement_score":0.0066284104,"about_ca_system_score_codex":0.0013246748,"about_ca_system_score_gemma":0.0009561586,"threshold_uncertainty_score":0.022174299},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034190014,0.00026708553,0.9936346,0.00011507798,0.000029308876,0.000057914418,0.000021345386,0.000117324416,0.0023383347],"genre_scores_gemma":[0.4930912,0.0015996379,0.4946791,0.00030900876,0.00017232032,0.000672117,0.00019236264,0.00006563145,0.009218556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987759,0.00039464617,0.00007561461,0.00020163282,0.00045933604,0.00009285124],"domain_scores_gemma":[0.9990513,0.00030682038,0.00016963424,0.00007233614,0.0003757111,0.0000242292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012885266,0.0008372467,0.0007076194,0.00043612666,0.00041020632,0.0012612663,0.0010459531,0.0009861774,0.0025362233],"category_scores_gemma":[0.0018000776,0.00038302914,0.00036590785,0.0005179318,0.0005724587,0.0010501712,0.000634944,0.0008486204,0.0013988155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026134503,0.0002085999,0.0012548014,0.0007672075,0.00016382216,0.00053047226,0.0004721145,0.4156158,0.14094675,0.17657083,0.005712616,0.2574956],"study_design_scores_gemma":[0.00003817007,0.0003947339,0.00023233253,0.00005316352,0.000055099306,0.0004117064,0.00005547503,0.9563533,0.023571888,0.0126553895,0.006139016,0.000039731985],"about_ca_topic_score_codex":0.0005135246,"about_ca_topic_score_gemma":0.00071181386,"teacher_disagreement_score":0.0025362233,"about_ca_system_score_codex":0.0006161442,"about_ca_system_score_gemma":0.0013447771,"threshold_uncertainty_score":0.008484542},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051373053,0.0005616783,0.94285136,0.00035580082,0.00004266486,0.000048587535,0.000039543684,0.00021851291,0.004508768],"genre_scores_gemma":[0.85983765,0.0007114296,0.13567148,0.00015902474,0.00003309406,0.000120941244,0.000059121416,0.000033005024,0.0033742536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978966,0.000081114886,0.000007855176,0.000019913161,0.00007087264,0.000030576302],"domain_scores_gemma":[0.9989901,0.00048461492,0.00020456639,0.00014421072,0.00015142426,0.000024921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071250065,0.00026783216,0.0002577345,0.00034713873,0.00038975227,0.00060969096,0.00046642168,0.00043733485,0.00086554466],"category_scores_gemma":[0.0021643776,0.00010370409,0.00019652602,0.00044148098,0.00074777106,0.0009868112,0.0005812143,0.0005835042,0.00021057665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003830639,0.00007575268,0.0006942182,0.00024622172,0.000040768424,0.00026842474,0.0002833727,0.335774,0.060465116,0.49455342,0.002389452,0.10482621],"study_design_scores_gemma":[0.000023377977,0.00011878488,0.00017713384,0.000028442817,0.000012260971,0.00014149102,0.000033686865,0.93865126,0.017075004,0.04002688,0.003688317,0.000023373475],"about_ca_topic_score_codex":0.0016181621,"about_ca_topic_score_gemma":0.0014085331,"teacher_disagreement_score":0.0016181621,"about_ca_system_score_codex":0.00073499966,"about_ca_system_score_gemma":0.0008539578,"threshold_uncertainty_score":0.0053328276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45771927,0.0041695107,0.52074677,0.0005316952,0.000040539508,0.00009989314,0.00020857873,0.00031582578,0.016167859],"genre_scores_gemma":[0.99364895,0.0007914866,0.004783567,0.00002899459,0.000025509373,0.000026774826,0.00003108228,0.000012933614,0.0006508325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988753,0.00042275176,0.000046450412,0.00012333096,0.0002885078,0.00024357432],"domain_scores_gemma":[0.9924925,0.0055576405,0.00085147814,0.00024921313,0.0007358981,0.000113231225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018962095,0.0015163999,0.00097451115,0.000952317,0.0007137606,0.0016112684,0.0007826165,0.0013247947,0.00083626166],"category_scores_gemma":[0.0091095,0.00037032727,0.00050477433,0.0011282644,0.0012815497,0.0012612296,0.0009755125,0.0007683489,0.00026074494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074913,0.000036148394,0.0012356568,0.00007704203,0.00004262207,0.00030977046,0.00019183928,0.9758394,0.0034178363,0.011357027,0.00025293775,0.0071648406],"study_design_scores_gemma":[0.000003688474,0.0000528377,0.00037267298,0.000007309352,0.000014860524,0.00009470103,0.000042786985,0.99626106,0.00053531013,0.0025127446,0.000091679074,0.000010235985],"about_ca_topic_score_codex":0.007931373,"about_ca_topic_score_gemma":0.0039985455,"teacher_disagreement_score":0.007931373,"about_ca_system_score_codex":0.0014664083,"about_ca_system_score_gemma":0.00097209093,"threshold_uncertainty_score":0.015770435},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13680996,0.0014110969,0.842115,0.0008948041,0.000054011427,0.00009682649,0.00032726672,0.00022966013,0.01806136],"genre_scores_gemma":[0.98025036,0.0006928721,0.016701706,0.000077415745,0.00006125503,0.00009422956,0.00013416588,0.00003966261,0.0019483507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992255,0.00040032945,0.00001658182,0.0000594075,0.00017983602,0.00011833524],"domain_scores_gemma":[0.9944311,0.004465275,0.0003452447,0.00018518254,0.00040895108,0.00016424031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001700997,0.00061508187,0.0006116585,0.001097973,0.0005125197,0.0009713021,0.0011421574,0.0006791995,0.0016947032],"category_scores_gemma":[0.005742711,0.00030636427,0.000514801,0.0010698145,0.0013070268,0.0015585315,0.0007820156,0.00077939173,0.00020732984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043756638,0.000035273802,0.00046506105,0.000064790656,0.000028598113,0.00013411959,0.000093562456,0.88681227,0.0019289762,0.105075195,0.0011583403,0.0041601267],"study_design_scores_gemma":[0.000001541292,0.000006940304,0.00010301773,0.0000036679157,0.0000025897962,0.000016497068,0.000009172697,0.9874936,0.00013802793,0.01205475,0.0001660832,0.0000040602645],"about_ca_topic_score_codex":0.003703222,"about_ca_topic_score_gemma":0.0017132425,"teacher_disagreement_score":0.003703222,"about_ca_system_score_codex":0.0015390173,"about_ca_system_score_gemma":0.0006668952,"threshold_uncertainty_score":0.011166453},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08704349,0.0005712526,0.9047508,0.00021164061,0.00003058396,0.00005112743,0.000039990857,0.00014430545,0.0071567064],"genre_scores_gemma":[0.96107584,0.00040451146,0.037194483,0.000056850095,0.000022370186,0.00007570017,0.00002127475,0.000008298136,0.0011407397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949193,0.00019123548,0.000018323944,0.000051091512,0.00015116966,0.00009614861],"domain_scores_gemma":[0.9990658,0.0004901504,0.00013320132,0.00013999092,0.00013566302,0.00003520971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009003322,0.00042088705,0.0003323618,0.0002701614,0.0004397754,0.00059716403,0.0007893577,0.0004728932,0.00048669265],"category_scores_gemma":[0.0018820005,0.00018946631,0.00019702996,0.0004662028,0.0005081197,0.0006924721,0.0008810339,0.00028493573,0.00014219871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032851388,0.00010883539,0.0023530102,0.00024926025,0.00007135496,0.0010428752,0.0009000714,0.507172,0.04849856,0.2906067,0.001641226,0.14702766],"study_design_scores_gemma":[0.000030024303,0.00012297304,0.0001930658,0.000016326874,0.000033882054,0.00034163313,0.00008442452,0.9441575,0.005749069,0.045463476,0.003784354,0.000023240136],"about_ca_topic_score_codex":0.0012894793,"about_ca_topic_score_gemma":0.0018732623,"teacher_disagreement_score":0.0012894793,"about_ca_system_score_codex":0.00039828656,"about_ca_system_score_gemma":0.00052169076,"threshold_uncertainty_score":0.0047614574},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4038653,0.0032307643,0.5791321,0.0007049814,0.00017689339,0.000090568974,0.000109564324,0.0001547321,0.012535049],"genre_scores_gemma":[0.9923665,0.0005321212,0.0053035747,0.00005185052,0.00003694168,0.000030645006,0.000025255878,0.000006649803,0.0016464669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902034,0.000354474,0.000021555314,0.00013061041,0.00020932902,0.0002636064],"domain_scores_gemma":[0.99823254,0.00105726,0.00021671594,0.00009126967,0.00029262443,0.000109608234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011477163,0.0007376,0.00071726623,0.00081729237,0.0005602308,0.0010330314,0.0010455218,0.00091908115,0.0006945666],"category_scores_gemma":[0.0034688357,0.00039119803,0.0004145781,0.00085513113,0.0012181585,0.0010682885,0.0011994615,0.00047565094,0.00018959606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015648233,0.000037019418,0.0014482945,0.000057976984,0.000047567017,0.0003542065,0.00012582765,0.95963126,0.0032782077,0.026012518,0.0005052608,0.00834543],"study_design_scores_gemma":[0.000012183873,0.00007134269,0.0002620968,0.000007326799,0.000014875653,0.00007439855,0.00004718743,0.99224347,0.0005386169,0.0062425914,0.0004741915,0.000011677637],"about_ca_topic_score_codex":0.0037102483,"about_ca_topic_score_gemma":0.0020114025,"teacher_disagreement_score":0.0037102483,"about_ca_system_score_codex":0.0012198804,"about_ca_system_score_gemma":0.0006050887,"threshold_uncertainty_score":0.008850932},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22510622,0.0021171023,0.75603646,0.0018352991,0.0001747959,0.00007667969,0.00024444843,0.0006696903,0.013739364],"genre_scores_gemma":[0.94835997,0.0012441785,0.047303844,0.00033281243,0.00006493809,0.00011150478,0.00015264549,0.00015561044,0.0022745589],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935645,0.00020403478,0.00001303975,0.00009307166,0.00015533816,0.00017817218],"domain_scores_gemma":[0.9879969,0.009475799,0.0006942782,0.0006457421,0.00086208753,0.00032513487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016171788,0.00052404386,0.00062196044,0.00058672036,0.000550545,0.0014157541,0.001289693,0.0010768637,0.0028507677],"category_scores_gemma":[0.024296714,0.00039362602,0.00023863954,0.0006219267,0.0014520931,0.005041315,0.0010188945,0.0017589738,0.000515127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030720688,0.000080726815,0.0015776826,0.00025214793,0.000041573236,0.000101790974,0.00039066008,0.5667489,0.008228486,0.3545905,0.005181213,0.062499043],"study_design_scores_gemma":[0.000020338459,0.00009919374,0.00028622558,0.000050020222,0.000009918036,0.00010813872,0.00017320462,0.80976504,0.005812256,0.18037997,0.003269923,0.000025759158],"about_ca_topic_score_codex":0.0028019901,"about_ca_topic_score_gemma":0.0016996986,"teacher_disagreement_score":0.0028507677,"about_ca_system_score_codex":0.001534053,"about_ca_system_score_gemma":0.00088294456,"threshold_uncertainty_score":0.011130452},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060724206,0.000117114956,0.9927105,0.00004875559,0.000024621171,0.000023706487,0.0000075684684,0.000071719,0.00092366344],"genre_scores_gemma":[0.6479627,0.00023129908,0.34929428,0.00013087106,0.00005252097,0.00013764085,0.000043863958,0.000022255263,0.0021245764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949586,0.00016032069,0.00002355001,0.00009835945,0.00017613677,0.00004579683],"domain_scores_gemma":[0.9996542,0.00016049326,0.000055790286,0.00006170276,0.000047396534,0.000020403668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063853414,0.0005449968,0.0005843081,0.0002745612,0.00036353758,0.00056376745,0.0010758144,0.0005714908,0.0009292942],"category_scores_gemma":[0.0014040064,0.00023221609,0.00029637443,0.00035178018,0.0005841049,0.0008260577,0.0007745558,0.0007794741,0.00021060796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025322026,0.00023700515,0.00039576067,0.00021307146,0.000069966976,0.00017348766,0.00025992913,0.600292,0.023133453,0.07764356,0.0020371848,0.2952913],"study_design_scores_gemma":[0.000034446417,0.00007471257,0.00006268611,0.000004435631,0.000009265328,0.00004344944,0.000007288159,0.99020106,0.0023057323,0.006198363,0.0010506175,0.000007973696],"about_ca_topic_score_codex":0.00067214103,"about_ca_topic_score_gemma":0.00082232995,"teacher_disagreement_score":0.0010758144,"about_ca_system_score_codex":0.00041231027,"about_ca_system_score_gemma":0.00046877583,"threshold_uncertainty_score":0.0033769011},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033544213,0.0011540725,0.95814955,0.00027646817,0.000038274124,0.00005247532,0.000020543752,0.000092376074,0.0066719246],"genre_scores_gemma":[0.87922347,0.0010229897,0.11751471,0.00011801042,0.000079806225,0.00014524668,0.000029245972,0.000015707212,0.0018507547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992084,0.00039613483,0.000032112282,0.000055050954,0.0002689508,0.000039280156],"domain_scores_gemma":[0.99937016,0.0003280394,0.000089402354,0.000084105726,0.00011146183,0.000016815611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008658676,0.0005158544,0.0004483637,0.0003783792,0.00042021877,0.0005604455,0.0004149325,0.0006791636,0.00093879516],"category_scores_gemma":[0.0016472819,0.00021147786,0.00030448378,0.0010231769,0.0009878549,0.0006919493,0.0006724899,0.000491488,0.00025808933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025700152,0.00011016007,0.0013674354,0.00036057577,0.000082845116,0.0005416,0.00063085946,0.45738602,0.107896514,0.29980034,0.0022251874,0.12934145],"study_design_scores_gemma":[0.000022247272,0.00014132592,0.00027359513,0.000022221657,0.000019171124,0.00024135452,0.000027444192,0.9659805,0.0061114253,0.024689225,0.0024466123,0.000024886956],"about_ca_topic_score_codex":0.0005115104,"about_ca_topic_score_gemma":0.00079203065,"teacher_disagreement_score":0.00093879516,"about_ca_system_score_codex":0.0007851136,"about_ca_system_score_gemma":0.0004462656,"threshold_uncertainty_score":0.005696416},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19972314,0.0020968672,0.7357125,0.0034275267,0.0005331969,0.0004545542,0.0006784118,0.0012529166,0.056120913],"genre_scores_gemma":[0.8168035,0.0012070242,0.13074687,0.0007917439,0.000688113,0.00040076303,0.0006229722,0.00042895376,0.048310053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968233,0.0012128826,0.00016619939,0.0006192739,0.0006876689,0.0004905894],"domain_scores_gemma":[0.9848935,0.006621234,0.0008456069,0.004372868,0.002650701,0.00061608397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027177641,0.0008721012,0.002076814,0.0016940458,0.0029992117,0.0038088246,0.0016851511,0.0023336867,0.00618309],"category_scores_gemma":[0.015212497,0.0007568521,0.0010863194,0.0025223873,0.001432199,0.004176221,0.0065053357,0.002910336,0.0024024302],"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.0034613474,0.00029554663,0.0076706246,0.0011241214,0.00041817987,0.0027409075,0.0049414313,0.037051935,0.07092062,0.69188184,0.016076097,0.16341731],"study_design_scores_gemma":[0.0008380309,0.00080653536,0.002597259,0.00028583893,0.0006596745,0.0054490976,0.0019097293,0.33606374,0.06631756,0.51385486,0.07096283,0.00025473788],"about_ca_topic_score_codex":0.00072274095,"about_ca_topic_score_gemma":0.0008369077,"teacher_disagreement_score":0.00618309,"about_ca_system_score_codex":0.0013152168,"about_ca_system_score_gemma":0.0013472448,"threshold_uncertainty_score":0.02068448},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01776784,0.00068501674,0.9791124,0.00016416571,0.00006423845,0.00009056361,0.000026847356,0.00036252366,0.0017264213],"genre_scores_gemma":[0.27001542,0.0008148762,0.7262561,0.00021637998,0.000041558942,0.00029610365,0.00018129815,0.000054531694,0.0021237105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959534,0.00016864976,0.000019242534,0.00004396761,0.00013149146,0.000041394647],"domain_scores_gemma":[0.9994783,0.0002725744,0.00007013019,0.00005601027,0.00010032129,0.000022703607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066876254,0.00057678076,0.00044354115,0.00063190074,0.0005355076,0.00035335033,0.0010767042,0.0006226746,0.00061943324],"category_scores_gemma":[0.0015402884,0.00017033516,0.00029049272,0.00080350845,0.00043668164,0.00069251563,0.00064511446,0.00040474028,0.00023048167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020718225,0.000107039,0.0020315116,0.00022219293,0.000117433054,0.00028480348,0.00034838423,0.57969993,0.016200747,0.047249287,0.007102902,0.34642863],"study_design_scores_gemma":[0.00006518519,0.00021491377,0.00044980782,0.00002193695,0.000038013157,0.00036409358,0.00007321646,0.97139007,0.0035219984,0.015895024,0.007936628,0.000029098206],"about_ca_topic_score_codex":0.0018738189,"about_ca_topic_score_gemma":0.0027297244,"teacher_disagreement_score":0.0018738189,"about_ca_system_score_codex":0.0004266983,"about_ca_system_score_gemma":0.0008469752,"threshold_uncertainty_score":0.0037257671},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17235811,0.0013658291,0.823578,0.0001593502,0.000042266023,0.000030271049,0.000023907396,0.00027765124,0.0021645837],"genre_scores_gemma":[0.90506357,0.00060674746,0.09290565,0.000048252463,0.000029528112,0.00003183501,0.000025433712,0.000011323357,0.0012776622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943525,0.000114129914,0.000022091466,0.00007254539,0.00029688404,0.00005911605],"domain_scores_gemma":[0.99935704,0.0003224087,0.00010667825,0.00005732254,0.00013284908,0.000023817167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061617355,0.0004951235,0.0004795696,0.00037282534,0.00041682157,0.0004331595,0.0005175772,0.00055253366,0.0002761063],"category_scores_gemma":[0.0016302537,0.00026077428,0.00026824206,0.00046778063,0.00047112248,0.00069656083,0.0005046004,0.0004383033,0.00011599895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004498786,0.00012728568,0.0033984198,0.00022500013,0.00008105359,0.00062720064,0.0005930251,0.5160736,0.16222486,0.016209258,0.0009578519,0.29903254],"study_design_scores_gemma":[0.000020335456,0.00018949425,0.0005370041,0.000014468321,0.00003211842,0.00032837858,0.000056944915,0.95540863,0.03977921,0.002384653,0.0012277478,0.00002100023],"about_ca_topic_score_codex":0.0022499925,"about_ca_topic_score_gemma":0.002291374,"teacher_disagreement_score":0.0022499925,"about_ca_system_score_codex":0.00041249522,"about_ca_system_score_gemma":0.0008296489,"threshold_uncertainty_score":0.004473865},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8981431,0.00044041086,0.09446772,0.00018746094,0.000036395246,0.000037478356,0.00010741186,0.00020691229,0.0063730464],"genre_scores_gemma":[0.99760747,0.00006719614,0.0019496611,0.000009256548,0.0000020321377,0.000009292458,0.000016959475,0.0000042452543,0.00033386974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952805,0.00011034292,0.000019751762,0.00005601872,0.00014902157,0.0001368104],"domain_scores_gemma":[0.9946109,0.003824831,0.00043042132,0.0002459118,0.00079665624,0.00009132284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012940019,0.00045265575,0.00028442708,0.00046632922,0.0005366857,0.00055583025,0.00043298115,0.0004007247,0.00072777225],"category_scores_gemma":[0.004613663,0.00016475614,0.00018168434,0.0004443249,0.00065230095,0.0005162706,0.00050474494,0.00032040366,0.0000835052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007545371,0.00009712413,0.0030896645,0.00009346379,0.000040797284,0.00022233378,0.00023594064,0.9382889,0.022062302,0.014288638,0.00049748213,0.020328807],"study_design_scores_gemma":[0.000012663941,0.00015065611,0.0004733977,0.000005227758,0.000018297027,0.0000665865,0.000046433564,0.9921306,0.0052606193,0.001664358,0.00015625842,0.000014930352],"about_ca_topic_score_codex":0.010777539,"about_ca_topic_score_gemma":0.008445191,"teacher_disagreement_score":0.010777539,"about_ca_system_score_codex":0.0014759641,"about_ca_system_score_gemma":0.0015694123,"threshold_uncertainty_score":0.021429598},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06834521,0.0016278857,0.9186743,0.00051447476,0.0000605697,0.00009077167,0.00017571142,0.00030414722,0.010207072],"genre_scores_gemma":[0.92046833,0.001243578,0.07498442,0.00009221674,0.000054465298,0.00020904264,0.00012438005,0.00008344837,0.002740234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829704,0.00092361576,0.000044611523,0.00017350967,0.00027143044,0.0002897422],"domain_scores_gemma":[0.9953819,0.003494665,0.0004155857,0.00019506291,0.00039772457,0.00011509667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002576391,0.0013238235,0.001199321,0.0013032884,0.0006117136,0.0012417353,0.0012772602,0.0015488134,0.0017370154],"category_scores_gemma":[0.011785921,0.0009947451,0.0006288628,0.0019222532,0.002114029,0.002648239,0.0011967106,0.0007325425,0.000477192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022627039,0.000008033032,0.00009784137,0.000024585226,0.000007563692,0.00004273603,0.000018261724,0.9893516,0.0004342556,0.008092802,0.00020797378,0.0016917826],"study_design_scores_gemma":[0.000011944517,0.000018766095,0.00006997049,0.000009256744,0.0000059465106,0.000024952982,0.000023947872,0.9909965,0.00042850623,0.008154357,0.00024913216,0.0000067283454],"about_ca_topic_score_codex":0.0063650263,"about_ca_topic_score_gemma":0.004241831,"teacher_disagreement_score":0.0063650263,"about_ca_system_score_codex":0.0023724153,"about_ca_system_score_gemma":0.0016247674,"threshold_uncertainty_score":0.017213166},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0086261155,0.012414833,0.9533901,0.0024897992,0.0005148112,0.000075955366,0.00003701649,0.00011147852,0.022339858],"genre_scores_gemma":[0.48184016,0.03705732,0.4693759,0.0013400968,0.0016079429,0.0005540894,0.00014657201,0.00009626922,0.007981475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828833,0.00081716996,0.00007468124,0.00012581596,0.0005713352,0.00012261626],"domain_scores_gemma":[0.996011,0.0026601877,0.00020045793,0.00042392613,0.0006535161,0.00005095049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026963197,0.000702556,0.0004980353,0.0009235959,0.0007592023,0.0014972799,0.0011482156,0.0014475135,0.0012671539],"category_scores_gemma":[0.0081264535,0.00046044195,0.0003957364,0.001558953,0.0024071136,0.0026532512,0.0012315572,0.0024871565,0.00034865647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007392727,0.000038536065,0.00038798567,0.00018848148,0.000021408456,0.00012322559,0.00020809844,0.055281583,0.0033775617,0.8135959,0.002382661,0.12432059],"study_design_scores_gemma":[0.00003383207,0.00018098722,0.00033261575,0.00033037624,0.000035074263,0.00039633352,0.000112696485,0.38608178,0.0058824895,0.5703844,0.0361522,0.00007723925],"about_ca_topic_score_codex":0.0024867756,"about_ca_topic_score_gemma":0.0017633011,"teacher_disagreement_score":0.0026963197,"about_ca_system_score_codex":0.0013323203,"about_ca_system_score_gemma":0.0012076665,"threshold_uncertainty_score":0.014259696},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9384146,0.0008169317,0.057824776,0.00013410731,0.000016781447,0.000013327455,0.000054684107,0.000095498115,0.0026292983],"genre_scores_gemma":[0.9962186,0.0001870348,0.0031796554,0.000009852353,0.000004681222,0.000004798467,0.000021907317,0.0000045047386,0.00036894763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936,0.00023144872,0.00003345464,0.00007937119,0.000195468,0.00010017014],"domain_scores_gemma":[0.9969975,0.0020832634,0.00030248394,0.000152096,0.00040509395,0.000059666654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013647375,0.00071622524,0.00047187912,0.00046999686,0.00039940726,0.000569651,0.00039986364,0.0006797062,0.00048842153],"category_scores_gemma":[0.0037152588,0.00016606807,0.00018432949,0.0004618435,0.00060893485,0.00065006857,0.0007615301,0.00033395115,0.000118545024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080572406,0.00009944768,0.009706485,0.00017610812,0.00010844183,0.0005872298,0.0003763035,0.86889684,0.07032389,0.0056562163,0.00024025509,0.043023087],"study_design_scores_gemma":[0.000015746824,0.0006708126,0.0033295203,0.000015049618,0.000044166725,0.00036700562,0.00008560686,0.96990037,0.023477178,0.0017989632,0.00026587117,0.000029728728],"about_ca_topic_score_codex":0.0019583195,"about_ca_topic_score_gemma":0.0019228185,"teacher_disagreement_score":0.0019583195,"about_ca_system_score_codex":0.0005631515,"about_ca_system_score_gemma":0.00036492076,"threshold_uncertainty_score":0.0072175264},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15973033,0.00074189604,0.83498514,0.00021565959,0.000025878373,0.00005034151,0.000025734642,0.00014213871,0.004082762],"genre_scores_gemma":[0.96747977,0.00024363198,0.03135676,0.000023763887,0.000010852232,0.000037160127,0.0000090447,0.000007816063,0.0008312201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959964,0.00021549259,0.0000145581635,0.000053965607,0.000060191844,0.000056268935],"domain_scores_gemma":[0.99895096,0.00078346767,0.0001042792,0.000047111553,0.00009206417,0.000022070086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073465233,0.00057110743,0.0005222492,0.00025540864,0.00037300092,0.00041379392,0.00057991926,0.00061220996,0.0006163089],"category_scores_gemma":[0.0020326462,0.00024879377,0.0002493523,0.0004188827,0.00062329357,0.00082780066,0.0004899302,0.00033638824,0.0000970234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011752215,0.00003377399,0.0005415142,0.000059602386,0.000018854416,0.00018069944,0.00013019748,0.96460676,0.006214115,0.007988397,0.00021998807,0.019888619],"study_design_scores_gemma":[0.0000059173835,0.0000336359,0.000078680474,0.0000024640897,0.0000066240846,0.000031646618,0.000014394424,0.9968262,0.0010335363,0.0018719092,0.00009146438,0.0000036037643],"about_ca_topic_score_codex":0.0018059063,"about_ca_topic_score_gemma":0.0014340278,"teacher_disagreement_score":0.0018059063,"about_ca_system_score_codex":0.00061214576,"about_ca_system_score_gemma":0.00037477043,"threshold_uncertainty_score":0.0044413805},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7864136,0.00031696452,0.20724384,0.00018975216,0.000016932323,0.000030943236,0.000054684067,0.00025753383,0.0054756925],"genre_scores_gemma":[0.9969067,0.000050285755,0.0028817137,0.000011641192,0.0000026123394,0.0000114607565,0.000009832463,0.000003926477,0.00012180701],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987134,0.00056632725,0.00006729206,0.0001532591,0.0002977481,0.00020204423],"domain_scores_gemma":[0.99148494,0.0057326644,0.00081510615,0.0007611502,0.0010870233,0.00011917667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021543445,0.00061322784,0.0007425199,0.00028913302,0.00038837068,0.0008641853,0.0006670366,0.0010137748,0.00046674308],"category_scores_gemma":[0.010367774,0.00017174127,0.00025167342,0.00037930824,0.0010502753,0.0012643207,0.0008302064,0.00046810557,0.00017185367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052677334,0.00008441493,0.0022802176,0.000111304515,0.000072695024,0.00054164045,0.00033660853,0.9265556,0.039490543,0.016761823,0.00027760884,0.012960817],"study_design_scores_gemma":[0.000035216104,0.0005027262,0.0010668276,0.000011155451,0.000049352384,0.0004297909,0.0001401391,0.9693085,0.021532731,0.0066609234,0.00023172604,0.000030960513],"about_ca_topic_score_codex":0.00080619886,"about_ca_topic_score_gemma":0.000572739,"teacher_disagreement_score":0.0021543445,"about_ca_system_score_codex":0.000542499,"about_ca_system_score_gemma":0.00050689414,"threshold_uncertainty_score":0.011393428},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054720555,0.00065633823,0.9413954,0.00020075725,0.0000879272,0.000072115974,0.000065148495,0.00011984813,0.0026818134],"genre_scores_gemma":[0.94710153,0.0002115381,0.05052967,0.00005354594,0.000083467334,0.000096187476,0.000030703162,0.000018352765,0.0018751419],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892455,0.00042700447,0.00004254933,0.00016495572,0.0002348517,0.00020606432],"domain_scores_gemma":[0.99628,0.0029175936,0.00016109184,0.00024181139,0.0003010166,0.00009845038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028762154,0.00062924204,0.0011932526,0.0007256109,0.0011880368,0.0012950974,0.0015133078,0.00080401695,0.0015257115],"category_scores_gemma":[0.0075534903,0.00043278225,0.00035778407,0.0009767383,0.0011779272,0.0012567719,0.0011930004,0.00057784683,0.00023496058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007971814,0.00019999106,0.0013339804,0.00010409185,0.000108071516,0.000260337,0.00044334363,0.7889735,0.010857711,0.09291007,0.0030809166,0.10093073],"study_design_scores_gemma":[0.000029723682,0.00004609871,0.00012749803,0.0000033490462,0.000015652842,0.00003934092,0.00002274562,0.9812144,0.0008092023,0.017350657,0.00033136387,0.00000999811],"about_ca_topic_score_codex":0.004848188,"about_ca_topic_score_gemma":0.009002893,"teacher_disagreement_score":0.004848188,"about_ca_system_score_codex":0.0013442156,"about_ca_system_score_gemma":0.0016243437,"threshold_uncertainty_score":0.015211105},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084648475,0.00068922556,0.89447427,0.0005261934,0.00018376447,0.0005523644,0.00019219216,0.0059000337,0.012833479],"genre_scores_gemma":[0.8710255,0.00036684723,0.12397728,0.00021868294,0.0001083686,0.00020392027,0.0003532696,0.00017209383,0.0035739907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992914,0.00016882969,0.000033360717,0.00012500018,0.00022437464,0.00015692209],"domain_scores_gemma":[0.9992611,0.00017070063,0.00009901163,0.00018366727,0.00015776661,0.00012782143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008899703,0.0005662234,0.00041019812,0.00055935123,0.000953629,0.001241361,0.0017632884,0.0006147171,0.00215042],"category_scores_gemma":[0.0013851877,0.00018283201,0.0003324423,0.0005654616,0.0005939326,0.0016634894,0.0016459839,0.0009466819,0.00033857007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013486379,0.0007291575,0.0029360114,0.0004572988,0.00019178988,0.0012490908,0.0006123706,0.18266527,0.13040337,0.10593397,0.03786461,0.5356085],"study_design_scores_gemma":[0.00015877649,0.0004075989,0.0010564525,0.000027169204,0.00004113738,0.0005187599,0.00016310916,0.92552245,0.03653553,0.010453291,0.025051273,0.00006441916],"about_ca_topic_score_codex":0.0055345553,"about_ca_topic_score_gemma":0.0063299807,"teacher_disagreement_score":0.0055345553,"about_ca_system_score_codex":0.0010475677,"about_ca_system_score_gemma":0.0016149813,"threshold_uncertainty_score":0.011004686},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072828503,0.00029064104,0.98424363,0.00035284023,0.00006924912,0.00003470289,0.000058833826,0.000079191996,0.007588075],"genre_scores_gemma":[0.32002974,0.0028661906,0.6593227,0.00066375366,0.00071737263,0.00024566616,0.00037711818,0.00015511786,0.015622284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989998,0.0002793149,0.00006024023,0.00015710475,0.00043964156,0.00006387868],"domain_scores_gemma":[0.99843425,0.0009524267,0.00013091366,0.00016467752,0.00027872002,0.00003899237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007392291,0.0007384528,0.00045859956,0.0011805518,0.00067336764,0.0013162587,0.0007888855,0.00092490227,0.003214646],"category_scores_gemma":[0.0055699195,0.00030266275,0.0006547066,0.0011861252,0.001899787,0.0028540632,0.0017056575,0.002146326,0.0011304073],"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.000044053046,0.000026749098,0.00022846539,0.000121653844,0.000014206421,0.0001069461,0.00021995037,0.052073944,0.0045748916,0.9014531,0.0011249314,0.04001108],"study_design_scores_gemma":[0.000034727032,0.00008560706,0.00010033001,0.00005259331,0.000016496402,0.00026449174,0.00009015275,0.29925644,0.005211281,0.68253607,0.012318638,0.00003308192],"about_ca_topic_score_codex":0.00095521397,"about_ca_topic_score_gemma":0.0008706752,"teacher_disagreement_score":0.003214646,"about_ca_system_score_codex":0.00085682847,"about_ca_system_score_gemma":0.0010520918,"threshold_uncertainty_score":0.010754108},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044376694,0.00867898,0.9299509,0.0032894572,0.0007216103,0.00006894087,0.00006991476,0.0007302424,0.012113245],"genre_scores_gemma":[0.89994407,0.007512417,0.08459731,0.00041759957,0.00076865475,0.00017864404,0.00010508093,0.00009661556,0.0063796416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999074,0.00034577234,0.000030189403,0.00009856221,0.0004009683,0.000050559473],"domain_scores_gemma":[0.9952467,0.0036363853,0.0003123115,0.0003359553,0.00037097777,0.000097680306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011772723,0.00035859132,0.000391481,0.00036549836,0.0005001241,0.0012001998,0.00063086575,0.00084178,0.0013194035],"category_scores_gemma":[0.006768337,0.00023551902,0.00013364718,0.000889228,0.0010555001,0.0020004963,0.0006689946,0.0010092028,0.00035238857],"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.000120901735,0.00008568427,0.0018133435,0.0004354453,0.00005966958,0.0009209265,0.00037876004,0.5057914,0.016074605,0.3093623,0.010200597,0.1547564],"study_design_scores_gemma":[0.00002496515,0.000043627315,0.0004978858,0.000022008944,0.0000128673655,0.00024291722,0.00007625644,0.87541753,0.0017201657,0.10846914,0.013450963,0.000021718786],"about_ca_topic_score_codex":0.0010275092,"about_ca_topic_score_gemma":0.0007569596,"teacher_disagreement_score":0.0013194035,"about_ca_system_score_codex":0.00052291,"about_ca_system_score_gemma":0.00041333798,"threshold_uncertainty_score":0.006226063},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01320725,0.001811022,0.9768587,0.00025938128,0.000053388856,0.000032368487,0.00003163686,0.000062974555,0.007683247],"genre_scores_gemma":[0.7683754,0.005188359,0.21600111,0.00020081433,0.00027373445,0.00024750832,0.00009393757,0.000055888224,0.009563214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993711,0.00029678742,0.000022259968,0.00008389872,0.00016789578,0.00005814449],"domain_scores_gemma":[0.99889576,0.00080220506,0.00008042634,0.00007241357,0.00012144095,0.000027808199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010641295,0.0006903139,0.0007089299,0.0005988103,0.0005270653,0.0010723016,0.0011913797,0.0008569934,0.0018482062],"category_scores_gemma":[0.0022950452,0.00040063763,0.00039590246,0.00078958296,0.0010058255,0.0015496003,0.0012316885,0.0012033078,0.00037110533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013560815,0.000063821746,0.00026976643,0.000369398,0.00006508332,0.00027590484,0.00038050205,0.6031745,0.004721018,0.34729406,0.0019461111,0.041304212],"study_design_scores_gemma":[0.000025897229,0.000059583654,0.000057724632,0.000020950265,0.00002150667,0.00013077057,0.00006736193,0.88510823,0.0011610546,0.10937102,0.003961524,0.000014443426],"about_ca_topic_score_codex":0.00077484146,"about_ca_topic_score_gemma":0.00075096387,"teacher_disagreement_score":0.0018482062,"about_ca_system_score_codex":0.0011068054,"about_ca_system_score_gemma":0.00048396003,"threshold_uncertainty_score":0.008030415},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36615023,0.0034549986,0.59991264,0.0010549558,0.00011556097,0.00006299207,0.00018130534,0.00029842433,0.028768916],"genre_scores_gemma":[0.9936039,0.00062510464,0.004519069,0.000049163686,0.00003709177,0.00002014872,0.000025786905,0.000017055503,0.001102715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851173,0.0005775727,0.000044590786,0.00013643922,0.00046804224,0.00026152207],"domain_scores_gemma":[0.99474096,0.0037803517,0.00047035975,0.00025662177,0.00065240584,0.00009922016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002565983,0.0010529917,0.0006738957,0.00074432965,0.00044948768,0.0013850775,0.00074491935,0.00075739936,0.000969158],"category_scores_gemma":[0.009669413,0.0003280287,0.00033361765,0.0007466182,0.001228367,0.0013088844,0.0011631974,0.000584074,0.000212932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012439588,0.00003946074,0.0009065746,0.00008894872,0.000036995807,0.00021700181,0.00014134009,0.93792194,0.003813687,0.045391455,0.00049561344,0.010822602],"study_design_scores_gemma":[0.0000045156444,0.000036688005,0.00026488697,0.000006587779,0.0000080788,0.000051842795,0.000028024011,0.9903384,0.00046625224,0.008650133,0.00013726974,0.0000072922358],"about_ca_topic_score_codex":0.004486474,"about_ca_topic_score_gemma":0.002873222,"teacher_disagreement_score":0.004486474,"about_ca_system_score_codex":0.0015602161,"about_ca_system_score_gemma":0.0012608117,"threshold_uncertainty_score":0.013570368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020678796,0.00051636825,0.97670835,0.00019695323,0.000022270217,0.000032494354,0.000033547458,0.00012378792,0.0016873823],"genre_scores_gemma":[0.8565085,0.00052825175,0.141104,0.00011700764,0.000038506427,0.000057644138,0.000052242984,0.000027090176,0.0015668091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979079,0.00082955766,0.00011226949,0.00029111243,0.0006411162,0.00021815272],"domain_scores_gemma":[0.99532735,0.003398109,0.00042631166,0.0002679678,0.00051527814,0.00006497058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024143127,0.000822892,0.0011019575,0.0007401761,0.00038477726,0.001716917,0.0012776284,0.0015719583,0.000636928],"category_scores_gemma":[0.009329107,0.00042278145,0.0004752915,0.0010842165,0.0016393602,0.0023021817,0.0013543332,0.0008198277,0.0002756807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024167661,0.00006694631,0.00075887865,0.00028129114,0.000074629825,0.00047517565,0.00041888122,0.8178292,0.014651888,0.10630362,0.00069261785,0.058205254],"study_design_scores_gemma":[0.000015268017,0.000044598564,0.00005938374,0.000012452791,0.00000943756,0.00011438648,0.000020227455,0.9826262,0.003430299,0.0133246705,0.00032656573,0.000016428567],"about_ca_topic_score_codex":0.0013065385,"about_ca_topic_score_gemma":0.0011332715,"teacher_disagreement_score":0.0024143127,"about_ca_system_score_codex":0.0013059264,"about_ca_system_score_gemma":0.0011890574,"threshold_uncertainty_score":0.012768269},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005538249,0.00012763124,0.99235666,0.00013472758,0.000009311766,0.000018668457,0.000013136931,0.000032044703,0.0017696159],"genre_scores_gemma":[0.7366108,0.0010494504,0.25435635,0.00018111971,0.00013515718,0.00029637376,0.00006044096,0.000043044864,0.0072673517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986558,0.00076724036,0.000036750047,0.00020549615,0.00024868714,0.00008595716],"domain_scores_gemma":[0.99866736,0.0008743292,0.0001672126,0.00011855417,0.00013020504,0.000042288888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018976451,0.00093943,0.0007976871,0.00038312923,0.00038694052,0.000807059,0.0011756277,0.0012183238,0.0017453565],"category_scores_gemma":[0.004139504,0.00042574372,0.00054468965,0.0006910971,0.0010523705,0.001148278,0.0012729719,0.0007248047,0.00052987353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010165552,0.000038864757,0.00032221843,0.00011895168,0.000070615395,0.00025978658,0.00025050738,0.8894248,0.0051642545,0.06948598,0.0007393629,0.03402305],"study_design_scores_gemma":[0.00002666171,0.000117651216,0.00007540594,0.000009663047,0.000026897354,0.00009195364,0.00003776301,0.9742187,0.001446247,0.022788262,0.0011464724,0.00001424379],"about_ca_topic_score_codex":0.00073412317,"about_ca_topic_score_gemma":0.00071130425,"teacher_disagreement_score":0.0018976451,"about_ca_system_score_codex":0.000568445,"about_ca_system_score_gemma":0.00069731165,"threshold_uncertainty_score":0.010035813},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04119487,0.0010549559,0.95043063,0.00025107773,0.00007607135,0.00010176414,0.00005878602,0.00021154684,0.0066202586],"genre_scores_gemma":[0.87653315,0.0008280866,0.11941276,0.00013439434,0.000040192957,0.0002094284,0.00007026744,0.000023218725,0.002748426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952686,0.00015154535,0.00003964378,0.000081791506,0.00015328261,0.000046860278],"domain_scores_gemma":[0.9992249,0.00038556388,0.000090807946,0.00014210041,0.00013472929,0.000021915876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006208793,0.00041584767,0.0004724163,0.00047749345,0.00030429487,0.00058923464,0.00085917977,0.00055134395,0.0008073436],"category_scores_gemma":[0.001709508,0.00015741074,0.00028991833,0.0006281784,0.00041662992,0.0008591232,0.00088755495,0.00049992587,0.00019204448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002545778,0.00017232989,0.0008519602,0.00061221677,0.00013509607,0.0011679739,0.0006382981,0.28895885,0.1870008,0.37405157,0.003697321,0.14245892],"study_design_scores_gemma":[0.000062060615,0.00021550349,0.00035145556,0.000041570907,0.00006017336,0.001123734,0.000047485973,0.89938444,0.040618192,0.041137516,0.016915865,0.000042047697],"about_ca_topic_score_codex":0.00029110184,"about_ca_topic_score_gemma":0.00040817267,"teacher_disagreement_score":0.00085917977,"about_ca_system_score_codex":0.00043727856,"about_ca_system_score_gemma":0.00049864897,"threshold_uncertainty_score":0.0032836199},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19134593,0.00037471842,0.79891735,0.00029133476,0.00004969605,0.00011109165,0.00025959723,0.00033065508,0.008319622],"genre_scores_gemma":[0.8918551,0.00020133598,0.10493971,0.000055808407,0.000015041213,0.000087539425,0.00017488403,0.000033536802,0.0026371179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999114,0.00032329265,0.000058731843,0.000105796695,0.00024162084,0.00015656628],"domain_scores_gemma":[0.99813,0.00097102404,0.0001597016,0.00029626285,0.00038141725,0.00006151047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012917639,0.00077024545,0.00082439376,0.0005537141,0.00068847847,0.0009376697,0.0007277473,0.00092854886,0.0009433558],"category_scores_gemma":[0.0030694983,0.00032486545,0.0005400921,0.0008122892,0.0010202326,0.0007426052,0.0013085601,0.0005291432,0.00028767544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000799436,0.00010784978,0.0033273003,0.00037911744,0.00020205448,0.00066917285,0.0009885632,0.76573294,0.044629697,0.12378289,0.0015396695,0.057841405],"study_design_scores_gemma":[0.000027488912,0.00006695632,0.00039155356,0.000022755337,0.000039446448,0.00015877298,0.000040064162,0.9746523,0.009624009,0.014479722,0.00046973414,0.000027329983],"about_ca_topic_score_codex":0.0031221982,"about_ca_topic_score_gemma":0.0059699104,"teacher_disagreement_score":0.0031221982,"about_ca_system_score_codex":0.00073284586,"about_ca_system_score_gemma":0.0027338124,"threshold_uncertainty_score":0.0068315864},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20547068,0.00073278806,0.7834247,0.0004198341,0.000068201036,0.00016876681,0.00009598644,0.00078594236,0.0088332165],"genre_scores_gemma":[0.96450603,0.00018334498,0.033515207,0.00006446469,0.000017117532,0.000107409556,0.000039980227,0.00000744583,0.0015589445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901855,0.00044800187,0.000043426076,0.00016076532,0.00021765906,0.00011154978],"domain_scores_gemma":[0.9988686,0.00045710162,0.00017512457,0.00019638363,0.00026791793,0.000034927845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085726083,0.00061031774,0.0005954493,0.00049776287,0.00061874493,0.00057577284,0.00077460264,0.0008461016,0.0006059342],"category_scores_gemma":[0.0016185072,0.00030897695,0.00038580253,0.0006049417,0.0006837998,0.00084137544,0.00086217676,0.00037571284,0.00030015357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008727503,0.00022684512,0.003830548,0.0005251503,0.00037132198,0.0032598914,0.0017499743,0.6480695,0.12584466,0.075316295,0.004852693,0.13508038],"study_design_scores_gemma":[0.00014275523,0.00051381835,0.00051614206,0.000027438346,0.000112918235,0.0013028845,0.00010586241,0.9639326,0.016420124,0.012774969,0.0040694457,0.00008099216],"about_ca_topic_score_codex":0.001656545,"about_ca_topic_score_gemma":0.0012474254,"teacher_disagreement_score":0.001656545,"about_ca_system_score_codex":0.00039304805,"about_ca_system_score_gemma":0.00073873193,"threshold_uncertainty_score":0.004533708},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1735577,0.00048524037,0.80926025,0.00016278584,0.00005615329,0.000098533965,0.00007788577,0.00014721644,0.016154313],"genre_scores_gemma":[0.66611004,0.00080371526,0.32647416,0.000082195416,0.00008422234,0.0001646526,0.00022870347,0.00006825712,0.0059840907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996445,0.00015403618,0.000015730415,0.0000313116,0.000117796095,0.000036659694],"domain_scores_gemma":[0.99908197,0.00046647867,0.0001357184,0.00016790743,0.000100255405,0.00004758266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003547374,0.00033656834,0.00031094262,0.0005104939,0.00037239143,0.00036443127,0.0003126379,0.00031267366,0.0020516454],"category_scores_gemma":[0.0015963415,0.00021228778,0.00039219632,0.0005180336,0.0009445182,0.0007781231,0.0008593807,0.0005572984,0.00046274293],"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.00016649677,0.000058812486,0.0007709276,0.00021888677,0.00004380404,0.0002999783,0.0005675074,0.1577302,0.035227735,0.6699722,0.0016201824,0.13332328],"study_design_scores_gemma":[0.00007504881,0.0005062098,0.00069760985,0.00006216587,0.000030208535,0.0008044712,0.00017225303,0.5131653,0.02786509,0.43928692,0.017270086,0.00006467261],"about_ca_topic_score_codex":0.0002204619,"about_ca_topic_score_gemma":0.00022946928,"teacher_disagreement_score":0.0020516454,"about_ca_system_score_codex":0.00024352779,"about_ca_system_score_gemma":0.00023933062,"threshold_uncertainty_score":0.006863475},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03843681,0.00032070852,0.9586984,0.00006394394,0.000018014864,0.000030483772,0.000010656621,0.000067675785,0.0023533164],"genre_scores_gemma":[0.92258686,0.00021055053,0.075725734,0.000026149952,0.000023616312,0.000039409108,0.000013114744,0.000026426376,0.0013481539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993406,0.00027009557,0.0000346352,0.00011195049,0.00017011417,0.000072519004],"domain_scores_gemma":[0.999199,0.0004622741,0.00014988812,0.00008278965,0.00008508207,0.000021078356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068678835,0.000790642,0.00063264224,0.00026363894,0.0002888093,0.00067247014,0.000814912,0.0005547675,0.00083530473],"category_scores_gemma":[0.0016966972,0.0002663552,0.00025290452,0.00032480413,0.00046138107,0.00089314947,0.00066258974,0.0004939196,0.0002625215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016794812,0.00005974992,0.0006651973,0.00013462978,0.00004470067,0.00016795324,0.00015107758,0.84472996,0.03520619,0.019259172,0.0003954882,0.09901787],"study_design_scores_gemma":[0.000017495293,0.000112393165,0.00029901337,0.000011907713,0.000014052664,0.00009733573,0.00003004808,0.9827483,0.008092058,0.0076731713,0.000891952,0.00001239039],"about_ca_topic_score_codex":0.00032442692,"about_ca_topic_score_gemma":0.0004920177,"teacher_disagreement_score":0.00083530473,"about_ca_system_score_codex":0.00042699417,"about_ca_system_score_gemma":0.00028035662,"threshold_uncertainty_score":0.0036321878},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37057093,0.00093454117,0.6221467,0.000119852724,0.00003043036,0.000030797433,0.00004785364,0.00052895723,0.0055899266],"genre_scores_gemma":[0.9673231,0.00019919287,0.031807065,0.00001869773,0.000010996694,0.000010221677,0.00002312396,0.000012254018,0.0005953218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996575,0.00011581859,0.000015452983,0.00003826503,0.00012440355,0.00004845279],"domain_scores_gemma":[0.99843615,0.0008957992,0.0002039196,0.0002412829,0.00018983193,0.000033031036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065899314,0.00047254644,0.00039052084,0.00031713065,0.00021071242,0.0004180438,0.00036002725,0.0003789499,0.0005479319],"category_scores_gemma":[0.0020565279,0.00014037419,0.00019654307,0.000320653,0.00048300947,0.00068993826,0.00055347953,0.00034549984,0.00015821459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049641344,0.00016111275,0.0031734926,0.00024306381,0.00009395589,0.0004026588,0.0004006352,0.5267806,0.28138745,0.03648465,0.0008226771,0.1495532],"study_design_scores_gemma":[0.000018871882,0.0004200727,0.0011781798,0.000020084666,0.000031453845,0.00039890828,0.000031185446,0.8662766,0.12489514,0.0050139204,0.0016740352,0.000041476655],"about_ca_topic_score_codex":0.00032744318,"about_ca_topic_score_gemma":0.000646381,"teacher_disagreement_score":0.00065899314,"about_ca_system_score_codex":0.00024538423,"about_ca_system_score_gemma":0.0002509187,"threshold_uncertainty_score":0.0034850836},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003472323,0.00012603158,0.99480283,0.000072499635,0.000021071855,0.000037499103,0.00004187746,0.00015802536,0.0012678872],"genre_scores_gemma":[0.45495236,0.0006564153,0.5398864,0.00019518593,0.000076861485,0.00028132694,0.00021977388,0.00006825583,0.0036633455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868864,0.0004821659,0.00005911596,0.00027748596,0.00036362276,0.00012896459],"domain_scores_gemma":[0.9989778,0.00047008423,0.00015001235,0.00013228359,0.0002397433,0.000030150735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011647663,0.0012584889,0.00088779733,0.00040012982,0.00053551554,0.0015073365,0.0010860767,0.0010006131,0.00280057],"category_scores_gemma":[0.0021387863,0.00051303214,0.0005343568,0.00094963005,0.0009630361,0.0012593229,0.0010254654,0.0012703314,0.0010960496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001701087,0.00016865217,0.0004894834,0.00032338488,0.000079801066,0.00033516122,0.00023927483,0.73695064,0.031499993,0.08708627,0.00452783,0.13812943],"study_design_scores_gemma":[0.000030292693,0.00010873575,0.00007727406,0.000013657476,0.000016972594,0.00016873381,0.000028076582,0.9875723,0.0043056076,0.0061759385,0.0014797245,0.000022674616],"about_ca_topic_score_codex":0.0017539582,"about_ca_topic_score_gemma":0.0032294593,"teacher_disagreement_score":0.00280057,"about_ca_system_score_codex":0.0008247253,"about_ca_system_score_gemma":0.0019942399,"threshold_uncertainty_score":0.0093688965},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028044265,0.00008921288,0.9959501,0.000050337592,0.000008859897,0.000019595263,0.000011740726,0.000053093623,0.0010125411],"genre_scores_gemma":[0.4507725,0.0007251694,0.5442637,0.00011759491,0.000062482184,0.0003054424,0.000079825375,0.000049998856,0.0036232977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994299,0.00025430875,0.000018449791,0.00010725895,0.00015131058,0.00003877034],"domain_scores_gemma":[0.9995957,0.00018608058,0.000048378923,0.000034716435,0.00011911383,0.000016020318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006675103,0.0008130338,0.00070523756,0.0002613951,0.00024121576,0.0004911349,0.0008467327,0.000982641,0.0018402289],"category_scores_gemma":[0.0014249823,0.00033468165,0.0005251359,0.00047382695,0.00041024582,0.0009832714,0.0005543164,0.00062460126,0.0007663749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052274736,0.000036514673,0.00024667807,0.00019999109,0.00003935194,0.00020590762,0.00009710974,0.89095676,0.025871567,0.023167262,0.0013467042,0.05777994],"study_design_scores_gemma":[0.000005912722,0.000053414922,0.00003650068,0.000004197528,0.000006546284,0.000077079036,0.000015338932,0.9930161,0.0022893897,0.0036241787,0.00086362264,0.000007646013],"about_ca_topic_score_codex":0.0007118783,"about_ca_topic_score_gemma":0.0009100826,"teacher_disagreement_score":0.0018402289,"about_ca_system_score_codex":0.0003747681,"about_ca_system_score_gemma":0.00055079086,"threshold_uncertainty_score":0.006156206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11031233,0.0015178311,0.8757529,0.00056609506,0.00024319714,0.0008725532,0.00016828223,0.0047769994,0.0057897307],"genre_scores_gemma":[0.88506025,0.00059971464,0.10974234,0.00022316563,0.0001534487,0.0003536427,0.00020006497,0.00016102202,0.003506456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993825,0.00015640775,0.000045331755,0.00009133282,0.00023464767,0.00008959942],"domain_scores_gemma":[0.99873084,0.0006029939,0.00010225659,0.00014746605,0.00029529558,0.0001212056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016028702,0.00068441784,0.000547129,0.00052043964,0.0007193242,0.0009214635,0.001055995,0.0006265888,0.0018472624],"category_scores_gemma":[0.0040877224,0.00026803015,0.00023874556,0.0004126834,0.000572498,0.0013675498,0.0013192917,0.0008181733,0.0002270767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026070166,0.00083569804,0.005271801,0.00062509044,0.00014725198,0.0010907304,0.0012060673,0.096583344,0.22759172,0.026445083,0.012241705,0.62535447],"study_design_scores_gemma":[0.00022792505,0.0010038319,0.0029546032,0.00009033108,0.00009358424,0.0006937768,0.00020815329,0.88071287,0.078438304,0.0156029975,0.019854475,0.00011907499],"about_ca_topic_score_codex":0.002549867,"about_ca_topic_score_gemma":0.0025821282,"teacher_disagreement_score":0.002549867,"about_ca_system_score_codex":0.0007121018,"about_ca_system_score_gemma":0.0009128537,"threshold_uncertainty_score":0.008476913},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007862653,0.00010243157,0.99159074,0.000051133524,0.000009069183,0.000013483063,0.0000103696975,0.00015375612,0.00020629934],"genre_scores_gemma":[0.30818993,0.00022533655,0.6901237,0.000049402486,0.000030393467,0.00009466303,0.00004703237,0.00003407476,0.0012054974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993749,0.0002707976,0.000037342015,0.000085795975,0.00019487437,0.00003636355],"domain_scores_gemma":[0.9976526,0.0014909003,0.00029466496,0.0002783361,0.00023058572,0.000052934865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014375568,0.00065604766,0.0007752828,0.0004473685,0.00033907607,0.00070327945,0.0006745193,0.0008851515,0.0010497826],"category_scores_gemma":[0.00523029,0.0003665908,0.00035397004,0.00035109837,0.00075644726,0.0014403393,0.001229961,0.00078130467,0.00044470796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005011451,0.00014804471,0.00083632744,0.00021512684,0.00007622178,0.00012681642,0.00026518223,0.5759057,0.03281057,0.029008018,0.001480411,0.35862634],"study_design_scores_gemma":[0.000033274053,0.00006786591,0.0001396231,0.0000061818523,0.000007631997,0.000080699676,0.000013155254,0.9845473,0.009137445,0.005361547,0.00058545324,0.000019780759],"about_ca_topic_score_codex":0.0005840729,"about_ca_topic_score_gemma":0.00077524583,"teacher_disagreement_score":0.0014375568,"about_ca_system_score_codex":0.00040392892,"about_ca_system_score_gemma":0.00078019866,"threshold_uncertainty_score":0.007602632},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19719464,0.0009616983,0.77844405,0.0003533404,0.00017675775,0.00037350983,0.00041658303,0.013637526,0.008441854],"genre_scores_gemma":[0.8331425,0.00018784178,0.16283244,0.00009251078,0.000025434063,0.00012517831,0.00030118268,0.00021642569,0.0030765226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994741,0.000067223846,0.000030790292,0.00006243845,0.0003013226,0.00006417432],"domain_scores_gemma":[0.9982132,0.0005675652,0.00014339598,0.00044479722,0.0005382583,0.00009288215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006809907,0.0003723836,0.00035893367,0.0006858445,0.0005775512,0.0006038673,0.0018341823,0.00034386764,0.0013533604],"category_scores_gemma":[0.0028643857,0.00018371711,0.00012405834,0.0007225158,0.00053690624,0.0012701192,0.00083199143,0.00051993784,0.00021028974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011834652,0.00038397513,0.005609795,0.00028029416,0.000062978674,0.00031794928,0.00044877912,0.38893786,0.05786625,0.02317203,0.013911013,0.5078256],"study_design_scores_gemma":[0.00003292494,0.00006077508,0.0003230446,0.0000070936644,0.000008032604,0.00007279349,0.00002113556,0.9749732,0.019163763,0.0016979419,0.0036274353,0.000011803999],"about_ca_topic_score_codex":0.010336598,"about_ca_topic_score_gemma":0.011368175,"teacher_disagreement_score":0.010336598,"about_ca_system_score_codex":0.0014564603,"about_ca_system_score_gemma":0.0015437985,"threshold_uncertainty_score":0.020552874},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4091054,0.0035642835,0.5565032,0.000606508,0.000057262794,0.000072614916,0.00028419966,0.00061661546,0.029189922],"genre_scores_gemma":[0.98826176,0.00069232454,0.009809164,0.00003199112,0.00003398653,0.000025835892,0.000061258244,0.000022582766,0.001061089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978218,0.00081339316,0.00007755051,0.0002044599,0.0007211265,0.00036166978],"domain_scores_gemma":[0.9929196,0.0051858597,0.00061356934,0.00028487976,0.0008945475,0.00010143171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021182771,0.001503157,0.0015107285,0.00093221886,0.00057585933,0.0013420576,0.00078119076,0.0013790178,0.0010430868],"category_scores_gemma":[0.0085644545,0.00052519573,0.0006153578,0.0012252668,0.0015388832,0.0011526726,0.0010808875,0.00060614734,0.00042855166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037168688,0.000030935887,0.0021172005,0.00012427098,0.00009248847,0.00039379077,0.00018180626,0.95616055,0.011603216,0.0153487865,0.000374663,0.013200438],"study_design_scores_gemma":[0.000009336252,0.00012848047,0.00077214395,0.000013719346,0.000044275108,0.00025848937,0.00003234769,0.9926367,0.002954338,0.0029027245,0.00022441972,0.00002296973],"about_ca_topic_score_codex":0.0037897108,"about_ca_topic_score_gemma":0.0023865497,"teacher_disagreement_score":0.0037897108,"about_ca_system_score_codex":0.0016466039,"about_ca_system_score_gemma":0.0010916471,"threshold_uncertainty_score":0.011947036},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008928989,0.0005266489,0.9877301,0.00012346529,0.0000494351,0.000030697527,0.000012791899,0.00017886228,0.0024189844],"genre_scores_gemma":[0.59486246,0.0009830147,0.39601862,0.000119201475,0.00023461298,0.00022064362,0.00008859222,0.00013609888,0.0073367655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994947,0.00019779256,0.000021458418,0.000059501475,0.00018312929,0.000043454645],"domain_scores_gemma":[0.9994881,0.00034457396,0.00003567157,0.00003887801,0.00007656663,0.000016228389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008495613,0.000591493,0.00097156316,0.0004961376,0.00040772237,0.00062802876,0.0010120991,0.0007049718,0.0011487708],"category_scores_gemma":[0.0017165584,0.0003221959,0.00038652704,0.0008141595,0.00039160904,0.0009156155,0.00081561547,0.00073780573,0.00016545736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088416404,0.00008493497,0.00016973935,0.00007259775,0.00005475943,0.0000310669,0.00003851992,0.84471637,0.0058100643,0.020511378,0.001731985,0.12669006],"study_design_scores_gemma":[0.000009395376,0.000019128125,0.00002486671,0.000002635791,0.0000060901834,0.000008467648,0.000003381761,0.9947056,0.00045976863,0.0044803517,0.00027772464,0.0000025398049],"about_ca_topic_score_codex":0.001099109,"about_ca_topic_score_gemma":0.0013477004,"teacher_disagreement_score":0.0011487708,"about_ca_system_score_codex":0.00074741343,"about_ca_system_score_gemma":0.00045668078,"threshold_uncertainty_score":0.00542289},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06699922,0.0012236155,0.9242367,0.00019886474,0.00004085714,0.00004077855,0.0000227035,0.00023458891,0.007002734],"genre_scores_gemma":[0.9092417,0.0011633852,0.08539666,0.00007414222,0.00004329406,0.00007964227,0.00004085878,0.000060816037,0.003899654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967706,0.0000994522,0.000013389362,0.000057028083,0.0001289901,0.000024159117],"domain_scores_gemma":[0.9994436,0.00035575044,0.000056743163,0.000050813822,0.000078281446,0.000014785958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004120735,0.0003321179,0.00043401858,0.00037577358,0.00027158513,0.00046367192,0.00053923007,0.00036192854,0.0005599329],"category_scores_gemma":[0.0015077952,0.00020925527,0.00016649601,0.00068986235,0.0007580164,0.0007128861,0.000509508,0.0003227991,0.00015433335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002545943,0.00010265965,0.0013404366,0.00037774967,0.000045573674,0.00061581546,0.00058797427,0.53638065,0.12622511,0.15537296,0.0011860474,0.17751043],"study_design_scores_gemma":[0.000019655363,0.00015059709,0.00029652021,0.000013494885,0.000014614581,0.0002602181,0.000060827402,0.9626631,0.009057813,0.02463745,0.0028117942,0.000013820533],"about_ca_topic_score_codex":0.000853368,"about_ca_topic_score_gemma":0.00083250296,"teacher_disagreement_score":0.000853368,"about_ca_system_score_codex":0.00042909005,"about_ca_system_score_gemma":0.00022001693,"threshold_uncertainty_score":0.0031133294},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086035696,0.1868305,0.06790434,0.026029339,0.64583856,0.000110770416,0.000550556,0.0003815656,0.07149395],"genre_scores_gemma":[0.0073063397,0.1465357,0.014796714,0.0136552155,0.6994155,0.00019614972,0.00079253165,0.00057137804,0.11673045],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875605,0.00025977052,0.00012067786,0.00023681312,0.00053878553,0.00008785574],"domain_scores_gemma":[0.9957698,0.0022051753,0.0002276856,0.0003028095,0.0011555036,0.00033899926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001645509,0.001930474,0.002096621,0.0035772996,0.00096976216,0.003229579,0.0015242789,0.0033759593,0.023993492],"category_scores_gemma":[0.005144011,0.000568337,0.0011774057,0.0034503527,0.0017273674,0.003449002,0.0014711336,0.00651945,0.014172345],"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.000031499785,0.00005657597,0.00018738881,0.000637214,0.00003911413,0.000143798,0.00005459913,0.00087785546,0.0010155777,0.03252606,0.84114873,0.123281516],"study_design_scores_gemma":[0.0000059700296,0.000059167643,0.00033173204,0.0002121202,0.000022764152,0.00042803245,0.000024086907,0.0016071742,0.0002462971,0.023544574,0.97349024,0.000027800294],"about_ca_topic_score_codex":0.0007522406,"about_ca_topic_score_gemma":0.0014021832,"teacher_disagreement_score":0.023993492,"about_ca_system_score_codex":0.0011030108,"about_ca_system_score_gemma":0.0010580599,"threshold_uncertainty_score":0.08026624},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71184015,0.00078312453,0.26327336,0.0019252693,0.00006051537,0.000065305605,0.0000817877,0.00018201757,0.021788454],"genre_scores_gemma":[0.99461985,0.00015384665,0.004957458,0.000023131344,0.000014837458,0.000016504557,0.000010129485,0.000018289938,0.00018586124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983962,0.0010397133,0.000045180295,0.0001056836,0.00027647897,0.00013663892],"domain_scores_gemma":[0.9438276,0.049501754,0.0022594146,0.0026811364,0.0012805882,0.00044948395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00402693,0.00028801517,0.0005425931,0.00071737793,0.00084558094,0.0013421387,0.00081230083,0.0009841997,0.0011804675],"category_scores_gemma":[0.04208669,0.00034253468,0.00024843015,0.0008953294,0.003053469,0.0031693005,0.0011455177,0.0008738929,0.00015703445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026137987,0.00008111755,0.0049660685,0.00022563532,0.000053547978,0.0002225738,0.0007533202,0.6605827,0.012195999,0.28712496,0.00062765274,0.03290496],"study_design_scores_gemma":[0.000057116165,0.00022365383,0.0027496042,0.000046782756,0.00004467104,0.00028821046,0.0005256231,0.7548732,0.006848086,0.23318341,0.0011157646,0.0000438699],"about_ca_topic_score_codex":0.0008406999,"about_ca_topic_score_gemma":0.0009816535,"teacher_disagreement_score":0.00402693,"about_ca_system_score_codex":0.0010695959,"about_ca_system_score_gemma":0.00076488,"threshold_uncertainty_score":0.02129674},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25328922,0.0055107647,0.6889266,0.012491479,0.00046342274,0.00017425045,0.001284136,0.00044028345,0.037419904],"genre_scores_gemma":[0.9474435,0.0033848064,0.036860548,0.0006634142,0.0008058361,0.00027312286,0.0007225143,0.00023807504,0.0096082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960665,0.002028461,0.00017506568,0.0005058963,0.0008077549,0.0004163509],"domain_scores_gemma":[0.8742948,0.11317897,0.004277618,0.0035334877,0.0020977969,0.002617217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004114425,0.0010667254,0.0031672781,0.002068477,0.001872397,0.004054124,0.0042776745,0.0038757278,0.007683186],"category_scores_gemma":[0.0585735,0.0011731889,0.0014365824,0.0025193994,0.005433593,0.010695463,0.0060888003,0.005021834,0.0006272048],"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.00030104016,0.00012485629,0.0022961325,0.00032545484,0.00010100549,0.00014614702,0.0003441575,0.36284485,0.0006693169,0.6083723,0.0061479458,0.018326767],"study_design_scores_gemma":[0.000040536594,0.000034459965,0.00035090264,0.00003066979,0.00001771921,0.000057921417,0.000054556327,0.42845145,0.00013757168,0.57013,0.0006712927,0.000022913357],"about_ca_topic_score_codex":0.0032845219,"about_ca_topic_score_gemma":0.0031373997,"teacher_disagreement_score":0.007683186,"about_ca_system_score_codex":0.0033835678,"about_ca_system_score_gemma":0.0016159443,"threshold_uncertainty_score":0.025702834},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023137644,0.0014103493,0.9696255,0.00022670352,0.000053453914,0.000024248955,0.00006620422,0.00018603414,0.0052698185],"genre_scores_gemma":[0.9153406,0.002804902,0.073121265,0.00018283995,0.0001359538,0.00011414727,0.00012041106,0.000044456217,0.008135311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947804,0.0002375584,0.000016082491,0.0000614006,0.00013938261,0.00006757841],"domain_scores_gemma":[0.9993254,0.00044358216,0.0000735403,0.000039832226,0.000096742704,0.00002099327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006982573,0.0005658231,0.0006259248,0.00030917316,0.00030128084,0.00068175205,0.0005577328,0.00070065906,0.0012374158],"category_scores_gemma":[0.0014135736,0.0003869488,0.0003214531,0.0007542652,0.0007753758,0.0007811811,0.00044354537,0.00048489464,0.0005220571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014914385,0.000028489829,0.00039116162,0.00022267958,0.00004043279,0.0002593016,0.0001466456,0.8764857,0.015966792,0.06886579,0.0013135521,0.03613038],"study_design_scores_gemma":[0.000019036499,0.000073595686,0.00018577556,0.000013742896,0.000017396174,0.00009059972,0.00003438948,0.9810079,0.002056754,0.0152067635,0.0012793014,0.00001480425],"about_ca_topic_score_codex":0.0020858708,"about_ca_topic_score_gemma":0.0023162246,"teacher_disagreement_score":0.0020858708,"about_ca_system_score_codex":0.0007290763,"about_ca_system_score_gemma":0.00046403919,"threshold_uncertainty_score":0.005289793},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029004553,0.0003929849,0.9683744,0.00009743594,0.000020363332,0.000029480136,0.00002289044,0.00013155426,0.0019264601],"genre_scores_gemma":[0.77696484,0.0004483878,0.22063239,0.000048373306,0.00003288627,0.00008372454,0.00005277711,0.00003003014,0.0017065778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996333,0.00015890811,0.000014507623,0.000051735304,0.00008265654,0.00005874741],"domain_scores_gemma":[0.99963546,0.00022508446,0.000045471494,0.000034410572,0.000043085798,0.000016383277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005975438,0.0004748011,0.00059721357,0.00033035676,0.00041855001,0.00056187407,0.0004743661,0.0005003053,0.0006073707],"category_scores_gemma":[0.0015179038,0.00023371987,0.00027717662,0.0005473387,0.00045586875,0.0006327656,0.0005052179,0.0005151822,0.00020404295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011915013,0.000090213696,0.00034795026,0.000059119255,0.00002738342,0.00010474386,0.00006820528,0.868393,0.008048478,0.017636416,0.0015463579,0.10355885],"study_design_scores_gemma":[0.0000063548473,0.000017469474,0.00005486532,0.0000023552773,0.0000046571604,0.000025586356,0.000008491359,0.99502546,0.0012389792,0.0031917086,0.0004201155,0.0000039416095],"about_ca_topic_score_codex":0.002935739,"about_ca_topic_score_gemma":0.0037382392,"teacher_disagreement_score":0.002935739,"about_ca_system_score_codex":0.00052528083,"about_ca_system_score_gemma":0.00073765416,"threshold_uncertainty_score":0.0058373213},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13780344,0.0017376854,0.8298523,0.0023307307,0.00016268027,0.000114086935,0.0007888043,0.0006020591,0.02660823],"genre_scores_gemma":[0.97494656,0.0012658559,0.017764485,0.00022119773,0.00023391005,0.0002806669,0.00033165424,0.00010432451,0.004851388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99576265,0.0016449608,0.00013610147,0.00043749667,0.0011664341,0.0008524013],"domain_scores_gemma":[0.9742174,0.020112073,0.001562934,0.0019345259,0.0018679381,0.00030511213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004362494,0.0010570901,0.0015473651,0.0016715076,0.00096849893,0.0023908198,0.0021864541,0.0017901413,0.0026611672],"category_scores_gemma":[0.024800973,0.0006307939,0.0006666772,0.0021046675,0.0037227166,0.0046923263,0.0022452148,0.0018144206,0.0005332436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114348644,0.000023880071,0.00019639032,0.00009140262,0.000021138418,0.00014886024,0.000104718485,0.5721282,0.0013667527,0.41986507,0.00139871,0.004540596],"study_design_scores_gemma":[0.000014601263,0.000014631177,0.00007117632,0.000022801793,0.0000069857147,0.000049536535,0.000012201523,0.85674775,0.0003662051,0.14224678,0.0004259908,0.000021373167],"about_ca_topic_score_codex":0.0044910572,"about_ca_topic_score_gemma":0.0017674892,"teacher_disagreement_score":0.0044910572,"about_ca_system_score_codex":0.0035304993,"about_ca_system_score_gemma":0.0020554047,"threshold_uncertainty_score":0.025615692},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010924874,0.00084681815,0.98257565,0.00019151144,0.00004983512,0.000037206755,0.000020614607,0.00007420484,0.0052791922],"genre_scores_gemma":[0.8055172,0.0020657168,0.18582456,0.00017090485,0.00014919485,0.00022279209,0.00005123548,0.000050848983,0.005947503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988518,0.00058127905,0.000034230347,0.00009618659,0.00036070298,0.00007587493],"domain_scores_gemma":[0.9977316,0.0017831153,0.00014767946,0.00014104688,0.00017728026,0.00001914499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013962428,0.0006101348,0.00046951705,0.0006066831,0.00035644099,0.0008817209,0.00074737106,0.0008354297,0.0009238784],"category_scores_gemma":[0.005976074,0.0002601584,0.0001909779,0.0012410578,0.001631646,0.001097732,0.0007835437,0.0006548214,0.00023948446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001123418,0.000021878497,0.00020924957,0.000108469285,0.000018565208,0.00018022604,0.0001343512,0.7153695,0.0039556986,0.23646085,0.0007361547,0.04269272],"study_design_scores_gemma":[0.000021910182,0.000054765922,0.00006325536,0.000018923998,0.0000088062025,0.00008507694,0.0000173063,0.91789186,0.0015061593,0.07837583,0.0019420977,0.000014049474],"about_ca_topic_score_codex":0.0013719074,"about_ca_topic_score_gemma":0.0011250998,"teacher_disagreement_score":0.0013962428,"about_ca_system_score_codex":0.0007993478,"about_ca_system_score_gemma":0.0006067956,"threshold_uncertainty_score":0.0073841214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025829928,0.0009692325,0.9640478,0.000935176,0.00015497606,0.00016891991,0.00022813011,0.00046407394,0.007201719],"genre_scores_gemma":[0.7546414,0.0011227663,0.2282295,0.00067711825,0.00061405107,0.00081302365,0.00033259077,0.00021219591,0.0133574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973883,0.0010440607,0.00013198888,0.00040600845,0.0007604379,0.00026916948],"domain_scores_gemma":[0.9906088,0.005676009,0.00082068244,0.0020713257,0.00048902846,0.00033418028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033163955,0.0008999505,0.0021367476,0.001411045,0.001657594,0.0019495283,0.002606012,0.0021871107,0.0037210013],"category_scores_gemma":[0.01420209,0.00089683715,0.0006022987,0.002335417,0.0027982993,0.0045679845,0.0055953455,0.0022432543,0.0009304539],"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.0022625953,0.0001570763,0.0006242295,0.0005520731,0.00013763401,0.0001675612,0.000537072,0.19286041,0.016596941,0.6304688,0.010068977,0.1455667],"study_design_scores_gemma":[0.0002888906,0.00017809155,0.00015771085,0.000043634347,0.000053040007,0.00015265816,0.000055356384,0.5111122,0.003960333,0.47923172,0.0047124918,0.000053920754],"about_ca_topic_score_codex":0.0005526103,"about_ca_topic_score_gemma":0.0007974963,"teacher_disagreement_score":0.0037210013,"about_ca_system_score_codex":0.0015974812,"about_ca_system_score_gemma":0.0015617805,"threshold_uncertainty_score":0.017539024},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4676209,0.0014751157,0.52550554,0.0005933269,0.00003570485,0.00005871193,0.00011265495,0.0001471982,0.004450753],"genre_scores_gemma":[0.9849,0.0005649607,0.013884327,0.000041935473,0.000026872329,0.00002413504,0.00002695891,0.00001777008,0.0005130224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785835,0.0008954827,0.00008575634,0.00019731099,0.0006608394,0.00030232445],"domain_scores_gemma":[0.95333695,0.041580047,0.0025745116,0.0013326528,0.0010430705,0.00013273339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004332874,0.0010144936,0.0014629526,0.0005906614,0.00054698455,0.001450367,0.00093364913,0.0011516184,0.0007021463],"category_scores_gemma":[0.026432522,0.0004310197,0.00041948256,0.00087361195,0.0016372263,0.0035905372,0.0010872564,0.0011255398,0.00013590071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098057,0.000023843239,0.0010726926,0.00005352806,0.000044062945,0.00015594298,0.00008815603,0.97010505,0.002510683,0.019379348,0.00006912342,0.006399527],"study_design_scores_gemma":[0.00001304911,0.000112651025,0.0006030925,0.000011612551,0.000030445422,0.00015660255,0.000035347464,0.98447615,0.004361014,0.010024504,0.00015350695,0.000022050497],"about_ca_topic_score_codex":0.0015866328,"about_ca_topic_score_gemma":0.0013036174,"teacher_disagreement_score":0.004332874,"about_ca_system_score_codex":0.0012281553,"about_ca_system_score_gemma":0.000753139,"threshold_uncertainty_score":0.022914708},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.526579,0.0003424974,0.4720568,0.000121905476,0.00001309117,0.00004188387,0.000015173892,0.00021247233,0.00061705586],"genre_scores_gemma":[0.98600096,0.00006172854,0.013782297,0.000014256693,0.0000054079906,0.000011622709,0.0000040403634,0.0000024067765,0.000117328804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983765,0.0006360653,0.00011257894,0.00018801748,0.0005807275,0.00010612954],"domain_scores_gemma":[0.99089384,0.005496194,0.0020578525,0.0006601429,0.00076972606,0.00012224448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001925019,0.00042041048,0.0004631487,0.00091924577,0.00050203275,0.000542432,0.00054109073,0.00067008386,0.000101904945],"category_scores_gemma":[0.008765,0.00025156644,0.00017020672,0.00047833144,0.0009186525,0.0008807552,0.00056211115,0.0003855053,0.000052753952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001242208,0.00024598368,0.037653994,0.00020893732,0.0001964352,0.0013345599,0.002165498,0.60896397,0.10021982,0.0195046,0.00049944984,0.22776455],"study_design_scores_gemma":[0.000013103512,0.0001951795,0.0016163421,0.0000061417154,0.000027188835,0.00030316054,0.00007475614,0.9754106,0.019177489,0.002971403,0.00018751745,0.000017113704],"about_ca_topic_score_codex":0.0011085137,"about_ca_topic_score_gemma":0.00080491154,"teacher_disagreement_score":0.001925019,"about_ca_system_score_codex":0.0005076053,"about_ca_system_score_gemma":0.00043163518,"threshold_uncertainty_score":0.010180593},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22263901,0.0031952537,0.7469206,0.0004557235,0.000048910715,0.0000504128,0.00035597646,0.00044079468,0.025893316],"genre_scores_gemma":[0.98863363,0.0014065123,0.008329261,0.000042432002,0.000046035257,0.00004496624,0.00007091609,0.00004167869,0.0013844008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990577,0.0003092341,0.000027363343,0.00009617009,0.0002684252,0.00024106797],"domain_scores_gemma":[0.99629277,0.002738479,0.00024951142,0.00028840892,0.00036836733,0.00006238482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001140552,0.0010408771,0.0007610559,0.001016578,0.0003727441,0.0010473346,0.0010871,0.00072511076,0.0014095703],"category_scores_gemma":[0.0068757012,0.00031657238,0.0005097108,0.001356779,0.0017163614,0.0017087285,0.0011340042,0.00070756953,0.0002573529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025663892,0.00001298679,0.00038008275,0.00007741352,0.000031963213,0.00023333426,0.00008480137,0.93423176,0.0029141482,0.056294892,0.00043263033,0.0052803243],"study_design_scores_gemma":[0.0000018269783,0.000011288781,0.0002840367,0.000012378429,0.0000104353885,0.00008627649,0.000019895588,0.9823072,0.0007523558,0.016209334,0.0002942101,0.000010644366],"about_ca_topic_score_codex":0.004004091,"about_ca_topic_score_gemma":0.0019118357,"teacher_disagreement_score":0.004004091,"about_ca_system_score_codex":0.0016605321,"about_ca_system_score_gemma":0.0008340493,"threshold_uncertainty_score":0.012048006},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034356188,0.0016276832,0.95515674,0.001224736,0.00005879635,0.00012244421,0.00018651933,0.00020722976,0.0070595737],"genre_scores_gemma":[0.57967913,0.0031338797,0.4106634,0.00034594678,0.000198254,0.00044440804,0.0004904599,0.00012292407,0.0049215164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909854,0.000457938,0.00003245757,0.00011651261,0.00017685736,0.00011767171],"domain_scores_gemma":[0.9958534,0.0034210822,0.00024623825,0.00019015884,0.00019768412,0.0000915219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020123369,0.0010534558,0.0012960427,0.00069797394,0.00086194806,0.0015314997,0.0016972327,0.0015347812,0.0016152274],"category_scores_gemma":[0.005864785,0.0005511832,0.00074193213,0.0016832454,0.0013361139,0.0031180142,0.0013009097,0.0015060159,0.00021587985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081116086,0.000104078565,0.0003455467,0.00021186638,0.000052261472,0.000097027994,0.0001183748,0.88337094,0.00055576453,0.07936342,0.00350458,0.032195017],"study_design_scores_gemma":[0.00003587118,0.00003334849,0.00008464113,0.000019199764,0.000016184977,0.00005467699,0.00005718984,0.865585,0.0003930374,0.13213731,0.0015755176,0.000007971856],"about_ca_topic_score_codex":0.0025875622,"about_ca_topic_score_gemma":0.0025939741,"teacher_disagreement_score":0.0025875622,"about_ca_system_score_codex":0.0012384658,"about_ca_system_score_gemma":0.0014125139,"threshold_uncertainty_score":0.010642409},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15425846,0.006714337,0.8184533,0.0017973938,0.00015598875,0.00008436866,0.00027280473,0.0003110184,0.017952345],"genre_scores_gemma":[0.9749008,0.00507433,0.016693678,0.00021116876,0.00027221302,0.000101256905,0.000099221645,0.00008535326,0.0025619757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976476,0.0011116795,0.00005936943,0.00023575868,0.0006366186,0.0003089953],"domain_scores_gemma":[0.9835714,0.013634844,0.001096711,0.000569306,0.0008916495,0.00023597077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032258665,0.0015591163,0.0014190166,0.0017412904,0.0009653166,0.0017539264,0.0015185825,0.0016146393,0.0013413139],"category_scores_gemma":[0.01845195,0.0008050715,0.0006768862,0.0020898995,0.0024183288,0.003856433,0.0019722532,0.0014186322,0.000296118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006301423,0.00003113219,0.0011117816,0.00011331284,0.000027769247,0.00023815184,0.00013974571,0.90656084,0.0014629605,0.08295765,0.0008285707,0.006465019],"study_design_scores_gemma":[0.000005298214,0.00006065839,0.00051735196,0.000028393895,0.000016574828,0.00018757423,0.000056277688,0.9656435,0.00033055106,0.032661643,0.00046950928,0.000022754079],"about_ca_topic_score_codex":0.003442472,"about_ca_topic_score_gemma":0.002107656,"teacher_disagreement_score":0.003442472,"about_ca_system_score_codex":0.0022469822,"about_ca_system_score_gemma":0.000737631,"threshold_uncertainty_score":0.01706022},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91316515,0.00046564903,0.080691226,0.00016127045,0.000014331186,0.000016711243,0.00008602329,0.00022472437,0.00517489],"genre_scores_gemma":[0.99814606,0.00008109924,0.0014947107,0.000011976144,0.0000027052758,0.0000044698522,0.000016810844,0.0000044635817,0.0002377632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991265,0.0002776232,0.00004692789,0.000100544064,0.0002679986,0.00018038381],"domain_scores_gemma":[0.9952527,0.0036253387,0.0003412671,0.00022740617,0.0004722344,0.00008113213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001379155,0.0008496059,0.00077817234,0.00050155417,0.00042890295,0.000865343,0.00052507006,0.0010695348,0.00058094045],"category_scores_gemma":[0.005697816,0.0002395708,0.00030092377,0.00042491456,0.0012034109,0.0006504637,0.00080987124,0.00037270342,0.0001600007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007441777,0.000060102884,0.005384979,0.00011746148,0.00011093964,0.00052623556,0.00025509924,0.93881416,0.03339609,0.006687085,0.00015531614,0.013748396],"study_design_scores_gemma":[0.00002687692,0.00039571544,0.0020207728,0.000014573885,0.00007872439,0.00039757293,0.000093504656,0.9785029,0.016027523,0.002265719,0.00014160218,0.000034385317],"about_ca_topic_score_codex":0.0031196896,"about_ca_topic_score_gemma":0.002005846,"teacher_disagreement_score":0.0031196896,"about_ca_system_score_codex":0.0007454523,"about_ca_system_score_gemma":0.00067692355,"threshold_uncertainty_score":0.0072938204},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02589747,0.00038912683,0.9689673,0.00013433032,0.000028044316,0.000036074547,0.00006400128,0.00024741294,0.0042361952],"genre_scores_gemma":[0.85773945,0.00070361415,0.1360817,0.000100690224,0.00006631358,0.00009202427,0.00010927767,0.000025125331,0.005081763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949217,0.00015234126,0.000027233276,0.00007130653,0.00021576573,0.00004112349],"domain_scores_gemma":[0.99952126,0.00018910485,0.0000844492,0.00007101204,0.000121133555,0.0000129974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058648054,0.0008353565,0.000707464,0.0002442435,0.00025803962,0.00067522225,0.0007462821,0.0006437859,0.0009935702],"category_scores_gemma":[0.0012746414,0.00039342907,0.00043220195,0.00032922585,0.0005083188,0.0007808305,0.00048675766,0.00042395547,0.00055958505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013640863,0.000039061568,0.00040183292,0.0001463846,0.00006459761,0.00019631082,0.00010617002,0.909091,0.022951093,0.029577216,0.0006671567,0.036622714],"study_design_scores_gemma":[0.0000173473,0.000095717376,0.000121306366,0.000008646194,0.000028117038,0.0001203821,0.000011049321,0.9895727,0.0046408316,0.004582294,0.00078898726,0.000012641317],"about_ca_topic_score_codex":0.0014812018,"about_ca_topic_score_gemma":0.0025192532,"teacher_disagreement_score":0.0014812018,"about_ca_system_score_codex":0.0005604575,"about_ca_system_score_gemma":0.0006888532,"threshold_uncertainty_score":0.0040664673},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7348409,0.0027221232,0.21489942,0.0012402674,0.00059600634,0.00024560167,0.0005337965,0.0022719477,0.042649955],"genre_scores_gemma":[0.8929612,0.00063431356,0.09362658,0.00015764803,0.00005840971,0.000055830376,0.00014410746,0.0000623813,0.012299458],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99981135,0.00001614409,0.0000074884715,0.000037431146,0.00010380748,0.000023823086],"domain_scores_gemma":[0.99984396,0.000036837027,0.000044241122,0.000018055955,0.000037286467,0.000019647463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017946756,0.0002990858,0.00022725257,0.00021382884,0.0002096377,0.00044909277,0.00060779316,0.00031987106,0.0020216925],"category_scores_gemma":[0.0003371694,0.00013856859,0.00019950302,0.00019829119,0.00021380254,0.00046287754,0.00026113703,0.00039686338,0.00096207374],"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.0001087867,0.00004996832,0.00044536404,0.000120487115,0.000015574482,0.00014059879,0.00012745956,0.0013136222,0.97178787,0.0068131476,0.001023873,0.018053284],"study_design_scores_gemma":[0.000090558286,0.001231901,0.0013004111,0.000032879743,0.00006461332,0.000999283,0.000077386976,0.015664732,0.92062056,0.0014657276,0.058416203,0.00003572955],"about_ca_topic_score_codex":0.00070824346,"about_ca_topic_score_gemma":0.0018643041,"teacher_disagreement_score":0.0020216925,"about_ca_system_score_codex":0.0005025173,"about_ca_system_score_gemma":0.00050695403,"threshold_uncertainty_score":0.0067632794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006217761,0.00022506945,0.9922386,0.00007341321,0.000016095415,0.000024605617,0.000026524556,0.00009565186,0.0010824047],"genre_scores_gemma":[0.8316574,0.00064883195,0.16520658,0.00008607238,0.00004198643,0.00013890932,0.000070096845,0.00004631607,0.0021037988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905294,0.0003823819,0.000054957625,0.0002315789,0.0002017553,0.00007648148],"domain_scores_gemma":[0.99888366,0.0005833649,0.00023638847,0.00012343896,0.00013979904,0.00003335957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013514606,0.0011981535,0.0010661863,0.0003728557,0.00031137932,0.0013533643,0.0009969819,0.0011265482,0.0017443233],"category_scores_gemma":[0.0030752982,0.0004334354,0.00072109676,0.0005000765,0.0008262107,0.0013923515,0.0009631136,0.00081214524,0.0005136105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013022385,0.00003365497,0.00029284667,0.00021917542,0.0000658146,0.00018931727,0.00010454763,0.9311724,0.012242713,0.025631506,0.0006001828,0.029317625],"study_design_scores_gemma":[0.00001591613,0.00011920592,0.00007237903,0.000008966247,0.000019090634,0.00008017637,0.000015700787,0.991524,0.00278076,0.0046458957,0.00070520764,0.000012674642],"about_ca_topic_score_codex":0.00058185845,"about_ca_topic_score_gemma":0.0005019842,"teacher_disagreement_score":0.0017443233,"about_ca_system_score_codex":0.0006570995,"about_ca_system_score_gemma":0.00062395504,"threshold_uncertainty_score":0.007147312},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03372965,0.00036051724,0.9625845,0.0001431628,0.000117303396,0.00006908048,0.000031115076,0.00035706648,0.0026076473],"genre_scores_gemma":[0.80802906,0.00028240646,0.18886907,0.00011661489,0.00011440441,0.0001318771,0.000057706595,0.00003055546,0.0023682783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923205,0.0002475695,0.00003780011,0.00013561652,0.00026441546,0.000082551844],"domain_scores_gemma":[0.9989248,0.00029217155,0.0001772279,0.00026049747,0.00027880934,0.00006657661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010444466,0.00040702446,0.0004470026,0.0005905249,0.00067764294,0.0006063311,0.001008066,0.0007179309,0.00089329283],"category_scores_gemma":[0.002713625,0.00021489574,0.00025834833,0.0009627324,0.0006684965,0.0009348993,0.0010751699,0.0005859199,0.00036281793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008819032,0.00016161772,0.0014185895,0.000166864,0.00009911987,0.0004049943,0.0006994585,0.34197605,0.12338477,0.1286646,0.004228209,0.39791384],"study_design_scores_gemma":[0.00015899801,0.0008292472,0.00057800254,0.000031721273,0.000085878986,0.00045969352,0.00010146887,0.9402255,0.02743876,0.017715469,0.012303105,0.000072134135],"about_ca_topic_score_codex":0.0011555876,"about_ca_topic_score_gemma":0.0010526092,"teacher_disagreement_score":0.0011555876,"about_ca_system_score_codex":0.0005528571,"about_ca_system_score_gemma":0.0008161324,"threshold_uncertainty_score":0.0055236816},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023921134,0.000240546,0.9730829,0.00014016494,0.000030293804,0.0000403928,0.000048226706,0.00009992224,0.002396322],"genre_scores_gemma":[0.78624165,0.0005081901,0.20912582,0.00017952986,0.00007263138,0.00016130967,0.000103551545,0.000018003864,0.003589154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995554,0.0001356723,0.000020434365,0.000087535496,0.0001496169,0.000051300995],"domain_scores_gemma":[0.9997143,0.00012000746,0.000032302498,0.000027614298,0.000091903894,0.000013835126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041245294,0.0004687403,0.00040961392,0.00019927659,0.00031607118,0.00055213174,0.0004124799,0.00061565166,0.0011687162],"category_scores_gemma":[0.00071604474,0.00023928499,0.0001723558,0.00020545308,0.0003717317,0.0005492284,0.00038952587,0.0004549001,0.00038656098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034421252,0.00016455849,0.0014223387,0.0003246806,0.00011319218,0.0004495579,0.00042501508,0.57649624,0.12347617,0.074777074,0.0034718579,0.21853502],"study_design_scores_gemma":[0.0000690112,0.00018918871,0.00034004866,0.00002404978,0.000033170305,0.00020612331,0.000045454373,0.9697925,0.015375506,0.011217754,0.0026844223,0.000022747428],"about_ca_topic_score_codex":0.0010988949,"about_ca_topic_score_gemma":0.0021365648,"teacher_disagreement_score":0.0011687162,"about_ca_system_score_codex":0.00041301618,"about_ca_system_score_gemma":0.0009651833,"threshold_uncertainty_score":0.0039097667},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047562767,0.0008394871,0.9460264,0.00026835036,0.000026620148,0.00004078551,0.000039918836,0.000062038955,0.0051336912],"genre_scores_gemma":[0.9067832,0.0016362703,0.08914544,0.00009655288,0.000065304164,0.00011095252,0.000050917657,0.00009072198,0.002020603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904984,0.00056365534,0.000031007963,0.00006173542,0.00021816818,0.00007561026],"domain_scores_gemma":[0.9977944,0.0017377015,0.00016078653,0.00009616544,0.00017105242,0.000039873434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021069269,0.0010128412,0.0007956677,0.0003932285,0.00027587765,0.00090174004,0.0006329007,0.00073910865,0.0008285622],"category_scores_gemma":[0.007140084,0.0004833229,0.00035921347,0.00055475405,0.0016261247,0.0013688306,0.0012472864,0.0006613876,0.00015324293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047298454,0.000012017012,0.00015279009,0.000045029363,0.000021297667,0.00004236775,0.000044951485,0.9585584,0.0025040947,0.029811854,0.00023177682,0.008528127],"study_design_scores_gemma":[0.0000065281665,0.000025238569,0.0000555243,0.000008842511,0.000005529403,0.000012229088,0.0000092399305,0.98659813,0.00069878454,0.012434654,0.00013900516,0.000006241523],"about_ca_topic_score_codex":0.0015144525,"about_ca_topic_score_gemma":0.0012752436,"teacher_disagreement_score":0.0021069269,"about_ca_system_score_codex":0.0011271064,"about_ca_system_score_gemma":0.0006239777,"threshold_uncertainty_score":0.0111426115},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22132151,0.0020401217,0.7680793,0.00014298476,0.000034205314,0.000038190134,0.00011252132,0.0003067983,0.007924307],"genre_scores_gemma":[0.95524246,0.00080045016,0.042138893,0.000026827362,0.000022181268,0.000033044795,0.000046570505,0.000012844575,0.0016766351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994442,0.00014099636,0.000044211167,0.00007251298,0.00022050187,0.000077524746],"domain_scores_gemma":[0.9983065,0.0009070272,0.00026711603,0.00016645381,0.00031981283,0.000033013457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061413087,0.0008711108,0.00073792203,0.00063850614,0.0004172374,0.0013968213,0.00066850544,0.0006823865,0.0007092309],"category_scores_gemma":[0.003259841,0.0003771488,0.00031338332,0.0008729863,0.000655646,0.0012547767,0.00087979273,0.00048594913,0.00027713724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022846865,0.0000514089,0.0022039192,0.0001966548,0.00009282035,0.00091158616,0.00027496362,0.88097733,0.021230012,0.04328922,0.0005682724,0.04997526],"study_design_scores_gemma":[0.000008361038,0.000058536833,0.00030492037,0.000009648437,0.00002570736,0.00030485087,0.000038530936,0.9895947,0.002411814,0.006672111,0.00055374624,0.000017021792],"about_ca_topic_score_codex":0.0014687434,"about_ca_topic_score_gemma":0.0019081307,"teacher_disagreement_score":0.0014687434,"about_ca_system_score_codex":0.00067357527,"about_ca_system_score_gemma":0.0004463575,"threshold_uncertainty_score":0.0048871636},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13452932,0.0016071673,0.8216374,0.0011701705,0.00012583626,0.000088894325,0.00049830845,0.00027184907,0.04007096],"genre_scores_gemma":[0.95242184,0.0010586662,0.04188519,0.0002569528,0.000056946265,0.00014276845,0.00024301137,0.000056736913,0.003877806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991335,0.00026696458,0.000020826616,0.00013568271,0.00026125953,0.00018168788],"domain_scores_gemma":[0.99415684,0.0045756875,0.00038497345,0.000306764,0.00040379204,0.00017199846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015358727,0.00062912836,0.00060724805,0.0009965232,0.0007485075,0.0012628008,0.0014397927,0.0009835393,0.0032202424],"category_scores_gemma":[0.006592476,0.00026566887,0.00049027917,0.0006911528,0.0014135863,0.0021132324,0.0010586426,0.0020064416,0.00023934181],"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.00008838611,0.000039084032,0.00033851663,0.00011820772,0.00002114795,0.00011715982,0.00013701628,0.4009312,0.00455912,0.58000207,0.0024701194,0.0111779915],"study_design_scores_gemma":[0.000011476752,0.000052991847,0.00021111929,0.000029583001,0.000011045909,0.00012629358,0.00006742631,0.7689247,0.0016800304,0.22490898,0.0039524734,0.000023976609],"about_ca_topic_score_codex":0.002206363,"about_ca_topic_score_gemma":0.0023492877,"teacher_disagreement_score":0.0032202424,"about_ca_system_score_codex":0.0023977798,"about_ca_system_score_gemma":0.0008478711,"threshold_uncertainty_score":0.017397165},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07302964,0.002311241,0.92107415,0.0003665399,0.00004021465,0.000026020847,0.00004465182,0.00015862969,0.0029489351],"genre_scores_gemma":[0.958994,0.00079882506,0.038938142,0.000061916995,0.000027073973,0.000036400896,0.000020845106,0.00002358382,0.0010991453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989517,0.0005017296,0.00003970395,0.00009438852,0.00030251776,0.00011004617],"domain_scores_gemma":[0.9977736,0.0015737523,0.00017345557,0.00019439559,0.0002490895,0.00003575207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015485229,0.00044943066,0.0006285087,0.00038030848,0.000379433,0.0009813972,0.0006984367,0.0006410021,0.00080217875],"category_scores_gemma":[0.0051081814,0.0002689307,0.00014806165,0.0009166818,0.0012652598,0.0017422007,0.0007471207,0.00050974824,0.000161513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011946921,0.000018599776,0.00039176742,0.00006189811,0.000015394015,0.000071650866,0.00009962102,0.92279583,0.0049454262,0.045705855,0.00042681643,0.02534767],"study_design_scores_gemma":[0.0000101468695,0.00003440783,0.00015039346,0.000008453128,0.000006731919,0.00003177237,0.000026532887,0.97249526,0.0023003025,0.024465142,0.00045891572,0.000011915946],"about_ca_topic_score_codex":0.0016245564,"about_ca_topic_score_gemma":0.0013885543,"teacher_disagreement_score":0.0016245564,"about_ca_system_score_codex":0.0010279856,"about_ca_system_score_gemma":0.0005449332,"threshold_uncertainty_score":0.008189499},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.160278,0.0054597566,0.8197005,0.0005370153,0.00007323687,0.000055775054,0.00008370033,0.00019147799,0.013620446],"genre_scores_gemma":[0.9590316,0.0021348803,0.035693713,0.000110443965,0.000059778282,0.000051645453,0.000067608074,0.00006984698,0.0027804894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990245,0.000345715,0.000035283818,0.000087683125,0.0003826968,0.00012420153],"domain_scores_gemma":[0.99595743,0.0032803414,0.00019145323,0.00026540173,0.00027456495,0.000030622934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001361444,0.0006439003,0.00044264953,0.00070041534,0.00038183827,0.00073856936,0.00064582593,0.00047571506,0.0011623091],"category_scores_gemma":[0.007338015,0.00022759498,0.00028198783,0.0008355646,0.0010562807,0.0018267541,0.0006874357,0.00049112836,0.0002544345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015407756,0.000048305195,0.0012083811,0.00016006213,0.00004372526,0.0000759633,0.000112384725,0.8580167,0.013160458,0.07224232,0.00046009396,0.054317642],"study_design_scores_gemma":[0.000006639829,0.00011037607,0.0006013679,0.000034594945,0.000016146538,0.00010756667,0.000048961574,0.9702931,0.007549734,0.020100988,0.0011149879,0.000015490374],"about_ca_topic_score_codex":0.0012167583,"about_ca_topic_score_gemma":0.0011346093,"teacher_disagreement_score":0.001361444,"about_ca_system_score_codex":0.0009997088,"about_ca_system_score_gemma":0.0004738593,"threshold_uncertainty_score":0.0072534084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075427853,0.00016647583,0.9910211,0.00010173193,0.000012964452,0.000033587614,0.00001269746,0.00013142049,0.0009773175],"genre_scores_gemma":[0.69269884,0.00039841345,0.3039369,0.00019710486,0.000039567898,0.00037513705,0.00011035459,0.00008416402,0.0021594977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920243,0.00034947033,0.000028501332,0.00012253708,0.0001887021,0.00010846857],"domain_scores_gemma":[0.9981159,0.0013519813,0.0001671502,0.00006767908,0.00024407274,0.00005329008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019335763,0.00097378914,0.000998735,0.0008121012,0.00061764405,0.0009010736,0.001268191,0.00084103446,0.0011675813],"category_scores_gemma":[0.0050496073,0.00043894467,0.0004396677,0.0010073177,0.0008712947,0.0011884918,0.0011799684,0.0009232298,0.00022455076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049387814,0.000028996215,0.00026967083,0.000025471085,0.000015920012,0.000018739513,0.00004245721,0.96484894,0.00054044736,0.0062196837,0.00048809798,0.027452262],"study_design_scores_gemma":[0.0000055535584,0.0000068001386,0.000021073734,0.0000018034406,0.0000015873018,0.0000037225632,0.0000046807095,0.9982284,0.00012439629,0.0015035648,0.00009675943,0.0000017004512],"about_ca_topic_score_codex":0.0066879713,"about_ca_topic_score_gemma":0.0061311205,"teacher_disagreement_score":0.0066879713,"about_ca_system_score_codex":0.0016866488,"about_ca_system_score_gemma":0.0019147114,"threshold_uncertainty_score":0.013298094},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.677915,0.0017663128,0.31106085,0.0005322908,0.000038865717,0.00012786503,0.00011967603,0.00026376577,0.008175424],"genre_scores_gemma":[0.9937742,0.00032160958,0.005183232,0.00003104694,0.000015886922,0.000029491128,0.000019070545,0.000007461896,0.00061799673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702126,0.0016510361,0.00008588738,0.0002541114,0.00050636526,0.00048136502],"domain_scores_gemma":[0.9767219,0.01917957,0.0019118714,0.0006810122,0.0011846662,0.00032101854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039896625,0.002116386,0.0015633887,0.00084168016,0.0009158581,0.0013258695,0.0011288373,0.0012761281,0.0006304227],"category_scores_gemma":[0.010617591,0.00051962124,0.00061203085,0.0010930346,0.0022628994,0.0017117359,0.001722582,0.00067529234,0.00018729939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037554168,0.000073083815,0.0022802458,0.000111464054,0.000111492016,0.0010754971,0.00023051615,0.9759125,0.0052507906,0.008927979,0.0002412623,0.005409619],"study_design_scores_gemma":[0.000041746778,0.00043149298,0.0005443836,0.000010013046,0.00006849648,0.0003938403,0.00013077965,0.9905274,0.0033841769,0.004281339,0.00016330955,0.000022982998],"about_ca_topic_score_codex":0.0038375896,"about_ca_topic_score_gemma":0.002689208,"teacher_disagreement_score":0.0039896625,"about_ca_system_score_codex":0.0011837312,"about_ca_system_score_gemma":0.0012369037,"threshold_uncertainty_score":0.021099627},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07192701,0.0009838353,0.9103482,0.0003648897,0.00009125679,0.00004195321,0.00012155018,0.00013687032,0.015984522],"genre_scores_gemma":[0.90384626,0.0021190916,0.08796454,0.00015512678,0.000098826386,0.00007567388,0.000120354016,0.00004247394,0.0055775787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996482,0.00014459708,0.000014388474,0.000067141875,0.000064028856,0.000061656814],"domain_scores_gemma":[0.9994972,0.00025848718,0.00009083416,0.000049710914,0.00006231692,0.000041490253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062013796,0.0003661877,0.00046370795,0.00022202628,0.0002944741,0.0005797609,0.00063738896,0.00039399284,0.0014227058],"category_scores_gemma":[0.0013710291,0.00020945567,0.00017579971,0.0005378141,0.00048303892,0.0009819528,0.00050047226,0.000365382,0.00035647803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019882986,0.00004898669,0.00045072503,0.00015866481,0.000024916753,0.0002449517,0.0001651799,0.72472394,0.0073178285,0.22289507,0.0029617148,0.040809155],"study_design_scores_gemma":[0.00002540035,0.00009423013,0.00018824424,0.000009632495,0.000011095013,0.000117413634,0.000115788695,0.9197535,0.0018950313,0.073871754,0.0039020146,0.000015942089],"about_ca_topic_score_codex":0.0010266615,"about_ca_topic_score_gemma":0.0009511119,"teacher_disagreement_score":0.0014227058,"about_ca_system_score_codex":0.00052610564,"about_ca_system_score_gemma":0.00049784494,"threshold_uncertainty_score":0.004759431},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041508596,0.0023169634,0.9459494,0.00028286944,0.000092911905,0.000059386148,0.0000590904,0.00012418814,0.009606644],"genre_scores_gemma":[0.88535124,0.0018359715,0.10947479,0.000168738,0.00008971056,0.00012196272,0.00006156709,0.00002399084,0.0028721346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939954,0.00019789202,0.000020667048,0.00006617758,0.00025316788,0.000062648745],"domain_scores_gemma":[0.9986204,0.0008139288,0.0001202564,0.000113852126,0.00030847444,0.000023151872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069565297,0.0005166122,0.00047955842,0.00034838167,0.00039569606,0.0006362704,0.0006388336,0.00059955445,0.0010628798],"category_scores_gemma":[0.0029958028,0.00017460492,0.00022625201,0.00051075546,0.0004961151,0.0006006578,0.00060027285,0.00062147365,0.0002831241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008341911,0.000039934563,0.000697011,0.00036325533,0.00003612352,0.0004741277,0.00022587863,0.8577591,0.014828338,0.071321994,0.0017772501,0.052393556],"study_design_scores_gemma":[0.0000025763304,0.000031712636,0.00010274307,0.0000140270295,0.0000053904364,0.00009915782,0.000019094796,0.9926514,0.0013807099,0.0046090144,0.001076732,0.0000075482176],"about_ca_topic_score_codex":0.0019659502,"about_ca_topic_score_gemma":0.0032078428,"teacher_disagreement_score":0.0019659502,"about_ca_system_score_codex":0.0008232398,"about_ca_system_score_gemma":0.0005302886,"threshold_uncertainty_score":0.0059731007},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9001376,0.00046654863,0.09361438,0.00014695329,0.000021318567,0.000022783404,0.00018539964,0.00030016803,0.0051048445],"genre_scores_gemma":[0.9983322,0.000058370246,0.0013891797,0.000006250474,0.0000031502757,0.0000036404178,0.000026187772,0.0000060346524,0.00017502901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989675,0.00031447408,0.000043868316,0.00010208174,0.00032618776,0.00024596034],"domain_scores_gemma":[0.9934095,0.004887625,0.00038694247,0.00035564398,0.00082315103,0.00013713533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012183534,0.00062228594,0.0007104601,0.00051678036,0.000538417,0.0007179904,0.0005105352,0.0005975813,0.0008111688],"category_scores_gemma":[0.006561259,0.00013963634,0.00023316854,0.00055768096,0.0009064003,0.00079116574,0.00081606786,0.00042873083,0.00016330673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005620521,0.00005638816,0.0033235734,0.00007974879,0.000047472455,0.00052830664,0.00021258052,0.95901763,0.0126136355,0.005142455,0.0005053151,0.017910784],"study_design_scores_gemma":[0.000012368616,0.00019751058,0.0013018716,0.0000069081107,0.000030033347,0.00024512166,0.00009866958,0.9916164,0.004609184,0.0017089889,0.00015551841,0.000017381288],"about_ca_topic_score_codex":0.0061107134,"about_ca_topic_score_gemma":0.0041586957,"teacher_disagreement_score":0.0061107134,"about_ca_system_score_codex":0.0013974633,"about_ca_system_score_gemma":0.00068763684,"threshold_uncertainty_score":0.012150347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036859788,0.00049378624,0.95006084,0.0009768639,0.00025260597,0.00044083712,0.00012157338,0.0007985491,0.009995196],"genre_scores_gemma":[0.89843714,0.00026664804,0.09491998,0.00044208998,0.0001426056,0.00039340323,0.00008328351,0.000056792032,0.005258111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763036,0.00076001993,0.000086664695,0.00040404292,0.0006237169,0.00049502763],"domain_scores_gemma":[0.99704665,0.0011234678,0.00047967024,0.00050803024,0.0003689299,0.00047326923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022020903,0.0007995521,0.0008537597,0.0008007468,0.001096951,0.001278677,0.0042523695,0.0017483999,0.0029210073],"category_scores_gemma":[0.004608207,0.00033180014,0.0005955884,0.0009700296,0.0010730932,0.0025127227,0.0033569068,0.0015908261,0.0003143888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008761675,0.0012390073,0.0027716106,0.0005454474,0.00027023745,0.0013178213,0.0006063293,0.3081187,0.04024304,0.41565365,0.022198142,0.2061599],"study_design_scores_gemma":[0.00013237646,0.00021528335,0.00045050576,0.000026009333,0.000055309538,0.00050985155,0.00007428133,0.9431919,0.0038465965,0.037864923,0.013560166,0.0000728289],"about_ca_topic_score_codex":0.0013993684,"about_ca_topic_score_gemma":0.0014174505,"teacher_disagreement_score":0.0042523695,"about_ca_system_score_codex":0.0011852065,"about_ca_system_score_gemma":0.0022689383,"threshold_uncertainty_score":0.011645913},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014827359,0.018701721,0.94791317,0.001907709,0.0005385813,0.000040695966,0.000096173826,0.00025816585,0.01571644],"genre_scores_gemma":[0.7581263,0.022739716,0.18520217,0.0008856418,0.0019691312,0.0003667524,0.0002711209,0.000091037975,0.03034818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950373,0.00020071898,0.000015062008,0.00006998926,0.00016023681,0.000050324863],"domain_scores_gemma":[0.99926645,0.00039889483,0.0000625508,0.00010303022,0.00014302845,0.000025967325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005579029,0.00052014133,0.00053679396,0.00043167017,0.0005367128,0.00084859726,0.00055724685,0.00080304645,0.0022155347],"category_scores_gemma":[0.002053597,0.00019471082,0.00022144194,0.0008825593,0.0006028331,0.00088663114,0.0009123786,0.0009069726,0.0008403127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012190996,0.000046226018,0.00043519126,0.00047386478,0.00007058952,0.0003369273,0.00022356692,0.2048133,0.011003597,0.5156291,0.019534979,0.24731077],"study_design_scores_gemma":[0.000021972746,0.000062126426,0.00028577528,0.00006264607,0.00002066108,0.00023798329,0.000034105386,0.5639494,0.0014876723,0.40716866,0.026638797,0.000030183266],"about_ca_topic_score_codex":0.0005064105,"about_ca_topic_score_gemma":0.000876653,"teacher_disagreement_score":0.0022155347,"about_ca_system_score_codex":0.00074525946,"about_ca_system_score_gemma":0.00044043493,"threshold_uncertainty_score":0.0074117184},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15763265,0.010907975,0.81017375,0.0012933955,0.000112434274,0.00004123567,0.000069368834,0.0001690835,0.019600078],"genre_scores_gemma":[0.9735971,0.0032387127,0.020563586,0.00011126739,0.00021766304,0.000060512455,0.00002048859,0.00002617733,0.0021645115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993772,0.00032192733,0.0000124967455,0.00005682994,0.00017596004,0.00005559777],"domain_scores_gemma":[0.9972077,0.0021174336,0.0002977904,0.00015263495,0.00017488004,0.000049509952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009679778,0.0005258346,0.0004920991,0.000372024,0.0004254989,0.00079973985,0.00058606226,0.0011163679,0.00057071185],"category_scores_gemma":[0.0036019993,0.00031108377,0.00024259131,0.0007159799,0.0013391727,0.0013346793,0.0005271728,0.00065013213,0.00013775549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070415,0.00005404459,0.00067386957,0.00020907154,0.000038756978,0.0005435944,0.0003935127,0.6940192,0.0124824485,0.26526856,0.0012803107,0.024966253],"study_design_scores_gemma":[0.000014818703,0.00014424638,0.0006021822,0.000025507858,0.000017853727,0.00027662455,0.00007646933,0.83349615,0.0020257903,0.16136792,0.0019237548,0.000028659571],"about_ca_topic_score_codex":0.0007791789,"about_ca_topic_score_gemma":0.0007522388,"teacher_disagreement_score":0.0011163679,"about_ca_system_score_codex":0.00059422135,"about_ca_system_score_gemma":0.00042238066,"threshold_uncertainty_score":0.0051192045},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1589002,0.0033137305,0.8115131,0.0010497688,0.00015347087,0.000062725965,0.00020143029,0.0003569404,0.024448555],"genre_scores_gemma":[0.97151864,0.0017781337,0.021680705,0.00012725664,0.00009393166,0.00009920489,0.00012114425,0.000086084976,0.0044949106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983931,0.00047701006,0.00006598861,0.00021784374,0.0005962879,0.00024975694],"domain_scores_gemma":[0.99142444,0.0061772116,0.0006562076,0.00041019588,0.0012248569,0.00010706284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023975645,0.0012657619,0.0012935337,0.0011715919,0.00072478154,0.0017327978,0.000917043,0.0014061454,0.0023002743],"category_scores_gemma":[0.0134136705,0.00029910146,0.0004887296,0.00075553055,0.0015463582,0.0021679034,0.0012552888,0.0014051502,0.0004543469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002170853,0.000041356445,0.00090969267,0.00033943588,0.00006164391,0.00034175668,0.00033897263,0.82787526,0.015177429,0.1391843,0.0012521576,0.014260929],"study_design_scores_gemma":[0.0000075103912,0.00005828287,0.00036164213,0.00004535591,0.000018522302,0.00017369098,0.000054244898,0.9798019,0.002956721,0.016067116,0.00043032,0.00002466913],"about_ca_topic_score_codex":0.0018625443,"about_ca_topic_score_gemma":0.0009895199,"teacher_disagreement_score":0.0023975645,"about_ca_system_score_codex":0.0015575872,"about_ca_system_score_gemma":0.0009613086,"threshold_uncertainty_score":0.012679696},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025341354,0.00080995826,0.971723,0.00013799248,0.000041773594,0.000047556354,0.000015637215,0.00019036153,0.0016924067],"genre_scores_gemma":[0.8181867,0.0009625137,0.17683628,0.00016037704,0.00006433446,0.00016009538,0.00005515406,0.000050702263,0.00352373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993723,0.00021703147,0.000028103603,0.00008474155,0.00023270248,0.0000651205],"domain_scores_gemma":[0.9992299,0.00037420404,0.00010749316,0.00010523757,0.00016122605,0.000021938065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011368954,0.00057564094,0.00049221027,0.0005198244,0.0004664784,0.00068438554,0.0015424907,0.0006030466,0.0005375532],"category_scores_gemma":[0.0016298596,0.00030232014,0.00035979596,0.00056917337,0.0005904047,0.0012636948,0.00086177594,0.0004916122,0.00018924297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007969023,0.00010985837,0.0005687489,0.00014950229,0.00007852849,0.00015971863,0.00022887676,0.854179,0.023338327,0.04146834,0.0011838274,0.07845558],"study_design_scores_gemma":[0.000012614337,0.00011507362,0.00012553917,0.0000063435823,0.000020552305,0.00007765715,0.000030465431,0.98635,0.0035233994,0.008064853,0.0016609794,0.000012622158],"about_ca_topic_score_codex":0.001142487,"about_ca_topic_score_gemma":0.0022810823,"teacher_disagreement_score":0.0015424907,"about_ca_system_score_codex":0.00049187284,"about_ca_system_score_gemma":0.0007007178,"threshold_uncertainty_score":0.006012559},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2210469,0.0017644999,0.76888794,0.0002835412,0.000068320456,0.000051960047,0.000062036095,0.00026540662,0.0075693405],"genre_scores_gemma":[0.9686357,0.0005261689,0.02946097,0.000032018517,0.000022887598,0.000024197163,0.000027594893,0.000011274425,0.0012591477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995975,0.00013900234,0.000011164215,0.00003631422,0.00015507083,0.000061029208],"domain_scores_gemma":[0.9988576,0.00074523495,0.00009126291,0.00008003099,0.00020909024,0.000016863405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010455736,0.0003652601,0.0004947749,0.0002054997,0.0002357174,0.00049020717,0.0002940547,0.00050092256,0.0014065023],"category_scores_gemma":[0.0021425793,0.00013428947,0.00026009863,0.0003145597,0.00031678856,0.00071715174,0.00031641097,0.0003917356,0.00030249744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025899583,0.00007637817,0.0015086478,0.00017716977,0.0000692856,0.00022505468,0.00016327779,0.9009425,0.030528452,0.027178414,0.00071270403,0.038159072],"study_design_scores_gemma":[0.000008977363,0.00007849436,0.00029827832,0.0000062786958,0.00000980717,0.000057937596,0.00001788552,0.9934522,0.0037502695,0.0019678136,0.00034358742,0.000008528812],"about_ca_topic_score_codex":0.001679841,"about_ca_topic_score_gemma":0.0017726759,"teacher_disagreement_score":0.001679841,"about_ca_system_score_codex":0.00059068453,"about_ca_system_score_gemma":0.000500384,"threshold_uncertainty_score":0.0055295825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31656775,0.0034954448,0.62407047,0.0016980072,0.0001568576,0.00007898881,0.0005917125,0.00042520597,0.052915532],"genre_scores_gemma":[0.9841957,0.0010065712,0.012173912,0.00016954931,0.00006597564,0.00008298022,0.000094250485,0.00003609834,0.0021751106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986557,0.00044678507,0.000037858732,0.0001714574,0.00035229442,0.00033597884],"domain_scores_gemma":[0.9941426,0.0042930036,0.00033998743,0.000498638,0.00061756937,0.000108161235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001649498,0.00069179304,0.0010079478,0.00073661347,0.00053107087,0.0018100138,0.0011120087,0.0009949764,0.0023234875],"category_scores_gemma":[0.008744347,0.00025605963,0.00040774894,0.0010232939,0.0027892338,0.0029566092,0.0014978425,0.00092912104,0.00041619185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024032884,0.000035296667,0.0002621014,0.00015266983,0.000041908756,0.00018836914,0.00019183634,0.58560765,0.004301214,0.39511874,0.0018552941,0.012004551],"study_design_scores_gemma":[0.00002468862,0.00007713315,0.00023858382,0.00005326942,0.000020780548,0.00022721059,0.00008452237,0.84993553,0.0027668425,0.14501005,0.001522733,0.000038587783],"about_ca_topic_score_codex":0.0021435816,"about_ca_topic_score_gemma":0.0008732342,"teacher_disagreement_score":0.0023234875,"about_ca_system_score_codex":0.001985458,"about_ca_system_score_gemma":0.0016438774,"threshold_uncertainty_score":0.014405608},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22323324,0.0017160765,0.75503385,0.00035774088,0.00005054319,0.00005031249,0.00028049402,0.00027012636,0.019007694],"genre_scores_gemma":[0.9819233,0.000622453,0.015805988,0.000037174817,0.000026325744,0.00008270806,0.00007727139,0.00003097252,0.0013938835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886864,0.00034518406,0.000041587675,0.000114582006,0.0003911597,0.00023884427],"domain_scores_gemma":[0.9959841,0.0029735835,0.00023714823,0.00028398118,0.0004284799,0.00009273185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013911705,0.0008453199,0.00071563304,0.0011133193,0.0005038984,0.0016036716,0.0012570514,0.0006133033,0.0015807443],"category_scores_gemma":[0.0055653392,0.0003758624,0.00029683733,0.00089970016,0.0014715189,0.0022195124,0.0012007876,0.0005556454,0.00027076426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011307926,0.000029299561,0.00026060652,0.00009919896,0.00003250055,0.00020372501,0.00010229732,0.8733099,0.009633454,0.10632197,0.0005002684,0.009393653],"study_design_scores_gemma":[0.00000810614,0.000029880823,0.00008944115,0.00001739819,0.000014575213,0.000077006676,0.000022540757,0.9660738,0.0028908313,0.030084303,0.00067884446,0.000013379381],"about_ca_topic_score_codex":0.0013323792,"about_ca_topic_score_gemma":0.0010289688,"teacher_disagreement_score":0.0017502768,"about_ca_system_score_codex":0.0017502768,"about_ca_system_score_gemma":0.0012331564,"threshold_uncertainty_score":0.012699187},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14080238,0.00038467694,0.8541895,0.00037955426,0.0001213108,0.00023130182,0.000024443078,0.0009594484,0.0029073516],"genre_scores_gemma":[0.95607185,0.00009544965,0.04276125,0.00010454051,0.000036856574,0.000090558155,0.000010500588,0.000011737446,0.0008172923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988463,0.0004048144,0.0000850677,0.00021018526,0.00033493916,0.00011877235],"domain_scores_gemma":[0.99722844,0.00088289095,0.0006977026,0.0005091743,0.00047779706,0.00020397849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016124094,0.0005492844,0.00058209384,0.0006862025,0.0005352602,0.000623887,0.0014597859,0.0007986284,0.00051845296],"category_scores_gemma":[0.0040779114,0.00022613705,0.00033906428,0.00030273027,0.0008431753,0.0012561673,0.00097221875,0.00072005467,0.0001322625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011139568,0.0011720804,0.009205179,0.0004874002,0.00041271455,0.0012423088,0.0008401149,0.272753,0.2193832,0.07295217,0.0035453287,0.41689256],"study_design_scores_gemma":[0.00012400406,0.0012358143,0.0026307867,0.00002988994,0.00012919493,0.00064101315,0.00007311267,0.95076334,0.028233824,0.013227316,0.0028229079,0.000088771514],"about_ca_topic_score_codex":0.00045235467,"about_ca_topic_score_gemma":0.0005112228,"teacher_disagreement_score":0.0016124094,"about_ca_system_score_codex":0.00051443826,"about_ca_system_score_gemma":0.0006614049,"threshold_uncertainty_score":0.0085273385},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06827378,0.00022068666,0.92846984,0.00017784699,0.000018922463,0.00005629853,0.00007131299,0.00010697041,0.0026043437],"genre_scores_gemma":[0.8119369,0.00032259044,0.18593383,0.00009789204,0.000011877125,0.0001772454,0.00011256725,0.000031542026,0.0013755978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957067,0.00016699043,0.000016591202,0.000052957694,0.00014308057,0.0000497454],"domain_scores_gemma":[0.99889296,0.0005629926,0.0001630804,0.00011009511,0.00022661083,0.000044257424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006208997,0.0004363009,0.00043965512,0.00034526768,0.0003120465,0.00069411926,0.0006655545,0.0006037735,0.00064853765],"category_scores_gemma":[0.0022028217,0.0003379812,0.0003021415,0.00037516133,0.0007834514,0.0006344891,0.00074484263,0.0005626458,0.00019765373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013949718,0.00006622846,0.0008600985,0.00015098296,0.000051687355,0.00018307868,0.00019101329,0.8242597,0.031109575,0.10913828,0.0009670399,0.03288287],"study_design_scores_gemma":[0.000018168179,0.000033416425,0.000072304036,0.000007773505,0.0000053923923,0.000043642674,0.000012055547,0.98589766,0.0042153066,0.009252257,0.00043263478,0.000009391807],"about_ca_topic_score_codex":0.0008421218,"about_ca_topic_score_gemma":0.0010131216,"teacher_disagreement_score":0.0008421218,"about_ca_system_score_codex":0.000804082,"about_ca_system_score_gemma":0.0013331091,"threshold_uncertainty_score":0.005834043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039497998,0.0003392433,0.9584356,0.00015067654,0.000021850678,0.000025339328,0.000014418635,0.00009301379,0.0014218197],"genre_scores_gemma":[0.8830133,0.0002698142,0.11546771,0.000063229054,0.000037782807,0.000087292625,0.000029530676,0.000015884758,0.0010155237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992981,0.00043943455,0.000017166254,0.00007597865,0.00011134182,0.000057887566],"domain_scores_gemma":[0.99932384,0.00044481189,0.00007249885,0.000064177155,0.0000730442,0.00002157223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012846868,0.00034252883,0.00043416736,0.0004067842,0.00045075323,0.00043937043,0.00077064155,0.0006216958,0.0005607599],"category_scores_gemma":[0.002594622,0.00019883303,0.00027856854,0.0004206861,0.00048026725,0.00068315427,0.00062969944,0.00031101765,0.00011892261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027484022,0.0000694316,0.0011631924,0.00016503652,0.0000891755,0.0004943082,0.00050030835,0.78645194,0.027922047,0.08671203,0.0025370626,0.0936206],"study_design_scores_gemma":[0.000017338809,0.000077155455,0.00013177047,0.0000064841884,0.000018908571,0.000060050468,0.000042234868,0.98769134,0.0024294883,0.008498582,0.0010183967,0.000008231006],"about_ca_topic_score_codex":0.0011225492,"about_ca_topic_score_gemma":0.0012900303,"teacher_disagreement_score":0.0012846868,"about_ca_system_score_codex":0.0005365343,"about_ca_system_score_gemma":0.00044230578,"threshold_uncertainty_score":0.0067941546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026460966,0.0006773287,0.96583205,0.00020217644,0.00001332724,0.00008734006,0.0001906209,0.00021548782,0.0063206],"genre_scores_gemma":[0.735856,0.0015185503,0.25769675,0.00016286658,0.000077736986,0.0005569261,0.00034652083,0.00023015273,0.0035545507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979233,0.0010228677,0.00008516369,0.00022665485,0.00046827752,0.00027373503],"domain_scores_gemma":[0.9881642,0.009579588,0.0009699429,0.0003213943,0.0007648493,0.00020001669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040581194,0.0018799414,0.0015212724,0.0013313905,0.000644141,0.0022143237,0.0018031115,0.0013364817,0.0023897816],"category_scores_gemma":[0.01403417,0.00060413475,0.00091362384,0.001050608,0.0016862545,0.0023849527,0.0017503236,0.0014599605,0.0007946339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018268192,0.00006732546,0.00040854103,0.00019206255,0.000041758223,0.00014844359,0.0002068587,0.8878373,0.0046928795,0.09080339,0.00083123165,0.014587499],"study_design_scores_gemma":[0.000019243791,0.0000681925,0.0001261494,0.000033454264,0.000012551189,0.00008024794,0.00003961257,0.9677665,0.0022302386,0.029018346,0.0005875196,0.000017904233],"about_ca_topic_score_codex":0.0010627942,"about_ca_topic_score_gemma":0.0006865957,"teacher_disagreement_score":0.0040581194,"about_ca_system_score_codex":0.0022006878,"about_ca_system_score_gemma":0.0011259902,"threshold_uncertainty_score":0.021461666},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025969323,0.00012740443,0.9708166,0.00010270708,0.000036301986,0.000057986683,0.00007668943,0.00048148033,0.002331374],"genre_scores_gemma":[0.27867246,0.00021100894,0.71289635,0.00012012727,0.0000697989,0.00014355374,0.00044614967,0.0001251105,0.0073153754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935466,0.00016425329,0.000043264805,0.00009341634,0.00024518804,0.00009928066],"domain_scores_gemma":[0.99936503,0.00023239141,0.00007616228,0.00012340484,0.0001750107,0.000028030965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005335904,0.00060428906,0.00062106096,0.00062335737,0.00044070015,0.0007269837,0.0005692629,0.0007545333,0.0023746735],"category_scores_gemma":[0.0016730321,0.00019964042,0.00040419318,0.0006244024,0.000450251,0.0008696375,0.0010335344,0.0007201792,0.0012048784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046481926,0.00012134125,0.001182938,0.00017337922,0.000076032244,0.0003706295,0.0006307649,0.20864785,0.08335542,0.14155646,0.0053136447,0.5581067],"study_design_scores_gemma":[0.000106158994,0.00021865893,0.00035717583,0.00002354471,0.000022081662,0.00045718133,0.0000680324,0.9003878,0.038891826,0.052170526,0.007248831,0.000048137135],"about_ca_topic_score_codex":0.0010487989,"about_ca_topic_score_gemma":0.0012184415,"teacher_disagreement_score":0.0023746735,"about_ca_system_score_codex":0.00044869375,"about_ca_system_score_gemma":0.0011570294,"threshold_uncertainty_score":0.007944107},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033345394,0.0005124514,0.9622731,0.00015029924,0.000024950452,0.000034636567,0.000056788347,0.00009252438,0.0035098607],"genre_scores_gemma":[0.9370438,0.0005808044,0.05960447,0.00006619689,0.00003915981,0.0001112909,0.00007580042,0.000029050689,0.0024494356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999686,0.00011280802,0.00000866775,0.000049741742,0.00007719398,0.0000655518],"domain_scores_gemma":[0.99976367,0.00012595023,0.000032981843,0.00002325392,0.00003590879,0.000018208488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040169197,0.00047686644,0.0005029991,0.00029567,0.00038968597,0.0007938115,0.00071793876,0.00050129514,0.0008007849],"category_scores_gemma":[0.0010419352,0.00031892344,0.0002504648,0.0005321357,0.00040833693,0.0007037423,0.0005992431,0.00050392846,0.00018357755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026456486,0.000024272023,0.00023483079,0.000036886348,0.000011419014,0.00005483877,0.000038675,0.96384954,0.0020722917,0.013060721,0.00054666377,0.020043517],"study_design_scores_gemma":[0.0000021859576,0.000009383543,0.00004522324,0.0000015447545,0.0000021263622,0.000008702799,0.000008234861,0.9968657,0.00025172505,0.0025658233,0.00023697386,0.0000022441538],"about_ca_topic_score_codex":0.0037178244,"about_ca_topic_score_gemma":0.0036025364,"teacher_disagreement_score":0.0037178244,"about_ca_system_score_codex":0.0010119524,"about_ca_system_score_gemma":0.0006884148,"threshold_uncertainty_score":0.007392347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009008509,0.00033511632,0.9892356,0.00007851046,0.000024152256,0.00001623714,0.00000884604,0.000038095815,0.0012549399],"genre_scores_gemma":[0.7039421,0.0010943541,0.29234266,0.0000998274,0.0001136967,0.00011979391,0.000044377633,0.000014885059,0.0022282505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961156,0.00013115881,0.00001733316,0.00006072827,0.00014683684,0.000032445634],"domain_scores_gemma":[0.99937004,0.00033147255,0.000085571,0.00007765387,0.00012006708,0.0000151849445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039210008,0.00041688516,0.00031361645,0.00023223115,0.00024150687,0.00048469732,0.0004000123,0.00050951046,0.0004954736],"category_scores_gemma":[0.0015114149,0.00015836462,0.00024703823,0.0003666313,0.00042457506,0.00048527564,0.00037820626,0.00045712828,0.00018765566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014538912,0.000073196796,0.0008516068,0.00024497102,0.000059678387,0.00046332178,0.00028733345,0.59224373,0.071332805,0.10251138,0.0015015414,0.23028497],"study_design_scores_gemma":[0.000021606904,0.00021693343,0.00019250752,0.000019427185,0.000014936406,0.00021270875,0.00003143588,0.9738444,0.0074471133,0.015290565,0.002694226,0.000014275219],"about_ca_topic_score_codex":0.00044942187,"about_ca_topic_score_gemma":0.00086668803,"teacher_disagreement_score":0.00050951046,"about_ca_system_score_codex":0.00038023997,"about_ca_system_score_gemma":0.00045030421,"threshold_uncertainty_score":0.002758801},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06934436,0.001005808,0.9239375,0.00027685714,0.00008917983,0.00009741438,0.000062416766,0.00027946904,0.004906945],"genre_scores_gemma":[0.9282814,0.0005951814,0.06923149,0.00006906563,0.000026990523,0.0001382415,0.00005682257,0.00001858589,0.0015821905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995883,0.00011586415,0.000013767733,0.000030682004,0.00020769903,0.000043642623],"domain_scores_gemma":[0.99870694,0.0006977252,0.00014399602,0.000113142836,0.00030673743,0.000031517182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081281224,0.0002589646,0.00025543568,0.00054560445,0.000447386,0.00042491377,0.0006908384,0.00044050338,0.0005638234],"category_scores_gemma":[0.002615277,0.0001333877,0.00027060194,0.0004905031,0.0006523833,0.00048446862,0.0005672911,0.00037414805,0.00011362766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007322739,0.00004606543,0.0006580058,0.00009490943,0.000024687635,0.0001526037,0.00016415998,0.84637344,0.007132209,0.09138998,0.0016276082,0.052262995],"study_design_scores_gemma":[0.0000079823885,0.000040514722,0.00007110874,0.00000755704,0.00000573718,0.00003861785,0.000009454753,0.98779917,0.0010874341,0.009931463,0.0009920672,0.00000898259],"about_ca_topic_score_codex":0.0067065503,"about_ca_topic_score_gemma":0.007594982,"teacher_disagreement_score":0.0067065503,"about_ca_system_score_codex":0.00091250724,"about_ca_system_score_gemma":0.0014402337,"threshold_uncertainty_score":0.01333499},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62017417,0.004281497,0.35464317,0.0011658751,0.00018394963,0.00013721174,0.00029214832,0.0005556035,0.018566435],"genre_scores_gemma":[0.9903572,0.00032393035,0.008307336,0.000043712833,0.000010807619,0.000011690058,0.000030240386,0.0000071741633,0.00090777193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879456,0.0004807866,0.00004844237,0.0001510462,0.00027361317,0.00025150715],"domain_scores_gemma":[0.9968119,0.0020238475,0.0003000117,0.0003294481,0.00045388768,0.000080777725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002197,0.0010356703,0.0010134093,0.0005572511,0.00072523305,0.0010073935,0.00085683906,0.0014090945,0.0015328045],"category_scores_gemma":[0.0040858844,0.0002260474,0.0004270251,0.00060950674,0.0013101676,0.0012461565,0.0013544268,0.00070137315,0.00018279749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012302195,0.00010369554,0.002493159,0.00034868586,0.00023214155,0.00062566355,0.00059073966,0.8440059,0.042617712,0.048120935,0.0014508798,0.058180276],"study_design_scores_gemma":[0.000058033853,0.0005736657,0.000700121,0.000025413628,0.00007179262,0.00053331576,0.00009672294,0.9773496,0.011334657,0.008480006,0.0007174023,0.000059322214],"about_ca_topic_score_codex":0.004481012,"about_ca_topic_score_gemma":0.0033110233,"teacher_disagreement_score":0.004481012,"about_ca_system_score_codex":0.0009676482,"about_ca_system_score_gemma":0.000989336,"threshold_uncertainty_score":0.011618972},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02576555,0.00074188714,0.9689433,0.00012963294,0.000032318087,0.000040127063,0.000038156493,0.000113967704,0.0041951817],"genre_scores_gemma":[0.92496425,0.0010120528,0.07112231,0.00006262596,0.00005602219,0.00009777956,0.00003095477,0.000012505415,0.0026414674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991887,0.00039183922,0.000030557163,0.00008317254,0.00021690389,0.00008870185],"domain_scores_gemma":[0.9988887,0.00067997095,0.00015284763,0.00009611073,0.00015512024,0.000027254051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009672546,0.0012656944,0.0007422645,0.0003907657,0.00039726176,0.00095905305,0.00079343,0.00076036766,0.00095809146],"category_scores_gemma":[0.0015644075,0.00037400948,0.00052572484,0.0007190953,0.00064619957,0.0009102572,0.0005821535,0.0005059738,0.00034507568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009788516,0.000045571564,0.00070123636,0.0001329046,0.00006744649,0.00035631962,0.00012250883,0.9131162,0.011804092,0.041278474,0.00076158455,0.031515732],"study_design_scores_gemma":[0.00000942681,0.00007375612,0.0001240212,0.0000054459733,0.000019420744,0.00017725988,0.000016858365,0.9926724,0.0014979414,0.00494163,0.0004507581,0.000011035173],"about_ca_topic_score_codex":0.0008793955,"about_ca_topic_score_gemma":0.001172388,"teacher_disagreement_score":0.0012656944,"about_ca_system_score_codex":0.0006694184,"about_ca_system_score_gemma":0.0003866249,"threshold_uncertainty_score":0.00511539},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016330225,0.00035648493,0.9805517,0.00014799152,0.000013429809,0.000034407993,0.000030813575,0.00006272538,0.002472201],"genre_scores_gemma":[0.81650627,0.0010597915,0.17743373,0.0001033092,0.00004587165,0.0003040866,0.00009065315,0.000058894693,0.004397413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995041,0.00023688971,0.000017797387,0.00007092858,0.000109722954,0.00006056484],"domain_scores_gemma":[0.9991918,0.000593328,0.000082798615,0.0000261995,0.00008336012,0.000022499516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001052549,0.001011314,0.0008541449,0.00043155023,0.0002935911,0.0009787962,0.0005522336,0.0010513784,0.0009904918],"category_scores_gemma":[0.0023066325,0.00058879564,0.00058031926,0.0008847543,0.0007739991,0.0008512898,0.00082259683,0.0006361815,0.00019995817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000221219,0.000014338572,0.00014297833,0.00003948751,0.00001562474,0.000034226618,0.00002242142,0.9847633,0.00090870814,0.006179345,0.00021283727,0.007644581],"study_design_scores_gemma":[0.0000047854132,0.000015302054,0.000031951702,0.000002234002,0.0000035239086,0.000006811934,0.0000059682343,0.997378,0.00025989473,0.0021541747,0.00013498781,0.0000024068079],"about_ca_topic_score_codex":0.0035941254,"about_ca_topic_score_gemma":0.0032980717,"teacher_disagreement_score":0.0035941254,"about_ca_system_score_codex":0.0010475847,"about_ca_system_score_gemma":0.0011083727,"threshold_uncertainty_score":0.0076007843},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07779842,0.00025322332,0.91815746,0.00015468548,0.00006716152,0.00009901749,0.0000526802,0.00019996818,0.003217475],"genre_scores_gemma":[0.9373351,0.0001081601,0.061344862,0.000033259606,0.00003375905,0.00011041471,0.000055075547,0.00002364168,0.000955819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992568,0.0002164764,0.000034806988,0.00011828885,0.00022269621,0.00015093721],"domain_scores_gemma":[0.9979305,0.0011165898,0.00024626357,0.00018971808,0.0003895655,0.00012734372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010905873,0.00066715776,0.00060208177,0.00047368405,0.0008280018,0.0007134726,0.0012546184,0.00039501445,0.001210095],"category_scores_gemma":[0.0033318202,0.0003156153,0.00028008918,0.001018681,0.0005640284,0.00068922684,0.0007896804,0.000561418,0.00017104443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022142212,0.00009271633,0.0005067625,0.00007836381,0.000023011447,0.00019784897,0.00016545758,0.91341263,0.009761411,0.018703127,0.0014538504,0.055383477],"study_design_scores_gemma":[0.000012682597,0.000028353174,0.000038170467,0.0000017204984,0.0000034233003,0.000018506258,0.000012305954,0.99658245,0.0008565731,0.002129981,0.00031230922,0.000003593505],"about_ca_topic_score_codex":0.0052615735,"about_ca_topic_score_gemma":0.005637975,"teacher_disagreement_score":0.0052615735,"about_ca_system_score_codex":0.0010081807,"about_ca_system_score_gemma":0.0018838968,"threshold_uncertainty_score":0.010461867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023844568,0.00046925634,0.99427783,0.00009043699,0.000044605054,0.000012790706,0.000027415823,0.00009886121,0.0025943418],"genre_scores_gemma":[0.45505545,0.003792603,0.5216842,0.00037677714,0.00037448588,0.0003588924,0.00032811958,0.00056785217,0.0174616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971384,0.00007685426,0.000011717808,0.00002772694,0.00014104463,0.000028822738],"domain_scores_gemma":[0.9992403,0.00042234597,0.000054715732,0.00010380786,0.00015474955,0.0000242196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008721797,0.0007322085,0.00050438044,0.0010812171,0.00028073962,0.0007105075,0.0008865057,0.0008131035,0.003275421],"category_scores_gemma":[0.0034364492,0.00021964156,0.0006653456,0.00097556744,0.00084196054,0.001551731,0.0006110679,0.0015481757,0.0009004059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041603944,0.000033899072,0.00029791822,0.00017155713,0.000027940916,0.00015424429,0.0001652138,0.30679074,0.008395124,0.58924764,0.003994565,0.09067947],"study_design_scores_gemma":[0.000006225769,0.00001464084,0.000085197156,0.000016898206,0.000003656951,0.00009503804,0.000013712279,0.9155983,0.00075650314,0.07947909,0.0039183665,0.000012460846],"about_ca_topic_score_codex":0.0021646824,"about_ca_topic_score_gemma":0.00081984926,"teacher_disagreement_score":0.003275421,"about_ca_system_score_codex":0.0008331128,"about_ca_system_score_gemma":0.00093814323,"threshold_uncertainty_score":0.01095736},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041118108,0.00023269624,0.95389867,0.0004031262,0.000029826333,0.000040451123,0.000079505415,0.00013080241,0.0040668934],"genre_scores_gemma":[0.88392943,0.0006093841,0.11180016,0.00025415086,0.00007946935,0.00015890633,0.00019738641,0.000081328624,0.00288984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981364,0.0007078862,0.00005517901,0.00022411552,0.00066540856,0.00021099937],"domain_scores_gemma":[0.9920271,0.0058803656,0.00068424136,0.0006652701,0.0006081401,0.00013495464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027056143,0.00069504295,0.0006853163,0.00058131624,0.0003267836,0.0011284879,0.0010623788,0.0008708917,0.0018260924],"category_scores_gemma":[0.018918151,0.0003519635,0.00042284172,0.00075695856,0.0023607835,0.0028631699,0.0015129736,0.0016660176,0.00028619738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025033107,0.00005243182,0.000802252,0.00019913948,0.000029925795,0.00018912007,0.0003109451,0.62470376,0.009290316,0.34003443,0.00097164843,0.023165582],"study_design_scores_gemma":[0.000014820914,0.000050373255,0.00015733996,0.000010291124,0.000004061314,0.0000497451,0.00003839691,0.9364304,0.0023156311,0.060562074,0.00035551479,0.000011372806],"about_ca_topic_score_codex":0.0016555476,"about_ca_topic_score_gemma":0.00093900436,"teacher_disagreement_score":0.0027056143,"about_ca_system_score_codex":0.0010839088,"about_ca_system_score_gemma":0.0010362269,"threshold_uncertainty_score":0.01430887},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29275295,0.0028834075,0.67737484,0.0007238593,0.000095079704,0.000094232884,0.0002798092,0.0003836374,0.025412256],"genre_scores_gemma":[0.99007726,0.0007586476,0.007645778,0.000048342594,0.00003479238,0.00002802309,0.000044563367,0.00002169808,0.0013407685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998502,0.0006166896,0.00003899613,0.0001227389,0.00048684815,0.0002327443],"domain_scores_gemma":[0.9944606,0.0037508216,0.00053424994,0.0003187063,0.0008396576,0.00009590968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020127955,0.0013254377,0.0006826141,0.00080305827,0.00047535152,0.0012355079,0.0007930229,0.00094097474,0.0016079381],"category_scores_gemma":[0.006918238,0.00034213424,0.0005660429,0.0007721845,0.001243288,0.0011351228,0.001043301,0.0007129473,0.0003393804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022033426,0.00003844939,0.0015343695,0.00013364523,0.0000713279,0.00035072063,0.0001333865,0.933279,0.009211922,0.043421444,0.00050183194,0.011103627],"study_design_scores_gemma":[0.0000039921288,0.000079911595,0.00040673063,0.000014509344,0.000019510457,0.00013643551,0.000026818518,0.9932355,0.0022333937,0.0036281163,0.00020282106,0.000012273706],"about_ca_topic_score_codex":0.0019760074,"about_ca_topic_score_gemma":0.0011719944,"teacher_disagreement_score":0.0020127955,"about_ca_system_score_codex":0.0015571008,"about_ca_system_score_gemma":0.000840802,"threshold_uncertainty_score":0.011297584},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002287362,0.00022390061,0.992572,0.00006069947,0.000041168176,0.00003224736,0.000047993883,0.00016649168,0.004568145],"genre_scores_gemma":[0.46156394,0.0012663179,0.52042675,0.00021685768,0.0003158765,0.00031712765,0.00027762825,0.00015550885,0.01546003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992649,0.0001924655,0.000027870894,0.00007987404,0.0003285612,0.000106390245],"domain_scores_gemma":[0.99939024,0.00027471475,0.000031157666,0.00011754621,0.00015404502,0.00003219286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008958662,0.0013530569,0.0010212954,0.00045634984,0.0006227514,0.0017244887,0.0021960365,0.0012007899,0.006007478],"category_scores_gemma":[0.0012662708,0.00045698255,0.0007175243,0.00076080905,0.00062498293,0.0015223064,0.0014581708,0.0012803625,0.0020145483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017249008,0.00014118891,0.0002608485,0.00025972526,0.00009254592,0.0003034299,0.00016825976,0.57547206,0.026461495,0.27643922,0.0051454473,0.11508331],"study_design_scores_gemma":[0.000010688194,0.000040468374,0.000032388252,0.000008642103,0.0000148183435,0.00007917755,0.000009609753,0.97488856,0.0016326644,0.02122347,0.002041392,0.000018050208],"about_ca_topic_score_codex":0.0016379678,"about_ca_topic_score_gemma":0.0036167486,"teacher_disagreement_score":0.006007478,"about_ca_system_score_codex":0.0007571786,"about_ca_system_score_gemma":0.0010622992,"threshold_uncertainty_score":0.020097077},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04548602,0.0034537162,0.9380219,0.00034091732,0.00015579586,0.000101154634,0.00007292777,0.0002701844,0.012097397],"genre_scores_gemma":[0.93093866,0.0017465105,0.063584045,0.00011057594,0.000079113735,0.00010032035,0.00006156608,0.000010421995,0.0033688236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970824,0.0000956715,0.000016539989,0.00004793775,0.00009477944,0.00003676388],"domain_scores_gemma":[0.9995272,0.00023829709,0.0000546629,0.000067934554,0.00010005007,0.000011755643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000367317,0.0003607941,0.00026757515,0.00033753348,0.0002703286,0.00046264613,0.00080303155,0.0005711595,0.0010416157],"category_scores_gemma":[0.0013953747,0.0001040869,0.00023912989,0.00038624695,0.00029812183,0.0004102607,0.0003168381,0.0004094798,0.00028004457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024122698,0.00012095774,0.0008748799,0.00040806152,0.00011110116,0.00078302575,0.00028511582,0.35595515,0.05793748,0.22223409,0.007143592,0.35390526],"study_design_scores_gemma":[0.000035150788,0.00017407915,0.00037278765,0.00002385536,0.000040219333,0.00045718325,0.000030749692,0.9440506,0.0045917733,0.040545557,0.009648945,0.000029180488],"about_ca_topic_score_codex":0.0010939019,"about_ca_topic_score_gemma":0.0013339791,"teacher_disagreement_score":0.0010939019,"about_ca_system_score_codex":0.00043536985,"about_ca_system_score_gemma":0.0003862699,"threshold_uncertainty_score":0.0034845471},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059629727,0.0015113504,0.92055315,0.0004940229,0.000050954204,0.000055697892,0.000092662165,0.00012956992,0.017482901],"genre_scores_gemma":[0.96009254,0.0015355574,0.03346174,0.00022742567,0.00013765546,0.00016734585,0.0000990449,0.00009366487,0.0041850135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757904,0.0011947036,0.000045977835,0.00022229177,0.00059055205,0.00036742666],"domain_scores_gemma":[0.99236804,0.0050826557,0.00063536473,0.00031279813,0.001359393,0.00024179745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032287994,0.0015134613,0.0013343641,0.001349629,0.00091657304,0.001879292,0.0014089879,0.0012173471,0.0020364851],"category_scores_gemma":[0.011064493,0.00053050753,0.0007469719,0.0014152661,0.0023786228,0.002260485,0.0021631606,0.0012328805,0.00055105734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010308017,0.00003771561,0.00079241977,0.00012029993,0.00007885933,0.0002393527,0.00025488826,0.79998225,0.004776203,0.18325207,0.0013070083,0.0090559125],"study_design_scores_gemma":[0.000009712964,0.000054044533,0.00018302813,0.000020979243,0.00001589981,0.00008612275,0.000054605505,0.95515406,0.00074914494,0.043195393,0.0004603508,0.000016684102],"about_ca_topic_score_codex":0.0020145013,"about_ca_topic_score_gemma":0.00092075835,"teacher_disagreement_score":0.0032287994,"about_ca_system_score_codex":0.0023482565,"about_ca_system_score_gemma":0.0012472062,"threshold_uncertainty_score":0.017075717},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43126273,0.0007617954,0.56013554,0.00013114623,0.00003054388,0.00006475637,0.0001244978,0.0003042543,0.007184806],"genre_scores_gemma":[0.99240017,0.00022504108,0.006510882,0.000017869765,0.000008889103,0.000015560936,0.000021739967,0.0000058754226,0.0007939942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996238,0.00008858302,0.000013817049,0.000060116767,0.00010524382,0.000108488966],"domain_scores_gemma":[0.99726593,0.0018306307,0.00032976767,0.00026864157,0.0002600614,0.000044872933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000608251,0.00048224558,0.0003863502,0.00031417128,0.00033560567,0.0004776184,0.00044198078,0.00036167746,0.00059733336],"category_scores_gemma":[0.002503387,0.00012069842,0.00019644639,0.0006718049,0.00055155996,0.00066022284,0.00035458858,0.00025452767,0.00016264008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004046028,0.000060830156,0.0033486534,0.00021185937,0.000086594395,0.0008957893,0.00047704836,0.78665155,0.075551346,0.041556038,0.0008897455,0.089866005],"study_design_scores_gemma":[0.000023342012,0.00023889639,0.0014862309,0.000010068653,0.00005419717,0.00061874755,0.00013494275,0.96480834,0.01650441,0.014165623,0.001926632,0.000028580662],"about_ca_topic_score_codex":0.0014967988,"about_ca_topic_score_gemma":0.0024720032,"teacher_disagreement_score":0.0014967988,"about_ca_system_score_codex":0.0004148807,"about_ca_system_score_gemma":0.00036742978,"threshold_uncertainty_score":0.003216803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03278088,0.0010230503,0.9625479,0.00016753863,0.00007492612,0.00005985573,0.000028718516,0.00015511838,0.0031620692],"genre_scores_gemma":[0.84451234,0.00088502304,0.15066162,0.00016394623,0.00006735118,0.00008279251,0.00006412309,0.000013125012,0.0035496475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944097,0.00022539074,0.00003260787,0.000075970966,0.00017103904,0.00005389666],"domain_scores_gemma":[0.99941826,0.00022382113,0.0000781446,0.00011447626,0.00014448084,0.000020829293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007018884,0.00059445755,0.00047185237,0.00035045948,0.00049338274,0.00046186778,0.0009537057,0.0006878577,0.0008675891],"category_scores_gemma":[0.0010177303,0.00020462647,0.0004011218,0.00046421305,0.0004173884,0.00063195196,0.00055705436,0.00045355005,0.00025022254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038166015,0.0002447706,0.00091649726,0.00042122867,0.00024176981,0.0011906936,0.0006511825,0.39190334,0.13318244,0.15015797,0.0044190693,0.3162893],"study_design_scores_gemma":[0.000040973457,0.00042947943,0.00026655724,0.00001856343,0.000062212595,0.0005862366,0.000035929024,0.9621977,0.016715081,0.0141681675,0.005436082,0.00004301129],"about_ca_topic_score_codex":0.0006187815,"about_ca_topic_score_gemma":0.0016703113,"teacher_disagreement_score":0.0009537057,"about_ca_system_score_codex":0.00048511676,"about_ca_system_score_gemma":0.00043741762,"threshold_uncertainty_score":0.0037119985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15798707,0.0010395733,0.83556575,0.00039563407,0.00003163939,0.000042282863,0.000047449266,0.00009842796,0.004792291],"genre_scores_gemma":[0.971422,0.00034652953,0.027302226,0.000037073827,0.00002040283,0.000047712452,0.000016208578,0.0000108648455,0.00079711375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985417,0.0009857027,0.00003603519,0.0001342419,0.00017873853,0.00012347168],"domain_scores_gemma":[0.99765176,0.0018078639,0.00019708059,0.0001209665,0.00017566916,0.00004671691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021043941,0.0005813664,0.0007716814,0.00038726264,0.0004507519,0.0007356387,0.000630409,0.0008680252,0.00038384064],"category_scores_gemma":[0.00595908,0.00038898204,0.000282189,0.0007039134,0.0014246921,0.001130318,0.00064708863,0.00036121625,0.00011317112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055783756,0.000013746641,0.0003672148,0.00002916852,0.000014378905,0.0001220639,0.000079033234,0.97433835,0.0011462141,0.01722198,0.0003075005,0.0063044634],"study_design_scores_gemma":[0.000010740832,0.000021177653,0.0000906821,0.0000026890673,0.0000055706178,0.00002537843,0.000020518355,0.9885465,0.00030550244,0.010844919,0.000121726,0.00000459287],"about_ca_topic_score_codex":0.0023173124,"about_ca_topic_score_gemma":0.0017212984,"teacher_disagreement_score":0.0023173124,"about_ca_system_score_codex":0.0009324218,"about_ca_system_score_gemma":0.00063210767,"threshold_uncertainty_score":0.0111292},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027102135,0.00034735285,0.9699856,0.00010618394,0.000030239107,0.00005449465,0.000053013722,0.0001304092,0.002190721],"genre_scores_gemma":[0.6733556,0.0004676113,0.3240319,0.000060024526,0.00005302615,0.00019971518,0.00012992801,0.000034651817,0.0016675127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989436,0.00040180248,0.000055266,0.00020695174,0.00028049317,0.000111883826],"domain_scores_gemma":[0.99867,0.00052321394,0.0003154625,0.00013196704,0.00029078155,0.00006849456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008172351,0.0010364491,0.00076185964,0.00051803084,0.00045281823,0.0007830335,0.0009376724,0.0007555068,0.0008340605],"category_scores_gemma":[0.003328073,0.00051658216,0.00038890273,0.0005667747,0.0008890358,0.00081917335,0.0008340743,0.0006347985,0.00035197174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017541695,0.00004533983,0.0005976272,0.00009731983,0.000056658475,0.0001476994,0.00016042635,0.88677436,0.01827391,0.036177054,0.0007897874,0.056704372],"study_design_scores_gemma":[0.000032224627,0.00011228755,0.00011258822,0.000012852735,0.0000172156,0.00007937549,0.000022027238,0.9870701,0.004851132,0.0065001864,0.0011702584,0.00001978518],"about_ca_topic_score_codex":0.0016788946,"about_ca_topic_score_gemma":0.0028830557,"teacher_disagreement_score":0.0016788946,"about_ca_system_score_codex":0.0009729541,"about_ca_system_score_gemma":0.0015108853,"threshold_uncertainty_score":0.0070593357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1250665,0.0009324286,0.8610322,0.0006964287,0.0002576727,0.0003068657,0.0001529556,0.0009268688,0.010628037],"genre_scores_gemma":[0.88380826,0.00031442242,0.11021656,0.00032704067,0.000083953186,0.0001934821,0.00015609374,0.000011866557,0.0048883166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994037,0.00017478496,0.00002861319,0.000101444304,0.0001963459,0.00009514282],"domain_scores_gemma":[0.9995146,0.0000932697,0.00006935964,0.00006145861,0.0002215634,0.00003968452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076322793,0.00048327635,0.00065218966,0.0005568585,0.00058119773,0.0008423762,0.0010739041,0.0008828646,0.001085606],"category_scores_gemma":[0.00082576997,0.0001683231,0.0002541891,0.00075796654,0.0005010845,0.00061078585,0.00067001005,0.0004381477,0.00048472593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010544586,0.0004469265,0.0045655947,0.00040380456,0.00020892681,0.0013794445,0.00041492164,0.11911592,0.34224316,0.08491117,0.011552244,0.4337034],"study_design_scores_gemma":[0.00027679183,0.0012528208,0.001351508,0.000045665663,0.00010213823,0.001294068,0.00005647617,0.9334126,0.037251193,0.0071817148,0.017677816,0.00009717123],"about_ca_topic_score_codex":0.0014071361,"about_ca_topic_score_gemma":0.0022263858,"teacher_disagreement_score":0.0014071361,"about_ca_system_score_codex":0.00040783238,"about_ca_system_score_gemma":0.00065509207,"threshold_uncertainty_score":0.004036367},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027672188,0.00072645093,0.96494204,0.00020928412,0.000027937245,0.000057662128,0.000039153507,0.000115525974,0.0062098578],"genre_scores_gemma":[0.71558225,0.0015482694,0.28065127,0.00012654533,0.000035990135,0.00014232584,0.000080348786,0.000031919324,0.0018011217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990527,0.0004209274,0.000027080288,0.000079040976,0.00035856655,0.00006165335],"domain_scores_gemma":[0.9979984,0.0011806404,0.00015612935,0.00009811399,0.0005130542,0.00005369122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011895411,0.00076450943,0.00038742681,0.0003835385,0.00021594799,0.00080184627,0.00045792686,0.00070368435,0.001056082],"category_scores_gemma":[0.0055047297,0.0002573892,0.00013832121,0.0006329806,0.00063403696,0.00082008605,0.0004239674,0.00044766627,0.00036889265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014832609,0.00005105093,0.00054534257,0.000103488375,0.000021795153,0.00004657874,0.00004215815,0.9103028,0.020649781,0.022446662,0.0005090438,0.045132916],"study_design_scores_gemma":[0.000011049942,0.000054414206,0.000091055066,0.000006454238,0.0000053707663,0.000030610936,0.0000062550293,0.99466574,0.0031656276,0.0016817894,0.00027513772,0.0000064184646],"about_ca_topic_score_codex":0.0031731066,"about_ca_topic_score_gemma":0.002465003,"teacher_disagreement_score":0.0031731066,"about_ca_system_score_codex":0.0007909299,"about_ca_system_score_gemma":0.0010562395,"threshold_uncertainty_score":0.006309271},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31908244,0.0015505361,0.675443,0.00036805114,0.00004211608,0.00007317019,0.00010944152,0.00022908085,0.0031021389],"genre_scores_gemma":[0.9809233,0.00060603465,0.017372081,0.000023528302,0.000025305384,0.000027828304,0.000028205843,0.000014616094,0.000979073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980205,0.0008342977,0.000091859205,0.00021612633,0.0005438719,0.00029334906],"domain_scores_gemma":[0.9771494,0.018551614,0.0022022172,0.00087800133,0.00108864,0.00013004817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040493635,0.0014510632,0.0015787248,0.00080691284,0.00039829794,0.0010885488,0.0010349015,0.0013196768,0.00039172816],"category_scores_gemma":[0.01661766,0.00061257713,0.00053641136,0.0010384792,0.0018347899,0.0022135242,0.000986106,0.0007061428,0.00016688432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017753418,0.000032615855,0.0014358727,0.00010689791,0.00006124409,0.0004784764,0.00015331926,0.9752838,0.0031536978,0.01396926,0.00012728325,0.0050200927],"study_design_scores_gemma":[0.000012731627,0.000066005894,0.00036222802,0.0000068226955,0.000025943036,0.0001379187,0.000027725839,0.9948968,0.0017403227,0.0026203014,0.00008740799,0.000015753174],"about_ca_topic_score_codex":0.003544305,"about_ca_topic_score_gemma":0.0021916379,"teacher_disagreement_score":0.0040493635,"about_ca_system_score_codex":0.0012202495,"about_ca_system_score_gemma":0.000751253,"threshold_uncertainty_score":0.021415293},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033004996,0.0002886326,0.9867932,0.00020888058,0.00004503547,0.00003985837,0.000020983965,0.00001885779,0.009284156],"genre_scores_gemma":[0.6603624,0.0018939357,0.32027668,0.0003943087,0.000316182,0.0006659819,0.00009696972,0.00007648088,0.01591713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983046,0.000964411,0.000053017073,0.00018453634,0.00037036507,0.0001231188],"domain_scores_gemma":[0.9992083,0.00043185658,0.0000877225,0.000062219646,0.0001588154,0.000051195027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002860382,0.000835265,0.00066477514,0.0008066561,0.00071863766,0.0017270525,0.0016324344,0.0012031564,0.0038110258],"category_scores_gemma":[0.0027824766,0.0003664835,0.0010509298,0.001038864,0.0017817698,0.0017895135,0.0017173258,0.0016609653,0.00054312113],"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.000008651676,0.000016603892,0.00009842262,0.000048158672,0.000017492823,0.00007685759,0.000099034245,0.11203775,0.0007247681,0.8798551,0.0008025038,0.0062147197],"study_design_scores_gemma":[0.000008065673,0.00002809588,0.00006668372,0.00002665209,0.000012796658,0.000050435076,0.00006221448,0.59922457,0.00026378428,0.39559042,0.0046541602,0.0000121980975],"about_ca_topic_score_codex":0.0015732177,"about_ca_topic_score_gemma":0.0009297096,"teacher_disagreement_score":0.0038110258,"about_ca_system_score_codex":0.0018820766,"about_ca_system_score_gemma":0.0011759889,"threshold_uncertainty_score":0.015127301},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046268117,0.00047426124,0.9500626,0.00021471246,0.00010169941,0.00012575364,0.000027047972,0.00088642625,0.0018394788],"genre_scores_gemma":[0.7128271,0.00048502287,0.28081563,0.00019361016,0.00006241709,0.00015341555,0.000111428926,0.000060489798,0.0052909236],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940455,0.00013748877,0.000044181466,0.00008013838,0.0002852585,0.00004846724],"domain_scores_gemma":[0.99911815,0.00022484163,0.00012053559,0.0001709652,0.00032298153,0.000042447493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012116404,0.00047076243,0.00030558222,0.0006657131,0.00041395467,0.0005056161,0.0015822019,0.0006601391,0.00054193125],"category_scores_gemma":[0.0022367258,0.00022933303,0.0003392159,0.00039562327,0.00040580888,0.00086703786,0.000637166,0.00068377604,0.00019237676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046988638,0.00029302214,0.0010813043,0.00047571943,0.0001699956,0.0007200295,0.0005969351,0.2108981,0.42309895,0.05463024,0.0028600686,0.30470574],"study_design_scores_gemma":[0.00010438312,0.0011436361,0.00054181385,0.00003959191,0.0001314342,0.0007020451,0.000091794536,0.86476284,0.110319294,0.005617413,0.016447654,0.000098037744],"about_ca_topic_score_codex":0.0012909847,"about_ca_topic_score_gemma":0.0011798127,"teacher_disagreement_score":0.0015822019,"about_ca_system_score_codex":0.00037386068,"about_ca_system_score_gemma":0.00062091334,"threshold_uncertainty_score":0.006407857},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049820136,0.0015968133,0.9449424,0.00025908498,0.00006534446,0.00006739506,0.000046916215,0.00021468842,0.0029872544],"genre_scores_gemma":[0.9009091,0.0012403298,0.09501268,0.00008676525,0.00009864908,0.00022041591,0.00007110314,0.00003082863,0.0023300496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985643,0.00067784986,0.000045638222,0.00009151602,0.00051147566,0.00010925126],"domain_scores_gemma":[0.9959371,0.0028791893,0.00038300277,0.00025910555,0.00049132237,0.000050342405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020891856,0.0006584677,0.00056725484,0.0009123116,0.00033619074,0.00078139064,0.0008999123,0.0007374391,0.0004363454],"category_scores_gemma":[0.006709629,0.00038799233,0.00019452543,0.0010039165,0.0010795796,0.0010833023,0.0007587817,0.00059769215,0.00014002768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011510024,0.000019690748,0.00028023467,0.00011724756,0.000018365858,0.00014566445,0.00012567041,0.93917197,0.0026133962,0.031424336,0.0006064862,0.025361793],"study_design_scores_gemma":[0.000014937511,0.000042504944,0.00007448867,0.000010287855,0.0000072826006,0.000030959654,0.000014753997,0.9872798,0.0006619444,0.011284436,0.00057132356,0.000007291885],"about_ca_topic_score_codex":0.0036767689,"about_ca_topic_score_gemma":0.0025362365,"teacher_disagreement_score":0.0036767689,"about_ca_system_score_codex":0.0008131864,"about_ca_system_score_gemma":0.0010187251,"threshold_uncertainty_score":0.011048794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076873586,0.0013846622,0.91271365,0.00059976836,0.00007851412,0.00004713217,0.00007010127,0.00012015803,0.008112483],"genre_scores_gemma":[0.9633211,0.0010403221,0.03251656,0.00006441393,0.00005062421,0.0000901497,0.000029048311,0.000032434302,0.002855256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995141,0.00021416199,0.000014847354,0.000051545794,0.00013094481,0.00007437418],"domain_scores_gemma":[0.9981237,0.0014768377,0.00014887491,0.000059675127,0.00015650287,0.00003446338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001140908,0.0005830531,0.00045189544,0.0005778587,0.00045597498,0.0007867628,0.0006837594,0.0006643153,0.00067686324],"category_scores_gemma":[0.003977201,0.00031068278,0.00025692093,0.00092322327,0.0011161987,0.0014233332,0.00078298576,0.00061167247,0.000099800614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001504408,0.00000577123,0.00013357897,0.000023518127,0.0000045183106,0.00002833056,0.000022620505,0.9639078,0.00060207176,0.0318465,0.00015907675,0.0032510716],"study_design_scores_gemma":[0.0000032259459,0.00000919601,0.00003266708,0.0000030210138,0.0000021676985,0.000007843839,0.000007070461,0.9885485,0.00017154207,0.011031536,0.00018065466,0.0000025735233],"about_ca_topic_score_codex":0.00561414,"about_ca_topic_score_gemma":0.0038792493,"teacher_disagreement_score":0.00561414,"about_ca_system_score_codex":0.0021019892,"about_ca_system_score_gemma":0.0011274774,"threshold_uncertainty_score":0.01525104},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10795246,0.008161718,0.865685,0.000721807,0.00012555308,0.000064654705,0.000085790416,0.00020557709,0.01699746],"genre_scores_gemma":[0.9752041,0.002588074,0.019609941,0.00012279004,0.00013319038,0.00006524708,0.000025104924,0.000029995528,0.002221497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826825,0.0006365983,0.00006000903,0.00017309363,0.0005278534,0.0003341549],"domain_scores_gemma":[0.9947872,0.00419129,0.00029388088,0.00018484896,0.00040062703,0.00014219759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002368615,0.0014133467,0.00092254486,0.0010023644,0.001086292,0.0019673344,0.0012374428,0.001479749,0.0016147355],"category_scores_gemma":[0.008385669,0.0005981495,0.0003195111,0.0013961112,0.0015354252,0.0032185242,0.0015542825,0.00079978857,0.0004101635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018179543,0.000050556384,0.001044641,0.000240557,0.00008986618,0.00047041764,0.0001984445,0.77912503,0.008896015,0.16460973,0.0010049382,0.044088077],"study_design_scores_gemma":[0.000026555623,0.00017297213,0.00035438477,0.000041616335,0.00004402659,0.0006821565,0.0000679117,0.8611396,0.0034888424,0.13232855,0.0016123438,0.000041122545],"about_ca_topic_score_codex":0.00077917526,"about_ca_topic_score_gemma":0.00075597485,"teacher_disagreement_score":0.002368615,"about_ca_system_score_codex":0.002098733,"about_ca_system_score_gemma":0.0006512766,"threshold_uncertainty_score":0.015227497},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017073812,0.00090556516,0.97201633,0.00049449934,0.00036215453,0.00012759949,0.000099138786,0.0014682872,0.0074526253],"genre_scores_gemma":[0.62102044,0.0019103286,0.36173975,0.0007783556,0.0004845849,0.00031861363,0.0005111597,0.00032242158,0.012914346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966717,0.000081447084,0.000021768461,0.00004612749,0.0001391412,0.000044242457],"domain_scores_gemma":[0.9992562,0.00025152456,0.00009965675,0.00015989383,0.00018994509,0.00004267328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010744828,0.00033186754,0.0003501202,0.0006996798,0.000525682,0.0007226807,0.0014156023,0.000654808,0.001787952],"category_scores_gemma":[0.0020240229,0.00017452886,0.00029030695,0.00058675255,0.0007795417,0.0014328102,0.0011934885,0.00080012286,0.00037683884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004183837,0.00014165748,0.0010110061,0.00043835948,0.00013733229,0.0005898507,0.00049262634,0.09456183,0.08771713,0.2689919,0.030725736,0.5147742],"study_design_scores_gemma":[0.00008298188,0.00036249746,0.0007805421,0.00009051567,0.00010075118,0.0010816595,0.00012039126,0.7932231,0.028948508,0.070260115,0.10482796,0.00012101067],"about_ca_topic_score_codex":0.00089763606,"about_ca_topic_score_gemma":0.0012639246,"teacher_disagreement_score":0.001787952,"about_ca_system_score_codex":0.00046547365,"about_ca_system_score_gemma":0.00056999427,"threshold_uncertainty_score":0.005981326},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28853014,0.0017171291,0.6920154,0.0010773055,0.00012889804,0.00013155595,0.0007303198,0.00063110073,0.015038125],"genre_scores_gemma":[0.97346884,0.0008526871,0.023136118,0.0001108524,0.00014304982,0.00014808516,0.00018235417,0.000085891916,0.001872104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983236,0.0004812738,0.00005567152,0.000265857,0.00043115215,0.00044240235],"domain_scores_gemma":[0.9869444,0.009801019,0.0010421986,0.00088336115,0.0010130152,0.00031602883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029608014,0.0014765777,0.0015230023,0.0013101334,0.00088247133,0.002201073,0.0016345271,0.0010612888,0.0026578002],"category_scores_gemma":[0.012809618,0.0004994165,0.00054807577,0.0021046635,0.0018207228,0.004071675,0.0014323456,0.0012069,0.000352949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066973263,0.000088844245,0.00127424,0.00024681806,0.000087924316,0.0003249566,0.00015421283,0.85761523,0.0091580935,0.10689659,0.0025881499,0.020895192],"study_design_scores_gemma":[0.000017241086,0.00009853384,0.00032085838,0.000028886796,0.000041702362,0.00022014376,0.000050173818,0.94136965,0.0033000144,0.054009542,0.00051400287,0.000029297631],"about_ca_topic_score_codex":0.0011733477,"about_ca_topic_score_gemma":0.0012813299,"teacher_disagreement_score":0.0029608014,"about_ca_system_score_codex":0.0029210532,"about_ca_system_score_gemma":0.0011158203,"threshold_uncertainty_score":0.021193862},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110981,0.000796851,0.88063145,0.00024708846,0.000026383412,0.00004267256,0.000059450605,0.00018311937,0.007032045],"genre_scores_gemma":[0.969857,0.00048977084,0.028423412,0.00005374027,0.000030361225,0.0000321087,0.000026840718,0.00003895229,0.0010478755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799156,0.000967565,0.00005978137,0.00022774313,0.00049489527,0.00025846163],"domain_scores_gemma":[0.9957688,0.0030849355,0.0004245208,0.00023062667,0.00043405496,0.00005710251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029362205,0.001151862,0.0010102749,0.00075989426,0.00048922206,0.0013240018,0.0009671559,0.0008067695,0.0013664308],"category_scores_gemma":[0.013473954,0.00029266716,0.0004548168,0.0008009272,0.0016459087,0.0016306675,0.001197968,0.00055496156,0.0002747031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009554227,0.000023723684,0.0005515056,0.000053769396,0.00002397032,0.00010030474,0.000071264476,0.9612136,0.0039863084,0.024201341,0.00018660442,0.009492171],"study_design_scores_gemma":[0.0000061393316,0.00005110812,0.00023432173,0.000008230232,0.000014514104,0.000102467406,0.000028505858,0.99199545,0.0019265382,0.0054238616,0.00020047226,0.0000083944005],"about_ca_topic_score_codex":0.0012685523,"about_ca_topic_score_gemma":0.00083486876,"teacher_disagreement_score":0.0029362205,"about_ca_system_score_codex":0.0012271262,"about_ca_system_score_gemma":0.0007616484,"threshold_uncertainty_score":0.015528381},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14686863,0.0011958312,0.84589005,0.0002613104,0.00003409058,0.000051439514,0.00004136594,0.00008728429,0.0055699986],"genre_scores_gemma":[0.9611211,0.00041887417,0.037007987,0.0000629013,0.000021189999,0.00007527237,0.000019300374,0.000011033621,0.001262394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999146,0.00040343948,0.000020082258,0.00006798394,0.00026961867,0.00009277046],"domain_scores_gemma":[0.99791807,0.0014619478,0.0002069829,0.000083910265,0.00029600537,0.000033085693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011227845,0.00062288495,0.0006332696,0.0005422395,0.00049956574,0.0006497186,0.0008352725,0.000843651,0.00045336978],"category_scores_gemma":[0.0032616837,0.00028212823,0.00023357416,0.00080328825,0.0009878969,0.0008312153,0.00079171674,0.00043137895,0.000120630204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060483646,0.000027018092,0.00044384823,0.00009758517,0.000026333213,0.00023346303,0.00018422533,0.96281946,0.0039474983,0.023652526,0.00029738317,0.008210253],"study_design_scores_gemma":[0.000007013302,0.000034889716,0.00009470794,0.0000064154415,0.000006625392,0.000063720065,0.000028922053,0.9940153,0.00077177724,0.0047251866,0.00023846705,0.0000069448747],"about_ca_topic_score_codex":0.0023654262,"about_ca_topic_score_gemma":0.0028360484,"teacher_disagreement_score":0.0023654262,"about_ca_system_score_codex":0.000979123,"about_ca_system_score_gemma":0.00056218717,"threshold_uncertainty_score":0.007104099},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028137378,0.00095208443,0.97699195,0.00055990735,0.00019855749,0.000053393447,0.0001796548,0.00015184781,0.018098885],"genre_scores_gemma":[0.68019044,0.008039469,0.26889938,0.001110377,0.0013359515,0.0008048229,0.0004187417,0.00018910256,0.03901167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756515,0.0008733109,0.000075144264,0.00036658245,0.0008094904,0.00031035778],"domain_scores_gemma":[0.9974867,0.0013915394,0.0002836049,0.00034066878,0.00042721513,0.00007018221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012998804,0.0011787047,0.0011252853,0.00102801,0.0008224769,0.001875241,0.0021784813,0.0014601871,0.004541619],"category_scores_gemma":[0.004273821,0.0006307067,0.00093112706,0.0013499343,0.0015828384,0.0020210883,0.0011314534,0.0020606136,0.0014925153],"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.000029561324,0.000029536328,0.00019201364,0.0000951241,0.00003137234,0.00019507053,0.00006777957,0.2086097,0.0012575203,0.7774748,0.0026994157,0.009318017],"study_design_scores_gemma":[0.000015581561,0.00004269256,0.00010078702,0.000027892023,0.00002303983,0.00021166976,0.000024617253,0.79608846,0.0006889504,0.19397996,0.008753691,0.000042603733],"about_ca_topic_score_codex":0.0028179623,"about_ca_topic_score_gemma":0.002624159,"teacher_disagreement_score":0.004541619,"about_ca_system_score_codex":0.0017612266,"about_ca_system_score_gemma":0.0017746,"threshold_uncertainty_score":0.015193164},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55563605,0.0014957505,0.4360892,0.00056285027,0.00007518055,0.00003125771,0.000054342807,0.00011791577,0.005937577],"genre_scores_gemma":[0.9948336,0.00025724698,0.004326941,0.000018807343,0.000015162736,0.0000069039907,0.000007547459,0.000002661817,0.000531218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993098,0.00024132252,0.000025806103,0.000115127375,0.00012968916,0.000178205],"domain_scores_gemma":[0.99888307,0.00059448055,0.00016598246,0.00012507978,0.00017832707,0.000052993433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057015894,0.00074525696,0.0007520399,0.00035845494,0.0007146523,0.0007630897,0.0007494429,0.0008447161,0.0003407115],"category_scores_gemma":[0.0018334725,0.00027038401,0.00037185554,0.00060018216,0.001085559,0.0010833095,0.0009584571,0.00046626345,0.00010742944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045197044,0.00006248036,0.0053123524,0.00016385668,0.00013210402,0.0037242202,0.00069305504,0.8361914,0.043501344,0.08232728,0.0006393856,0.026800426],"study_design_scores_gemma":[0.000014057881,0.0000945511,0.0004570196,0.0000066337193,0.000033650118,0.000693816,0.00008400019,0.9887812,0.0033475976,0.0059989304,0.00047041327,0.000018062801],"about_ca_topic_score_codex":0.002123625,"about_ca_topic_score_gemma":0.0015011716,"teacher_disagreement_score":0.002123625,"about_ca_system_score_codex":0.0009224122,"about_ca_system_score_gemma":0.00052837085,"threshold_uncertainty_score":0.0066925883},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07086019,0.0007445593,0.9097646,0.00046127618,0.00011221166,0.0000615487,0.000053154927,0.0001231968,0.017819325],"genre_scores_gemma":[0.86618924,0.0012664914,0.12825873,0.00023591472,0.000108462154,0.00011773645,0.00006433215,0.000048297472,0.0037107777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953437,0.00019658613,0.000020253774,0.000040923896,0.00017081165,0.000036997615],"domain_scores_gemma":[0.99888986,0.0007349149,0.00008387655,0.00016043372,0.000108128785,0.000022859283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006891428,0.0004289741,0.0002510886,0.00033367393,0.0002633199,0.0005968206,0.00036062152,0.00040857305,0.0016738662],"category_scores_gemma":[0.004126746,0.0001504381,0.00015935011,0.0004419888,0.0012903141,0.0011597521,0.0009526586,0.00064557075,0.0003398701],"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.00025390906,0.000050876315,0.00035557433,0.00022365924,0.000011819933,0.00035583164,0.00036711435,0.18937832,0.029108077,0.70357925,0.0016701511,0.074645415],"study_design_scores_gemma":[0.00002296695,0.000098360135,0.0002236126,0.00007155429,0.0000075671337,0.0003115715,0.000041380506,0.70986295,0.010252192,0.2750754,0.004004255,0.000028151157],"about_ca_topic_score_codex":0.00045111106,"about_ca_topic_score_gemma":0.00034864814,"teacher_disagreement_score":0.0016738662,"about_ca_system_score_codex":0.00044646897,"about_ca_system_score_gemma":0.00047576454,"threshold_uncertainty_score":0.0055996776},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9549732,0.00087999355,0.03949592,0.0001705054,0.00003188434,0.00009394774,0.00017240048,0.00020701319,0.0039751157],"genre_scores_gemma":[0.9963229,0.00011078104,0.0033037756,0.000012433805,0.000004998412,0.000017048242,0.000073834664,0.0000073388487,0.00014697856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983542,0.0008667487,0.00006456944,0.00010585446,0.00043916018,0.0001693974],"domain_scores_gemma":[0.9918499,0.005783025,0.0005662187,0.00042291707,0.0012175934,0.00016030428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002724695,0.00076080253,0.00075397734,0.0009052981,0.00046768566,0.00045292333,0.00076366076,0.0007296872,0.00043306782],"category_scores_gemma":[0.008477167,0.00014925204,0.00027325857,0.000890996,0.0005424747,0.0009612422,0.00064493646,0.00035023704,0.000058570204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027145725,0.00011088909,0.0021962984,0.00008016459,0.00004542909,0.0000740985,0.000034792116,0.9823575,0.004265257,0.0009067731,0.00019947039,0.009457903],"study_design_scores_gemma":[0.0000095135065,0.00035938763,0.0009405936,0.0000061664923,0.000012275412,0.000048502527,0.000022227388,0.99440104,0.0037390206,0.00036148634,0.00009132761,0.000008534483],"about_ca_topic_score_codex":0.0029094962,"about_ca_topic_score_gemma":0.0020583782,"teacher_disagreement_score":0.0029094962,"about_ca_system_score_codex":0.001415806,"about_ca_system_score_gemma":0.00047612222,"threshold_uncertainty_score":0.014409721},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05109853,0.0012990327,0.94434446,0.00032819968,0.00015977818,0.00009608791,0.000059622922,0.0006137981,0.002000444],"genre_scores_gemma":[0.7922438,0.0007531372,0.2041694,0.00019035082,0.000086381915,0.00017401914,0.00013575611,0.00005900062,0.0021882653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947196,0.00021300175,0.00002722756,0.00007799142,0.00012817961,0.000081605715],"domain_scores_gemma":[0.9994305,0.000180072,0.000086707216,0.00016178169,0.00009822198,0.00004276143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062258734,0.00042765102,0.0007615533,0.00066932844,0.0007188219,0.0004130987,0.0012304737,0.0004255206,0.00077949977],"category_scores_gemma":[0.0009540951,0.00021283985,0.000377968,0.0007191755,0.00062802486,0.001009789,0.00091980695,0.00042622717,0.00026135848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084884395,0.00016592776,0.0011425517,0.00032031295,0.00017047982,0.00051370665,0.00044850775,0.4866255,0.077884555,0.07560582,0.007834635,0.34843928],"study_design_scores_gemma":[0.000097866134,0.00042537873,0.00045481627,0.0000191728,0.000059632694,0.0005512212,0.00011066537,0.9532787,0.013932803,0.021646582,0.009349921,0.00007325048],"about_ca_topic_score_codex":0.00092115405,"about_ca_topic_score_gemma":0.0013412392,"teacher_disagreement_score":0.0012304737,"about_ca_system_score_codex":0.0005719098,"about_ca_system_score_gemma":0.0006629571,"threshold_uncertainty_score":0.0041494966},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21528968,0.004453838,0.7663578,0.0008720423,0.0008987021,0.00068832486,0.00030199694,0.00372762,0.0074099745],"genre_scores_gemma":[0.93274647,0.00041017088,0.062294856,0.00029061182,0.00014035644,0.0001178034,0.00019293197,0.000027340486,0.0037794136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943703,0.00014233298,0.000037962425,0.000081134545,0.00018072868,0.00012077074],"domain_scores_gemma":[0.99905676,0.00020013521,0.000099506,0.00016367588,0.00041088666,0.00006898985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010673221,0.00056546077,0.0005319293,0.0007535413,0.0009932086,0.00050438906,0.0015765663,0.0005622877,0.001694813],"category_scores_gemma":[0.0014840057,0.00013869868,0.0002539936,0.0003896954,0.00047109576,0.0006253312,0.00075270195,0.0005771528,0.00039552126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028068498,0.00059669476,0.0039222487,0.00046107502,0.0002611432,0.0019247404,0.0007749358,0.0752717,0.28413177,0.017860634,0.016194347,0.5957939],"study_design_scores_gemma":[0.00038555695,0.002335912,0.005681287,0.000053389867,0.0002562225,0.0030017488,0.0003872805,0.8825568,0.07984482,0.008636746,0.016607936,0.00025232905],"about_ca_topic_score_codex":0.0029465675,"about_ca_topic_score_gemma":0.00431786,"teacher_disagreement_score":0.0029465675,"about_ca_system_score_codex":0.0005582894,"about_ca_system_score_gemma":0.0007706268,"threshold_uncertainty_score":0.0058588386},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028308762,0.0043760915,0.87543464,0.0017139398,0.0004208185,0.0000795725,0.000236913,0.00019395948,0.08923541],"genre_scores_gemma":[0.80664694,0.004907678,0.1525598,0.00057106675,0.00041413392,0.00023238151,0.00032988723,0.000083540705,0.034254555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999561,0.00017614623,0.0000132814575,0.000064409585,0.00011627043,0.00006889886],"domain_scores_gemma":[0.99917346,0.00053366926,0.00003882591,0.000075419826,0.00013412892,0.000044458717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006383799,0.00036167435,0.00054649235,0.00066716375,0.00061517744,0.0010976733,0.0008688242,0.0009223766,0.0073488383],"category_scores_gemma":[0.0019176414,0.00023667971,0.00032710368,0.0006798111,0.0009824436,0.0012550182,0.0013956552,0.0012940044,0.0007507978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006564629,0.000020950103,0.0001280159,0.00012364918,0.000011066334,0.000103104976,0.0001376187,0.05396998,0.0013600995,0.9176779,0.0051084375,0.021293597],"study_design_scores_gemma":[0.0000457481,0.000054248932,0.00009579364,0.000044506734,0.000009702424,0.00016714357,0.000120079756,0.44570076,0.0010281933,0.53490674,0.017800855,0.000026286412],"about_ca_topic_score_codex":0.0014978538,"about_ca_topic_score_gemma":0.0014226272,"teacher_disagreement_score":0.0073488383,"about_ca_system_score_codex":0.0011387694,"about_ca_system_score_gemma":0.0007997802,"threshold_uncertainty_score":0.024584293},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023422945,0.0004856521,0.9747633,0.00010427864,0.00001460551,0.00003450653,0.000017705952,0.00006046972,0.0010966128],"genre_scores_gemma":[0.90654224,0.0008654176,0.09106958,0.000051594918,0.00005154652,0.00015234748,0.000037625523,0.000030176381,0.0011995812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990355,0.0005334531,0.000041229665,0.00012596873,0.00019483866,0.000069058224],"domain_scores_gemma":[0.99899775,0.00068446546,0.000115110415,0.00007068088,0.00010572468,0.000026170515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015137792,0.0006919984,0.0007206207,0.00045718474,0.00035905105,0.0006522537,0.00075118936,0.0005641865,0.0005024244],"category_scores_gemma":[0.004046728,0.0003040536,0.00035159983,0.000782957,0.0009525783,0.0008974159,0.0008584968,0.0003530604,0.00015266596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014079135,0.00006031638,0.00030665938,0.00014647121,0.000052978587,0.0001534768,0.00024292045,0.8855964,0.011938033,0.039851055,0.00097072736,0.06054024],"study_design_scores_gemma":[0.00001556557,0.00007670013,0.00009627492,0.000007991583,0.0000149804455,0.00004375863,0.000025073172,0.9808096,0.001727762,0.016674763,0.00049811683,0.000009424147],"about_ca_topic_score_codex":0.00078688574,"about_ca_topic_score_gemma":0.0010435326,"teacher_disagreement_score":0.0015137792,"about_ca_system_score_codex":0.0004871677,"about_ca_system_score_gemma":0.0006932575,"threshold_uncertainty_score":0.008005738},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023425253,0.00039088805,0.97429097,0.00012479397,0.000022667666,0.000030264297,0.000010701976,0.00010061302,0.0016038197],"genre_scores_gemma":[0.86920005,0.00057425274,0.12847055,0.000117006464,0.0000414471,0.00014059426,0.000028729999,0.000048006306,0.0013794964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991036,0.0003856715,0.000030471454,0.00010807438,0.00028281065,0.00008924019],"domain_scores_gemma":[0.9986098,0.0008791025,0.00016022605,0.00015121915,0.0001609652,0.000038708422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001018401,0.00080838165,0.00066952594,0.0003996411,0.00053071463,0.00059599156,0.0008455266,0.0005406657,0.0006886267],"category_scores_gemma":[0.0042526824,0.000280627,0.00027714146,0.0007815902,0.0009182229,0.0011259302,0.00115284,0.00069082424,0.0001608446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097688404,0.000065714994,0.00059862353,0.00011890611,0.000038999955,0.00013276363,0.00025068858,0.8740698,0.014868064,0.044040415,0.0006451021,0.06507316],"study_design_scores_gemma":[0.000007843689,0.000054465,0.0000969994,0.000009183128,0.000010550269,0.000042998137,0.000031598043,0.9854762,0.0029101418,0.010643958,0.0007082184,0.000007717489],"about_ca_topic_score_codex":0.0013346678,"about_ca_topic_score_gemma":0.0012359627,"teacher_disagreement_score":0.0013346678,"about_ca_system_score_codex":0.0006753754,"about_ca_system_score_gemma":0.0007625445,"threshold_uncertainty_score":0.0053858757},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04123652,0.0004553573,0.95273846,0.00022960412,0.000099103505,0.000053412485,0.00003612984,0.000113074995,0.005038263],"genre_scores_gemma":[0.914528,0.00035056967,0.08179197,0.00008008301,0.00008323266,0.000060695333,0.000037771686,0.000033097782,0.0030345889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994305,0.00022276722,0.000023671068,0.00008433256,0.00011555544,0.00012315567],"domain_scores_gemma":[0.99916863,0.00044394803,0.00009594651,0.000046091915,0.00019124638,0.000054097713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011116401,0.00055224966,0.000747413,0.000342518,0.00061380875,0.00086794747,0.0008222073,0.00060735364,0.0018097839],"category_scores_gemma":[0.0023216212,0.000215176,0.00032747563,0.00060477253,0.00047415908,0.00064573257,0.0007311977,0.00055932294,0.00021277675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001204112,0.00005567553,0.0003049713,0.000068542635,0.000024541345,0.00010911421,0.000094007984,0.94150656,0.004871132,0.022125527,0.0013241076,0.02939535],"study_design_scores_gemma":[0.000006799131,0.00003067493,0.000051127055,0.0000023339985,0.0000046453233,0.000013294659,0.000015327867,0.9963715,0.0005572837,0.0026830195,0.00026103796,0.0000030621225],"about_ca_topic_score_codex":0.0037608158,"about_ca_topic_score_gemma":0.003549322,"teacher_disagreement_score":0.0037608158,"about_ca_system_score_codex":0.0010481756,"about_ca_system_score_gemma":0.001583713,"threshold_uncertainty_score":0.007605076},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013069162,0.00020699025,0.98556155,0.0001132448,0.000009360363,0.000013121069,0.000028238366,0.0001278636,0.0008704884],"genre_scores_gemma":[0.7384193,0.00041656452,0.2592288,0.00016018205,0.000038303857,0.00011521328,0.000115740346,0.000031744297,0.0014741768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986614,0.00054236775,0.000070947295,0.00019920824,0.00039354336,0.00013254484],"domain_scores_gemma":[0.9958448,0.0031428137,0.00037629763,0.00018941492,0.00038016334,0.00006652076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021676342,0.000691614,0.000997654,0.00045724507,0.0003996089,0.0013692968,0.0008162059,0.0012974729,0.00083882903],"category_scores_gemma":[0.010273872,0.00062223675,0.0004141163,0.00054917997,0.0011364163,0.0018001889,0.0014882932,0.0010742899,0.00034956654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023068675,0.000062869396,0.0011004504,0.0001476733,0.000045213743,0.0001825455,0.00020360517,0.8906194,0.009030494,0.040009562,0.0009618514,0.05740565],"study_design_scores_gemma":[0.000009402695,0.000044406228,0.00010246422,0.000011835625,0.0000066215043,0.000070704795,0.00001691712,0.98632914,0.0025954333,0.010439232,0.00036216184,0.0000116965975],"about_ca_topic_score_codex":0.0007584777,"about_ca_topic_score_gemma":0.0012756311,"teacher_disagreement_score":0.0021676342,"about_ca_system_score_codex":0.0011505136,"about_ca_system_score_gemma":0.0014294016,"threshold_uncertainty_score":0.011463642},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015005186,0.00019681122,0.981646,0.00026283058,0.000042380536,0.00008969264,0.000032919423,0.00018777368,0.0025364065],"genre_scores_gemma":[0.66031814,0.00060672854,0.33224356,0.0003710209,0.000040119885,0.00046439748,0.00014832664,0.000055239445,0.0057524825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961627,0.0001558802,0.000019315892,0.00004245626,0.00011454885,0.00005159739],"domain_scores_gemma":[0.9992162,0.00036072207,0.0001333158,0.00010113464,0.00015137621,0.00003721852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009494106,0.00038534804,0.000387175,0.00048833963,0.0005510466,0.0005217039,0.0008158272,0.0005963302,0.00097113836],"category_scores_gemma":[0.0023468616,0.00013579632,0.0002885649,0.0007513876,0.00082827685,0.0010478252,0.0012952621,0.0006494187,0.00019121057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045494532,0.000106972424,0.00043368936,0.00025169263,0.00007355817,0.00048276616,0.00055099884,0.42437553,0.054970015,0.35435212,0.0072574047,0.15669033],"study_design_scores_gemma":[0.000042816857,0.00013364959,0.00008794125,0.000017120661,0.0000144891565,0.00019822459,0.000037097827,0.96081966,0.0096697565,0.023682045,0.0052662776,0.00003090124],"about_ca_topic_score_codex":0.0018990863,"about_ca_topic_score_gemma":0.0025135404,"teacher_disagreement_score":0.0018990863,"about_ca_system_score_codex":0.0007228702,"about_ca_system_score_gemma":0.0011339287,"threshold_uncertainty_score":0.0052447915},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061216443,0.00048140108,0.99160916,0.00018824684,0.000020892927,0.000026178175,0.000028408935,0.0000532885,0.0014708467],"genre_scores_gemma":[0.82069737,0.0021446974,0.17343001,0.0002751907,0.00020167722,0.00026190377,0.00015039035,0.000040870495,0.0027979421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970644,0.0016032758,0.00011821903,0.00034447483,0.0006899409,0.00017953764],"domain_scores_gemma":[0.994915,0.004075933,0.00028291636,0.00017876984,0.000457269,0.00009025232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004157193,0.0007001791,0.001410953,0.0010147803,0.0006352657,0.001302429,0.0015398456,0.0011581966,0.00088232174],"category_scores_gemma":[0.009917401,0.0006749658,0.0005716191,0.0014492915,0.0017756011,0.0020058956,0.0010353975,0.0010621055,0.00028791607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001353255,0.00005166709,0.0009738239,0.00014192815,0.000093999086,0.00024565094,0.00028717946,0.73823535,0.0014073271,0.19933988,0.001634031,0.057453822],"study_design_scores_gemma":[0.000022583868,0.000030328389,0.00013634382,0.000014933787,0.000018283217,0.000046766752,0.000013494757,0.9225971,0.00037498705,0.07608425,0.00064036733,0.00002057277],"about_ca_topic_score_codex":0.0041762153,"about_ca_topic_score_gemma":0.0027255504,"teacher_disagreement_score":0.0041762153,"about_ca_system_score_codex":0.0014728935,"about_ca_system_score_gemma":0.0010977926,"threshold_uncertainty_score":0.02198565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39212438,0.004477857,0.5947674,0.0007422526,0.00021437756,0.00006612689,0.00011581163,0.00035348826,0.0071382793],"genre_scores_gemma":[0.9817949,0.000582558,0.016587747,0.00005282029,0.000073931646,0.0000144198975,0.000040249375,0.00001864403,0.00083472923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960345,0.00011669517,0.000019913781,0.00004809115,0.00013313453,0.00007878172],"domain_scores_gemma":[0.99766135,0.0013931382,0.00020502445,0.00030218868,0.00037694018,0.00006133933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006774847,0.0004093969,0.00042279574,0.00051582983,0.00051042455,0.00041753802,0.00062932057,0.0004363768,0.00042968418],"category_scores_gemma":[0.0035305996,0.00025381954,0.00021567328,0.00047756376,0.00051617733,0.00082007697,0.00053388876,0.0003972046,0.000104492356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015871258,0.00018219555,0.0041435696,0.0005494981,0.00020837011,0.0015566626,0.00065808726,0.35186955,0.24079055,0.09191386,0.0055816337,0.30095893],"study_design_scores_gemma":[0.000032050237,0.00040966674,0.0011185554,0.000028643522,0.000113654714,0.00080730073,0.00015386827,0.9402588,0.034617044,0.019279262,0.003150585,0.000030644733],"about_ca_topic_score_codex":0.0009805051,"about_ca_topic_score_gemma":0.0017713895,"teacher_disagreement_score":0.0009805051,"about_ca_system_score_codex":0.00035170454,"about_ca_system_score_gemma":0.00050683203,"threshold_uncertainty_score":0.0035828948},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05221866,0.0007965892,0.9358368,0.0001813179,0.000067085,0.000056401495,0.00013439289,0.00043302288,0.010275709],"genre_scores_gemma":[0.8966849,0.0010359408,0.09774148,0.00017260511,0.00013624752,0.000093583614,0.00031623893,0.00010552598,0.0037134362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987179,0.00037233272,0.000044770757,0.0000944798,0.00059482484,0.0001757382],"domain_scores_gemma":[0.9982741,0.0008010481,0.00029949547,0.00025464286,0.0003149975,0.000055701945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016876397,0.0009439195,0.00074973615,0.0008737589,0.00038104918,0.0015312372,0.00067794265,0.0007135348,0.0012882217],"category_scores_gemma":[0.0049118414,0.00030647704,0.00051885634,0.0017144833,0.0007962301,0.0012769914,0.0007912642,0.00080245436,0.0006888404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023345064,0.000071133305,0.003130091,0.0002664484,0.00012192493,0.0012462307,0.00029246902,0.61924297,0.025480956,0.27743757,0.0033555203,0.06912126],"study_design_scores_gemma":[0.000013273599,0.00010495781,0.0012407105,0.000022372995,0.00002902759,0.0008073927,0.000038616126,0.93954927,0.009397261,0.04540831,0.0033280868,0.000060767576],"about_ca_topic_score_codex":0.0010702983,"about_ca_topic_score_gemma":0.0012648659,"teacher_disagreement_score":0.0016876397,"about_ca_system_score_codex":0.000747837,"about_ca_system_score_gemma":0.0010151322,"threshold_uncertainty_score":0.008925259},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35207778,0.0020704963,0.6295903,0.0009645691,0.00008713428,0.00011182162,0.000047437603,0.00034533243,0.014705173],"genre_scores_gemma":[0.966854,0.0005061137,0.03152728,0.000091389586,0.000026837628,0.000066387984,0.000016264485,0.000036075457,0.0008756406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986455,0.0006178408,0.00006219717,0.00013761001,0.00035733133,0.000179605],"domain_scores_gemma":[0.99167436,0.0059694266,0.0004991987,0.00094254105,0.00075100537,0.00016341072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031817092,0.0008640576,0.0005642755,0.00057480065,0.0003506107,0.00078408857,0.0010585538,0.00082627847,0.00074690825],"category_scores_gemma":[0.012623623,0.00033570538,0.00022153529,0.00081991614,0.0011069081,0.0023991743,0.0012472145,0.00056432874,0.0001599734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005989244,0.00022826759,0.0035927123,0.00025751116,0.00007282913,0.00022338971,0.00039369494,0.7384042,0.0596615,0.082780465,0.0004967178,0.113289736],"study_design_scores_gemma":[0.00005422426,0.0005448154,0.001112136,0.0000783626,0.000062653504,0.00043997177,0.00019636488,0.9171808,0.025041537,0.0532365,0.0020018143,0.000050878094],"about_ca_topic_score_codex":0.00053574325,"about_ca_topic_score_gemma":0.0007160089,"teacher_disagreement_score":0.0031817092,"about_ca_system_score_codex":0.00052508037,"about_ca_system_score_gemma":0.00061383244,"threshold_uncertainty_score":0.01682669},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88335335,0.0016206614,0.11094957,0.00042022887,0.000056606677,0.000039103088,0.00010233805,0.00032810727,0.0031299973],"genre_scores_gemma":[0.9975452,0.00017724106,0.0020323289,0.000025511992,0.000009992755,0.000010696723,0.000016324278,0.000011520879,0.00017111754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982192,0.00066718523,0.00008120457,0.00020641625,0.00047723524,0.00034881194],"domain_scores_gemma":[0.9679,0.027052965,0.0018253735,0.0008919624,0.0020919768,0.00023778551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034598163,0.0012002045,0.00082766346,0.00056479505,0.00063796784,0.00090022455,0.00068268145,0.0011728855,0.00045185882],"category_scores_gemma":[0.026646614,0.00032956025,0.00025128163,0.00058996235,0.0014407824,0.0016234831,0.0010025669,0.0006335561,0.00010707293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005805752,0.000078442106,0.0029672596,0.00008386231,0.000053466603,0.00036224388,0.00020090853,0.97321624,0.009826271,0.00260318,0.00017635056,0.009851196],"study_design_scores_gemma":[0.000050290728,0.0006282224,0.0016593544,0.000020596408,0.000049581588,0.00029861374,0.00013675758,0.98302543,0.011398433,0.0025355069,0.00015760348,0.000039617295],"about_ca_topic_score_codex":0.0031168554,"about_ca_topic_score_gemma":0.0019268298,"teacher_disagreement_score":0.0034598163,"about_ca_system_score_codex":0.0013796116,"about_ca_system_score_gemma":0.00094010105,"threshold_uncertainty_score":0.018297434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25831613,0.0018667352,0.72421587,0.0006891183,0.000048780566,0.000048786802,0.00026195293,0.0002618341,0.014290878],"genre_scores_gemma":[0.99014026,0.0007212768,0.007818547,0.00004713926,0.000036507256,0.000042960673,0.000058829355,0.000034350087,0.001100186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984883,0.0006307943,0.00004985577,0.000105727006,0.0004881723,0.00023715053],"domain_scores_gemma":[0.9838758,0.013182911,0.0010114993,0.0005574875,0.0012205642,0.0001516172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027150307,0.0007120676,0.0008750123,0.0007211534,0.00046767254,0.00096986286,0.00080955034,0.00074355333,0.0015564064],"category_scores_gemma":[0.014760984,0.0003278005,0.00029506063,0.0009547248,0.0017691422,0.0018043099,0.0013372189,0.0008717556,0.00021489839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011494289,0.000032935583,0.0013596027,0.00010813703,0.00002780626,0.00022354415,0.00023747318,0.8832255,0.0033950915,0.10159257,0.00066840375,0.009014106],"study_design_scores_gemma":[0.0000055433543,0.000022002207,0.0003359375,0.00001194895,0.000008619665,0.000069754096,0.000037848768,0.98110574,0.0006320822,0.017571235,0.00018632144,0.000012997183],"about_ca_topic_score_codex":0.002963401,"about_ca_topic_score_gemma":0.0016102539,"teacher_disagreement_score":0.002963401,"about_ca_system_score_codex":0.0016943298,"about_ca_system_score_gemma":0.0009806537,"threshold_uncertainty_score":0.01435864},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052855488,0.0002888171,0.9422245,0.0002248842,0.00004307396,0.00008116171,0.000058679376,0.00016212683,0.0040613515],"genre_scores_gemma":[0.8646985,0.00028600174,0.13146502,0.00015899263,0.00004250108,0.00020609934,0.00008382702,0.000039087496,0.0030199552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991373,0.0003364478,0.00003507863,0.00013551199,0.00024983965,0.00010571817],"domain_scores_gemma":[0.99734664,0.0014789677,0.00024575854,0.0005682739,0.0002976612,0.00006259666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010011494,0.0004937134,0.00044234958,0.00057395245,0.00049223815,0.00041187106,0.0009341736,0.00054023194,0.0010861984],"category_scores_gemma":[0.004426846,0.0001799434,0.00026582243,0.00088655594,0.00089937355,0.0015506113,0.0011685942,0.00064267847,0.00021168182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047457093,0.00006755258,0.0007964199,0.000111677866,0.000038963437,0.0003451377,0.00035702696,0.53798896,0.01918091,0.27727678,0.001812537,0.16154951],"study_design_scores_gemma":[0.000044530152,0.0001007505,0.0001971025,0.000024220368,0.000016562852,0.00021193012,0.000030211055,0.9239367,0.0069765644,0.06555875,0.0028798878,0.000022838063],"about_ca_topic_score_codex":0.0010436658,"about_ca_topic_score_gemma":0.0010593281,"teacher_disagreement_score":0.0010861984,"about_ca_system_score_codex":0.00085720944,"about_ca_system_score_gemma":0.0005958453,"threshold_uncertainty_score":0.0062195063},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019851675,0.0023621304,0.96908844,0.00044496614,0.0002688451,0.00018701267,0.00010994516,0.0008187728,0.0068681664],"genre_scores_gemma":[0.80163133,0.002677605,0.18618517,0.00035673712,0.00022005149,0.0006294818,0.0003993262,0.00008189666,0.007818287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990109,0.00035137052,0.000054213837,0.0001048263,0.00037643063,0.000102181635],"domain_scores_gemma":[0.99864584,0.0006378131,0.00015201062,0.00015670349,0.00035896924,0.00004867948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010966903,0.0004719068,0.0005765477,0.00055590126,0.00051071215,0.0007206117,0.0009058564,0.00064149464,0.0017735291],"category_scores_gemma":[0.0034386234,0.00019379215,0.00036250177,0.0007298333,0.00076420023,0.00087638624,0.0007558467,0.0010704553,0.00039109943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041687972,0.00018876724,0.0010924547,0.00045572326,0.00012873224,0.0006802951,0.00060601695,0.5631115,0.034895204,0.21521744,0.013319169,0.16988777],"study_design_scores_gemma":[0.000051897114,0.0001981915,0.00027776894,0.000035029316,0.000044772853,0.00024398995,0.000025058593,0.9615878,0.003051168,0.020901937,0.013543661,0.00003880958],"about_ca_topic_score_codex":0.0032840518,"about_ca_topic_score_gemma":0.0041196113,"teacher_disagreement_score":0.0032840518,"about_ca_system_score_codex":0.0010301494,"about_ca_system_score_gemma":0.0011542691,"threshold_uncertainty_score":0.0074743032},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5389433,0.0016012668,0.45325828,0.00013205438,0.00003650691,0.00003919822,0.00006487586,0.00015720687,0.0057673343],"genre_scores_gemma":[0.99206406,0.00063715514,0.0066659115,0.000010374083,0.0000127990115,0.000009066938,0.000013586797,0.000008369242,0.00057861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942917,0.00023391504,0.000019946876,0.000071464056,0.00015638657,0.000089085646],"domain_scores_gemma":[0.9984762,0.0011047333,0.00016997564,0.00006720221,0.00015468446,0.000027146192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081614876,0.0012356826,0.000656047,0.00038905066,0.0003365481,0.00073786266,0.0005767423,0.0007623659,0.00032876915],"category_scores_gemma":[0.0024275722,0.00021732175,0.00039328772,0.00064583414,0.0008219194,0.00093146024,0.00049909076,0.00040161272,0.00011261694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006729404,0.000014960899,0.000696657,0.000040020186,0.000031971693,0.00025432569,0.00003779208,0.98052806,0.0071699065,0.0051583806,0.000055987464,0.005944509],"study_design_scores_gemma":[0.0000052191463,0.000075215044,0.00036560965,0.0000032022824,0.000020290532,0.00009984493,0.000017147882,0.9951395,0.0027609654,0.0013959263,0.00010868889,0.0000083451605],"about_ca_topic_score_codex":0.002797143,"about_ca_topic_score_gemma":0.0021088638,"teacher_disagreement_score":0.002797143,"about_ca_system_score_codex":0.0008131353,"about_ca_system_score_gemma":0.00035674576,"threshold_uncertainty_score":0.005899787},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3896617,0.0018511739,0.58520526,0.0006639884,0.00005865707,0.00005503337,0.0003699972,0.0002645189,0.021869646],"genre_scores_gemma":[0.9931958,0.00048439187,0.005199905,0.000033506436,0.000024095209,0.000018854991,0.000054066095,0.000012364474,0.000976982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913555,0.00031156963,0.000032267788,0.00006189554,0.0003010672,0.0001575829],"domain_scores_gemma":[0.9961606,0.002782661,0.00034493642,0.00020265431,0.0004403972,0.00006863776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014074241,0.0006532067,0.00074459746,0.0006917633,0.00041068194,0.00066552026,0.0005669179,0.0005992856,0.0008189014],"category_scores_gemma":[0.00614131,0.00025951874,0.00029518612,0.00066339853,0.00092717167,0.00096254906,0.0007458026,0.00045301425,0.00017024585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111628324,0.000031916512,0.0014397231,0.000071717026,0.000025664183,0.0005552662,0.00015046755,0.94167656,0.00429222,0.044262245,0.0006498311,0.0067328108],"study_design_scores_gemma":[0.0000047983867,0.000024621675,0.0003661148,0.0000052201267,0.0000071230334,0.00012603382,0.000032272088,0.99161994,0.0005407906,0.0070763533,0.00018890583,0.000007767685],"about_ca_topic_score_codex":0.0033841934,"about_ca_topic_score_gemma":0.0017630509,"teacher_disagreement_score":0.0033841934,"about_ca_system_score_codex":0.001455469,"about_ca_system_score_gemma":0.00084803306,"threshold_uncertainty_score":0.0105602145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09095809,0.0052280175,0.8765869,0.00070675235,0.00023718164,0.00012542069,0.00015024238,0.00048801312,0.025519378],"genre_scores_gemma":[0.9103275,0.0023162044,0.081079856,0.00012696389,0.0001346605,0.000086367174,0.00008188107,0.000029820527,0.005816745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961025,0.0001679033,0.00001377815,0.000029923624,0.00012591456,0.000052230942],"domain_scores_gemma":[0.9995795,0.00018018424,0.000058342986,0.00006126679,0.00009871483,0.000022044498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009126711,0.00043471565,0.00034731498,0.0004610089,0.00032902154,0.0005836859,0.0006061563,0.00064194784,0.001562319],"category_scores_gemma":[0.0013509863,0.00011876509,0.00020496662,0.0006363322,0.00058354234,0.0005587861,0.00042331923,0.00039022218,0.0003699446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046116946,0.000078925535,0.0014561448,0.00039356857,0.000095908064,0.00074552157,0.00015319315,0.38807175,0.040615436,0.29817772,0.011216474,0.25853416],"study_design_scores_gemma":[0.000036842597,0.0003049363,0.00054281665,0.00003798156,0.00003219677,0.0005304072,0.00003243599,0.9189222,0.017827956,0.048274178,0.013421216,0.000036916314],"about_ca_topic_score_codex":0.0012212453,"about_ca_topic_score_gemma":0.00186876,"teacher_disagreement_score":0.001562319,"about_ca_system_score_codex":0.0005721369,"about_ca_system_score_gemma":0.00061612984,"threshold_uncertainty_score":0.005226493},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020462444,0.0003609243,0.9696881,0.0005779213,0.00008521559,0.00018868603,0.00025761977,0.00027099313,0.0081080515],"genre_scores_gemma":[0.28514647,0.00065233785,0.70517707,0.0003319472,0.00013474018,0.0005364905,0.0008692171,0.00014722513,0.0070044766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914527,0.00020751175,0.000027079905,0.00013465961,0.00033607674,0.00014933317],"domain_scores_gemma":[0.99835783,0.0011121453,0.00011790528,0.00015285778,0.0001840607,0.00007503734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081603054,0.0010123439,0.0011381719,0.001224858,0.00077735935,0.0012962827,0.0018649022,0.001979634,0.0049329014],"category_scores_gemma":[0.0043203803,0.0004320024,0.0010758886,0.0018959895,0.000831651,0.0018198123,0.0017302262,0.0018507553,0.0007075469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027289297,0.00032651762,0.00063596125,0.00043154907,0.0000868325,0.0003789389,0.00029753565,0.6590667,0.009043789,0.11298912,0.018173818,0.19829635],"study_design_scores_gemma":[0.000043531563,0.000103050654,0.00013994747,0.000032064174,0.000017875338,0.00026667412,0.000062128034,0.95622486,0.0018972309,0.037958216,0.0032389087,0.000015426722],"about_ca_topic_score_codex":0.002479065,"about_ca_topic_score_gemma":0.0026561741,"teacher_disagreement_score":0.0049329014,"about_ca_system_score_codex":0.0014450956,"about_ca_system_score_gemma":0.0021415204,"threshold_uncertainty_score":0.016502202},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007598289,0.39653304,0.5451961,0.0031575651,0.0018316617,0.00016701956,0.00027132794,0.00026217994,0.04498276],"genre_scores_gemma":[0.11130194,0.7313674,0.14174397,0.0012748839,0.0028943063,0.00041999068,0.0005291261,0.00010596115,0.010362401],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992907,0.00020382492,0.00006804269,0.0000677941,0.00031887883,0.000050741113],"domain_scores_gemma":[0.9987908,0.0007559776,0.0000632165,0.00009338634,0.00026925254,0.000027434462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011036583,0.00070307974,0.0006851932,0.0011369999,0.00057087856,0.0011925498,0.00078675454,0.0010696077,0.0019488343],"category_scores_gemma":[0.0027360206,0.00041673533,0.0003088123,0.0029277506,0.00084202987,0.0020108148,0.00076340686,0.0011607789,0.0007687646],"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.000080872866,0.000101200276,0.001310901,0.0027433413,0.00005044516,0.0002337083,0.00015440694,0.032935467,0.004205111,0.2138732,0.01864516,0.7256661],"study_design_scores_gemma":[0.00003759871,0.0003476059,0.0022794856,0.0018543482,0.00010807686,0.0020065978,0.0002115086,0.20246662,0.0069542965,0.28011695,0.5034778,0.0001391201],"about_ca_topic_score_codex":0.0015583868,"about_ca_topic_score_gemma":0.0011494199,"teacher_disagreement_score":0.0019488343,"about_ca_system_score_codex":0.0007755913,"about_ca_system_score_gemma":0.001341657,"threshold_uncertainty_score":0.0065194964},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020447327,0.000030114366,0.9975873,0.000052982865,0.000003314829,0.000011351238,0.000009492196,0.000022278376,0.00023830276],"genre_scores_gemma":[0.43784818,0.0005727454,0.55883026,0.00013553936,0.000082983235,0.00036740315,0.00013508977,0.00004498058,0.0019827522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988411,0.0005462598,0.000046279605,0.0001437412,0.0003614565,0.00006109729],"domain_scores_gemma":[0.99262434,0.0057157516,0.00068420003,0.00038695685,0.00050448114,0.00008433552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002045285,0.0007654881,0.0005775416,0.0012434077,0.0004156976,0.0010567885,0.0012284068,0.00080714625,0.00080340845],"category_scores_gemma":[0.015239917,0.00044933642,0.0005343334,0.0012630299,0.0018928014,0.0026315313,0.0018536751,0.0015488083,0.00018081936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049961272,0.000029755245,0.00080186606,0.00008267356,0.000026019774,0.0000911015,0.00016456268,0.8368808,0.003841546,0.11442347,0.00039723443,0.043211017],"study_design_scores_gemma":[0.0000028249644,0.000016587554,0.000058379002,0.000004068341,0.0000030339602,0.000024577763,0.000008772811,0.98145825,0.0005797966,0.017648498,0.0001885887,0.0000066460184],"about_ca_topic_score_codex":0.0016777266,"about_ca_topic_score_gemma":0.001107522,"teacher_disagreement_score":0.002045285,"about_ca_system_score_codex":0.0011380732,"about_ca_system_score_gemma":0.0008115701,"threshold_uncertainty_score":0.010816634},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93652654,0.0008424109,0.05277868,0.00025826282,0.000030344825,0.00003860159,0.00017858506,0.00018435785,0.009162157],"genre_scores_gemma":[0.99834013,0.00007853941,0.0011870796,0.000014583411,0.0000036975391,0.000008332867,0.000034209355,0.000005336168,0.0003281526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998988,0.0003504318,0.00003967167,0.00014854514,0.00023997403,0.00023340563],"domain_scores_gemma":[0.993489,0.0047543836,0.00048861,0.0003034216,0.0007986695,0.00016576279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014292247,0.0011589277,0.0009804253,0.00052701257,0.00059507065,0.0013617495,0.00082849077,0.0012616586,0.0009386006],"category_scores_gemma":[0.0070086685,0.00028572517,0.00035713916,0.00070544024,0.0014291961,0.0012942521,0.0012733394,0.0004894221,0.0001745981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005238737,0.00006915076,0.0017438376,0.000101507394,0.000061184604,0.0003333814,0.000117907846,0.9756,0.010904932,0.00448513,0.00022359725,0.005835512],"study_design_scores_gemma":[0.000026335636,0.00024971072,0.0010431897,0.000012931781,0.00002459982,0.00018856328,0.00006017638,0.9926369,0.0035079273,0.0021197516,0.00009404909,0.00003584448],"about_ca_topic_score_codex":0.005747665,"about_ca_topic_score_gemma":0.0025567608,"teacher_disagreement_score":0.005747665,"about_ca_system_score_codex":0.001062192,"about_ca_system_score_gemma":0.0010599681,"threshold_uncertainty_score":0.011428416},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12742785,0.0007495236,0.8682103,0.00023701784,0.000059480706,0.000034362994,0.000029718054,0.00012684872,0.0031248606],"genre_scores_gemma":[0.8865752,0.00064685463,0.110512264,0.00007993536,0.000102052334,0.000037164675,0.00004469507,0.000009835288,0.0019920259],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937063,0.00016590976,0.000023005188,0.000109480454,0.0002818288,0.000049188366],"domain_scores_gemma":[0.9982887,0.0010752672,0.0001789557,0.000111679175,0.00031525726,0.00003007278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077397545,0.0005423607,0.00061886234,0.00034432727,0.00035006495,0.00045897698,0.00048885844,0.0007726023,0.00035212646],"category_scores_gemma":[0.0038513185,0.0002271042,0.00023316764,0.0005258597,0.00065978,0.0008872418,0.00049770594,0.00040590565,0.00017065475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011260929,0.0001226545,0.0046417722,0.00044761857,0.00013731506,0.0011689214,0.0008977717,0.52037674,0.13604139,0.031936143,0.0013590218,0.3017446],"study_design_scores_gemma":[0.000023167602,0.00014395996,0.0005209915,0.000013607794,0.000024968534,0.00027768305,0.000046090892,0.9851864,0.010394662,0.0027603828,0.0005952004,0.000012923497],"about_ca_topic_score_codex":0.0018433084,"about_ca_topic_score_gemma":0.0016692239,"teacher_disagreement_score":0.0018433084,"about_ca_system_score_codex":0.00032066827,"about_ca_system_score_gemma":0.0005251251,"threshold_uncertainty_score":0.00409323},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06788792,0.00084436475,0.92815906,0.00010210546,0.000020756806,0.00008711067,0.00006337908,0.0002327235,0.002602484],"genre_scores_gemma":[0.9427662,0.00060023915,0.05555961,0.000041342704,0.000026326055,0.00010437807,0.00008107843,0.00004529065,0.0007756724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973884,0.0013471588,0.000094368166,0.00018079806,0.0007368257,0.00025240722],"domain_scores_gemma":[0.995751,0.0030223385,0.0002667086,0.00021295928,0.0006429213,0.000103992264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042968756,0.0011600908,0.000978056,0.0008188515,0.00048870326,0.0010791076,0.0013640658,0.0008322337,0.0010015515],"category_scores_gemma":[0.009603981,0.00029714088,0.00047952047,0.00066721876,0.0008107747,0.0012749989,0.00085478,0.00086125225,0.00025334567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008858493,0.000053977896,0.0003709624,0.00004276597,0.000021519158,0.000054427197,0.000036013178,0.9820274,0.003510482,0.0063385554,0.00017736758,0.00727786],"study_design_scores_gemma":[0.0000024421543,0.000042325755,0.00007746498,0.0000026768946,0.0000036983515,0.000010822953,0.0000065323593,0.9984995,0.0006348449,0.00065400713,0.00006222432,0.0000034736802],"about_ca_topic_score_codex":0.004011291,"about_ca_topic_score_gemma":0.0017513094,"teacher_disagreement_score":0.0042968756,"about_ca_system_score_codex":0.0022105572,"about_ca_system_score_gemma":0.0011028139,"threshold_uncertainty_score":0.02272427},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77119565,0.0016484689,0.21273522,0.001479698,0.000078104174,0.00007218979,0.00063336646,0.00047599006,0.011681288],"genre_scores_gemma":[0.99762434,0.00017786506,0.0014495819,0.00005910592,0.000027283308,0.000025904337,0.000084803585,0.000020749514,0.000530387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99478155,0.002537053,0.00021138278,0.0005403173,0.0010164164,0.0009131914],"domain_scores_gemma":[0.9216673,0.06660546,0.0055082673,0.002297802,0.0030922694,0.0008289484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008499962,0.0010606064,0.0020336409,0.0009095454,0.0008825143,0.0016578924,0.001123656,0.002057171,0.0018060851],"category_scores_gemma":[0.043992825,0.00064948277,0.0004751658,0.001141656,0.0033698333,0.0023543122,0.0021164718,0.0011854379,0.0003121179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017461774,0.00013119695,0.016340645,0.00026349185,0.00021027625,0.0021115632,0.00073105673,0.92149746,0.005878132,0.03560603,0.0018609344,0.013623089],"study_design_scores_gemma":[0.00013960752,0.00038892202,0.0073289466,0.000052557178,0.0001489392,0.0014516091,0.0003167331,0.96381176,0.0055362405,0.020241063,0.0004896639,0.00009390852],"about_ca_topic_score_codex":0.0021632058,"about_ca_topic_score_gemma":0.00088947336,"teacher_disagreement_score":0.008499962,"about_ca_system_score_codex":0.0016838826,"about_ca_system_score_gemma":0.0012620594,"threshold_uncertainty_score":0.04495263},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7607927,0.00962398,0.17503397,0.01042168,0.0007366871,0.00005975249,0.0012006485,0.00074248906,0.04138807],"genre_scores_gemma":[0.98979694,0.0017501343,0.0043161586,0.00022071443,0.00028905598,0.000025413394,0.00015168005,0.00024881447,0.003201157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982028,0.00062381657,0.00006571142,0.00019787496,0.00043549913,0.00047433865],"domain_scores_gemma":[0.81465054,0.17174274,0.0047570076,0.0027403526,0.0038758402,0.002233528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035725185,0.0007418267,0.0014317544,0.0016682111,0.001739193,0.003027491,0.0019341855,0.0022002575,0.008286573],"category_scores_gemma":[0.06285181,0.0011220505,0.00046278437,0.0023486419,0.0027649822,0.0067379046,0.0019142386,0.0024332844,0.0006154634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038932466,0.00046478424,0.006706151,0.0007204746,0.00012390855,0.00057782885,0.0011138648,0.6137407,0.02158746,0.2824273,0.008199902,0.060444254],"study_design_scores_gemma":[0.00022149866,0.00032094354,0.0034958788,0.000088343266,0.00016089388,0.000328735,0.00033103095,0.76292753,0.0074404734,0.22295763,0.0016026705,0.0001244493],"about_ca_topic_score_codex":0.0029039297,"about_ca_topic_score_gemma":0.0039039408,"teacher_disagreement_score":0.008286573,"about_ca_system_score_codex":0.0027618378,"about_ca_system_score_gemma":0.0017886839,"threshold_uncertainty_score":0.027721345},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6583603,0.0020555733,0.32456526,0.000452988,0.000045502533,0.000056730278,0.00010824979,0.00036310925,0.013992195],"genre_scores_gemma":[0.9917748,0.00020708103,0.007087826,0.00002385786,0.000014048135,0.000022167078,0.00003325319,0.00001608151,0.0008208378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897325,0.000353018,0.000022109298,0.00008303811,0.00043638967,0.00013219584],"domain_scores_gemma":[0.9953719,0.0028607727,0.0003741361,0.0003094044,0.0010025372,0.00008128311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017582002,0.00071916933,0.00045963613,0.0006748838,0.0005084683,0.00066227856,0.0006049783,0.00080032373,0.00077917153],"category_scores_gemma":[0.0062472243,0.0002025869,0.00026104593,0.0005616693,0.001037522,0.00061272597,0.0006349286,0.00040974515,0.00019721154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007201936,0.000020886157,0.00074438157,0.000032099633,0.0000188449,0.00008240516,0.00008400008,0.97620595,0.005194421,0.010291204,0.00030231941,0.006951424],"study_design_scores_gemma":[0.0000041920553,0.00003551038,0.00021453275,0.0000048772486,0.000004477126,0.000029176856,0.00001472904,0.99724495,0.00092931406,0.0014233775,0.00008880681,0.000006015772],"about_ca_topic_score_codex":0.005395905,"about_ca_topic_score_gemma":0.003702203,"teacher_disagreement_score":0.005395905,"about_ca_system_score_codex":0.0018593178,"about_ca_system_score_gemma":0.0010065242,"threshold_uncertainty_score":0.013490379},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7760209,0.0009533933,0.2179749,0.00040298223,0.000034184548,0.000033775137,0.000103668404,0.0003776442,0.004098603],"genre_scores_gemma":[0.9984097,0.00011524437,0.0012990303,0.000017298868,0.0000047144727,0.0000061868236,0.000018274643,0.000009258146,0.0001202901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970667,0.0011912633,0.000104686165,0.00021669788,0.000875653,0.0005449733],"domain_scores_gemma":[0.9699507,0.023259541,0.0025951762,0.0015399713,0.002409489,0.00024517957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036900397,0.001007002,0.0009185816,0.0005037152,0.000703142,0.0012605505,0.0006490827,0.0010837436,0.00031212025],"category_scores_gemma":[0.035875384,0.0004701817,0.00021443091,0.0005941347,0.0017626281,0.0017733664,0.0014524976,0.00071911793,0.00012735561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010132976,0.000016972965,0.0025109164,0.000024859126,0.000028206956,0.00013453387,0.00007242277,0.98881525,0.002025385,0.0018011868,0.00008093264,0.0043879305],"study_design_scores_gemma":[0.000012294211,0.00015959867,0.0025286952,0.000016085678,0.00003676778,0.00016155513,0.000094757685,0.98713756,0.0072972314,0.002382734,0.0001360533,0.00003674338],"about_ca_topic_score_codex":0.0052396245,"about_ca_topic_score_gemma":0.0030786933,"teacher_disagreement_score":0.0052396245,"about_ca_system_score_codex":0.0011763613,"about_ca_system_score_gemma":0.0013018547,"threshold_uncertainty_score":0.019514978},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07896023,0.0012042706,0.83384436,0.006853997,0.00039593357,0.00013164707,0.0005155597,0.00041810353,0.077675834],"genre_scores_gemma":[0.8789984,0.001579978,0.10190491,0.0012152691,0.00074941566,0.00025187503,0.00038190646,0.00017512988,0.01474307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990889,0.00033002786,0.000031587624,0.0001675458,0.00024401286,0.00013798091],"domain_scores_gemma":[0.9956938,0.0024558732,0.0003021051,0.0008543647,0.0004892047,0.0002046607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001190736,0.0005309608,0.00044348367,0.0010166421,0.0010444908,0.0016936774,0.0011030865,0.0011153022,0.0049419375],"category_scores_gemma":[0.006885786,0.00025359628,0.0006928404,0.0008617087,0.0032899259,0.004373321,0.0019287118,0.0026941013,0.0005510776],"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.000012152263,0.0000057651087,0.000081164755,0.000021663625,0.0000019854263,0.00002469128,0.0000886036,0.0046227686,0.00056092546,0.99088645,0.00077273475,0.0029210886],"study_design_scores_gemma":[0.000007798314,0.000024151335,0.00010395631,0.000017800165,0.000004292594,0.00007833791,0.00006118542,0.034300357,0.0007217219,0.9570551,0.0076162904,0.000008918397],"about_ca_topic_score_codex":0.002170812,"about_ca_topic_score_gemma":0.0015434765,"teacher_disagreement_score":0.0049419375,"about_ca_system_score_codex":0.002144757,"about_ca_system_score_gemma":0.001011767,"threshold_uncertainty_score":0.016532421},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005349835,0.000149835,0.9935209,0.00006228213,0.000048171158,0.000030666382,0.000015378699,0.0001904672,0.0006323908],"genre_scores_gemma":[0.222664,0.00021407426,0.7737693,0.00019468516,0.00012446618,0.00008269338,0.00008202443,0.00002417863,0.0028445756],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994093,0.0001019388,0.000032747917,0.00014052857,0.00027008943,0.00004539527],"domain_scores_gemma":[0.9993376,0.00018802575,0.000058764937,0.00019014237,0.00019606609,0.000029317629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005483164,0.00053246494,0.000746704,0.00043536656,0.00034425437,0.0004946978,0.0013344618,0.00082712143,0.0015903958],"category_scores_gemma":[0.0013752038,0.00025848704,0.00039152618,0.00036194408,0.00044089367,0.0011529685,0.00085808913,0.00089613075,0.00077073777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004106131,0.00025207349,0.00086458476,0.00032110128,0.00013297725,0.000269171,0.00015807878,0.05164137,0.45750937,0.04907518,0.0034919945,0.4358735],"study_design_scores_gemma":[0.00014468774,0.00042909262,0.0006014128,0.000027672508,0.00007761701,0.0009908167,0.00002460936,0.8657303,0.10982495,0.009630018,0.012445845,0.00007297496],"about_ca_topic_score_codex":0.00025805415,"about_ca_topic_score_gemma":0.00064281997,"teacher_disagreement_score":0.0015903958,"about_ca_system_score_codex":0.00027991808,"about_ca_system_score_gemma":0.00055457687,"threshold_uncertainty_score":0.00532043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19695969,0.0008246744,0.79355955,0.00038878107,0.000025827307,0.00005746406,0.00007449129,0.00013173553,0.0079777725],"genre_scores_gemma":[0.9508501,0.0006784222,0.046728283,0.00008843746,0.000056833156,0.00008284101,0.000083397,0.000021464373,0.001410213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925715,0.00021363782,0.000019730183,0.0000589357,0.0003676259,0.000082887695],"domain_scores_gemma":[0.9941392,0.0042996984,0.00045200202,0.0004784882,0.0005137783,0.000116868614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013243115,0.000683293,0.0006663345,0.0006105304,0.00032808154,0.0006724579,0.00058037543,0.00078961876,0.0008092803],"category_scores_gemma":[0.0068685873,0.00024832194,0.00037746533,0.000630348,0.0015113896,0.0012814264,0.0010471392,0.001098484,0.00026683608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003631432,0.00013208702,0.0025583003,0.00016697428,0.00007503266,0.00045526735,0.0003998459,0.71344286,0.04208252,0.20034336,0.0009406902,0.039039884],"study_design_scores_gemma":[0.00002430028,0.00010162516,0.0005045829,0.000017415423,0.000012543307,0.00022890404,0.000032742668,0.9552431,0.00715124,0.036319096,0.00033293117,0.00003146928],"about_ca_topic_score_codex":0.00047490202,"about_ca_topic_score_gemma":0.00036328845,"teacher_disagreement_score":0.0013243115,"about_ca_system_score_codex":0.0007342936,"about_ca_system_score_gemma":0.0007366637,"threshold_uncertainty_score":0.0070037246},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5887174,0.0027866024,0.40152973,0.00044999883,0.00006185806,0.000040608298,0.00012235135,0.0004575633,0.005833826],"genre_scores_gemma":[0.992706,0.0004256849,0.006478906,0.00002432447,0.0000101477835,0.000008239899,0.000022271548,0.000015219368,0.00030913122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982109,0.00068036007,0.000091823116,0.00022713092,0.0005660369,0.00022363348],"domain_scores_gemma":[0.9833139,0.013563396,0.0009248502,0.0009045606,0.0012197235,0.000073542156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002719763,0.0011429192,0.00086814683,0.00047132262,0.00046239945,0.001009536,0.0006533836,0.0010036086,0.00046439184],"category_scores_gemma":[0.018654503,0.00027589657,0.00025101347,0.0005420573,0.00095459475,0.0016696522,0.0009932432,0.0006572943,0.00012580353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018437093,0.000036864163,0.0027346166,0.000097601674,0.00005964877,0.00018050456,0.00010147207,0.9603255,0.006812347,0.004952743,0.00014452697,0.02436985],"study_design_scores_gemma":[0.000014411713,0.0002605336,0.0015178722,0.00002209934,0.0000540949,0.00029311917,0.0000446224,0.97678137,0.017860422,0.0028612313,0.00025380054,0.00003651681],"about_ca_topic_score_codex":0.0019896764,"about_ca_topic_score_gemma":0.0014272566,"teacher_disagreement_score":0.002719763,"about_ca_system_score_codex":0.0006844466,"about_ca_system_score_gemma":0.00072682305,"threshold_uncertainty_score":0.014383614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015931166,0.0016147104,0.9776494,0.00045508487,0.00029909046,0.000067620516,0.000058375983,0.00019892944,0.018063657],"genre_scores_gemma":[0.4054223,0.0058979313,0.5486141,0.002173162,0.0010469662,0.000908363,0.00027277088,0.0001298934,0.035534512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946696,0.0001555172,0.000027411492,0.000074375705,0.00021829923,0.000057471338],"domain_scores_gemma":[0.9993968,0.00018759625,0.00004945004,0.00007534279,0.00027315115,0.000017628994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072646776,0.0005474083,0.00031446197,0.0005525426,0.0004507102,0.0010983276,0.0006572642,0.0007248047,0.006145383],"category_scores_gemma":[0.0019653721,0.00018720156,0.00027107424,0.0006783812,0.00044974333,0.0007040637,0.0006462236,0.0008652411,0.0013509323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000929782,0.000040786745,0.00027764862,0.000330817,0.000051432522,0.00016825873,0.00015721384,0.08592006,0.017554127,0.6532957,0.013749179,0.22836176],"study_design_scores_gemma":[0.000050437706,0.00023288131,0.00040014763,0.00027756195,0.00007805778,0.0006128164,0.00005058439,0.6209213,0.010842295,0.22782691,0.13864523,0.00006169581],"about_ca_topic_score_codex":0.001268739,"about_ca_topic_score_gemma":0.0013526498,"teacher_disagreement_score":0.006145383,"about_ca_system_score_codex":0.00079132034,"about_ca_system_score_gemma":0.00077757565,"threshold_uncertainty_score":0.020558357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047094684,0.0072886525,0.91375965,0.0013787182,0.00014296295,0.00008756352,0.000235267,0.00028752594,0.02972485],"genre_scores_gemma":[0.8534682,0.010953664,0.12882318,0.0004320552,0.0007709371,0.0007061814,0.0003453086,0.00027560425,0.004225044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995246,0.0027402546,0.00019096704,0.00027139738,0.0010572147,0.00049409753],"domain_scores_gemma":[0.98337674,0.014102927,0.0006038262,0.0007473123,0.000986155,0.00018297981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056999614,0.0021720012,0.0018335232,0.0017880669,0.0012833953,0.0029810567,0.0017288695,0.001934307,0.0020566306],"category_scores_gemma":[0.032244068,0.0009954125,0.0006799521,0.0021552744,0.0027256722,0.0040827943,0.002527233,0.0025791973,0.0008888431],"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.0002742697,0.0000489749,0.00037737953,0.00032421268,0.000051349736,0.00020787025,0.00034256277,0.44484377,0.0042787855,0.5158062,0.0026950275,0.030749548],"study_design_scores_gemma":[0.000046680707,0.00007359654,0.00016199324,0.00014507677,0.000019841174,0.00015769052,0.000078488185,0.64532715,0.0022927308,0.3488003,0.0028641636,0.00003228431],"about_ca_topic_score_codex":0.00080000045,"about_ca_topic_score_gemma":0.00059968524,"teacher_disagreement_score":0.0056999614,"about_ca_system_score_codex":0.0021038624,"about_ca_system_score_gemma":0.0010156047,"threshold_uncertainty_score":0.030144632},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017856544,0.0007668564,0.9776307,0.00022799759,0.00022690889,0.000092102666,0.000022767197,0.0009826106,0.002193626],"genre_scores_gemma":[0.9216569,0.00053480326,0.07588818,0.00019420101,0.00015057783,0.00017022331,0.00004874227,0.00007763881,0.001278616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986921,0.00047186363,0.00006482067,0.00015040717,0.00044194225,0.00017892048],"domain_scores_gemma":[0.9967602,0.0016073495,0.00033292227,0.00044295902,0.0007306566,0.00012594603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023954099,0.00076944183,0.0007213717,0.000860439,0.0007660737,0.0010726409,0.0020373922,0.0006677729,0.00077308755],"category_scores_gemma":[0.006801357,0.00025840153,0.00045593525,0.00067274447,0.0012197968,0.0018261098,0.0014168264,0.001242599,0.00010347383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038097028,0.00021566593,0.00244487,0.00028866282,0.00016152063,0.00038782385,0.00029463283,0.6278016,0.0190891,0.11896358,0.0048542866,0.22511739],"study_design_scores_gemma":[0.000014700685,0.0001011136,0.0001405326,0.000015248598,0.000030461082,0.00012992407,0.000019343137,0.98154014,0.003124161,0.012690266,0.0021664186,0.000027744916],"about_ca_topic_score_codex":0.002838351,"about_ca_topic_score_gemma":0.0027437822,"teacher_disagreement_score":0.002838351,"about_ca_system_score_codex":0.0009350146,"about_ca_system_score_gemma":0.0017682365,"threshold_uncertainty_score":0.012668252},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074176835,0.00036813304,0.98950434,0.0001223885,0.000041522737,0.000022446327,0.000025413681,0.00005495384,0.0024431525],"genre_scores_gemma":[0.5042321,0.0027642944,0.48184347,0.00021543063,0.00014797747,0.00018155311,0.0001085192,0.000042866563,0.010463827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962056,0.0001417676,0.000015533053,0.000068450914,0.000107835054,0.000045895766],"domain_scores_gemma":[0.99907696,0.0005668042,0.00010525709,0.00007380442,0.00015570727,0.000021431006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009853096,0.0010419367,0.0006763312,0.00026340075,0.0002953218,0.0005437194,0.000598816,0.0012973925,0.0020706502],"category_scores_gemma":[0.0022303625,0.0002809994,0.0005179896,0.0004875078,0.00051179837,0.001338551,0.00039700925,0.0005861659,0.0008369695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015983937,0.000068515204,0.0006527858,0.00028506108,0.00010092947,0.00027657102,0.00014781908,0.7554204,0.040822078,0.109937154,0.0018736976,0.09025518],"study_design_scores_gemma":[0.000019497806,0.00015987079,0.00013003888,0.000016999837,0.000027231024,0.00019133864,0.00002585026,0.98046434,0.005643696,0.010752823,0.0025483929,0.000019931043],"about_ca_topic_score_codex":0.001224312,"about_ca_topic_score_gemma":0.0017827139,"teacher_disagreement_score":0.0020706502,"about_ca_system_score_codex":0.00051321945,"about_ca_system_score_gemma":0.0005308955,"threshold_uncertainty_score":0.006926954},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02161119,0.0074248323,0.92989385,0.0040327804,0.0011018786,0.00011581414,0.0003099684,0.0002003493,0.03530927],"genre_scores_gemma":[0.77951914,0.022938881,0.13678867,0.0009907486,0.0029349944,0.00058479205,0.0005484342,0.0002456179,0.05544877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947387,0.00016172424,0.00003232067,0.000058481262,0.00022787965,0.000045749508],"domain_scores_gemma":[0.9987023,0.00080307794,0.00019028317,0.00009198211,0.00016749247,0.00004492111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008454291,0.0005232173,0.00072025816,0.00093518407,0.0004807553,0.0018045591,0.00090304145,0.0014157312,0.0025315543],"category_scores_gemma":[0.0049747485,0.00026747872,0.00072188536,0.0009175605,0.0010266218,0.0021486261,0.0011241329,0.0013615892,0.000580488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002154828,0.00003727831,0.0005412225,0.00015875218,0.000037418682,0.00013550166,0.00015241532,0.44271633,0.0022653714,0.530086,0.007291167,0.016557084],"study_design_scores_gemma":[0.0000072619123,0.0000157612,0.00016295987,0.000018924013,0.000007662416,0.000055604167,0.000017776278,0.88936865,0.00026759424,0.10312562,0.0069421344,0.000009987767],"about_ca_topic_score_codex":0.0016260248,"about_ca_topic_score_gemma":0.0005804581,"teacher_disagreement_score":0.0025315543,"about_ca_system_score_codex":0.0009764922,"about_ca_system_score_gemma":0.0007474362,"threshold_uncertainty_score":0.008468926},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024778334,0.0004311849,0.97358537,0.00013928299,0.00001963204,0.000016459328,0.000022829232,0.00010607143,0.00090082193],"genre_scores_gemma":[0.8953148,0.00072589505,0.1020356,0.00007558743,0.000065798005,0.000086641914,0.00007461681,0.00002321241,0.0015978788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859303,0.00062447955,0.000050653056,0.00024639536,0.00032661573,0.00015867932],"domain_scores_gemma":[0.9928556,0.0054996805,0.0005942045,0.0003762197,0.000597542,0.00007679908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001700189,0.00080428476,0.00090152194,0.00045868705,0.0004367016,0.0006763219,0.0007957265,0.0009798869,0.0005732537],"category_scores_gemma":[0.00941242,0.00051994104,0.0003391548,0.00074506307,0.0014083418,0.0016551662,0.0007957451,0.000878188,0.00015569334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012649641,0.000025153538,0.0004295004,0.000066125285,0.000024849965,0.000079544305,0.000111321606,0.94864225,0.0019151532,0.010539467,0.00033290262,0.037707165],"study_design_scores_gemma":[0.000015525704,0.000032647455,0.00012539385,0.0000066204097,0.000010195347,0.00003740783,0.000015822457,0.9945872,0.001241697,0.0036912865,0.0002269879,0.000009311449],"about_ca_topic_score_codex":0.0058667706,"about_ca_topic_score_gemma":0.0033501338,"teacher_disagreement_score":0.0058667706,"about_ca_system_score_codex":0.0010524592,"about_ca_system_score_gemma":0.0011911613,"threshold_uncertainty_score":0.011665225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054272357,0.00035905393,0.98998207,0.00029139005,0.00004742516,0.00008396196,0.00007908797,0.00028383872,0.0034459825],"genre_scores_gemma":[0.3555782,0.0009954304,0.63496655,0.00038594447,0.00017916226,0.001149557,0.00056673476,0.00035101947,0.005827363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986172,0.0006443619,0.00005589652,0.00015401735,0.00029979015,0.00022878198],"domain_scores_gemma":[0.9908058,0.007955556,0.00034354517,0.00027753404,0.00044442277,0.00017301872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033422129,0.0017005848,0.001651824,0.0011507017,0.00074783876,0.001437168,0.0019880268,0.002051992,0.004141529],"category_scores_gemma":[0.011907759,0.0007030181,0.0013090676,0.0016477501,0.0014555329,0.0016865765,0.0024898874,0.0025602132,0.0006193943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005096425,0.000038753733,0.00024590647,0.000060452207,0.000019647736,0.000023700824,0.000041616677,0.94256467,0.0002442065,0.03733864,0.0013304896,0.018040862],"study_design_scores_gemma":[0.0000113086335,0.000007412706,0.000023175058,0.000005698732,0.000002256188,0.000004214724,0.0000042626816,0.9830273,0.000073458825,0.016557423,0.0002807502,0.000002761209],"about_ca_topic_score_codex":0.008152516,"about_ca_topic_score_gemma":0.006895409,"teacher_disagreement_score":0.008152516,"about_ca_system_score_codex":0.0033929937,"about_ca_system_score_gemma":0.0029432562,"threshold_uncertainty_score":0.02461803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087597355,0.00057099946,0.9052162,0.00034326455,0.000022560087,0.00004487675,0.000102519065,0.000104210194,0.005998024],"genre_scores_gemma":[0.9672492,0.00045135073,0.030205771,0.00006180672,0.00003902676,0.000060742623,0.000063935644,0.0000364179,0.0018318456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987425,0.00050969556,0.00006258976,0.00019410986,0.00029034127,0.00020072494],"domain_scores_gemma":[0.997033,0.0020158929,0.00037079075,0.00014507529,0.00032766545,0.00010756197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001835314,0.0011355106,0.0010280013,0.00057580933,0.00044458988,0.0012118788,0.0009689951,0.00085871614,0.0010271388],"category_scores_gemma":[0.0038504405,0.00038393322,0.00040570853,0.0009452556,0.0007819485,0.0012305259,0.00096348405,0.000853244,0.00025409897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001520391,0.00006616832,0.00045375558,0.00013499727,0.000046849364,0.00020631951,0.00015602789,0.9389254,0.006172217,0.032249007,0.00077622174,0.020661006],"study_design_scores_gemma":[0.000009534622,0.000058999165,0.00015390095,0.0000061502283,0.000012096027,0.00006987074,0.000030753723,0.9868976,0.0008287423,0.011663945,0.0002587256,0.000009615765],"about_ca_topic_score_codex":0.0014904261,"about_ca_topic_score_gemma":0.0010933195,"teacher_disagreement_score":0.001835314,"about_ca_system_score_codex":0.0014276848,"about_ca_system_score_gemma":0.00093822106,"threshold_uncertainty_score":0.010358572},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6832632,0.0007873404,0.3034725,0.00030549342,0.000034501354,0.00005542665,0.00005722558,0.00036997627,0.0116543025],"genre_scores_gemma":[0.99319893,0.00009827497,0.006181072,0.000024244353,0.000008490107,0.00001904991,0.000010424353,0.000004976627,0.0004543632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990569,0.00041656033,0.000026756177,0.00013745824,0.000185831,0.00017656654],"domain_scores_gemma":[0.99747723,0.0015831493,0.00027461178,0.00019276113,0.00040409729,0.00006822888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001945204,0.00085355464,0.0007142894,0.00045951587,0.0006834418,0.0009482138,0.0006659676,0.0011348801,0.0005078403],"category_scores_gemma":[0.0041594207,0.0002992649,0.00032595996,0.00065387506,0.0015491246,0.00095542776,0.0011042057,0.00039554032,0.00016733029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034842035,0.00005173889,0.0016779404,0.00004855346,0.00006573757,0.00024426545,0.00014065269,0.96155864,0.01287687,0.009022395,0.0002740422,0.013690739],"study_design_scores_gemma":[0.000019193008,0.0001603213,0.00031839943,0.0000055379646,0.00002797172,0.00009013345,0.000035435656,0.99462754,0.002371655,0.0021761921,0.00015371219,0.000013966167],"about_ca_topic_score_codex":0.004796676,"about_ca_topic_score_gemma":0.0022329532,"teacher_disagreement_score":0.004796676,"about_ca_system_score_codex":0.0009898824,"about_ca_system_score_gemma":0.00072420406,"threshold_uncertainty_score":0.010287285},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029609995,0.000282906,0.96672976,0.00011762713,0.000012483826,0.000033120657,0.000024689187,0.000056253317,0.0031331554],"genre_scores_gemma":[0.90114856,0.00035108862,0.09623197,0.00004112049,0.000023890765,0.00011279071,0.000024582094,0.000021930739,0.0020440528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994382,0.00026790766,0.000020343017,0.00005790833,0.00014051521,0.00007512879],"domain_scores_gemma":[0.9992692,0.0005274742,0.00007692389,0.000050330327,0.000054616903,0.000021441712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010612028,0.00068042136,0.00058817444,0.00033217267,0.0003568121,0.0008186615,0.0008156531,0.00070481154,0.0011514358],"category_scores_gemma":[0.0020496363,0.00033646263,0.00045520242,0.0006371308,0.0007335736,0.0011991018,0.0008420693,0.0004718652,0.00028221618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063125684,0.000060931325,0.00025379992,0.00005365824,0.00002068102,0.00013170131,0.000091812995,0.9484138,0.003864328,0.019993061,0.00037949425,0.026673678],"study_design_scores_gemma":[0.000008833392,0.00002263791,0.000047471123,0.0000023707871,0.000004771015,0.000029745055,0.000012815303,0.9936186,0.0005526755,0.005525224,0.00016982903,0.0000049662535],"about_ca_topic_score_codex":0.0016657606,"about_ca_topic_score_gemma":0.002469654,"teacher_disagreement_score":0.0016657606,"about_ca_system_score_codex":0.000672473,"about_ca_system_score_gemma":0.0006909543,"threshold_uncertainty_score":0.005612254},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12473028,0.00069553405,0.87046385,0.00031935406,0.000022664219,0.000057972335,0.000102941194,0.00015122893,0.0034562233],"genre_scores_gemma":[0.94398004,0.0002442746,0.0546029,0.00003923975,0.000017172388,0.00006467326,0.000038433504,0.000016915703,0.000996311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994611,0.00031942234,0.000018051227,0.000060382074,0.000066557375,0.000074376825],"domain_scores_gemma":[0.9983051,0.001376133,0.00013257415,0.000075843374,0.00007359508,0.000036821537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013846825,0.00055725855,0.0007993772,0.0005568389,0.0004290113,0.000602293,0.0010074322,0.0005479032,0.001042758],"category_scores_gemma":[0.0034784689,0.00029638913,0.0002730552,0.0008121762,0.00071075914,0.0010675107,0.00063172524,0.00030093952,0.0001281264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016374976,0.000026662621,0.00037924998,0.000038332928,0.000023860364,0.00006855111,0.000053715576,0.9723103,0.0011018274,0.010559235,0.00046807327,0.014806544],"study_design_scores_gemma":[0.000011608527,0.000022844846,0.00006878451,0.0000024211058,0.0000046481355,0.000018193223,0.000012255236,0.9925736,0.00040430756,0.006722127,0.0001556016,0.0000036423316],"about_ca_topic_score_codex":0.0018489118,"about_ca_topic_score_gemma":0.001827201,"teacher_disagreement_score":0.0018489118,"about_ca_system_score_codex":0.0010051171,"about_ca_system_score_gemma":0.00046964933,"threshold_uncertainty_score":0.007322967},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20990318,0.001593386,0.76543474,0.00054316275,0.000053102183,0.000107368425,0.00018522961,0.000379553,0.021800322],"genre_scores_gemma":[0.9899402,0.00044597228,0.008138394,0.0000349136,0.000018607268,0.000044286622,0.00004371423,0.000016891212,0.0013170198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998841,0.00035660836,0.0000458878,0.00013593292,0.00037974305,0.00024094101],"domain_scores_gemma":[0.9948608,0.003608246,0.0004720381,0.00022245695,0.0007578898,0.00007864608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016910204,0.0011643964,0.0009394823,0.00087447104,0.00052291446,0.0011530136,0.0008279797,0.0008735733,0.0015595981],"category_scores_gemma":[0.0070274738,0.00034170118,0.0003859019,0.00089021533,0.0009535,0.0009869998,0.00088690914,0.0004953919,0.00029792494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018540525,0.00003879399,0.0009831901,0.00010452683,0.00003898596,0.0003052536,0.0001164663,0.9535958,0.0059500406,0.023808384,0.00045755634,0.014415469],"study_design_scores_gemma":[0.000006425143,0.000066483546,0.00020746698,0.0000059454374,0.000012478137,0.00010934629,0.000022911223,0.9953361,0.0010034291,0.0030619276,0.0001588605,0.000008483664],"about_ca_topic_score_codex":0.0037111102,"about_ca_topic_score_gemma":0.0022247517,"teacher_disagreement_score":0.0037111102,"about_ca_system_score_codex":0.0014705985,"about_ca_system_score_gemma":0.0011587214,"threshold_uncertainty_score":0.010669947},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06582065,0.0014744803,0.9307524,0.00015390401,0.000032432905,0.000040755112,0.000012511143,0.00010411531,0.0016087018],"genre_scores_gemma":[0.9246154,0.0009665621,0.072364405,0.000040748087,0.00005094682,0.00007494363,0.000025543119,0.000015080907,0.0018463186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999238,0.00039975534,0.00003232574,0.000099378565,0.00017350006,0.000057011574],"domain_scores_gemma":[0.9991211,0.00060278154,0.00008558054,0.000076876924,0.00008679263,0.000026736014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013469754,0.00048324734,0.0005293412,0.00036449693,0.00040632876,0.0006057064,0.0006632711,0.0006126828,0.00027522218],"category_scores_gemma":[0.002266551,0.00029567367,0.0003062419,0.00057277066,0.00065302564,0.0010320718,0.0005832835,0.00025199997,0.00008865265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009550258,0.000050355135,0.0011731229,0.000111688976,0.000059161757,0.00032980694,0.00023408548,0.87017834,0.012332798,0.022473797,0.0005458047,0.09241551],"study_design_scores_gemma":[0.000020789972,0.00015782872,0.00032779778,0.0000059935282,0.00003390255,0.000172357,0.00006593167,0.98031,0.0035594907,0.014024344,0.0013085833,0.000012915992],"about_ca_topic_score_codex":0.0006454862,"about_ca_topic_score_gemma":0.0007844839,"teacher_disagreement_score":0.0013469754,"about_ca_system_score_codex":0.00023665442,"about_ca_system_score_gemma":0.0003467939,"threshold_uncertainty_score":0.0071235895},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83716196,0.00079525093,0.15384163,0.00023076101,0.00002403466,0.00007392204,0.00009176011,0.00019527959,0.007585367],"genre_scores_gemma":[0.99312854,0.0001107057,0.006219893,0.000015429629,0.0000042685715,0.000018830158,0.000014594776,0.00000610923,0.00048166738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988071,0.0005942973,0.00008908804,0.0001343985,0.00021772487,0.00015742687],"domain_scores_gemma":[0.99529666,0.0034040664,0.0005033228,0.00023532227,0.00047452608,0.000086193904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002092192,0.0007779188,0.00077309384,0.00044677703,0.00041104874,0.0010322778,0.00066257274,0.00086027215,0.0009495523],"category_scores_gemma":[0.00485074,0.00027480556,0.00033221036,0.0006191688,0.00095938204,0.0008548912,0.00070798467,0.00041984097,0.00024798763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011539393,0.00013619353,0.0032635892,0.00015937357,0.00011268035,0.00023297619,0.00035123652,0.92229307,0.027561903,0.009665818,0.00027268374,0.0347965],"study_design_scores_gemma":[0.0000525921,0.00049507467,0.0014077108,0.000015016433,0.00004921614,0.0001607746,0.00008292709,0.9812531,0.013078046,0.003213164,0.00016921302,0.000023085804],"about_ca_topic_score_codex":0.001540614,"about_ca_topic_score_gemma":0.0015138297,"teacher_disagreement_score":0.002092192,"about_ca_system_score_codex":0.0008338347,"about_ca_system_score_gemma":0.00051069923,"threshold_uncertainty_score":0.011064708},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1529601,0.00064461824,0.8374587,0.00035153702,0.000034544275,0.00007732516,0.00004976791,0.00013553735,0.008287872],"genre_scores_gemma":[0.958911,0.00019467981,0.03935032,0.00003571047,0.000014637693,0.0000649738,0.000020485979,0.000015524329,0.0013926248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909806,0.000485151,0.000022205382,0.00010264512,0.00016083992,0.00013121113],"domain_scores_gemma":[0.9989133,0.000762171,0.00010964513,0.00006781711,0.00010683079,0.000040237064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013597537,0.0008612137,0.001030784,0.00035336043,0.000448784,0.0009756832,0.0006586168,0.00095343863,0.0007074849],"category_scores_gemma":[0.0021778615,0.0004241426,0.00054316927,0.00069455,0.001116874,0.0010881864,0.0009497078,0.0006753329,0.00015408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005505775,0.00004044428,0.0002690905,0.000031855285,0.000018951912,0.00010991421,0.000052024676,0.9769059,0.0028082451,0.01364595,0.00018297098,0.005879565],"study_design_scores_gemma":[0.0000069394496,0.000027604581,0.000052206495,0.0000013114826,0.0000043348473,0.000017895907,0.000008738154,0.9967849,0.0006223189,0.0023842775,0.00008497759,0.0000045378447],"about_ca_topic_score_codex":0.002250379,"about_ca_topic_score_gemma":0.0016261665,"teacher_disagreement_score":0.002250379,"about_ca_system_score_codex":0.0009049579,"about_ca_system_score_gemma":0.00084472564,"threshold_uncertainty_score":0.007191181},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020127613,0.0011144211,0.9656371,0.00043377024,0.000034533245,0.00008332324,0.00022892345,0.0003144691,0.01202588],"genre_scores_gemma":[0.8340267,0.0030467312,0.15500014,0.00035602273,0.00018443083,0.00092405087,0.00046474807,0.00031640066,0.005680788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951853,0.0022418268,0.00018950082,0.0005411509,0.0011620144,0.000680168],"domain_scores_gemma":[0.9834358,0.01268062,0.00129399,0.00077686325,0.0015285109,0.000284134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062347944,0.0027411191,0.002345491,0.0013159511,0.00084384397,0.0034496086,0.0018958658,0.0017079186,0.0037557743],"category_scores_gemma":[0.019706674,0.00091490697,0.0013670159,0.0017686606,0.002783718,0.003269001,0.0030248468,0.002202064,0.0017059984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000395439,0.00012130443,0.0004159631,0.00057271944,0.00013190761,0.0005120348,0.00055452087,0.7211212,0.01260463,0.23910606,0.0031372623,0.021326965],"study_design_scores_gemma":[0.000054087,0.00012791244,0.00018567078,0.00009245754,0.0000328695,0.00030390112,0.000094368,0.8862925,0.004893729,0.106249884,0.0016260925,0.00004647231],"about_ca_topic_score_codex":0.0011545538,"about_ca_topic_score_gemma":0.0006085612,"teacher_disagreement_score":0.0062347944,"about_ca_system_score_codex":0.0023231755,"about_ca_system_score_gemma":0.0014454968,"threshold_uncertainty_score":0.03297317},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24355622,0.0018443075,0.7380669,0.00035457624,0.000106157415,0.000054878812,0.00016213863,0.0002038478,0.015650976],"genre_scores_gemma":[0.9705639,0.00043561574,0.026392939,0.000053628963,0.000034418907,0.000028048846,0.000048528993,0.000010060626,0.002432954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963176,0.000071616305,0.000021661557,0.00006675526,0.00015565504,0.00005257219],"domain_scores_gemma":[0.9986595,0.00062814204,0.00019038156,0.0001800828,0.00029677726,0.000045110482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005046365,0.00035631497,0.00039604818,0.00035443957,0.00021556165,0.00085820525,0.0005748892,0.00077828806,0.001547586],"category_scores_gemma":[0.0032307305,0.00015532339,0.00020490722,0.00036066,0.00034539856,0.00090812746,0.00072553515,0.00048145166,0.00036584472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060938444,0.000100209414,0.0034589467,0.00022620542,0.000061867366,0.00053441484,0.00022776291,0.7754301,0.03194206,0.0735945,0.0017388787,0.1120757],"study_design_scores_gemma":[0.000017188986,0.00014161819,0.0005206137,0.000010421184,0.000018297562,0.00035459388,0.00004559098,0.9825205,0.0031625158,0.011943749,0.0012506853,0.00001430192],"about_ca_topic_score_codex":0.0008164898,"about_ca_topic_score_gemma":0.00096116256,"teacher_disagreement_score":0.001547586,"about_ca_system_score_codex":0.0006087712,"about_ca_system_score_gemma":0.00038701983,"threshold_uncertainty_score":0.0051771402},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24354172,0.0012667975,0.7504873,0.00014973464,0.000024467343,0.00003606785,0.00005895553,0.000120423065,0.004314462],"genre_scores_gemma":[0.9691957,0.0005666192,0.029146768,0.00001976658,0.000010637299,0.000023521128,0.000018021568,0.0000061186665,0.0010128026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962485,0.00014948437,0.00001714768,0.000043672782,0.0001221198,0.000042683896],"domain_scores_gemma":[0.99920183,0.0004730669,0.00015240307,0.00005595608,0.00009117359,0.000025669968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005962663,0.00045513888,0.00042542545,0.00032865978,0.00025554284,0.00084638863,0.0005123041,0.00058334577,0.00047743812],"category_scores_gemma":[0.0014455651,0.0002491066,0.00027631776,0.00039507885,0.00068727223,0.0010508973,0.00079364964,0.00036404896,0.0001229186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012782568,0.00003075773,0.0009480351,0.00013692353,0.0000482143,0.00063372724,0.0002407044,0.85505396,0.025495417,0.100645386,0.00018094826,0.016458143],"study_design_scores_gemma":[0.0000064825736,0.000045804292,0.00013790473,0.0000069266544,0.000012911293,0.000105929204,0.000031244963,0.98512864,0.0033451782,0.010835809,0.00033205163,0.000010982844],"about_ca_topic_score_codex":0.0010173959,"about_ca_topic_score_gemma":0.0007944313,"teacher_disagreement_score":0.0010173959,"about_ca_system_score_codex":0.0006110228,"about_ca_system_score_gemma":0.00030888032,"threshold_uncertainty_score":0.0044332743},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77711654,0.001935368,0.20706762,0.00046277986,0.000044622462,0.00007396481,0.00019690064,0.00036265684,0.012739477],"genre_scores_gemma":[0.99487656,0.0002459801,0.004332254,0.000020568961,0.00000863256,0.000013208679,0.000039868995,0.0000106159805,0.00045236855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985934,0.0005518725,0.00005057208,0.00012737534,0.0004129599,0.00026384907],"domain_scores_gemma":[0.98871684,0.0091286255,0.0006092349,0.00033837606,0.0010710424,0.00013581391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021634654,0.0011517385,0.0010252201,0.00073337543,0.0006144089,0.0010482091,0.0008112194,0.0010397582,0.0008183464],"category_scores_gemma":[0.011688845,0.00031406825,0.0003993088,0.00071387086,0.0012574848,0.0009264912,0.0009858368,0.00060378335,0.000159008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033636397,0.00003441919,0.0018563485,0.00008260688,0.00005886332,0.00026602554,0.000114035436,0.97678214,0.0057215667,0.0065131686,0.00020752953,0.008027008],"study_design_scores_gemma":[0.0000123121035,0.00022733047,0.0007432024,0.0000099840145,0.000044454613,0.00020092653,0.000050005885,0.9939569,0.0031918345,0.001427059,0.00011758541,0.000018320608],"about_ca_topic_score_codex":0.006283956,"about_ca_topic_score_gemma":0.0046660523,"teacher_disagreement_score":0.006283956,"about_ca_system_score_codex":0.0017382164,"about_ca_system_score_gemma":0.0013063449,"threshold_uncertainty_score":0.012611747},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39465913,0.0026719517,0.5923735,0.00037757694,0.000053783657,0.000038229435,0.00013937267,0.00027573455,0.009410766],"genre_scores_gemma":[0.98260754,0.00087869394,0.014427562,0.000042279917,0.000026619138,0.000026516573,0.000049696773,0.000037851794,0.0019032034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990613,0.0002743976,0.000036071826,0.000080955295,0.00044309968,0.00010418455],"domain_scores_gemma":[0.99539125,0.0032465279,0.00043057173,0.0002553857,0.00062535243,0.00005089694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018226166,0.00084025384,0.0007448005,0.0007956128,0.00031136387,0.00068344345,0.00057790225,0.00085759297,0.0011477814],"category_scores_gemma":[0.007344867,0.00029168135,0.00033366663,0.0005630991,0.0010347777,0.0014386957,0.0006602857,0.00046113902,0.00026647915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011028069,0.00002808072,0.0010907298,0.00012136061,0.000038295726,0.00022482738,0.00013952184,0.9531621,0.00941139,0.028733479,0.00021954304,0.006720423],"study_design_scores_gemma":[0.0000050440735,0.000039919887,0.00058348733,0.0000111644795,0.000013325202,0.00008957016,0.000024285484,0.99266243,0.0016504964,0.0047874507,0.000120540964,0.0000122903],"about_ca_topic_score_codex":0.0017232373,"about_ca_topic_score_gemma":0.001153809,"teacher_disagreement_score":0.0018226166,"about_ca_system_score_codex":0.0012288586,"about_ca_system_score_gemma":0.0004931631,"threshold_uncertainty_score":0.009639025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27911112,0.0016033022,0.7103696,0.00025882365,0.00007130239,0.000043779448,0.000084000414,0.00020804621,0.00825009],"genre_scores_gemma":[0.9898033,0.00027699894,0.009229632,0.00002844593,0.000021912514,0.000018212584,0.000011125911,0.000007881032,0.00060237845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956256,0.00019502123,0.000012238621,0.00004473637,0.00009772161,0.00008768501],"domain_scores_gemma":[0.99862635,0.00094134116,0.00017803998,0.00008828676,0.00012094468,0.00004500414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074259803,0.0003795971,0.00038880834,0.00036782477,0.0004855977,0.00069390924,0.00047607772,0.00036794506,0.00040761626],"category_scores_gemma":[0.0021545393,0.0002645199,0.00021575348,0.00062450836,0.0005896633,0.00058972655,0.0004996312,0.00027080995,0.000086739354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014434497,0.000034143686,0.0011712803,0.0000725925,0.00003537073,0.0005280389,0.0001567947,0.9235411,0.006260005,0.047300294,0.00060169934,0.020154363],"study_design_scores_gemma":[0.000006434343,0.00003497526,0.00020073948,0.00000429438,0.00000939463,0.00010661467,0.000041130363,0.9889951,0.00081598735,0.00928021,0.00049874117,0.000006402159],"about_ca_topic_score_codex":0.0024386274,"about_ca_topic_score_gemma":0.0031452628,"teacher_disagreement_score":0.0024386274,"about_ca_system_score_codex":0.0008229096,"about_ca_system_score_gemma":0.000599599,"threshold_uncertainty_score":0.0059707165},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9191337,0.0013498745,0.07554009,0.00017341148,0.000025895799,0.00007928626,0.00009738882,0.00020247848,0.0033979546],"genre_scores_gemma":[0.9941248,0.00017138055,0.0055169663,0.000011177877,0.0000027915764,0.00001336669,0.00001739648,0.00000622855,0.00013576336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896884,0.0005783707,0.00003446915,0.000086434244,0.00018014974,0.00015182042],"domain_scores_gemma":[0.99148166,0.0066227927,0.00071853714,0.0003259178,0.00071513065,0.00013601535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021421523,0.000880691,0.00056513643,0.0006663472,0.00035727365,0.00057539955,0.00074171857,0.00075513107,0.00049566635],"category_scores_gemma":[0.008349404,0.00018510463,0.00025684916,0.00069398363,0.00055112276,0.0007924217,0.0005480745,0.00022217304,0.000084793086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002256997,0.00004723871,0.0024321869,0.00006824226,0.00004054882,0.0001106731,0.00004018468,0.9806404,0.004420096,0.0008438363,0.000108733155,0.011022245],"study_design_scores_gemma":[0.000017642462,0.00052702066,0.0013293177,0.0000122661,0.00004019779,0.000102921156,0.000059116515,0.990263,0.007064911,0.0004499684,0.000118650125,0.000015048089],"about_ca_topic_score_codex":0.003093407,"about_ca_topic_score_gemma":0.0031533076,"teacher_disagreement_score":0.003093407,"about_ca_system_score_codex":0.0010573656,"about_ca_system_score_gemma":0.00035998572,"threshold_uncertainty_score":0.011328876},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010987398,0.0005278267,0.9862017,0.00008990212,0.000021278329,0.000018775836,0.000027241102,0.00010189013,0.0020239537],"genre_scores_gemma":[0.8140462,0.0020746093,0.17859115,0.000101820115,0.00008929938,0.00019413973,0.00012288903,0.0000672746,0.0047125733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916387,0.000410935,0.00003156012,0.00013440062,0.00017129519,0.00008795433],"domain_scores_gemma":[0.9993044,0.0004717789,0.000076021744,0.000035050383,0.00009377956,0.000018983248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009497699,0.0011810518,0.0010193663,0.00036829372,0.00025334544,0.00096149085,0.0006537564,0.00092592154,0.00064188265],"category_scores_gemma":[0.0018477628,0.00055769854,0.0005235982,0.0010201446,0.0007507932,0.0010347659,0.0008380432,0.00071563944,0.00027442377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003193013,0.00001674059,0.00016712204,0.000053218228,0.000020992999,0.00006451343,0.00002805222,0.9699774,0.0017179488,0.009506943,0.00032668616,0.018088492],"study_design_scores_gemma":[0.0000038789644,0.000023051434,0.00003831194,0.0000024076219,0.0000040765103,0.000012537952,0.0000056301947,0.99693155,0.00047010576,0.0023364155,0.00016832292,0.0000036252181],"about_ca_topic_score_codex":0.002640756,"about_ca_topic_score_gemma":0.0023221679,"teacher_disagreement_score":0.002640756,"about_ca_system_score_codex":0.00067243195,"about_ca_system_score_gemma":0.0010147344,"threshold_uncertainty_score":0.0052508116},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049662553,0.0010926267,0.9437029,0.00030884004,0.000035909587,0.00008001535,0.00006794195,0.00008628634,0.004962894],"genre_scores_gemma":[0.9406551,0.00081620447,0.054245956,0.00007583906,0.00004367936,0.00017058144,0.000042127227,0.000057745732,0.0038927519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979809,0.0011691953,0.000061754356,0.00025788593,0.00024489398,0.000285528],"domain_scores_gemma":[0.9955388,0.0034910666,0.0004521573,0.00014557593,0.00022050158,0.00015188578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031478985,0.0014698649,0.0017343393,0.00086736586,0.00051291555,0.0021212385,0.0018923979,0.0020677545,0.0019535515],"category_scores_gemma":[0.0067209867,0.0010817384,0.00075505115,0.0012746777,0.0020001782,0.0026178104,0.0015422087,0.0009224824,0.00031420033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007990864,0.000036916994,0.00021760837,0.00006598266,0.000031058542,0.00013124046,0.000069699556,0.9706699,0.0013448203,0.02181236,0.0002977481,0.0052428567],"study_design_scores_gemma":[0.000017227225,0.000042324184,0.00006620467,0.000006618633,0.0000091873,0.000034201308,0.000025480009,0.9888676,0.00033546623,0.010344263,0.00024088778,0.00001064952],"about_ca_topic_score_codex":0.0019752919,"about_ca_topic_score_gemma":0.0014119006,"teacher_disagreement_score":0.0031478985,"about_ca_system_score_codex":0.0021322516,"about_ca_system_score_gemma":0.0008685858,"threshold_uncertainty_score":0.016647875},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022210017,0.00027594762,0.96809846,0.0003817833,0.000043751614,0.000056691308,0.00007743833,0.0001675994,0.008688287],"genre_scores_gemma":[0.86486703,0.000380253,0.13024612,0.00010103712,0.00004634184,0.000094094095,0.000103573024,0.000047614856,0.004114047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991134,0.00034208645,0.000035498182,0.00017326695,0.00023053301,0.000105145446],"domain_scores_gemma":[0.99811244,0.0011094573,0.00026468397,0.000146613,0.0002931076,0.00007370013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011269222,0.0012563888,0.00095212413,0.00038539493,0.00041191504,0.0015295073,0.0008762935,0.0013719212,0.0034278736],"category_scores_gemma":[0.0034490922,0.00045285988,0.0004476763,0.00058000605,0.001165596,0.0013887455,0.0009458051,0.0012695676,0.00092715473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003744678,0.0000970235,0.00035613065,0.00019819672,0.000051168572,0.0004066585,0.00012263855,0.85073465,0.018242583,0.088778414,0.0022999074,0.03833806],"study_design_scores_gemma":[0.000024365234,0.00007274337,0.00006372952,0.000008402047,0.000009317538,0.00007158582,0.000018792029,0.98827934,0.002663998,0.008320249,0.00045325558,0.000014241068],"about_ca_topic_score_codex":0.0019665528,"about_ca_topic_score_gemma":0.0017930161,"teacher_disagreement_score":0.0034278736,"about_ca_system_score_codex":0.0010862144,"about_ca_system_score_gemma":0.0011558925,"threshold_uncertainty_score":0.011467338},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13766438,0.0027488081,0.85688484,0.0001953476,0.00004072774,0.000034747292,0.000032510896,0.00009485898,0.002303825],"genre_scores_gemma":[0.9564639,0.001402134,0.040592287,0.000057983696,0.00005768266,0.000041549483,0.000022506754,0.0000087207645,0.0013531267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930155,0.0003737909,0.0000249042,0.00010273949,0.00014829346,0.00004871246],"domain_scores_gemma":[0.99893373,0.0007353514,0.0001287869,0.000072756964,0.00010879626,0.000020566558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010014605,0.00046043337,0.00044159943,0.00029534262,0.00027825637,0.00061337865,0.0006998572,0.0006899093,0.00036460537],"category_scores_gemma":[0.0022183352,0.0002348714,0.0002166556,0.00046633417,0.0005692922,0.0011083537,0.00048059053,0.00030752545,0.00010450023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014938434,0.000055904013,0.0016265769,0.00020026394,0.00006814423,0.00055562705,0.0002029342,0.86059636,0.018329553,0.06622659,0.0004321273,0.05155648],"study_design_scores_gemma":[0.00001693586,0.000106916414,0.0004256327,0.000007909794,0.000019570318,0.00013251611,0.000031020765,0.9815247,0.0019716222,0.0151032135,0.00064801105,0.00001181999],"about_ca_topic_score_codex":0.00081076927,"about_ca_topic_score_gemma":0.00085394434,"teacher_disagreement_score":0.0010014605,"about_ca_system_score_codex":0.00048234966,"about_ca_system_score_gemma":0.00027425197,"threshold_uncertainty_score":0.00529629},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10297148,0.00041528945,0.8918396,0.00022601,0.000018083445,0.000035098496,0.00004044241,0.0001790461,0.004274965],"genre_scores_gemma":[0.9761478,0.00021414905,0.022804879,0.00003820936,0.00001700725,0.00004506424,0.000016038004,0.00002827939,0.0006886651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924564,0.00032477913,0.000024312574,0.00010482444,0.00015892967,0.00014151886],"domain_scores_gemma":[0.9961582,0.0031102696,0.0002816872,0.00016642715,0.00022515918,0.000058371086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020451506,0.0007601047,0.0007373639,0.0005358012,0.0003449847,0.00096516125,0.00070102804,0.00071625045,0.00072659965],"category_scores_gemma":[0.007924228,0.00043096463,0.00034940228,0.00060096267,0.0013968559,0.0015987434,0.0007554787,0.00059205276,0.0001505179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004125497,0.000030597017,0.00022298527,0.00003762395,0.000013773701,0.000056324636,0.000051128383,0.97216,0.0030133284,0.019052187,0.00018090871,0.005139849],"study_design_scores_gemma":[0.0000052461346,0.00002654691,0.00006885626,0.0000035881726,0.0000039086253,0.000014807714,0.00001303366,0.9907137,0.0007565949,0.008312434,0.00007781822,0.0000033988338],"about_ca_topic_score_codex":0.0012605818,"about_ca_topic_score_gemma":0.00078230066,"teacher_disagreement_score":0.0020451506,"about_ca_system_score_codex":0.0011061982,"about_ca_system_score_gemma":0.0007322884,"threshold_uncertainty_score":0.010815918},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045305084,0.00033365437,0.9444675,0.00015733264,0.00003319872,0.000052812382,0.000020320502,0.00014177052,0.009488409],"genre_scores_gemma":[0.91021955,0.0005070569,0.08285185,0.00015069767,0.000046823792,0.00009453147,0.000053126965,0.00006659154,0.0060097147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991689,0.0003259534,0.000019654299,0.00008625341,0.00031019276,0.00008907511],"domain_scores_gemma":[0.9971969,0.0019847632,0.0002993935,0.00021612928,0.00025134298,0.000051440766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090126466,0.00054857024,0.0004605679,0.00027858315,0.00039376927,0.00077905826,0.0006319363,0.0007507961,0.0021914032],"category_scores_gemma":[0.004231551,0.0002875438,0.00023634596,0.00042148647,0.00087923795,0.0012232466,0.0010549513,0.00086650514,0.00043486527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030219514,0.00007335782,0.00075394724,0.0002475142,0.00004493255,0.0005691996,0.00034987717,0.5340313,0.046354942,0.35556045,0.001644324,0.06006792],"study_design_scores_gemma":[0.000016124637,0.00017581132,0.00023003823,0.000016076243,0.000017302464,0.00033376398,0.000056095014,0.94910794,0.011125376,0.036730368,0.002167732,0.000023402017],"about_ca_topic_score_codex":0.0004992533,"about_ca_topic_score_gemma":0.000438879,"teacher_disagreement_score":0.0021914032,"about_ca_system_score_codex":0.00065471535,"about_ca_system_score_gemma":0.0006742934,"threshold_uncertainty_score":0.007330954},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019351296,0.0021262395,0.97679603,0.00015817521,0.00005780297,0.000043336455,0.000016719152,0.00010910931,0.0013412896],"genre_scores_gemma":[0.8943528,0.0032667902,0.10077702,0.00008828496,0.00012631893,0.00010325654,0.000035508725,0.000026910247,0.0012230643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990195,0.0004255851,0.000065820015,0.00010236431,0.00031989324,0.000066837536],"domain_scores_gemma":[0.9982645,0.0012421989,0.00013612889,0.00012282538,0.00020155053,0.00003274948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016688942,0.0006284216,0.00081065804,0.00051621394,0.00045226605,0.0009910384,0.0009208105,0.00060809683,0.0004749106],"category_scores_gemma":[0.005647336,0.00028132644,0.00038076285,0.00079370977,0.0010064542,0.0014499368,0.00066470855,0.0005418334,0.00017283454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017463637,0.00006906525,0.0009658525,0.00032941144,0.00008831288,0.00034811968,0.00047583674,0.71613246,0.019019367,0.1585334,0.0013738946,0.102489576],"study_design_scores_gemma":[0.000012284633,0.00012555743,0.0001124271,0.0000141378,0.000022594468,0.0001545205,0.000027314158,0.9741557,0.0022780478,0.021823136,0.0012594583,0.00001473574],"about_ca_topic_score_codex":0.000820652,"about_ca_topic_score_gemma":0.0005582479,"teacher_disagreement_score":0.0016688942,"about_ca_system_score_codex":0.0008382338,"about_ca_system_score_gemma":0.0005592869,"threshold_uncertainty_score":0.008826077},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4901939,0.0034140204,0.472239,0.0008807326,0.00005887764,0.00006150396,0.0010315089,0.0004227365,0.031697698],"genre_scores_gemma":[0.9952496,0.0007613807,0.00286803,0.000033687753,0.000023419252,0.000043441632,0.00009677561,0.000018844368,0.0009048455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865735,0.00051268545,0.000051746345,0.00008430768,0.00028893162,0.0004049575],"domain_scores_gemma":[0.9840312,0.013442063,0.000888872,0.0005848462,0.00084278156,0.00021033922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002368794,0.0008468896,0.0008673048,0.001225857,0.0006550352,0.0016688847,0.00092941464,0.0008619292,0.0021494033],"category_scores_gemma":[0.013534051,0.0004394907,0.00041679078,0.0015719194,0.0019652403,0.0020314867,0.0012768497,0.0006580559,0.00021154743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053489843,0.000017090024,0.0007312635,0.00007784627,0.000029077428,0.00020920741,0.00015885453,0.9151476,0.0010192926,0.07688319,0.0005769234,0.0050961575],"study_design_scores_gemma":[0.000007504535,0.000020343157,0.00078229775,0.000034712233,0.00001548956,0.00012400711,0.00009524899,0.95395553,0.0006515062,0.043875366,0.00041625273,0.000021853784],"about_ca_topic_score_codex":0.0050113113,"about_ca_topic_score_gemma":0.0029727973,"teacher_disagreement_score":0.0050113113,"about_ca_system_score_codex":0.0021392177,"about_ca_system_score_gemma":0.0011224626,"threshold_uncertainty_score":0.015521109},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0486206,0.0003443954,0.9468708,0.00016128454,0.000066903485,0.00016226916,0.000077766024,0.00041398767,0.0032819388],"genre_scores_gemma":[0.7351572,0.00020948707,0.26135212,0.00017564735,0.000040960247,0.00029857372,0.00018077351,0.000032471176,0.0025527591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953556,0.00014221363,0.000024250241,0.00007183281,0.00013378041,0.00009231126],"domain_scores_gemma":[0.9995974,0.00015247213,0.000059290232,0.00005330824,0.00008690641,0.000050620125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053504435,0.0006532706,0.00067677844,0.00042825151,0.0007055071,0.00042725232,0.0012638933,0.00054327183,0.0012488491],"category_scores_gemma":[0.0011848859,0.0002803844,0.00027678526,0.00077929295,0.00051436696,0.000593414,0.0007999867,0.00037356035,0.00042407794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007054293,0.00018383472,0.00064623385,0.00013525422,0.000068185174,0.00024854625,0.00021867752,0.69796634,0.036913708,0.030105341,0.0065141884,0.22629425],"study_design_scores_gemma":[0.00005342312,0.00010982514,0.000095582494,0.0000047610374,0.000011795194,0.00007477056,0.000017545146,0.9918168,0.0021457316,0.004535207,0.0011207041,0.000013926926],"about_ca_topic_score_codex":0.0029808416,"about_ca_topic_score_gemma":0.0052970964,"teacher_disagreement_score":0.0029808416,"about_ca_system_score_codex":0.00067813264,"about_ca_system_score_gemma":0.0016736997,"threshold_uncertainty_score":0.0059269667},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051420316,0.012812398,0.27130374,0.06187804,0.012304026,0.000071989634,0.0012404833,0.0004919341,0.5884771],"genre_scores_gemma":[0.54626936,0.018291945,0.081491955,0.042286202,0.015364535,0.00015834646,0.001565334,0.00091089995,0.29366148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953043,0.00015890751,0.000012199099,0.00009095776,0.0001527814,0.000054801087],"domain_scores_gemma":[0.9986946,0.0006564055,0.00006779412,0.00028921806,0.00020819163,0.00008388855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006997515,0.00080851803,0.00094595616,0.0018496582,0.0012464379,0.0013953163,0.0010968007,0.0017113904,0.023212958],"category_scores_gemma":[0.0024127525,0.00030601193,0.0010662046,0.0026286782,0.0018531962,0.0068961075,0.0013163792,0.0025234278,0.002557611],"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.000008458015,0.000019682193,0.000051916333,0.00006979713,0.000008791371,0.000044655128,0.0000740491,0.0013726731,0.000335659,0.9744105,0.015079891,0.0085240165],"study_design_scores_gemma":[0.00000436119,0.0000046638743,0.000056311088,0.000015762253,0.000004089737,0.00004115503,0.000024037268,0.0010937703,0.000095440795,0.9763315,0.022321794,0.000007100858],"about_ca_topic_score_codex":0.0015109752,"about_ca_topic_score_gemma":0.0016214139,"teacher_disagreement_score":0.023212958,"about_ca_system_score_codex":0.0011160324,"about_ca_system_score_gemma":0.00034380422,"threshold_uncertainty_score":0.07765514},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5062079,0.0005786662,0.4857553,0.0001613685,0.000023667402,0.000043398868,0.000048364494,0.00025937855,0.006921984],"genre_scores_gemma":[0.9650221,0.00017469689,0.03411173,0.000020585787,0.000008339927,0.000016691447,0.000024172505,0.0000103555085,0.0006112842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986344,0.00053477514,0.000041842526,0.00008988398,0.00059205305,0.00010710308],"domain_scores_gemma":[0.9958824,0.0026960692,0.00048274582,0.00029973197,0.0005932113,0.000045889963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018193342,0.00071665534,0.00067480566,0.00047027314,0.0004019764,0.000589656,0.0006247328,0.0005836989,0.0004980889],"category_scores_gemma":[0.00463342,0.00020036544,0.00027878373,0.0007742034,0.0010074682,0.0010658812,0.0006217103,0.000501412,0.00018908769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063566986,0.000098152595,0.006069145,0.00025278004,0.0001418906,0.00052265567,0.0005555218,0.841661,0.061286766,0.0431182,0.00035538702,0.04530277],"study_design_scores_gemma":[0.000015507916,0.00017832208,0.0005591794,0.000014263065,0.00002917114,0.00021619383,0.000036197485,0.9683091,0.028040567,0.0022641402,0.00031785254,0.000019519164],"about_ca_topic_score_codex":0.0016130282,"about_ca_topic_score_gemma":0.0017663309,"teacher_disagreement_score":0.0018193342,"about_ca_system_score_codex":0.0008179624,"about_ca_system_score_gemma":0.0005338197,"threshold_uncertainty_score":0.00962162},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00544077,0.00038746416,0.9913031,0.00016161145,0.000052219315,0.000026480046,0.000045462002,0.00011802769,0.0024648327],"genre_scores_gemma":[0.5869287,0.0020170603,0.4038692,0.00040074496,0.00028028837,0.00036359648,0.00022978416,0.00012768563,0.0057829116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989717,0.00038427804,0.000038214755,0.00008894608,0.00041090694,0.000106010775],"domain_scores_gemma":[0.9981152,0.0009309201,0.00018485198,0.00038162025,0.00034316865,0.000044296066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012668432,0.00070214295,0.0005452891,0.00048585856,0.00036581315,0.0009354772,0.0012807632,0.00085335993,0.0010158423],"category_scores_gemma":[0.004398415,0.00026250098,0.00046651822,0.0005631657,0.0012898325,0.0016671123,0.0009649166,0.0014717269,0.00045732287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006852264,0.000025342137,0.00012664135,0.000085825915,0.000017051883,0.0001563205,0.000113453025,0.28062463,0.008669941,0.68010026,0.0014599131,0.028552094],"study_design_scores_gemma":[0.000027053882,0.000055249006,0.000053023006,0.000026803313,0.000011935281,0.00013121469,0.00000964992,0.81926143,0.0034120185,0.17240101,0.0045813737,0.00002927625],"about_ca_topic_score_codex":0.001340923,"about_ca_topic_score_gemma":0.00087022973,"teacher_disagreement_score":0.001340923,"about_ca_system_score_codex":0.0008317469,"about_ca_system_score_gemma":0.0008311452,"threshold_uncertainty_score":0.006699741},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026464615,0.00025397306,0.9719953,0.000111478475,0.000011995894,0.000011573541,0.0000121120665,0.00009256533,0.001046306],"genre_scores_gemma":[0.91739225,0.00026604926,0.08117872,0.000058873677,0.00002268711,0.00004586573,0.000029923061,0.000023145476,0.0009826003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996525,0.00012793626,0.00001380363,0.000079799924,0.00008295426,0.00004304456],"domain_scores_gemma":[0.99897194,0.00068697747,0.00010564071,0.00008209923,0.00012326658,0.000030158466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000816157,0.0005408136,0.000499838,0.00019427722,0.00026058813,0.00042465827,0.000838215,0.00038927863,0.0006260552],"category_scores_gemma":[0.0026932238,0.00019160278,0.00027723395,0.00028250366,0.00043701622,0.001325112,0.00058501365,0.00047509084,0.00013135279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012753849,0.000046363544,0.00059479167,0.000081848186,0.000027905053,0.000118353826,0.00015474779,0.9040972,0.017160442,0.02397822,0.0008906565,0.052721824],"study_design_scores_gemma":[0.0000052547016,0.00003197137,0.00006239277,0.000002416182,0.0000042713496,0.000038583996,0.000013550522,0.99330115,0.0018401647,0.004501017,0.00019445458,0.0000047158214],"about_ca_topic_score_codex":0.00054175593,"about_ca_topic_score_gemma":0.00063819555,"teacher_disagreement_score":0.000838215,"about_ca_system_score_codex":0.0003659823,"about_ca_system_score_gemma":0.0004946127,"threshold_uncertainty_score":0.0043162704},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105733976,0.0010903602,0.8713368,0.0007836684,0.00004589034,0.000082823404,0.00015696613,0.00014843224,0.020621048],"genre_scores_gemma":[0.96522593,0.00045489994,0.03140909,0.000056853954,0.000024107987,0.000046622856,0.00004036604,0.00002527811,0.0027167876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994024,0.00027942774,0.000017163038,0.00008102379,0.0001033516,0.00011674528],"domain_scores_gemma":[0.9991873,0.00055728294,0.00011444652,0.00003959797,0.00007020223,0.000031220337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001113251,0.0007315567,0.0006820058,0.00040032036,0.00036278492,0.0012129684,0.00063025934,0.00073322485,0.0024458542],"category_scores_gemma":[0.0029021737,0.0003712656,0.0003198302,0.00065583945,0.0009850153,0.0012037897,0.00089267007,0.00053134275,0.00029959262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009841456,0.00003483562,0.0002920887,0.00008192481,0.000018151726,0.00020151571,0.000067543355,0.9504752,0.0021992591,0.03055451,0.0007901711,0.015186361],"study_design_scores_gemma":[0.000016623018,0.000036978923,0.00012438453,0.000005386986,0.000006243646,0.000054325905,0.000042911277,0.9879083,0.00041065345,0.0108305095,0.00055612193,0.0000075106323],"about_ca_topic_score_codex":0.0035493134,"about_ca_topic_score_gemma":0.0034447892,"teacher_disagreement_score":0.0035493134,"about_ca_system_score_codex":0.0015336996,"about_ca_system_score_gemma":0.000821802,"threshold_uncertainty_score":0.01112783},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22986132,0.0020221805,0.6871213,0.006343255,0.00014603663,0.00018530063,0.00018649767,0.00014447587,0.07398967],"genre_scores_gemma":[0.9804545,0.0007530402,0.01560015,0.0001351335,0.00013100386,0.000083976505,0.000026986958,0.000039829785,0.002775405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977723,0.0012058326,0.000060675815,0.00021375023,0.00047074392,0.0002767002],"domain_scores_gemma":[0.98051065,0.016361972,0.0011287787,0.0007007392,0.0008315269,0.000466292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037811263,0.0007066739,0.0011675851,0.0010297697,0.0015098124,0.0040058903,0.0014741676,0.0018391913,0.004742282],"category_scores_gemma":[0.018813724,0.00065430393,0.0007476777,0.0011387788,0.005140506,0.008629373,0.0020288967,0.00224855,0.00032410814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006735927,0.00004617709,0.0004008346,0.00006863182,0.000020527496,0.00016539868,0.00017147316,0.15869653,0.0010446752,0.83169764,0.00084945915,0.006771339],"study_design_scores_gemma":[0.000029607032,0.000042112635,0.00022164472,0.000020821613,0.000011459682,0.0000801512,0.00008355401,0.5702423,0.00034828877,0.42782325,0.0010734053,0.00002339381],"about_ca_topic_score_codex":0.0024989685,"about_ca_topic_score_gemma":0.0017696376,"teacher_disagreement_score":0.004742282,"about_ca_system_score_codex":0.0024951962,"about_ca_system_score_gemma":0.0017232619,"threshold_uncertainty_score":0.019996762},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034087203,0.0006398822,0.95757663,0.0002891487,0.00003035402,0.00006071884,0.00007399676,0.000087944754,0.0071541076],"genre_scores_gemma":[0.90038955,0.0010150094,0.09169297,0.00011279044,0.00007721581,0.00020364874,0.000087539214,0.00007676463,0.0063445354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992453,0.0004061271,0.000025316003,0.00008951573,0.00014503974,0.00008866999],"domain_scores_gemma":[0.99790907,0.0017294879,0.00015222389,0.000055285578,0.00010886184,0.000045010427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014265297,0.0010391328,0.001041374,0.0005443814,0.00040712752,0.0013980409,0.0009791128,0.0010977685,0.0026562258],"category_scores_gemma":[0.0036812886,0.0005219392,0.00043353828,0.0009039802,0.0009916708,0.001236618,0.0009923682,0.0007785518,0.0005146367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016697946,0.000075861215,0.00022616074,0.00016610036,0.00004064231,0.00020332845,0.00015608076,0.89628375,0.0030207613,0.06630672,0.001412901,0.03194069],"study_design_scores_gemma":[0.000022578726,0.000045238296,0.00008087519,0.000009604867,0.000011189759,0.000055421195,0.000025062975,0.96591985,0.000610489,0.03284473,0.00036696927,0.0000079562615],"about_ca_topic_score_codex":0.0010115823,"about_ca_topic_score_gemma":0.00092246884,"teacher_disagreement_score":0.0026562258,"about_ca_system_score_codex":0.0011872047,"about_ca_system_score_gemma":0.00060340075,"threshold_uncertainty_score":0.00888592},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034752435,0.00011139231,0.9943409,0.00011617284,0.00001901914,0.000030701733,0.0000117618665,0.000034164917,0.0018606188],"genre_scores_gemma":[0.6222731,0.0005656846,0.37193587,0.0002663564,0.00009901895,0.00026787477,0.000042625394,0.00007011405,0.0044793016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986449,0.0005884999,0.000053076074,0.00019351553,0.00037872826,0.00014135973],"domain_scores_gemma":[0.99816436,0.0012146435,0.00011702553,0.00016285844,0.00026571727,0.00007547426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034369065,0.0010499986,0.0009675743,0.00063093303,0.00046496966,0.0015074981,0.0013930021,0.0012128841,0.0025200632],"category_scores_gemma":[0.005727286,0.0004942274,0.00050355657,0.0008346571,0.0014795483,0.002040207,0.0014820267,0.0013297208,0.0003269207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115858194,0.00008158931,0.00024941814,0.00009959894,0.000032524287,0.00008647226,0.00010342892,0.7953052,0.00397175,0.1524981,0.0009956119,0.04646041],"study_design_scores_gemma":[0.00001905459,0.000034481567,0.000026587288,0.0000071304753,0.0000058987284,0.000032917444,0.000015047956,0.9729235,0.0011035595,0.02519942,0.0006249447,0.0000074523837],"about_ca_topic_score_codex":0.0012158413,"about_ca_topic_score_gemma":0.001174326,"teacher_disagreement_score":0.0034369065,"about_ca_system_score_codex":0.0012852491,"about_ca_system_score_gemma":0.0014312897,"threshold_uncertainty_score":0.018176317},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.818846,0.0020096232,0.17052677,0.00018782092,0.000052431275,0.000027883163,0.00004495137,0.0001383731,0.008166144],"genre_scores_gemma":[0.99367154,0.0006815697,0.0052354885,0.000013975103,0.000015234679,0.000007832925,0.000012954918,0.000008419361,0.00035288476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993393,0.0002003429,0.000022362283,0.00006372366,0.0002539433,0.0001202676],"domain_scores_gemma":[0.9937552,0.004614989,0.00064318883,0.00023890425,0.0006424139,0.00010528747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073693326,0.0007272332,0.0009193263,0.00046737216,0.00054125424,0.00072317984,0.0005392989,0.00060483394,0.00052903785],"category_scores_gemma":[0.005908178,0.0002799194,0.00032821298,0.00085179723,0.00083877944,0.0007961528,0.0008517656,0.00053473824,0.00013101618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037202888,0.000077615114,0.009524298,0.0003418718,0.00011972501,0.0023885,0.0006255984,0.9144373,0.039430674,0.011582257,0.00030789129,0.020792237],"study_design_scores_gemma":[0.0000064777632,0.00018088442,0.0023135426,0.000014631775,0.000055700148,0.0007045797,0.00014088851,0.98527294,0.0092885075,0.0017604483,0.00023175063,0.000029603403],"about_ca_topic_score_codex":0.0015519467,"about_ca_topic_score_gemma":0.0013237995,"teacher_disagreement_score":0.0015519467,"about_ca_system_score_codex":0.00048180582,"about_ca_system_score_gemma":0.0003769324,"threshold_uncertainty_score":0.003897369},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038633537,0.00046350627,0.95863354,0.00016148061,0.000031342563,0.0000519638,0.00001975081,0.000079727346,0.0019251526],"genre_scores_gemma":[0.8637196,0.00060734473,0.13423467,0.000056529803,0.000047382746,0.00014960354,0.00003628643,0.000023067061,0.001125469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906415,0.00048212873,0.000030968396,0.000079379475,0.00021097684,0.00013244589],"domain_scores_gemma":[0.9976998,0.0016660169,0.0002206982,0.00016612359,0.00018967167,0.000057560545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014757385,0.0004922032,0.00048510745,0.0005164354,0.00052456284,0.0006816864,0.0006369298,0.00057182316,0.0005546041],"category_scores_gemma":[0.0038628809,0.00027048227,0.0003052034,0.0011096055,0.0011718955,0.0012564732,0.0007355472,0.00057785347,0.00008500626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060195896,0.00002289562,0.00024133234,0.000034716824,0.000011040557,0.00003969515,0.00005014474,0.9520685,0.002034683,0.025487056,0.0002362377,0.01971353],"study_design_scores_gemma":[0.000009767507,0.000020723337,0.000045800545,0.000003725268,0.0000046004034,0.000014152575,0.00001071528,0.99016505,0.0007853523,0.00869419,0.00024086043,0.0000050281024],"about_ca_topic_score_codex":0.0050217593,"about_ca_topic_score_gemma":0.00567939,"teacher_disagreement_score":0.0050217593,"about_ca_system_score_codex":0.0011591779,"about_ca_system_score_gemma":0.0017826181,"threshold_uncertainty_score":0.00998503},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5160887,0.0019350777,0.4693529,0.00047327532,0.000030229794,0.000062510364,0.000119125136,0.00037888592,0.011559418],"genre_scores_gemma":[0.9946173,0.0002869929,0.0042192508,0.000023770557,0.000010973458,0.000015180301,0.000020300435,0.000016518592,0.0007897982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992224,0.00030858448,0.000023986959,0.00009949394,0.00022463812,0.00012087454],"domain_scores_gemma":[0.9971614,0.0018870793,0.00025411343,0.00016460914,0.00048149648,0.00005119863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011988996,0.0009470202,0.0008387415,0.0004581369,0.00035511467,0.0008607309,0.000489105,0.0008356352,0.0011580907],"category_scores_gemma":[0.003988196,0.00022082879,0.00043362053,0.00042981628,0.0009488098,0.00089208205,0.000768818,0.00046725897,0.0003353653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010484055,0.000018843864,0.0009289146,0.000065251494,0.000041672116,0.00023155073,0.00012404744,0.9749428,0.011370799,0.007017358,0.00014984912,0.0050040265],"study_design_scores_gemma":[0.000006166165,0.000080384874,0.00041857627,0.0000057135326,0.000015464395,0.000109643035,0.000031578038,0.99561214,0.0022154883,0.0013790082,0.000113153255,0.000012644393],"about_ca_topic_score_codex":0.002731976,"about_ca_topic_score_gemma":0.0011064532,"teacher_disagreement_score":0.002731976,"about_ca_system_score_codex":0.00085715257,"about_ca_system_score_gemma":0.000564396,"threshold_uncertainty_score":0.0063405037},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031922106,0.00062471576,0.9630215,0.00037053233,0.000041121326,0.000029615134,0.00006253246,0.00009182713,0.0038360173],"genre_scores_gemma":[0.9285765,0.00049715507,0.06599561,0.00025478672,0.00006222169,0.00016897033,0.00014477091,0.000079740996,0.0042202924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916756,0.0004054439,0.000023474835,0.00013017574,0.00016573849,0.000107752785],"domain_scores_gemma":[0.99829787,0.0013106005,0.00012455894,0.000059096263,0.0001467208,0.00006106256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017565414,0.0011910683,0.0011136296,0.000650279,0.00035343607,0.0010132119,0.0007779859,0.0008938731,0.0013913917],"category_scores_gemma":[0.0031191052,0.0004471498,0.00049637764,0.00072467834,0.0012325499,0.0012765651,0.0015259899,0.0010112446,0.00014457204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055648266,0.000024614323,0.00023334206,0.000044140623,0.000036790938,0.0000634216,0.000031605352,0.9723121,0.00088826043,0.018153641,0.0005072095,0.0076491423],"study_design_scores_gemma":[0.0000056950407,0.0000125356455,0.000051551655,0.000003177655,0.0000045439433,0.000007323129,0.0000048022084,0.99349964,0.00019487257,0.006087025,0.0001257074,0.0000032206697],"about_ca_topic_score_codex":0.002379278,"about_ca_topic_score_gemma":0.0015690139,"teacher_disagreement_score":0.002379278,"about_ca_system_score_codex":0.0013938614,"about_ca_system_score_gemma":0.0009690127,"threshold_uncertainty_score":0.01011318},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056243395,0.00018677753,0.9912599,0.0001042368,0.000014458542,0.000022817525,0.000038021724,0.000049647875,0.0026997626],"genre_scores_gemma":[0.636582,0.0010362966,0.35375318,0.00015099431,0.00007213301,0.00041268233,0.0001696773,0.00009108523,0.007731941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926454,0.0003716086,0.000023893743,0.00009214438,0.00014635059,0.00010135959],"domain_scores_gemma":[0.99937695,0.0004081756,0.00007135184,0.000039497194,0.000073415154,0.00003067751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011697882,0.0010330352,0.0008673217,0.00045722767,0.00031190223,0.0008756612,0.00077620195,0.0008255545,0.0030281171],"category_scores_gemma":[0.0025258884,0.00048824045,0.00035618522,0.00082534284,0.0007780241,0.0012660911,0.0010699618,0.0006654676,0.00065741804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005665431,0.000029089666,0.0001361548,0.00005127162,0.00001494466,0.00004806465,0.000042229258,0.9232741,0.0020791234,0.04762494,0.000952853,0.025690556],"study_design_scores_gemma":[0.000010460179,0.000021274047,0.0000356998,0.0000052093387,0.000003866094,0.000014109738,0.000012588273,0.9777434,0.000356504,0.021247452,0.0005426584,0.0000068046534],"about_ca_topic_score_codex":0.0016904435,"about_ca_topic_score_gemma":0.0019694215,"teacher_disagreement_score":0.0030281171,"about_ca_system_score_codex":0.0009279295,"about_ca_system_score_gemma":0.00093885954,"threshold_uncertainty_score":0.010130107},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021726202,0.00067335676,0.9756502,0.00019886752,0.00005662289,0.00007204909,0.000021753382,0.00017194061,0.0014290476],"genre_scores_gemma":[0.91627413,0.00074632664,0.08088889,0.00017062754,0.00009177798,0.00022846469,0.000037873662,0.00003771593,0.0015241959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980824,0.00093060016,0.00006334064,0.00019409778,0.0005395278,0.00019000734],"domain_scores_gemma":[0.9931758,0.0042236135,0.0007699757,0.0006383834,0.0011034822,0.00008886855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029061616,0.0007298879,0.0006517451,0.0006510181,0.00055442384,0.00057780533,0.0017945904,0.0010375684,0.00092159864],"category_scores_gemma":[0.007138739,0.0003305316,0.00041940034,0.00073122245,0.0016298378,0.0019639155,0.00089522405,0.0011449214,0.00019099428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003346372,0.00018184855,0.0010897674,0.00043483396,0.00011120081,0.000300348,0.00049646496,0.78992593,0.031335387,0.10909925,0.0019624273,0.064727895],"study_design_scores_gemma":[0.00001303912,0.00014137028,0.000115601804,0.000012073437,0.00002535749,0.000107022934,0.000023448982,0.98919475,0.0033722061,0.00639425,0.0005815377,0.000019446803],"about_ca_topic_score_codex":0.0016810467,"about_ca_topic_score_gemma":0.0018754409,"teacher_disagreement_score":0.0029061616,"about_ca_system_score_codex":0.0011455542,"about_ca_system_score_gemma":0.00094142405,"threshold_uncertainty_score":0.015369415},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028932862,0.00073912233,0.959986,0.00026844986,0.00011445889,0.00011499029,0.0002535814,0.00024314258,0.009347392],"genre_scores_gemma":[0.8226952,0.00079015753,0.16914311,0.00024316186,0.000105748826,0.00035411218,0.0003030055,0.00006115418,0.006304391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886984,0.00034394793,0.000046909754,0.00016869891,0.00033149152,0.00023905306],"domain_scores_gemma":[0.99683905,0.0013524478,0.00025958542,0.0006496193,0.00079531065,0.000103978586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010640079,0.0006711643,0.00078109885,0.00080799,0.00066576863,0.0009475021,0.0012309297,0.0010006117,0.002462213],"category_scores_gemma":[0.004860175,0.00026814567,0.00041544644,0.0013431298,0.0014872532,0.0015707765,0.0014412345,0.0010363286,0.0004820539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039961172,0.000036644265,0.00061693357,0.00017116911,0.000048610338,0.00041967788,0.0002498258,0.59943396,0.009882343,0.3168055,0.0049198056,0.0670159],"study_design_scores_gemma":[0.00002260372,0.00005091976,0.00013948894,0.000028534261,0.0000122713345,0.00016874155,0.00003745271,0.9157765,0.002884289,0.07689834,0.003956516,0.00002430744],"about_ca_topic_score_codex":0.004387058,"about_ca_topic_score_gemma":0.0037931632,"teacher_disagreement_score":0.004387058,"about_ca_system_score_codex":0.0014200838,"about_ca_system_score_gemma":0.0015072167,"threshold_uncertainty_score":0.010303438},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038218215,0.0014309007,0.95716125,0.00030186112,0.000041591993,0.000023755765,0.000024861258,0.00010156707,0.0026960545],"genre_scores_gemma":[0.870361,0.0015287433,0.12565143,0.00012973744,0.00009816079,0.0001140388,0.000043471726,0.00005529496,0.002018153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927014,0.00045239448,0.00001971165,0.000043069933,0.00014135319,0.00007340024],"domain_scores_gemma":[0.9987317,0.0009808023,0.00010969212,0.000061002687,0.00009608426,0.00002081038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023172935,0.00086961966,0.000585665,0.0005138546,0.00024802095,0.0007234235,0.0004768871,0.0006268507,0.00086684455],"category_scores_gemma":[0.0028377506,0.0004158611,0.00045299373,0.00068380305,0.00089779653,0.0011312896,0.0010141901,0.00062821823,0.00012749655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021761698,0.000014221942,0.00014152662,0.000026567122,0.000021711698,0.000018847519,0.000012730948,0.9836051,0.0012853632,0.008442621,0.00017269488,0.0062369904],"study_design_scores_gemma":[0.000004663163,0.000016182414,0.000038528302,0.0000027383505,0.000003879541,0.00000457024,0.0000032191829,0.99615496,0.00026907594,0.0033813475,0.00011877811,0.000002024225],"about_ca_topic_score_codex":0.0011133315,"about_ca_topic_score_gemma":0.0009999183,"teacher_disagreement_score":0.0023172935,"about_ca_system_score_codex":0.00081825163,"about_ca_system_score_gemma":0.0006817611,"threshold_uncertainty_score":0.012255192},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13096364,0.0037199594,0.84694284,0.0005032954,0.000056915018,0.00006931762,0.00026771604,0.00035249992,0.017123854],"genre_scores_gemma":[0.97678775,0.0017447971,0.0193053,0.00006577622,0.00006221784,0.00005951352,0.000087746324,0.00004358373,0.0018432931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985341,0.0005886141,0.000057369965,0.0002004235,0.00044507516,0.00017441931],"domain_scores_gemma":[0.99534386,0.0031340183,0.0005163112,0.00026404246,0.00066510227,0.000076680415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019604128,0.001552255,0.0009804589,0.00074372377,0.00042705564,0.0012413486,0.0011341257,0.00077136455,0.0019777534],"category_scores_gemma":[0.008221924,0.00043120465,0.0005137843,0.0009063369,0.00090603204,0.0016027464,0.0014119565,0.00075987255,0.00047970747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015407681,0.000030557596,0.0014793624,0.00022403743,0.00009523389,0.00028757434,0.00015959934,0.8983572,0.014316378,0.058076713,0.0008826666,0.02593654],"study_design_scores_gemma":[0.000004311557,0.00012311856,0.0004328973,0.000018335717,0.000029939212,0.00026686947,0.000043964417,0.9836897,0.0035975056,0.0112253595,0.0005466738,0.00002124353],"about_ca_topic_score_codex":0.0011801285,"about_ca_topic_score_gemma":0.0011337731,"teacher_disagreement_score":0.0019777534,"about_ca_system_score_codex":0.0012316798,"about_ca_system_score_gemma":0.0007239653,"threshold_uncertainty_score":0.010367751},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017839812,0.00032297082,0.97169715,0.00064002164,0.000040506624,0.000095981784,0.000078314595,0.000045935623,0.00923929],"genre_scores_gemma":[0.8523075,0.001071784,0.12941703,0.00041047728,0.000170632,0.0005212906,0.00012243976,0.00007582386,0.015902992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769384,0.0011391742,0.00006160121,0.00023366637,0.0005350697,0.00033663702],"domain_scores_gemma":[0.995301,0.0034346196,0.0003949541,0.00017505864,0.0005015836,0.0001928442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044462644,0.0015071242,0.0013499921,0.0010540606,0.0008756108,0.0019276474,0.0021547156,0.0019445958,0.003536918],"category_scores_gemma":[0.011318086,0.00102424,0.0010006869,0.0009226341,0.0024152363,0.0042523635,0.0015291207,0.0019997938,0.00043079545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004866962,0.00006623874,0.00043979092,0.00008032871,0.000043793076,0.00013908281,0.00017120977,0.55313206,0.0012941939,0.43757534,0.00115918,0.005850152],"study_design_scores_gemma":[0.000010260435,0.000025231055,0.000111375186,0.000010262754,0.000010683704,0.000025265752,0.000020395953,0.932209,0.00012356193,0.0667461,0.00069536373,0.000012468213],"about_ca_topic_score_codex":0.0073992624,"about_ca_topic_score_gemma":0.005794632,"teacher_disagreement_score":0.0073992624,"about_ca_system_score_codex":0.0035838527,"about_ca_system_score_gemma":0.0026642962,"threshold_uncertainty_score":0.026002765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025092011,0.0023044099,0.9658494,0.000338172,0.00010668446,0.000060480736,0.00006769201,0.0002749882,0.0059061316],"genre_scores_gemma":[0.82980216,0.00255529,0.16085313,0.0001703468,0.00016718142,0.00014992937,0.00014170194,0.000019226569,0.0061409282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995222,0.0002005897,0.000021574411,0.00006857576,0.00013369061,0.000053360123],"domain_scores_gemma":[0.9995284,0.00020997185,0.00007238193,0.00008872515,0.0000866286,0.000013983025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004676705,0.000616536,0.0007939788,0.00028257747,0.00039075487,0.0006512766,0.0008658358,0.0008230088,0.0016971356],"category_scores_gemma":[0.0012978158,0.00022658835,0.00038164522,0.0005369485,0.0003984578,0.00096946367,0.0005676251,0.0007299373,0.00069788174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004983871,0.00019495244,0.0016038109,0.0010271127,0.00029092614,0.0022622535,0.0005991572,0.40131795,0.078776814,0.2633421,0.009787907,0.24029855],"study_design_scores_gemma":[0.00006815023,0.0003487693,0.00043139854,0.000033586508,0.00009565415,0.00091672625,0.000039921837,0.9471565,0.008185534,0.03117049,0.011508115,0.000045266584],"about_ca_topic_score_codex":0.0006645911,"about_ca_topic_score_gemma":0.0013894651,"teacher_disagreement_score":0.0016971356,"about_ca_system_score_codex":0.0004659795,"about_ca_system_score_gemma":0.0004200211,"threshold_uncertainty_score":0.0056774616},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16145287,0.0017983151,0.8273805,0.00037049648,0.000057159217,0.00009525296,0.00003633545,0.0002752335,0.008533935],"genre_scores_gemma":[0.965116,0.00054756174,0.033588845,0.00006576098,0.00003767177,0.00008277778,0.0000161436,0.000021168295,0.00052412844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692035,0.0016824232,0.00008264317,0.00020369118,0.0008966131,0.00021429345],"domain_scores_gemma":[0.9850723,0.01212294,0.00087767123,0.0007421521,0.0009369915,0.00024790986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029117838,0.00059152476,0.00052288704,0.00086206716,0.00054474134,0.00093116873,0.0011607917,0.0007234573,0.0004715136],"category_scores_gemma":[0.017896915,0.00029093094,0.00025972765,0.0005784439,0.00180939,0.0019846568,0.0011570806,0.00058696145,0.00013657963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018527327,0.000071740316,0.0021273463,0.00021703092,0.00007658085,0.0007013719,0.00046593914,0.72145194,0.014300814,0.22483534,0.000784868,0.034781735],"study_design_scores_gemma":[0.000030420799,0.00023738686,0.0006997108,0.000029173876,0.000036156995,0.00046345635,0.00011549666,0.890724,0.004779328,0.1013663,0.0014899088,0.000028731249],"about_ca_topic_score_codex":0.0005617887,"about_ca_topic_score_gemma":0.00049752876,"teacher_disagreement_score":0.0029117838,"about_ca_system_score_codex":0.00074317155,"about_ca_system_score_gemma":0.00068587495,"threshold_uncertainty_score":0.015399218},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07651384,0.0006370152,0.91395557,0.00030028092,0.00002972061,0.000044800538,0.000059404643,0.00012293688,0.008336449],"genre_scores_gemma":[0.9309997,0.0004817373,0.064901486,0.000056741934,0.000021981366,0.000051013638,0.00004110574,0.000021141186,0.0034250834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996766,0.00014588842,0.000009537028,0.00004044639,0.00009141285,0.000036150534],"domain_scores_gemma":[0.99962234,0.0002338476,0.00005744816,0.000025916494,0.00004752579,0.000012882953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004553719,0.00052986067,0.0004615645,0.00016976957,0.0002422063,0.0006130624,0.00042277825,0.00053539686,0.0015083611],"category_scores_gemma":[0.0010934107,0.00021476382,0.00033111288,0.00029817072,0.0006470577,0.00055012165,0.0004509567,0.0004340372,0.00033312853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008330548,0.000026170766,0.00017830862,0.00009372147,0.000019952475,0.0001838221,0.000094875264,0.9155568,0.010654226,0.06415382,0.0004166239,0.008538298],"study_design_scores_gemma":[0.000009682007,0.000024318564,0.000037915193,0.000003828459,0.0000053752774,0.000034496145,0.000015558271,0.99193126,0.001370067,0.0063529797,0.00020927688,0.0000052001183],"about_ca_topic_score_codex":0.0018405775,"about_ca_topic_score_gemma":0.0028131318,"teacher_disagreement_score":0.0018405775,"about_ca_system_score_codex":0.0007483827,"about_ca_system_score_gemma":0.00089327287,"threshold_uncertainty_score":0.0054299235},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017451607,0.0015626848,0.96396106,0.0004959493,0.00013187775,0.000046289206,0.000024917248,0.00004533683,0.016280273],"genre_scores_gemma":[0.88614523,0.0028996714,0.101731665,0.00020434031,0.00025182296,0.00025079455,0.000036180376,0.000035867062,0.00844453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978902,0.0012647475,0.000063906875,0.00024722808,0.0003731128,0.00016076944],"domain_scores_gemma":[0.9983779,0.0012071182,0.00013701092,0.000086941975,0.00012641853,0.000064676984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028054416,0.0009748622,0.0011204957,0.00073297153,0.0009845087,0.0016427571,0.0014480188,0.0017651602,0.0022078466],"category_scores_gemma":[0.004326877,0.0004900979,0.000627679,0.0013572858,0.0022646615,0.0027810098,0.0013567338,0.0013350238,0.00047426394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006311275,0.000021647455,0.00018211009,0.00010599507,0.00003456305,0.00039830132,0.00024402741,0.38964754,0.0017130737,0.5970526,0.00063113315,0.00990598],"study_design_scores_gemma":[0.000026064627,0.00003566226,0.000054149812,0.000019804544,0.000013055209,0.00006823786,0.00006882344,0.7238022,0.0004450945,0.2733352,0.0021147714,0.000016826325],"about_ca_topic_score_codex":0.00090027676,"about_ca_topic_score_gemma":0.0006241814,"teacher_disagreement_score":0.0028054416,"about_ca_system_score_codex":0.0014351774,"about_ca_system_score_gemma":0.00066326483,"threshold_uncertainty_score":0.014836788},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44105297,0.004090605,0.53099024,0.0006085043,0.00005583957,0.000051676663,0.00012514743,0.0002122025,0.022812804],"genre_scores_gemma":[0.987847,0.00093106023,0.009861581,0.00003220137,0.000024394998,0.000015039718,0.000025642827,0.000025834239,0.0012373542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931383,0.00030136306,0.000016174667,0.00008022454,0.00018488997,0.00010345732],"domain_scores_gemma":[0.99700564,0.002375277,0.00022263102,0.00010537558,0.00024798064,0.000043175914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011735221,0.0011403799,0.00069017406,0.00044145004,0.00030063785,0.000841387,0.0005704174,0.00077926397,0.00060277793],"category_scores_gemma":[0.005409324,0.00024065135,0.00029382095,0.0006930563,0.0007739861,0.0009275852,0.00062192493,0.00045071112,0.00020427012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002899334,0.000018523806,0.00041396837,0.000028163635,0.000014505072,0.000064697735,0.000036370064,0.987677,0.0018477387,0.004546835,0.000118541895,0.005204803],"study_design_scores_gemma":[0.000002659166,0.000053559623,0.000268926,0.000004116104,0.000007465501,0.000030817748,0.000014804788,0.9962304,0.0009468714,0.0023102092,0.00012476604,0.000005368611],"about_ca_topic_score_codex":0.0022211052,"about_ca_topic_score_gemma":0.0019460402,"teacher_disagreement_score":0.0022211052,"about_ca_system_score_codex":0.0008815024,"about_ca_system_score_gemma":0.0004299597,"threshold_uncertainty_score":0.006395817},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47884667,0.0020144326,0.49401996,0.0007115185,0.00007543421,0.00011317107,0.00023148052,0.00043374504,0.023553621],"genre_scores_gemma":[0.9937738,0.00026637962,0.0044732825,0.00003494564,0.000015210623,0.000024047213,0.000023952913,0.000014088484,0.001374307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988707,0.00044061555,0.000036087033,0.000104779705,0.00028031974,0.00026748682],"domain_scores_gemma":[0.99470526,0.004018447,0.00036846322,0.00019495355,0.0006262184,0.00008671943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015013681,0.0011211103,0.0009182754,0.0005868498,0.00063433853,0.0013852669,0.00057870476,0.00090626476,0.0017908429],"category_scores_gemma":[0.0054572765,0.0003418628,0.00040279728,0.00062846375,0.0011941162,0.0009093128,0.0011190382,0.00049965293,0.00030976825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002465906,0.000029792127,0.0011944034,0.000095494324,0.0000517851,0.0002179646,0.0001868745,0.9752882,0.0055772336,0.008343247,0.00037446775,0.008393968],"study_design_scores_gemma":[0.000010398005,0.00013229898,0.000493498,0.000007660102,0.00002265712,0.00011429635,0.000055670767,0.9958198,0.0016478951,0.0015059676,0.00017423923,0.000015610716],"about_ca_topic_score_codex":0.0059063355,"about_ca_topic_score_gemma":0.0040083188,"teacher_disagreement_score":0.0059063355,"about_ca_system_score_codex":0.0013754161,"about_ca_system_score_gemma":0.0009422437,"threshold_uncertainty_score":0.011743903},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27288088,0.0012515169,0.7011138,0.0006516322,0.0000551593,0.000046641257,0.00013929661,0.00016126975,0.02369977],"genre_scores_gemma":[0.9926479,0.00024376654,0.0055813887,0.000057228684,0.00001194414,0.00003555752,0.000026699023,0.000013995579,0.0013816883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994407,0.00020178512,0.000016148082,0.00007739505,0.00013059999,0.00013331573],"domain_scores_gemma":[0.9986534,0.0010023186,0.00010267539,0.000048981237,0.00015930318,0.000033339766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011031596,0.0007330739,0.00076626684,0.0004408966,0.00037771353,0.0009886092,0.00070555345,0.0006932185,0.0010340165],"category_scores_gemma":[0.003063842,0.00023267619,0.0003033292,0.00078189047,0.000674089,0.00093468424,0.0007110246,0.00042268354,0.00013153868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076364326,0.000028069033,0.00036895787,0.000046974386,0.000013967855,0.00009823963,0.000049476068,0.9765752,0.0017961038,0.013527894,0.00046671656,0.0069521205],"study_design_scores_gemma":[0.0000058350292,0.00001793116,0.00009921135,0.0000034911736,0.0000045112065,0.000021385826,0.000016337768,0.9945872,0.0003483199,0.0047831936,0.00010871314,0.0000038886437],"about_ca_topic_score_codex":0.003969686,"about_ca_topic_score_gemma":0.0022912738,"teacher_disagreement_score":0.003969686,"about_ca_system_score_codex":0.0012386404,"about_ca_system_score_gemma":0.00082324335,"threshold_uncertainty_score":0.0089870095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95940626,0.0015466533,0.026539842,0.000527845,0.00006797436,0.000052598196,0.0005196256,0.00039866785,0.010940572],"genre_scores_gemma":[0.9973068,0.000302435,0.0015164779,0.00002604708,0.000011862565,0.000020033021,0.0001268945,0.000022581331,0.00066684093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983329,0.0006133215,0.00008574878,0.00020861841,0.0003042927,0.00045498708],"domain_scores_gemma":[0.98285264,0.01332713,0.00068265136,0.00074018113,0.002014371,0.0003829789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026640934,0.0013295942,0.001104797,0.0013396562,0.0009448436,0.0014405595,0.0016287364,0.0018331697,0.0020336485],"category_scores_gemma":[0.009119345,0.0004532786,0.00061179814,0.001069994,0.0019415518,0.0015464511,0.001151002,0.00074829854,0.0004254577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025782208,0.00013885953,0.0023115277,0.00039704877,0.00023858658,0.0004190846,0.000562394,0.93998486,0.029278895,0.008619272,0.0011928396,0.014278435],"study_design_scores_gemma":[0.00017056252,0.000986338,0.0023379135,0.000062338055,0.00031304007,0.00043879607,0.00055360794,0.95220965,0.03437848,0.007972961,0.00047550714,0.000100793055],"about_ca_topic_score_codex":0.0038698544,"about_ca_topic_score_gemma":0.0033167892,"teacher_disagreement_score":0.0038698544,"about_ca_system_score_codex":0.001477252,"about_ca_system_score_gemma":0.0009319089,"threshold_uncertainty_score":0.014089227},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019317511,0.0005483445,0.9654898,0.00040746748,0.0000896272,0.000082046616,0.00021412582,0.0003923793,0.013458661],"genre_scores_gemma":[0.64110506,0.0012426525,0.34705752,0.00039892484,0.00010861595,0.0003226166,0.0004696144,0.00025185238,0.009043107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878794,0.0004424241,0.00006274759,0.0001768199,0.00031900275,0.0002111266],"domain_scores_gemma":[0.99832195,0.00092582195,0.00019799486,0.00020529995,0.00025119117,0.00009770649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013448616,0.0008497787,0.0009609982,0.00081242074,0.0008835879,0.0014576057,0.0015613493,0.0012060112,0.0046410947],"category_scores_gemma":[0.0060111983,0.0005753724,0.0010605019,0.0008544099,0.00080573425,0.0023877851,0.001754333,0.0011649195,0.0007111856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012758873,0.000053738615,0.0003761241,0.00016153186,0.000042815685,0.000081508486,0.00009413044,0.80058783,0.0026007171,0.14757699,0.0047784084,0.04351863],"study_design_scores_gemma":[0.000015163178,0.000029802808,0.00007199756,0.000014670471,0.000012009369,0.000033838514,0.000020495989,0.9395879,0.00070369453,0.057650086,0.0018502488,0.000010053975],"about_ca_topic_score_codex":0.0020919403,"about_ca_topic_score_gemma":0.0023981542,"teacher_disagreement_score":0.0046410947,"about_ca_system_score_codex":0.0019368514,"about_ca_system_score_gemma":0.0015413484,"threshold_uncertainty_score":0.015525997},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009635598,0.00028517362,0.9874483,0.00009432652,0.000029995364,0.000029054545,0.00002612378,0.000073287825,0.0023782388],"genre_scores_gemma":[0.68788505,0.00090249284,0.30636168,0.0001006134,0.00007915362,0.00014539945,0.00005254226,0.000025821872,0.0044472273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999443,0.00028870016,0.000023224347,0.00008218119,0.00011188319,0.000050946255],"domain_scores_gemma":[0.999476,0.00027515157,0.000066719535,0.000067814304,0.00008872041,0.000025548237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009520126,0.00084890216,0.000584429,0.0002624244,0.00030393244,0.00082459685,0.0010282153,0.0008896344,0.0016342246],"category_scores_gemma":[0.0018024902,0.00023847984,0.00030977002,0.00072028383,0.000514388,0.0014884978,0.0005794708,0.0005011707,0.0004928328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012471282,0.000049454717,0.0002471477,0.00008558922,0.000021568705,0.00009346315,0.000051266798,0.9013021,0.006086107,0.038933016,0.0008971542,0.052108303],"study_design_scores_gemma":[0.000007719049,0.000033024036,0.000031045944,0.0000027760152,0.0000052127184,0.000026882582,0.000007403886,0.99454725,0.00081519806,0.0040168087,0.0005020798,0.0000046625464],"about_ca_topic_score_codex":0.0011689606,"about_ca_topic_score_gemma":0.0017501944,"teacher_disagreement_score":0.0016342246,"about_ca_system_score_codex":0.00056007225,"about_ca_system_score_gemma":0.00047449663,"threshold_uncertainty_score":0.0054669976},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051158585,0.0006429931,0.94409513,0.00021722831,0.000025517842,0.00003364432,0.00003052292,0.000089839246,0.003706483],"genre_scores_gemma":[0.9488363,0.000546166,0.047792222,0.00006442355,0.000036570218,0.000100588964,0.000027980272,0.000023511111,0.0025722217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992136,0.00038506874,0.0000270909,0.000098941986,0.00019900862,0.000076340446],"domain_scores_gemma":[0.99854064,0.0010632987,0.00015332806,0.00007593634,0.00013779923,0.000028949149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011054203,0.00046608524,0.00053187355,0.00042892055,0.00032946005,0.000794127,0.0007840377,0.0008099731,0.0005346766],"category_scores_gemma":[0.00356972,0.00032130053,0.00020961929,0.0008743535,0.0010666018,0.0011035459,0.00069435016,0.000366725,0.00017061505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006670715,0.000017690423,0.0001849772,0.000053048327,0.000019102297,0.00009607387,0.00012365151,0.9299092,0.0040099365,0.04297382,0.00040781716,0.022138054],"study_design_scores_gemma":[0.000019388652,0.000040898423,0.000069566384,0.000005429864,0.0000061052983,0.000043260134,0.000029406132,0.97233826,0.0009361636,0.025983041,0.0005215248,0.0000070120586],"about_ca_topic_score_codex":0.0013071109,"about_ca_topic_score_gemma":0.0012512733,"teacher_disagreement_score":0.0013071109,"about_ca_system_score_codex":0.0007543209,"about_ca_system_score_gemma":0.0005469673,"threshold_uncertainty_score":0.0058460236},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13879952,0.000640511,0.84405154,0.00059963815,0.00009011155,0.000058539714,0.00016537642,0.00016875916,0.015425925],"genre_scores_gemma":[0.94473124,0.0009874806,0.048803862,0.00014754062,0.0002109447,0.00013501065,0.0001032534,0.000041569452,0.004839117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842,0.00068640383,0.000051867923,0.00015826164,0.00039638852,0.00028715315],"domain_scores_gemma":[0.9955705,0.003076698,0.00043878888,0.00045019886,0.00029807058,0.0001657763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014135037,0.000672805,0.00057908025,0.0006500144,0.0007053659,0.0011357194,0.0006279567,0.0005065915,0.002035184],"category_scores_gemma":[0.00468856,0.0002621918,0.00037177032,0.0009040108,0.0022070664,0.0027271307,0.0014932248,0.0012499564,0.00039398344],"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.000107475964,0.000037015507,0.00016846185,0.000069336,0.000008273861,0.00014342237,0.00015753577,0.17460136,0.0043508103,0.81329787,0.00067607453,0.006382412],"study_design_scores_gemma":[0.000024302677,0.000060526145,0.00008764158,0.000020455635,0.000006522251,0.00007824795,0.00004070522,0.6847467,0.001983438,0.3113381,0.0015883897,0.000025033267],"about_ca_topic_score_codex":0.0014785145,"about_ca_topic_score_gemma":0.0011431098,"teacher_disagreement_score":0.002035184,"about_ca_system_score_codex":0.00103543,"about_ca_system_score_gemma":0.000864415,"threshold_uncertainty_score":0.007512629},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09910221,0.0025243761,0.889896,0.00050633535,0.000042491232,0.000051528372,0.000085221596,0.00024640808,0.007545432],"genre_scores_gemma":[0.9662258,0.001149414,0.028912708,0.000120512304,0.00004761191,0.00012222836,0.000062078565,0.00009914566,0.003260578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971698,0.0012043215,0.000097494194,0.00030475028,0.0009154475,0.00030829848],"domain_scores_gemma":[0.98772556,0.009231631,0.00094317296,0.0008421888,0.0011697273,0.00008774662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034842768,0.0011881675,0.0011416591,0.001015615,0.0005318758,0.0013632047,0.0016353326,0.0009870031,0.0010057535],"category_scores_gemma":[0.015667818,0.00054846983,0.00046169432,0.0013406071,0.0015882152,0.002461448,0.0012636298,0.0007400534,0.00038855584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031067684,0.00006408453,0.0011172907,0.00019956875,0.00006134936,0.0003622396,0.00043431975,0.84483325,0.010226542,0.106228255,0.0011043944,0.035057977],"study_design_scores_gemma":[0.000019684388,0.00009515014,0.00041732006,0.000024898,0.00002384127,0.00015613367,0.00006763629,0.9484024,0.0031249332,0.047013894,0.00062839175,0.000025625364],"about_ca_topic_score_codex":0.0012672553,"about_ca_topic_score_gemma":0.00086700317,"teacher_disagreement_score":0.0034842768,"about_ca_system_score_codex":0.0013381903,"about_ca_system_score_gemma":0.00079303735,"threshold_uncertainty_score":0.018426836},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006229764,0.002824663,0.9873958,0.00031153052,0.00007797352,0.000024093686,0.00006868865,0.00029525143,0.0027721645],"genre_scores_gemma":[0.6037942,0.012722332,0.37554458,0.00062139326,0.0010726028,0.00054024043,0.00066731917,0.0005144574,0.0045228344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.992788,0.0021815198,0.00037463204,0.0009003169,0.0030976182,0.0006580624],"domain_scores_gemma":[0.91972846,0.06458806,0.003700598,0.00345339,0.007857502,0.00067205104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010375287,0.0023071659,0.0014839966,0.003354845,0.0009777509,0.0038048031,0.0018027297,0.001984687,0.0016193542],"category_scores_gemma":[0.084164396,0.0007931462,0.0008093004,0.0027849306,0.0028397674,0.0041941586,0.003582127,0.0037198192,0.0009656229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028157284,0.000049264665,0.0009310705,0.0003227411,0.00008186644,0.00012311405,0.00027886895,0.8285202,0.00549585,0.0934433,0.0014624122,0.06900975],"study_design_scores_gemma":[0.000018294722,0.00010914995,0.00040450762,0.00017388035,0.000033988563,0.00009558154,0.000058305362,0.93886995,0.005417246,0.052351184,0.0024180575,0.00004988392],"about_ca_topic_score_codex":0.0042802547,"about_ca_topic_score_gemma":0.003016941,"teacher_disagreement_score":0.010375287,"about_ca_system_score_codex":0.002671504,"about_ca_system_score_gemma":0.0026625835,"threshold_uncertainty_score":0.054870427},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07274785,0.0005943558,0.91910774,0.00025915736,0.000029362242,0.00005938558,0.00007365374,0.00005444613,0.007074074],"genre_scores_gemma":[0.94493353,0.00040849607,0.05222595,0.000044005003,0.000026670969,0.00009448108,0.000031591047,0.0000201974,0.0022150413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994437,0.00025827673,0.000017636346,0.00007305024,0.000116792195,0.00009054588],"domain_scores_gemma":[0.99918646,0.0006201057,0.000073338815,0.000036158184,0.000055054465,0.000028870461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084821007,0.000677693,0.0007245091,0.00036663358,0.00035574337,0.00095735776,0.0007426236,0.0009221262,0.0012860935],"category_scores_gemma":[0.002495944,0.0004048611,0.0003192678,0.0006745369,0.0010407462,0.0011941576,0.0008422121,0.00045382185,0.00025593909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010868834,0.00005897651,0.0002024529,0.00008751864,0.00002654867,0.00015138862,0.000112659865,0.9323796,0.0050616004,0.03821159,0.00063552323,0.022963442],"study_design_scores_gemma":[0.000022037439,0.000032710977,0.00008113026,0.0000058169126,0.000007485779,0.00003823207,0.00002775663,0.97725725,0.0008111615,0.021383872,0.00032339062,0.00000920778],"about_ca_topic_score_codex":0.0013267532,"about_ca_topic_score_gemma":0.0014419373,"teacher_disagreement_score":0.0013267532,"about_ca_system_score_codex":0.00097111386,"about_ca_system_score_gemma":0.0006235975,"threshold_uncertainty_score":0.0070459247},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01405478,0.00010926396,0.9847512,0.00007425298,0.000007917109,0.000015601601,0.0000068323006,0.00012625221,0.0008539049],"genre_scores_gemma":[0.6978242,0.00020354304,0.29920095,0.00010248041,0.000042498887,0.00014030124,0.00004256261,0.00004120096,0.0024022616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992467,0.00033550942,0.000025628582,0.000115999996,0.00019988045,0.00007626424],"domain_scores_gemma":[0.99875736,0.0008948286,0.00010673163,0.00009907845,0.00011230592,0.000029731555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010394418,0.00052280456,0.00068803114,0.0003242766,0.000362166,0.00062524475,0.0009954376,0.00070487306,0.00084814586],"category_scores_gemma":[0.0030341216,0.00034561462,0.00037516936,0.0005345448,0.000607657,0.0010828133,0.0008301945,0.00069611025,0.00024152738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006799849,0.000038098246,0.0005324423,0.000023021463,0.000025322137,0.000036804864,0.000044706736,0.9101929,0.0021429928,0.008817862,0.00032614844,0.07775169],"study_design_scores_gemma":[0.000008926164,0.00001905122,0.00007286792,0.0000012343006,0.0000034586853,0.000018637784,0.000003398724,0.9971994,0.0005037193,0.0020084225,0.00015759433,0.0000032260575],"about_ca_topic_score_codex":0.0016011648,"about_ca_topic_score_gemma":0.0017992236,"teacher_disagreement_score":0.0016011648,"about_ca_system_score_codex":0.0004891451,"about_ca_system_score_gemma":0.00076097803,"threshold_uncertainty_score":0.0054971576},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046434846,0.0002244361,0.95033693,0.000091605376,0.000034047003,0.000058603066,0.00002342086,0.00020242146,0.0025935792],"genre_scores_gemma":[0.702702,0.00023641171,0.29413024,0.000060192462,0.000030865573,0.00013613672,0.000074909876,0.000041445455,0.0025878265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994617,0.0001891926,0.000033671127,0.00009266748,0.00015843206,0.00006421454],"domain_scores_gemma":[0.99867404,0.00054677605,0.00014508782,0.00031554233,0.00026741883,0.00005116287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084692833,0.0005406595,0.00054169167,0.00042876723,0.00046994892,0.00056969037,0.0011313268,0.0005709953,0.0007937945],"category_scores_gemma":[0.0022924675,0.00021533464,0.00034662185,0.00044870147,0.00073169265,0.0013509202,0.000984854,0.00064430793,0.00026021074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006209745,0.00018609098,0.001080261,0.00018058105,0.00007290347,0.000654743,0.00083248736,0.53650874,0.0967387,0.120206684,0.0024036407,0.24051422],"study_design_scores_gemma":[0.000042178068,0.000121488876,0.00020600467,0.000018121575,0.000023631652,0.0002325695,0.000033086057,0.96731824,0.023108864,0.007091248,0.001776881,0.000027713491],"about_ca_topic_score_codex":0.0018129254,"about_ca_topic_score_gemma":0.002321089,"teacher_disagreement_score":0.0018129254,"about_ca_system_score_codex":0.00054157083,"about_ca_system_score_gemma":0.0007825923,"threshold_uncertainty_score":0.004478991},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04877045,0.0009035541,0.9442857,0.00021230971,0.000046722078,0.000053847245,0.000028422819,0.00007362545,0.0056254994],"genre_scores_gemma":[0.85157436,0.00066203316,0.14446199,0.00014167972,0.000060493727,0.0001118401,0.000029096405,0.000020996085,0.0029374268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992242,0.00034144905,0.000018982377,0.00008898782,0.0002226227,0.000103777784],"domain_scores_gemma":[0.99938595,0.00030079333,0.00007967502,0.00008528201,0.0001223629,0.000025856898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069955713,0.0007394193,0.0007211067,0.00038194892,0.0005048376,0.0006953583,0.0012345491,0.0008814503,0.0008011108],"category_scores_gemma":[0.0017376737,0.00023643725,0.0003337554,0.00085437484,0.0008087315,0.00092394307,0.0009919212,0.0005374577,0.00025831803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001478024,0.00011656428,0.0008379113,0.00020141595,0.000058870002,0.00043931848,0.00024173604,0.7946577,0.013048518,0.105113916,0.0014452686,0.08369093],"study_design_scores_gemma":[0.000011717647,0.000080752274,0.000099904886,0.0000072599046,0.00001404587,0.00014879015,0.000033877175,0.983959,0.0022719358,0.011852792,0.0015098286,0.000010077121],"about_ca_topic_score_codex":0.0010834777,"about_ca_topic_score_gemma":0.0014525247,"teacher_disagreement_score":0.0012345491,"about_ca_system_score_codex":0.0006391783,"about_ca_system_score_gemma":0.0006217963,"threshold_uncertainty_score":0.0046376586},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08030426,0.0013000539,0.91003036,0.00026832684,0.000059502614,0.000054692515,0.000071376795,0.00012752118,0.0077838637],"genre_scores_gemma":[0.95815843,0.00091317866,0.038471688,0.000048031863,0.00004647636,0.00009596534,0.000029947698,0.000019249728,0.0022169861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917233,0.00034249318,0.000027941975,0.000083418534,0.00024476438,0.00012908403],"domain_scores_gemma":[0.9961361,0.0027949181,0.0003903239,0.0003245051,0.00026991515,0.00008415581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016224023,0.0005769012,0.0004253833,0.0006436267,0.0005716567,0.00091143796,0.0007686771,0.0005387469,0.00090310944],"category_scores_gemma":[0.0051762154,0.0002581698,0.0003238555,0.0005783328,0.0011497671,0.0012154978,0.0010055777,0.00064784667,0.00012618137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021052775,0.000046826146,0.0006599406,0.000114913884,0.000029916877,0.00023580034,0.00021184895,0.76581734,0.009701414,0.19610816,0.0008245152,0.026038764],"study_design_scores_gemma":[0.000011244964,0.000079544945,0.00020216659,0.00001028019,0.000013995718,0.00009782264,0.000036661175,0.97024566,0.001753529,0.026391266,0.0011435006,0.000014412008],"about_ca_topic_score_codex":0.002070206,"about_ca_topic_score_gemma":0.0025506115,"teacher_disagreement_score":0.002070206,"about_ca_system_score_codex":0.0012535685,"about_ca_system_score_gemma":0.00097474374,"threshold_uncertainty_score":0.009095371},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28160095,0.001505151,0.7108642,0.0003420922,0.00008084983,0.000059721962,0.0001807733,0.00022678399,0.0051396033],"genre_scores_gemma":[0.98249865,0.0005660119,0.01530663,0.00007005073,0.000034306613,0.000054111442,0.0000669092,0.000044630808,0.0013586502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993647,0.00014188993,0.000021592461,0.00009034276,0.0002064138,0.00017510128],"domain_scores_gemma":[0.98897356,0.008060076,0.0009113139,0.0003939601,0.0014558714,0.00020516857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012186599,0.00065587036,0.00046754506,0.0008011646,0.00042016048,0.00089192315,0.0008846864,0.0006271038,0.0013927434],"category_scores_gemma":[0.01039313,0.00028569574,0.00021956448,0.0007390611,0.0013643658,0.0020437292,0.0008294561,0.0008822284,0.0001676676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001303627,0.000016268064,0.00062990194,0.000059910053,0.00001927609,0.00010969572,0.00010150015,0.94445217,0.0053877495,0.041779052,0.00047766764,0.006836383],"study_design_scores_gemma":[0.0000035141695,0.000030380384,0.000120527446,0.000006933276,0.0000060575044,0.000039649723,0.000024610692,0.98967487,0.0015357631,0.008276915,0.00027020706,0.000010476096],"about_ca_topic_score_codex":0.003883768,"about_ca_topic_score_gemma":0.0016294118,"teacher_disagreement_score":0.003883768,"about_ca_system_score_codex":0.0023518675,"about_ca_system_score_gemma":0.0008720979,"threshold_uncertainty_score":0.017064035},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033224416,0.9152675,0.060861085,0.0014930369,0.0009625325,0.00008305675,0.00010562005,0.00013509627,0.017769618],"genre_scores_gemma":[0.01776167,0.95859045,0.018324772,0.00040801888,0.0017211845,0.00007899532,0.00019788505,0.00003884585,0.0028780962],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992362,0.00018152279,0.00008215612,0.0001064287,0.00033707626,0.000056481767],"domain_scores_gemma":[0.9989561,0.0006541792,0.00007148032,0.0000617367,0.0002198316,0.000036655027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012390268,0.0011528812,0.0012504958,0.0020199558,0.00060685456,0.00210603,0.0011497813,0.0014328551,0.0021073911],"category_scores_gemma":[0.0017657536,0.0006775684,0.00052168104,0.005145632,0.00068459695,0.0035360241,0.001182518,0.0014002702,0.0012657106],"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.000049136484,0.00015146626,0.0011264946,0.0059612365,0.00006577985,0.00018017451,0.00024661672,0.020146247,0.001819777,0.067999944,0.029600626,0.87265253],"study_design_scores_gemma":[0.000021547417,0.0003248638,0.0017041673,0.0033910584,0.0001298534,0.001513567,0.0004878402,0.034786273,0.0013852933,0.091878094,0.8642798,0.00009770399],"about_ca_topic_score_codex":0.0014779761,"about_ca_topic_score_gemma":0.0011047949,"teacher_disagreement_score":0.0021073911,"about_ca_system_score_codex":0.00075049174,"about_ca_system_score_gemma":0.0012243581,"threshold_uncertainty_score":0.007049918},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06140599,0.0008824077,0.9314082,0.00026922952,0.0000554032,0.000075378965,0.00008737944,0.00015761619,0.0056582587],"genre_scores_gemma":[0.9006883,0.0005163885,0.096107565,0.000094946,0.000030260873,0.0001325261,0.00007019598,0.000016399512,0.0023434116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951696,0.00017658064,0.0000201847,0.000049244245,0.00016178642,0.000075276716],"domain_scores_gemma":[0.99905986,0.0005062073,0.000092053575,0.00011181747,0.00016945023,0.00006053359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059571816,0.00051161594,0.0006310369,0.00059727643,0.00041549062,0.0007135797,0.0010202145,0.00059411064,0.0013141925],"category_scores_gemma":[0.0017227427,0.00017256217,0.0003038829,0.0008086089,0.00062232156,0.00087685644,0.001021239,0.0005494917,0.0002555682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025176897,0.00007909987,0.0005825718,0.00022705445,0.000072501025,0.00041160974,0.00031731612,0.7292821,0.01738604,0.124468096,0.0020781313,0.124843694],"study_design_scores_gemma":[0.000019267767,0.00007819574,0.000093208255,0.000015547603,0.0000121973335,0.000075535776,0.0000261365,0.9761159,0.0016490642,0.02098043,0.00091723824,0.000017355624],"about_ca_topic_score_codex":0.0027818177,"about_ca_topic_score_gemma":0.003076702,"teacher_disagreement_score":0.0027818177,"about_ca_system_score_codex":0.00084757904,"about_ca_system_score_gemma":0.00078685046,"threshold_uncertainty_score":0.0061496496},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20092298,0.00090951606,0.7800786,0.0013430091,0.000060049475,0.00006925878,0.0003968394,0.00021081952,0.016009068],"genre_scores_gemma":[0.9639645,0.0008833589,0.031607036,0.0001583804,0.00011604543,0.0001370093,0.00027730962,0.00007010201,0.0027861795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997563,0.0012934987,0.000081959435,0.00020997669,0.0004128835,0.0004387456],"domain_scores_gemma":[0.9840522,0.013192155,0.00087235856,0.0008118445,0.0007505245,0.00032096013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031016571,0.000933509,0.0010906102,0.00074621453,0.0006019705,0.0013008298,0.0007444282,0.00078787457,0.0017945467],"category_scores_gemma":[0.013341007,0.00039208046,0.0004144457,0.0009934797,0.0028163665,0.0029162602,0.0018970899,0.0015778284,0.00034673078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027181927,0.00005234472,0.00041566955,0.00010635494,0.000023678662,0.00009898728,0.00016781522,0.5635513,0.003323429,0.4192549,0.0017668206,0.0109668635],"study_design_scores_gemma":[0.000026613649,0.000051831288,0.00011643747,0.000018144554,0.0000050540425,0.000033343735,0.000035987494,0.799309,0.0012602416,0.19871512,0.0004118747,0.0000163537],"about_ca_topic_score_codex":0.0017682204,"about_ca_topic_score_gemma":0.0010840616,"teacher_disagreement_score":0.0031016571,"about_ca_system_score_codex":0.0016327221,"about_ca_system_score_gemma":0.0016338705,"threshold_uncertainty_score":0.016403377},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034130104,0.005219516,0.9404332,0.00050100614,0.00024778102,0.000105342784,0.000074359894,0.00019072859,0.019097956],"genre_scores_gemma":[0.9096085,0.0059544756,0.073514454,0.00026027396,0.00023087954,0.00019534897,0.00008845146,0.000026864749,0.0101207215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989882,0.000471512,0.00003807283,0.000108205866,0.00025984528,0.00013405445],"domain_scores_gemma":[0.99803394,0.001403546,0.00012640802,0.00024073415,0.00014630062,0.00004906728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009621268,0.00044179778,0.00048096405,0.00046102365,0.0005715221,0.0012494291,0.0006333219,0.00076846976,0.000711842],"category_scores_gemma":[0.0025461002,0.00023357438,0.00029195455,0.00081144436,0.0008023986,0.001420395,0.0012015805,0.00051833707,0.00019422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024440867,0.000107253196,0.0014810578,0.0005444925,0.000113647366,0.0012954829,0.0006881941,0.2927799,0.018664476,0.45616665,0.0061586574,0.22175592],"study_design_scores_gemma":[0.000057357887,0.0002101657,0.0005950281,0.000086556465,0.00006278593,0.0012998114,0.00013936857,0.77072054,0.006902338,0.17985918,0.03999074,0.00007611254],"about_ca_topic_score_codex":0.0007569614,"about_ca_topic_score_gemma":0.00097015814,"teacher_disagreement_score":0.0012494291,"about_ca_system_score_codex":0.00048550952,"about_ca_system_score_gemma":0.00046628792,"threshold_uncertainty_score":0.0050882697},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014559074,0.00042499084,0.9785769,0.00041211562,0.000047667418,0.000059388443,0.00005195685,0.00005067144,0.0058173407],"genre_scores_gemma":[0.77541596,0.0018125275,0.21540248,0.00023948304,0.000323341,0.0002967247,0.000115305025,0.000121872574,0.0062723416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991009,0.0004796047,0.00002094065,0.0000979171,0.00018199428,0.00011866855],"domain_scores_gemma":[0.99755484,0.0017647401,0.00020830834,0.00016876453,0.00021281469,0.00009047722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030016236,0.0011835013,0.00088422414,0.0011159983,0.0007128725,0.001497451,0.0015581597,0.0012150059,0.0025672037],"category_scores_gemma":[0.005076062,0.00050363265,0.00069809397,0.0010735522,0.0021757507,0.0025547638,0.0012616863,0.0010826715,0.000334511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021721256,0.00003501782,0.000110618625,0.000026866614,0.000010327288,0.00003925387,0.00003982544,0.8771987,0.0010587958,0.11469815,0.0005121526,0.006248633],"study_design_scores_gemma":[0.000005722578,0.000018943863,0.000040131017,0.000004062775,0.0000042709567,0.000011277826,0.000008032138,0.9691627,0.00013497732,0.030215664,0.00038956292,0.0000046168348],"about_ca_topic_score_codex":0.002802166,"about_ca_topic_score_gemma":0.0022567378,"teacher_disagreement_score":0.0030016236,"about_ca_system_score_codex":0.0019097287,"about_ca_system_score_gemma":0.0013600127,"threshold_uncertainty_score":0.015874326},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048990738,0.0005540046,0.94856983,0.000101253965,0.000019135654,0.000019125384,0.000025350671,0.00010311563,0.0016174268],"genre_scores_gemma":[0.93519014,0.00088692526,0.061953124,0.000044267897,0.000074632124,0.00008412653,0.000036548317,0.000021950782,0.0017084057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989543,0.00059069996,0.000030310579,0.00011051994,0.00022539962,0.00008868518],"domain_scores_gemma":[0.9978942,0.0016172915,0.00017256259,0.0001300514,0.0001618596,0.000023973724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013698179,0.0006623104,0.00068110524,0.00039007602,0.00027182398,0.00068534206,0.000645533,0.00079583307,0.00041716147],"category_scores_gemma":[0.0042561204,0.0005578862,0.00047329522,0.0005539577,0.0011967762,0.0013207287,0.00060479733,0.00039825882,0.00018198602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049195154,0.000009902695,0.0002635175,0.000029836177,0.000030301953,0.000102391576,0.00008514026,0.9745735,0.0027260566,0.013814983,0.000107922766,0.008207168],"study_design_scores_gemma":[0.000008821591,0.000040175462,0.00011763401,0.000004542759,0.000010679095,0.00004112149,0.000012981363,0.9928439,0.00091009773,0.005828334,0.00017061835,0.000011134597],"about_ca_topic_score_codex":0.0016901096,"about_ca_topic_score_gemma":0.0011059416,"teacher_disagreement_score":0.0016901096,"about_ca_system_score_codex":0.00053906074,"about_ca_system_score_gemma":0.00033252058,"threshold_uncertainty_score":0.007244408},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034030485,0.00030490037,0.99291223,0.000112423615,0.000053617714,0.000009787659,0.00001842362,0.00014683767,0.0030387223],"genre_scores_gemma":[0.4734821,0.0034144144,0.5091115,0.00059461157,0.00032346358,0.00015352032,0.0002315823,0.0004558965,0.01223284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873084,0.00031362966,0.000057084675,0.00014026399,0.00062512467,0.00013305916],"domain_scores_gemma":[0.9967656,0.0020933058,0.00016822078,0.00044736173,0.0004742693,0.000051222254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026818363,0.0012032298,0.00078157685,0.0010260248,0.00055922323,0.0015421603,0.0018900863,0.0013073232,0.0018946311],"category_scores_gemma":[0.011061035,0.00051857624,0.0009990304,0.0010311101,0.0013013919,0.0033291532,0.0009223418,0.0025090564,0.0015332819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011405759,0.0000657338,0.0012531587,0.00018425377,0.000049341907,0.00045915684,0.00032771938,0.6235732,0.009031717,0.31088015,0.0031639445,0.050897516],"study_design_scores_gemma":[0.0000029912283,0.000010701607,0.000085980675,0.000018460165,0.000006449634,0.00014057965,0.000016310938,0.98019767,0.00089958915,0.016740942,0.0018695537,0.000010737612],"about_ca_topic_score_codex":0.0029984415,"about_ca_topic_score_gemma":0.0018971647,"teacher_disagreement_score":0.0029984415,"about_ca_system_score_codex":0.0012647135,"about_ca_system_score_gemma":0.0009675845,"threshold_uncertainty_score":0.014183104},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053223534,0.0012323484,0.99108434,0.00015508597,0.00018244513,0.00006930941,0.000016500906,0.00017128809,0.0017662628],"genre_scores_gemma":[0.46355492,0.0023373317,0.5279958,0.00022501567,0.00021036807,0.0004224518,0.00015301508,0.000059556725,0.0050414195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990484,0.00033834839,0.00005951179,0.000191729,0.00030915957,0.00005276879],"domain_scores_gemma":[0.9987919,0.00045765273,0.00011737639,0.00037489444,0.00022788558,0.0000303025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016127871,0.00054814713,0.0006462904,0.0006872653,0.0006685676,0.000833174,0.0019495469,0.000908526,0.001448512],"category_scores_gemma":[0.0032852902,0.00022039213,0.0005498695,0.00064938655,0.0007598324,0.0017208698,0.0009846494,0.0009391606,0.00036036203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001602775,0.00007669472,0.00038214124,0.00045740485,0.00014883079,0.00020900139,0.00025195358,0.37584525,0.02017958,0.36615878,0.0040041455,0.23212595],"study_design_scores_gemma":[0.0001196281,0.00026133613,0.00022955729,0.00006175788,0.000102124264,0.00035505532,0.00007761643,0.8404754,0.00777125,0.12425453,0.026216298,0.00007554469],"about_ca_topic_score_codex":0.00044685454,"about_ca_topic_score_gemma":0.00067479926,"teacher_disagreement_score":0.0019495469,"about_ca_system_score_codex":0.00086028606,"about_ca_system_score_gemma":0.00049436145,"threshold_uncertainty_score":0.008529305},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088512786,0.00073194987,0.9078992,0.00019751274,0.000029065834,0.00002139896,0.000015294023,0.00018345278,0.0024093138],"genre_scores_gemma":[0.9503081,0.0005682798,0.04656946,0.000043494325,0.000048905484,0.00004313215,0.000020913474,0.000017236864,0.0023804386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953926,0.0001702251,0.000018627665,0.00006652893,0.00017983622,0.000025662894],"domain_scores_gemma":[0.99928457,0.00043414967,0.00014321542,0.00003536362,0.000089592264,0.000013127073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007827209,0.00023623106,0.00032209884,0.00023608246,0.00031509515,0.00038952235,0.00030802988,0.00059728185,0.0005710881],"category_scores_gemma":[0.0021520252,0.00019164807,0.00013848141,0.00034472285,0.00055082235,0.0007099596,0.0004099618,0.00035245088,0.00017233542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003479686,0.00006378463,0.0018941679,0.00021915925,0.00006274797,0.0005289432,0.0008345331,0.65230906,0.117059045,0.104519665,0.0010629373,0.121097945],"study_design_scores_gemma":[0.00004762279,0.00019767092,0.00040758355,0.00001407429,0.00002155829,0.00018538765,0.000057009955,0.9603424,0.016077876,0.020586384,0.0020381394,0.000024439276],"about_ca_topic_score_codex":0.00053671334,"about_ca_topic_score_gemma":0.00034822908,"teacher_disagreement_score":0.0007827209,"about_ca_system_score_codex":0.00029419042,"about_ca_system_score_gemma":0.0002579395,"threshold_uncertainty_score":0.004139483},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54041815,0.0006918677,0.45541662,0.000355283,0.000049745962,0.0000644483,0.00005087294,0.00015564225,0.0027973037],"genre_scores_gemma":[0.9949646,0.00014392976,0.004388398,0.000019183553,0.000012617407,0.000020296196,0.000011479804,0.00000876983,0.00043079475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993697,0.00021860193,0.000023409691,0.00007777318,0.00015274576,0.00015786006],"domain_scores_gemma":[0.9964755,0.002178958,0.0005454121,0.0001440594,0.0005119214,0.00014422492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014252213,0.00078779616,0.00066272425,0.00051704375,0.0006860819,0.00081355224,0.0008211331,0.00063655054,0.0008289444],"category_scores_gemma":[0.0045549846,0.0003283807,0.00036749794,0.00065409637,0.0010818518,0.0008460222,0.0008149178,0.00060455635,0.00012343847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101014164,0.00004548677,0.00078683835,0.00004177446,0.000022849075,0.00017309122,0.00015015468,0.97680515,0.0055103074,0.011438788,0.0002535585,0.0046710568],"study_design_scores_gemma":[0.0000041006106,0.00003412491,0.00011158214,0.0000013215332,0.0000054445836,0.000014902795,0.000017879911,0.9985958,0.00029530213,0.0008808286,0.000035445497,0.000003274662],"about_ca_topic_score_codex":0.009703829,"about_ca_topic_score_gemma":0.0042284722,"teacher_disagreement_score":0.009703829,"about_ca_system_score_codex":0.0017653392,"about_ca_system_score_gemma":0.0012312974,"threshold_uncertainty_score":0.01929468},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43498144,0.0013448584,0.5488962,0.00044980447,0.000037895992,0.0000938069,0.0001758945,0.00027589267,0.0137442155],"genre_scores_gemma":[0.9873169,0.0002852779,0.011696428,0.000033848377,0.000011801739,0.000024947283,0.00002733904,0.000013679633,0.0005897534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910575,0.00033466626,0.00003151131,0.000092479124,0.0002911124,0.00014438291],"domain_scores_gemma":[0.9956584,0.0031035892,0.00038897982,0.00025655684,0.0005430485,0.00004952117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019482464,0.0009404451,0.00052837137,0.00049481215,0.0003540112,0.00071677763,0.00067325763,0.0006828031,0.001152396],"category_scores_gemma":[0.007745892,0.0002592692,0.00033570602,0.00048656957,0.0008254883,0.00080390513,0.0006427746,0.0004223313,0.00022959095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028477216,0.00004767033,0.0027084295,0.00011737648,0.000057306832,0.00028363272,0.00018916857,0.9185299,0.022369912,0.03756529,0.00038047263,0.01746605],"study_design_scores_gemma":[0.000010484072,0.000095214134,0.0006077683,0.0000099581775,0.000016237756,0.000097209915,0.000025844529,0.99308527,0.0023955991,0.0034536556,0.00019036191,0.000012406787],"about_ca_topic_score_codex":0.002693571,"about_ca_topic_score_gemma":0.002819092,"teacher_disagreement_score":0.002693571,"about_ca_system_score_codex":0.0010717701,"about_ca_system_score_gemma":0.0010059102,"threshold_uncertainty_score":0.010303438},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0128052775,0.0033639965,0.9685942,0.0014828563,0.00019682545,0.00008417779,0.00019605734,0.00026597155,0.013010653],"genre_scores_gemma":[0.75273335,0.007966545,0.2221689,0.00078128866,0.0007562861,0.0011344366,0.0007636481,0.0008112093,0.012884375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994136,0.0026105992,0.00019963474,0.0004887792,0.001880466,0.00068437756],"domain_scores_gemma":[0.9570291,0.037159003,0.0010924096,0.0019944722,0.0023404988,0.00038460098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008275307,0.0032533323,0.0019708711,0.0023570454,0.001252548,0.004006697,0.0029069963,0.0025014314,0.004248866],"category_scores_gemma":[0.0530249,0.0013349944,0.0009444373,0.0035711094,0.003658122,0.007269045,0.0044784774,0.0055055735,0.0006927694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014970734,0.00006641653,0.0003265932,0.00014917702,0.000048303613,0.000052901596,0.00016539657,0.7760793,0.0014881094,0.1762549,0.0033674773,0.04185173],"study_design_scores_gemma":[0.00001394075,0.00002730651,0.000098566714,0.000054277105,0.000015721103,0.000021493017,0.00003086685,0.8668522,0.00057570357,0.13117324,0.0011164355,0.000020156942],"about_ca_topic_score_codex":0.006846264,"about_ca_topic_score_gemma":0.0058122315,"teacher_disagreement_score":0.008275307,"about_ca_system_score_codex":0.004630351,"about_ca_system_score_gemma":0.003272528,"threshold_uncertainty_score":0.043764472},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02358464,0.00058536703,0.96892613,0.00038730176,0.00016417383,0.00013726161,0.0001193355,0.00083651434,0.005259212],"genre_scores_gemma":[0.8179381,0.00048587902,0.17769824,0.00033736948,0.00020492834,0.00019524377,0.00017809763,0.00004700921,0.0029150266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992812,0.00027898836,0.000034125707,0.000060658724,0.0002377634,0.00010726611],"domain_scores_gemma":[0.9991301,0.0004116375,0.00010759441,0.00014093953,0.00016010863,0.00004979261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012596935,0.00037627452,0.00047253206,0.00038159845,0.00067829713,0.000574667,0.00087774044,0.00067739433,0.0014338414],"category_scores_gemma":[0.001571784,0.00012345212,0.00033072702,0.00056176056,0.00038928646,0.0008984978,0.0012272315,0.0006879406,0.00024290562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006250182,0.00027315077,0.001951578,0.00053870276,0.00018943593,0.0007184968,0.0004477039,0.33601344,0.074876785,0.20167127,0.015001789,0.36769274],"study_design_scores_gemma":[0.000048941292,0.0002857756,0.0003414638,0.000020109252,0.00002951857,0.00036178276,0.000059949994,0.93997544,0.01127145,0.038650546,0.008931455,0.000023581886],"about_ca_topic_score_codex":0.0004617896,"about_ca_topic_score_gemma":0.0006266145,"teacher_disagreement_score":0.0014338414,"about_ca_system_score_codex":0.00049023994,"about_ca_system_score_gemma":0.0005154531,"threshold_uncertainty_score":0.006662011},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018009787,0.00037990577,0.97278756,0.00022473023,0.00025299072,0.0001491716,0.00014322398,0.0047180788,0.0033344892],"genre_scores_gemma":[0.30543843,0.00041919603,0.683795,0.00031860627,0.00014932732,0.00025888698,0.00045063754,0.0005482912,0.008621698],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987908,0.00022943535,0.00005268459,0.00014149208,0.00064517494,0.00014049625],"domain_scores_gemma":[0.99655557,0.0011249152,0.00017862678,0.0009930125,0.0009783923,0.00016946546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012290616,0.0008192354,0.0009296528,0.0010098115,0.00087533303,0.000993545,0.0019834691,0.0010507561,0.0047016307],"category_scores_gemma":[0.006741023,0.00031927542,0.00037674882,0.0010746573,0.0007845594,0.0023465948,0.0020393606,0.0017147354,0.0012396389],"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.0008535663,0.00040657516,0.0010383538,0.0002282536,0.000099258155,0.00022554102,0.0002612208,0.23984443,0.068305425,0.042235017,0.023665307,0.6228371],"study_design_scores_gemma":[0.000049477665,0.00009880779,0.00014398676,0.000018499299,0.000017396425,0.000098192315,0.000034053952,0.9549804,0.02965524,0.009812156,0.0050627547,0.000029044588],"about_ca_topic_score_codex":0.0072240313,"about_ca_topic_score_gemma":0.0097538475,"teacher_disagreement_score":0.0072240313,"about_ca_system_score_codex":0.0012547546,"about_ca_system_score_gemma":0.0019758332,"threshold_uncertainty_score":0.015728593},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01568115,0.0007408233,0.97828466,0.00018823471,0.000032487256,0.00004609671,0.00006839094,0.000081413535,0.004876757],"genre_scores_gemma":[0.85221875,0.0019158805,0.13860582,0.00015192598,0.00008932179,0.00030877543,0.00012012158,0.000090709975,0.0064987913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991731,0.0003744766,0.00003260961,0.00011789246,0.00019816877,0.000103603474],"domain_scores_gemma":[0.9989166,0.0007405395,0.000110379166,0.00004214832,0.00015682704,0.000033498876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011715288,0.0015215751,0.0010986851,0.00046119926,0.00037352063,0.0012389754,0.0007974796,0.0011869678,0.0021041539],"category_scores_gemma":[0.0033702417,0.00058610615,0.0004095169,0.00091019867,0.0010543836,0.0014844227,0.0010440587,0.0008808807,0.0006908298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005636604,0.000039127557,0.00015493442,0.00012518514,0.000028834733,0.000112959206,0.000071783026,0.94631165,0.0035827942,0.035126854,0.0007625074,0.013626996],"study_design_scores_gemma":[0.000010496753,0.000021528615,0.00004140104,0.000006909293,0.00000562531,0.000021616297,0.000015077819,0.9882946,0.00043142436,0.010867062,0.00027807264,0.0000063079124],"about_ca_topic_score_codex":0.0018311013,"about_ca_topic_score_gemma":0.002179038,"teacher_disagreement_score":0.0021041539,"about_ca_system_score_codex":0.0012553344,"about_ca_system_score_gemma":0.000950288,"threshold_uncertainty_score":0.009108126},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02750329,0.00036610285,0.97073877,0.00008635929,0.000023279377,0.000044745517,0.000013306685,0.00014420219,0.0010798716],"genre_scores_gemma":[0.92537034,0.0003559669,0.07326445,0.00008035846,0.000035440517,0.00013008335,0.000030004516,0.00004631572,0.00068713946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979005,0.0009545657,0.00010384193,0.00028886108,0.00054216234,0.00021006135],"domain_scores_gemma":[0.99701023,0.0015457716,0.000401329,0.0002115192,0.0007664602,0.00006455341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004816934,0.0010504164,0.00082237186,0.0006049284,0.00055798667,0.0013524829,0.0011011836,0.0007374479,0.0009937084],"category_scores_gemma":[0.007175404,0.00062850956,0.000566786,0.00057982665,0.0009060554,0.0013937366,0.0011006225,0.0007792331,0.00022821687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009643593,0.000060383925,0.0007553616,0.00007769897,0.00008159838,0.00008634854,0.00014061794,0.9523584,0.01017845,0.013650993,0.00032700482,0.022186624],"study_design_scores_gemma":[0.000006706563,0.00005308418,0.000084654275,0.0000041322314,0.000020639041,0.000019103034,0.000008395574,0.99628687,0.0019480458,0.0014044737,0.00015733275,0.0000065793183],"about_ca_topic_score_codex":0.0015033124,"about_ca_topic_score_gemma":0.0013979877,"teacher_disagreement_score":0.004816934,"about_ca_system_score_codex":0.0013428938,"about_ca_system_score_gemma":0.0012206284,"threshold_uncertainty_score":0.025474668},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011278089,0.002776216,0.9680605,0.00085261115,0.000101127276,0.000062143205,0.00022342354,0.00035569214,0.016290225],"genre_scores_gemma":[0.6538951,0.00957945,0.32603452,0.0011000235,0.0007617119,0.0010659517,0.0007701361,0.0006455263,0.006147668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950206,0.0012114123,0.00017053934,0.0005451602,0.0021672137,0.0008850313],"domain_scores_gemma":[0.97139084,0.023647204,0.0010950064,0.0014320896,0.0019761564,0.0004587131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052620624,0.0020787101,0.0018599046,0.002960044,0.0016128308,0.0045688674,0.003833139,0.0018378,0.0069230944],"category_scores_gemma":[0.03641947,0.0011403537,0.0011073247,0.004146208,0.003117562,0.008026172,0.0033720357,0.0039263205,0.0018617513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002642317,0.00014876988,0.00058607885,0.00057529006,0.000064573745,0.00013759304,0.0002719631,0.6178158,0.0026389514,0.31423476,0.0067389943,0.056523014],"study_design_scores_gemma":[0.000026399204,0.00006960752,0.00024203624,0.00013266792,0.000029102948,0.00013725809,0.00008558532,0.8032228,0.0019867527,0.19034776,0.0036898341,0.000030202049],"about_ca_topic_score_codex":0.0017329702,"about_ca_topic_score_gemma":0.0017007369,"teacher_disagreement_score":0.0069230944,"about_ca_system_score_codex":0.004397813,"about_ca_system_score_gemma":0.0024771944,"threshold_uncertainty_score":0.031908512},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77131045,0.010744715,0.1788362,0.0008308119,0.00024997842,0.000092943505,0.0005535815,0.0005072673,0.036873985],"genre_scores_gemma":[0.99389464,0.0015072434,0.0036064028,0.000036323105,0.000040558316,0.00001893407,0.00009599095,0.000034104833,0.0007657126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877566,0.00037193828,0.000039585884,0.0001411086,0.0004291841,0.00024254891],"domain_scores_gemma":[0.9903015,0.007286928,0.0007121036,0.0004886866,0.0010636249,0.00014719831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017468344,0.0009878329,0.00066090963,0.0010423528,0.00064984895,0.0012829083,0.00068452256,0.0011235479,0.0011033072],"category_scores_gemma":[0.013314263,0.00019368093,0.00027533187,0.0013382203,0.0013449704,0.0013688379,0.00076539075,0.00061586447,0.00026610645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002635187,0.00004076002,0.0017268559,0.0001013965,0.000043283548,0.00015559352,0.00009168049,0.9617422,0.0061333487,0.009051763,0.00055332686,0.020096239],"study_design_scores_gemma":[0.000012229345,0.00030946056,0.002837569,0.000035762274,0.00004757654,0.00020665479,0.00007028548,0.9866621,0.0043176934,0.004783172,0.0006877324,0.000029770054],"about_ca_topic_score_codex":0.0067763817,"about_ca_topic_score_gemma":0.0044603567,"teacher_disagreement_score":0.0067763817,"about_ca_system_score_codex":0.0016500753,"about_ca_system_score_gemma":0.0007050269,"threshold_uncertainty_score":0.013473928},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011648613,0.00013658864,0.9865058,0.0001903301,0.000032035456,0.00008199356,0.00001645015,0.00035403066,0.0010340925],"genre_scores_gemma":[0.7344239,0.00030957276,0.26283422,0.00022213852,0.00007351784,0.0002290691,0.000067314475,0.00006450939,0.0017758223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979175,0.0008439885,0.00008403971,0.00020725517,0.00079466833,0.00015262041],"domain_scores_gemma":[0.9915326,0.005451208,0.00081632397,0.0009988094,0.0010481158,0.00015293722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026218363,0.00057653675,0.00062295503,0.0009443293,0.00057740643,0.0005874136,0.0015919048,0.0010988881,0.0009172195],"category_scores_gemma":[0.011506609,0.00027450203,0.00039324275,0.0007264294,0.0018539266,0.0021310362,0.0016715451,0.0012038461,0.00032135873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029083758,0.00014244317,0.0010184989,0.00016335909,0.000051574836,0.0004945887,0.00035769623,0.7645755,0.027302353,0.105849355,0.001571302,0.09818244],"study_design_scores_gemma":[0.000017030363,0.00006642111,0.000053187083,0.000009638099,0.000009522242,0.000084891864,0.000013986421,0.98126066,0.0044955383,0.013159701,0.00081166346,0.000017839602],"about_ca_topic_score_codex":0.0025905531,"about_ca_topic_score_gemma":0.0025959762,"teacher_disagreement_score":0.0026218363,"about_ca_system_score_codex":0.0013884314,"about_ca_system_score_gemma":0.0012263142,"threshold_uncertainty_score":0.013865709},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058016954,0.00035485625,0.9925533,0.00004296962,0.000029683511,0.000014926802,0.000038783626,0.0002810819,0.0008826304],"genre_scores_gemma":[0.57803094,0.0013568404,0.41675192,0.00008575907,0.0001221088,0.00011652304,0.00034840425,0.000060511342,0.0031269428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992933,0.00025879877,0.00003415295,0.0001099342,0.0002405497,0.000063213454],"domain_scores_gemma":[0.99905735,0.00045834816,0.000081929626,0.00012576226,0.0002477496,0.00002889513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007406951,0.00075356825,0.00085767754,0.00055072946,0.00035912468,0.0007421934,0.00062647206,0.0005962183,0.001044087],"category_scores_gemma":[0.0027935437,0.0004397991,0.00046598466,0.00065253564,0.00051976467,0.0010033762,0.00070929417,0.00075631787,0.00060412695],"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.00020180664,0.00004035278,0.00050288526,0.00014009727,0.000059431677,0.00013977072,0.00009330007,0.8092142,0.019023234,0.01696003,0.0021326386,0.15149227],"study_design_scores_gemma":[0.0000042698925,0.000017511384,0.000068130765,0.0000045642196,0.000005159189,0.000032615197,0.0000067520573,0.99458003,0.0026020594,0.002300009,0.0003685498,0.000010400572],"about_ca_topic_score_codex":0.0036403597,"about_ca_topic_score_gemma":0.003294891,"teacher_disagreement_score":0.0036403597,"about_ca_system_score_codex":0.00047591687,"about_ca_system_score_gemma":0.0007390952,"threshold_uncertainty_score":0.0072383285},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01786072,0.0020532073,0.92612106,0.006010342,0.00051654334,0.000066218694,0.00018807438,0.00022428494,0.046959568],"genre_scores_gemma":[0.74148566,0.0067628087,0.23169178,0.0016600309,0.0022319003,0.00040852904,0.00040465881,0.00026278192,0.015091888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998454,0.0006311222,0.000047113354,0.00021900253,0.0004713311,0.00017744534],"domain_scores_gemma":[0.9963845,0.001965619,0.00037588843,0.0006387855,0.00048491472,0.00015014551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016064851,0.0011243144,0.0007459006,0.002550551,0.0015305752,0.0028332057,0.0020956066,0.0017798558,0.005721318],"category_scores_gemma":[0.0079660565,0.0004968648,0.00091266714,0.0024377876,0.0069544697,0.007918972,0.004038221,0.0040671006,0.00094792014],"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.0000050043363,0.0000034160373,0.000029153827,0.00000983306,0.0000014166449,0.000015054321,0.000032570562,0.0037872738,0.00011430732,0.9935684,0.00047407066,0.001959487],"study_design_scores_gemma":[0.000004415718,0.000015996906,0.000034497178,0.000013036572,0.0000023843493,0.000049400365,0.00005022082,0.019299686,0.00028325222,0.97534513,0.004892398,0.000009468989],"about_ca_topic_score_codex":0.0009063221,"about_ca_topic_score_gemma":0.0005975899,"teacher_disagreement_score":0.005721318,"about_ca_system_score_codex":0.0020252727,"about_ca_system_score_gemma":0.0009669671,"threshold_uncertainty_score":0.019139767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47523454,0.0024158296,0.51258504,0.00037427252,0.000055468114,0.00006600906,0.0001563334,0.00034370553,0.00876884],"genre_scores_gemma":[0.9899226,0.00043398072,0.00922758,0.000021745731,0.000014156843,0.000017049691,0.00002884368,0.000011697192,0.00032243822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869436,0.00047579783,0.00006203245,0.00011232305,0.0004912553,0.00016425468],"domain_scores_gemma":[0.99069,0.0070263627,0.0007215606,0.00047057625,0.0010161626,0.00007533321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018390819,0.0008199555,0.00074449315,0.00054736424,0.00047827812,0.0011560891,0.0007266305,0.0008837332,0.0008906645],"category_scores_gemma":[0.012939801,0.00025457112,0.0003402973,0.0007678373,0.0007415751,0.0010704553,0.0007028238,0.00059372996,0.00018411748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005602079,0.000059482074,0.0033189557,0.00019246571,0.000095343334,0.0004281315,0.00027537698,0.9165112,0.023828525,0.013745653,0.00031205,0.04067259],"study_design_scores_gemma":[0.000009150294,0.00013186237,0.0007899517,0.000015265967,0.000027648157,0.0001657667,0.00003478601,0.9932568,0.0035726903,0.0018064015,0.00017314989,0.00001644705],"about_ca_topic_score_codex":0.002491611,"about_ca_topic_score_gemma":0.0024250778,"teacher_disagreement_score":0.002491611,"about_ca_system_score_codex":0.00089046254,"about_ca_system_score_gemma":0.0008126895,"threshold_uncertainty_score":0.009726107},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008851412,0.00008522908,0.9893945,0.00009093594,0.000008656806,0.000017535007,0.000008912976,0.00048334184,0.0010594657],"genre_scores_gemma":[0.7593841,0.000152224,0.23753144,0.00017659405,0.00006003613,0.00015323689,0.000058896607,0.00018773042,0.0022957174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958616,0.00016501664,0.000016223265,0.0000981516,0.00007520859,0.000059319373],"domain_scores_gemma":[0.99905735,0.0005613812,0.00012410259,0.00014032284,0.00007582399,0.00004097136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001416549,0.0011187616,0.0013925113,0.00062096154,0.00057760184,0.0008970277,0.0015151146,0.0010289542,0.0014522633],"category_scores_gemma":[0.00253111,0.0003698078,0.0005415832,0.0006253547,0.0017432742,0.0015677289,0.0013968785,0.0010085799,0.0003809484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059127295,0.00003945369,0.00037640572,0.00004830719,0.000043460404,0.000030769883,0.00006647898,0.9431411,0.002021566,0.009814244,0.0006596488,0.04369944],"study_design_scores_gemma":[0.000008563672,0.000014505813,0.000032731405,0.0000018896435,0.0000053771623,0.0000041749654,0.000004899138,0.99583036,0.00047078665,0.0034881202,0.00013558668,0.0000031480442],"about_ca_topic_score_codex":0.005332066,"about_ca_topic_score_gemma":0.0048386087,"teacher_disagreement_score":0.005332066,"about_ca_system_score_codex":0.000675155,"about_ca_system_score_gemma":0.0012180808,"threshold_uncertainty_score":0.010602057},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3481393,0.003495987,0.6255927,0.0006415517,0.000058797963,0.00010762468,0.0003400527,0.0005872817,0.021036599],"genre_scores_gemma":[0.98843527,0.00060320465,0.009915933,0.0000553646,0.000026045383,0.00004654481,0.00006281378,0.000018144343,0.0008367299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984303,0.00058856193,0.000056909776,0.00014455015,0.0005418522,0.0002377715],"domain_scores_gemma":[0.99286556,0.0051810937,0.0005973457,0.00030180195,0.00093019276,0.00012395416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021900618,0.0010146985,0.0008821943,0.00090510707,0.0006235966,0.00113131,0.0009232827,0.0011046202,0.0013733741],"category_scores_gemma":[0.009939379,0.00033768988,0.0003940935,0.00096530694,0.001283187,0.0012756366,0.0017503209,0.00052331184,0.00028756165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017833708,0.000026136406,0.0010180405,0.00015012892,0.000034736207,0.00020366811,0.00018115238,0.96356887,0.006243997,0.0170071,0.0004972108,0.010890626],"study_design_scores_gemma":[0.0000062487643,0.00008021617,0.0003875645,0.000015507192,0.000017685397,0.00013242701,0.000050477003,0.99383813,0.0016896469,0.0035351343,0.00023346563,0.000013377307],"about_ca_topic_score_codex":0.0032330484,"about_ca_topic_score_gemma":0.0025299378,"teacher_disagreement_score":0.0032330484,"about_ca_system_score_codex":0.0018511076,"about_ca_system_score_gemma":0.00082369376,"threshold_uncertainty_score":0.013430834},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077195734,0.00074967433,0.91893435,0.00016831957,0.000021325155,0.000034128887,0.00003725517,0.00008386275,0.0027754013],"genre_scores_gemma":[0.956648,0.00032477314,0.042082943,0.000017780654,0.000022970715,0.000039713388,0.000020685547,0.000008522354,0.0008346613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994702,0.00026694863,0.0000227701,0.00007709544,0.00009803712,0.00006495908],"domain_scores_gemma":[0.9987417,0.00093201856,0.00012905903,0.00010402515,0.00006817778,0.000024957086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008873673,0.00055385847,0.0006695868,0.00024033722,0.00045087116,0.0007183946,0.0004651401,0.00059439463,0.00062754506],"category_scores_gemma":[0.0034728074,0.0003382162,0.00026372392,0.0003714005,0.00073154137,0.0011575177,0.0004917174,0.0004552738,0.00015663054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011313174,0.0000310667,0.0005484618,0.00007972719,0.000027410118,0.00021819299,0.00011323785,0.92867,0.0040953835,0.030058589,0.00037773116,0.035667017],"study_design_scores_gemma":[0.000010205569,0.00003831703,0.00010277245,0.000002730497,0.0000062694885,0.000064152555,0.000017123464,0.992796,0.00078609557,0.005906895,0.0002638681,0.000005527762],"about_ca_topic_score_codex":0.0015768508,"about_ca_topic_score_gemma":0.001878547,"teacher_disagreement_score":0.0015768508,"about_ca_system_score_codex":0.0006875605,"about_ca_system_score_gemma":0.00063409103,"threshold_uncertainty_score":0.004988551},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026150705,0.0004190499,0.9657701,0.0004372782,0.000085338856,0.000065465654,0.00009618698,0.00023868617,0.0067371666],"genre_scores_gemma":[0.861019,0.0010509903,0.124141656,0.00048385336,0.00030956074,0.00044566838,0.00020699768,0.000067466484,0.012274814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969422,0.0009516254,0.00015206916,0.00042347817,0.0011065064,0.00042400372],"domain_scores_gemma":[0.9910267,0.0052838624,0.00074630993,0.0014502669,0.0013094987,0.00018336142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028127907,0.0017574272,0.0016864393,0.0014615003,0.0013448264,0.002093433,0.0015101705,0.0019830887,0.001523795],"category_scores_gemma":[0.009897452,0.0008304438,0.00081844156,0.0030294028,0.0019328935,0.0029298784,0.0036964111,0.0012287918,0.0010569335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014122004,0.0003475051,0.0034483469,0.00060743367,0.00048472153,0.0011537338,0.001670982,0.5464105,0.06338496,0.18427074,0.0050063026,0.19180264],"study_design_scores_gemma":[0.000093798866,0.00022601614,0.00052585715,0.000041041712,0.00013404276,0.00050751626,0.00014435513,0.90730244,0.012664315,0.07513523,0.0031237171,0.00010164104],"about_ca_topic_score_codex":0.0011495168,"about_ca_topic_score_gemma":0.0021649688,"teacher_disagreement_score":0.0028127907,"about_ca_system_score_codex":0.0007301954,"about_ca_system_score_gemma":0.0015548503,"threshold_uncertainty_score":0.01487565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009756289,0.00047324577,0.9865469,0.00011627897,0.000025509968,0.000034868357,0.00007408692,0.000060307077,0.0029125772],"genre_scores_gemma":[0.67609066,0.0023473778,0.3114474,0.00019850399,0.00010936055,0.00024100785,0.00024595755,0.00006773206,0.009251952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993907,0.00022331392,0.000030813397,0.000092647904,0.00021057959,0.000051865398],"domain_scores_gemma":[0.9991634,0.00045413952,0.000094397365,0.000064906766,0.0001927514,0.000030454945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080224714,0.00064419594,0.0005536154,0.00033487796,0.00028158835,0.0008530042,0.00049846177,0.00060334435,0.0023128276],"category_scores_gemma":[0.0024431776,0.00026728524,0.0002679006,0.00072610646,0.0007748895,0.0013756165,0.00045791376,0.0005171539,0.0005870884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060995757,0.000021551466,0.00022464256,0.0000923968,0.000021279959,0.00008934777,0.000081053,0.7808497,0.005697162,0.15972559,0.0015456282,0.051590644],"study_design_scores_gemma":[0.000010928569,0.000042483516,0.0000903362,0.000008717603,0.000005040135,0.00003576123,0.000023527118,0.9469322,0.0015503624,0.049762793,0.0015223895,0.000015449103],"about_ca_topic_score_codex":0.0029215673,"about_ca_topic_score_gemma":0.0030899562,"teacher_disagreement_score":0.0029215673,"about_ca_system_score_codex":0.0011885212,"about_ca_system_score_gemma":0.0011789983,"threshold_uncertainty_score":0.008623362},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051963024,0.00081243535,0.94314796,0.00012714544,0.000025601998,0.000042598414,0.000046657195,0.00013280414,0.0037017576],"genre_scores_gemma":[0.95128185,0.0006646463,0.046242245,0.000032949487,0.000034160093,0.00007379579,0.00003705042,0.000011428903,0.0016218764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865025,0.00072156347,0.0000682742,0.0001392361,0.00026303274,0.00015781895],"domain_scores_gemma":[0.9980082,0.001320191,0.00022544077,0.00015750255,0.0002255965,0.00006308492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015330476,0.0011817614,0.0009816824,0.0004539155,0.00044692075,0.0010472169,0.0008963558,0.0006770771,0.0010086693],"category_scores_gemma":[0.0026813734,0.00053832366,0.00058736297,0.0005941777,0.00075622415,0.00081952824,0.00085968623,0.0004334788,0.00038256316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028149417,0.00006317672,0.0008835036,0.0001357658,0.00009935207,0.00043769437,0.00015626072,0.9014746,0.011960366,0.03135876,0.0008467143,0.052302197],"study_design_scores_gemma":[0.00002018921,0.00012753381,0.00014634896,0.0000069182747,0.000036394027,0.00018260989,0.000024603694,0.9888076,0.00232446,0.007815456,0.00049116084,0.000016612865],"about_ca_topic_score_codex":0.0006827091,"about_ca_topic_score_gemma":0.0010616144,"teacher_disagreement_score":0.0015330476,"about_ca_system_score_codex":0.00060690835,"about_ca_system_score_gemma":0.00037180647,"threshold_uncertainty_score":0.008107603},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1277889,0.0026923884,0.8566478,0.0005185027,0.000059943763,0.00004552377,0.00007771887,0.00017842665,0.011990852],"genre_scores_gemma":[0.969912,0.0015439406,0.026836852,0.000114174596,0.0000788647,0.00005297569,0.00002846775,0.000037471822,0.001395196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980013,0.0008392323,0.00006374659,0.000242643,0.00041368362,0.00043939363],"domain_scores_gemma":[0.99102986,0.007412902,0.00061431614,0.0004311398,0.00038304992,0.00012878829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002235293,0.0010492861,0.0010937466,0.00093729224,0.0007499966,0.0016400722,0.0012244572,0.0014922575,0.0010704399],"category_scores_gemma":[0.009647073,0.00054510543,0.000505125,0.0010103547,0.0021306835,0.0030089968,0.0017038803,0.0010677421,0.00021559515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014286657,0.000051478582,0.0005600076,0.0001640354,0.00006710558,0.0002623234,0.00016372315,0.8467456,0.011042463,0.1233474,0.00038846658,0.01706451],"study_design_scores_gemma":[0.000015481928,0.0001536487,0.00035478038,0.00003601823,0.0000350777,0.0002988203,0.00005713766,0.9023064,0.005621313,0.090306535,0.0007844828,0.000030366311],"about_ca_topic_score_codex":0.00062726456,"about_ca_topic_score_gemma":0.0006280279,"teacher_disagreement_score":0.002235293,"about_ca_system_score_codex":0.0013287043,"about_ca_system_score_gemma":0.00044415504,"threshold_uncertainty_score":0.011821508},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04338979,0.00016421259,0.95259386,0.00014233198,0.000024887671,0.00006597933,0.000047177673,0.0003881261,0.0031837693],"genre_scores_gemma":[0.7703087,0.00023022531,0.22563638,0.00009380408,0.000029664296,0.00017172628,0.00014872702,0.00005241518,0.0033283962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995714,0.00012424665,0.000015167855,0.00005425745,0.00017157765,0.000063422674],"domain_scores_gemma":[0.99900657,0.0004623208,0.00012472847,0.00019708717,0.00017591426,0.000033406213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052210863,0.00037802962,0.00035159328,0.00064106344,0.00048001527,0.0004138602,0.0008595482,0.0003671068,0.0010568887],"category_scores_gemma":[0.0017089995,0.00015076839,0.00025857997,0.0008396179,0.00063065445,0.00081767404,0.00089562376,0.00042986384,0.0002149031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000405145,0.00011333044,0.00088477955,0.000093297866,0.000039247014,0.0002718494,0.00033680524,0.5734037,0.058192473,0.12823808,0.0028273282,0.23519398],"study_design_scores_gemma":[0.00003280052,0.000050907634,0.0001397437,0.000009529314,0.000008841191,0.00008676924,0.0000162368,0.97404283,0.010689087,0.013075752,0.0018301676,0.000017257498],"about_ca_topic_score_codex":0.002156569,"about_ca_topic_score_gemma":0.0028718384,"teacher_disagreement_score":0.002156569,"about_ca_system_score_codex":0.0009002657,"about_ca_system_score_gemma":0.0006806964,"threshold_uncertainty_score":0.006531954},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47351938,0.001973997,0.5115174,0.00064826186,0.00006980133,0.000037695918,0.00017036924,0.0002671684,0.0117958635],"genre_scores_gemma":[0.9952872,0.00030986912,0.0038215502,0.000020806057,0.00002165546,0.000009882571,0.000021619553,0.000013819291,0.00049343915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991142,0.00034234262,0.000035789664,0.00007906025,0.00025064292,0.00017806192],"domain_scores_gemma":[0.99195576,0.0062367744,0.00074772123,0.00028433083,0.0006248151,0.0001505928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019891832,0.0005687125,0.00085422513,0.0005706507,0.00056716613,0.0010611305,0.00070198945,0.00062092574,0.0007366068],"category_scores_gemma":[0.007537999,0.000377567,0.00031441578,0.000786086,0.0011357507,0.00093490025,0.0008079377,0.000495187,0.00011891649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016063158,0.000025422225,0.0020510608,0.000072517105,0.000035293848,0.0005937191,0.0001598481,0.9626988,0.0038580801,0.022776112,0.00049483293,0.007073677],"study_design_scores_gemma":[0.0000032736784,0.000019890405,0.00031765853,0.000003898713,0.000008055049,0.00009349525,0.000033207016,0.9954295,0.000366947,0.0036106566,0.00010686784,0.0000065154936],"about_ca_topic_score_codex":0.003521258,"about_ca_topic_score_gemma":0.0020679582,"teacher_disagreement_score":0.003521258,"about_ca_system_score_codex":0.0017289888,"about_ca_system_score_gemma":0.0007520768,"threshold_uncertainty_score":0.012544692},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27810997,0.010211519,0.62134546,0.004265535,0.00031136404,0.00007934397,0.00042501435,0.00048794865,0.084763855],"genre_scores_gemma":[0.9802745,0.001765529,0.01580676,0.00026873493,0.00012149807,0.000104077735,0.00007671518,0.000080013764,0.0015021723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818283,0.00070904876,0.000040680898,0.00014890022,0.00052984955,0.00038857447],"domain_scores_gemma":[0.9826234,0.014761738,0.0006886549,0.00074134563,0.00083911786,0.0003456687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030805904,0.0010664648,0.0011191912,0.0014224064,0.00077279954,0.0019009627,0.0013435833,0.0011823869,0.0024122118],"category_scores_gemma":[0.014264639,0.00044097245,0.0004938156,0.001112388,0.0035799744,0.003420317,0.0024352933,0.0026311309,0.00044946666],"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.0003569495,0.00007288769,0.0005351246,0.00024134268,0.000044436238,0.00032346696,0.00045092878,0.29169318,0.0057499255,0.6827006,0.0026338072,0.015197375],"study_design_scores_gemma":[0.000023791079,0.00006972257,0.0002752366,0.00010683411,0.000013825827,0.00021695653,0.00012261774,0.6129529,0.0030399815,0.38146555,0.001675138,0.00003743383],"about_ca_topic_score_codex":0.00073250476,"about_ca_topic_score_gemma":0.0003341865,"teacher_disagreement_score":0.0030805904,"about_ca_system_score_codex":0.0020447683,"about_ca_system_score_gemma":0.00093649334,"threshold_uncertainty_score":0.016291916},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030116582,0.00014306584,0.9681042,0.000064800966,0.000009756853,0.000025148294,0.000025082572,0.00015289804,0.0013585651],"genre_scores_gemma":[0.73990685,0.00024841639,0.2574225,0.000053903277,0.000022280105,0.00013631789,0.00006341934,0.000026659336,0.0021195833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959344,0.00013191826,0.000017593326,0.00007851541,0.000113040405,0.000065390836],"domain_scores_gemma":[0.99936014,0.00043195637,0.000068409456,0.00004742093,0.000068506866,0.000023624547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005884871,0.0007478006,0.00062899437,0.0003089136,0.00027916304,0.0008047401,0.0006099694,0.0005198962,0.0007427563],"category_scores_gemma":[0.0017638332,0.00039186617,0.00035305115,0.00061765907,0.0005607992,0.00084511697,0.000810212,0.0005263958,0.0002441695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115105824,0.00006160995,0.00041762763,0.000049655817,0.00003672476,0.000077684876,0.000097079435,0.90642947,0.008007191,0.009848012,0.00049352087,0.07436628],"study_design_scores_gemma":[0.00001871706,0.000033587636,0.00010385885,0.0000030422264,0.0000064021197,0.000027696473,0.000017898532,0.99263257,0.0024814627,0.0044654957,0.00020155408,0.000007720663],"about_ca_topic_score_codex":0.0022248619,"about_ca_topic_score_gemma":0.004922195,"teacher_disagreement_score":0.0022248619,"about_ca_system_score_codex":0.00053944514,"about_ca_system_score_gemma":0.0010624835,"threshold_uncertainty_score":0.004423797},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20927481,0.004076541,0.7174347,0.0018487077,0.00018305052,0.00017085664,0.00070773554,0.0011558755,0.06514777],"genre_scores_gemma":[0.974875,0.0009853983,0.019580519,0.00016982008,0.00012616515,0.00006709775,0.00017873343,0.00007274341,0.0039444924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963421,0.0015714436,0.00010801789,0.00037752948,0.0009541527,0.00064682483],"domain_scores_gemma":[0.98791504,0.008774066,0.0007063437,0.0008526757,0.0015734581,0.0001782772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038466726,0.0023145545,0.0017642851,0.0014585855,0.00093915657,0.0029300372,0.0014305708,0.0018261577,0.005361419],"category_scores_gemma":[0.010537977,0.0007426554,0.0008262939,0.0019446181,0.0021717625,0.0021895128,0.0019508721,0.00088569266,0.0012598891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010374438,0.0000727981,0.0018722474,0.00030285804,0.00022165473,0.00045675068,0.00032870917,0.8232973,0.01507897,0.12548804,0.002206543,0.029636672],"study_design_scores_gemma":[0.00004043188,0.000283212,0.00066732016,0.00003395665,0.00011775875,0.0004386988,0.000088759014,0.96877915,0.003557899,0.024952184,0.0009893596,0.000051254585],"about_ca_topic_score_codex":0.0029607532,"about_ca_topic_score_gemma":0.0027291025,"teacher_disagreement_score":0.005361419,"about_ca_system_score_codex":0.0023547772,"about_ca_system_score_gemma":0.0015777707,"threshold_uncertainty_score":0.020343423},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055605825,0.0025203356,0.9221934,0.00043786925,0.00008166752,0.000052603547,0.0002536964,0.00025897607,0.018595561],"genre_scores_gemma":[0.95415705,0.0029573939,0.037354704,0.000117404605,0.00012080598,0.00013648193,0.00017032475,0.00009445779,0.0048913807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845636,0.0005882238,0.00006158189,0.00015167799,0.00051723205,0.00022494292],"domain_scores_gemma":[0.9932928,0.004837175,0.00050381344,0.00031651178,0.0009605092,0.00008918749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002327716,0.0017059287,0.0013277986,0.0009966011,0.0006478164,0.0019568037,0.0014949755,0.0010212595,0.0026709603],"category_scores_gemma":[0.0077121635,0.0005316589,0.0008555056,0.0012646996,0.0014063094,0.0018645747,0.0015029951,0.0013125226,0.0006986706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011274783,0.000027764785,0.0005551851,0.000228666,0.000057136138,0.0002923818,0.00013960579,0.91296864,0.005995979,0.06831884,0.00085077283,0.010452217],"study_design_scores_gemma":[0.000004852961,0.000031546566,0.0001390659,0.000017986009,0.000017992974,0.0001264513,0.000031678523,0.9865824,0.0013331244,0.011417932,0.00028161454,0.000015288013],"about_ca_topic_score_codex":0.0023588412,"about_ca_topic_score_gemma":0.0015344657,"teacher_disagreement_score":0.0026709603,"about_ca_system_score_codex":0.0016078094,"about_ca_system_score_gemma":0.0010765448,"threshold_uncertainty_score":0.0123102665},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003723964,0.00017064539,0.99443805,0.000068274596,0.00004009972,0.0000142159815,0.00001871136,0.00008627623,0.0014397054],"genre_scores_gemma":[0.3764786,0.0012113522,0.61495346,0.00016359577,0.00017389389,0.00016247382,0.00018732646,0.00019243122,0.0064767725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981874,0.00004867784,0.00000879886,0.000020411424,0.00008497124,0.000018361989],"domain_scores_gemma":[0.9993043,0.00036408397,0.00005410449,0.00008514868,0.00017023167,0.000022125465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046612878,0.00047054267,0.00042563313,0.00069243676,0.00024249859,0.0004538387,0.0006258842,0.0008011047,0.0025632947],"category_scores_gemma":[0.002218809,0.000165124,0.00059697765,0.00088868086,0.000487076,0.0010516003,0.0004005013,0.0008838178,0.000490642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010530467,0.000043379976,0.00076382584,0.0001829019,0.000041535823,0.00034504934,0.00019231638,0.5235081,0.020847002,0.16087402,0.0043023555,0.28879425],"study_design_scores_gemma":[0.000006777825,0.000023781822,0.000107034386,0.000007069445,0.00000454036,0.00021340579,0.000011642557,0.98614776,0.0015020838,0.009908234,0.0020537905,0.000013830402],"about_ca_topic_score_codex":0.0021941222,"about_ca_topic_score_gemma":0.0014556443,"teacher_disagreement_score":0.0025632947,"about_ca_system_score_codex":0.00050963915,"about_ca_system_score_gemma":0.0009922094,"threshold_uncertainty_score":0.008575082},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09457744,0.0014498617,0.8893876,0.000572663,0.00012645712,0.00009608146,0.000294255,0.00019816445,0.013297403],"genre_scores_gemma":[0.94632256,0.0013871014,0.048545398,0.00011229211,0.00011162382,0.00007185153,0.00009989314,0.000027264115,0.00332208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995221,0.00016170242,0.000018435787,0.00006706839,0.00010572661,0.00012495977],"domain_scores_gemma":[0.9983668,0.0010827435,0.00015869725,0.00013725931,0.00017318634,0.00008141517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009095183,0.0007714425,0.0005256279,0.00033044873,0.000582775,0.00074990833,0.0007186641,0.0006895879,0.0016304316],"category_scores_gemma":[0.0038720956,0.00028793968,0.000327663,0.0007362917,0.0010990436,0.0014082856,0.00083058304,0.00064591883,0.00020416304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020099113,0.000029997995,0.0008361647,0.00017268435,0.00002947586,0.00047303265,0.00010609311,0.7774763,0.00708973,0.19131331,0.0013560175,0.020916192],"study_design_scores_gemma":[0.000016781853,0.00006224705,0.00012886908,0.00000848517,0.000008904109,0.00016694386,0.000018797742,0.96588945,0.0014378607,0.031436276,0.000814454,0.0000108431595],"about_ca_topic_score_codex":0.0027930802,"about_ca_topic_score_gemma":0.0016528026,"teacher_disagreement_score":0.0027930802,"about_ca_system_score_codex":0.0011965043,"about_ca_system_score_gemma":0.0008636679,"threshold_uncertainty_score":0.008681297},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8002043,0.0012878493,0.18920855,0.0003714372,0.00018863901,0.00008759613,0.00005321878,0.00053958,0.00805884],"genre_scores_gemma":[0.9952205,0.000096943295,0.0042460766,0.000043696557,0.0000118308635,0.000016829004,0.000014904753,0.0000067153187,0.00034256862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984762,0.0006685731,0.000057302776,0.00011774643,0.00042424607,0.00025604633],"domain_scores_gemma":[0.9947273,0.0029736985,0.0006467614,0.00031633017,0.0011577634,0.00017813474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030580275,0.000832887,0.0005154563,0.00049908506,0.00059192046,0.00097186735,0.00059270795,0.0005613862,0.00071526924],"category_scores_gemma":[0.0041913493,0.00026652336,0.00025598324,0.0003397224,0.0009917539,0.0006808745,0.0007610702,0.0006117582,0.00011859036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012041407,0.00028831765,0.0083349785,0.00015847395,0.00025264674,0.00035255382,0.00019835957,0.89020056,0.05605957,0.012565121,0.0014920995,0.028893158],"study_design_scores_gemma":[0.000022763177,0.00044388862,0.00083446136,0.000006776418,0.000041981326,0.000087432534,0.00003236627,0.98619974,0.011422096,0.00071596383,0.00017621194,0.000016367769],"about_ca_topic_score_codex":0.0016319839,"about_ca_topic_score_gemma":0.0011964171,"teacher_disagreement_score":0.0030580275,"about_ca_system_score_codex":0.000898419,"about_ca_system_score_gemma":0.0008180229,"threshold_uncertainty_score":0.016172588},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073801456,0.00015530417,0.99086994,0.0000662103,0.00002194276,0.000034693614,0.000025596502,0.00005513348,0.001390995],"genre_scores_gemma":[0.5659156,0.0005959582,0.43007693,0.00008403232,0.00006134559,0.00044018432,0.00015043344,0.000034188535,0.0026414334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912435,0.00028999144,0.000037911195,0.0001220548,0.0003340287,0.000091727634],"domain_scores_gemma":[0.9986137,0.000578966,0.00022258345,0.00014989535,0.00036931774,0.000065532724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008746922,0.00078121043,0.00056358316,0.00043348313,0.00035332,0.000703451,0.0010775278,0.0009775567,0.00083898334],"category_scores_gemma":[0.0025125628,0.0003714635,0.0003615423,0.000530275,0.00075030647,0.0006410604,0.0009649943,0.0006948175,0.00039914783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010848546,0.000046958365,0.0003846932,0.00010052649,0.000042197833,0.00015078213,0.00014244445,0.837844,0.020835212,0.061194524,0.0013119063,0.0778383],"study_design_scores_gemma":[0.00002604134,0.000076702054,0.00006831083,0.0000089914365,0.0000072079747,0.00006840491,0.000012145868,0.9883007,0.0026913579,0.007356272,0.0013717889,0.000012098308],"about_ca_topic_score_codex":0.0015795196,"about_ca_topic_score_gemma":0.0025684605,"teacher_disagreement_score":0.0015795196,"about_ca_system_score_codex":0.00077583926,"about_ca_system_score_gemma":0.0015425605,"threshold_uncertainty_score":0.005629182},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040186375,0.0004981069,0.949783,0.00021651444,0.000039174844,0.00010977661,0.000054464406,0.00006128009,0.00905136],"genre_scores_gemma":[0.8351597,0.0009805206,0.15885144,0.0000858998,0.000051660965,0.0003097381,0.000039627066,0.000026431526,0.004494992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990119,0.00052473065,0.00005422713,0.00015320639,0.00013573412,0.0001202665],"domain_scores_gemma":[0.99889165,0.00069521705,0.00017090703,0.00005945775,0.0001350168,0.000047764803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001091738,0.0015339982,0.0012557781,0.0005406041,0.0005609323,0.00102914,0.0012956582,0.0010356461,0.002238692],"category_scores_gemma":[0.002883205,0.00054850697,0.00051329285,0.0009975857,0.0010692832,0.0014688225,0.0011668041,0.0006361364,0.00040798285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017809939,0.00012136281,0.00059024245,0.00019600222,0.00007727735,0.00037547736,0.00013124051,0.85618556,0.0065545826,0.09118185,0.0010762465,0.043332104],"study_design_scores_gemma":[0.00004728071,0.00014101098,0.000096584365,0.000017283113,0.000039686445,0.00014404937,0.000058995924,0.9660696,0.0014588889,0.031068603,0.00083429395,0.00002378569],"about_ca_topic_score_codex":0.0012019571,"about_ca_topic_score_gemma":0.0016002632,"teacher_disagreement_score":0.002238692,"about_ca_system_score_codex":0.00088961876,"about_ca_system_score_gemma":0.00080064265,"threshold_uncertainty_score":0.007489145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47772467,0.0024144342,0.50561714,0.00044150086,0.00005227188,0.00007303341,0.00015683234,0.00036910982,0.013150967],"genre_scores_gemma":[0.9925351,0.00035579278,0.0061782016,0.000022886483,0.000021720332,0.000031674834,0.000027903825,0.000016614564,0.0008100375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989066,0.00046679418,0.000023384233,0.000106429216,0.00030694102,0.00018984154],"domain_scores_gemma":[0.994463,0.0043169325,0.00044988596,0.00021121313,0.0005012412,0.000057737172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001598732,0.00074024,0.00052989676,0.0010696643,0.00040964436,0.0007797401,0.00069750944,0.00041040266,0.000693128],"category_scores_gemma":[0.006106015,0.00022982204,0.0003228493,0.0009316222,0.0010502912,0.0010497785,0.00057596556,0.0003520157,0.00015429039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009844854,0.00003455908,0.00094432174,0.00004803974,0.000029548337,0.00014206067,0.00009323027,0.97471935,0.005727205,0.0111449845,0.00032016827,0.006698093],"study_design_scores_gemma":[0.0000030609383,0.000039698447,0.00033362993,0.0000039885786,0.000011274709,0.000035604095,0.000029389364,0.9952181,0.0018022546,0.0023665363,0.00015098564,0.0000055539613],"about_ca_topic_score_codex":0.0033088461,"about_ca_topic_score_gemma":0.0015877587,"teacher_disagreement_score":0.0033088461,"about_ca_system_score_codex":0.0021799495,"about_ca_system_score_gemma":0.00057081576,"threshold_uncertainty_score":0.015816748},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057337526,0.00068038015,0.9271505,0.0009311941,0.00007578331,0.00012325787,0.00013731356,0.00023391594,0.013330144],"genre_scores_gemma":[0.8496623,0.0019614515,0.14234956,0.00024458708,0.00016669356,0.0003029077,0.00025289028,0.00015291979,0.0049067163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994623,0.00025052397,0.00001716485,0.0000653971,0.00015821744,0.000046358717],"domain_scores_gemma":[0.995596,0.003155427,0.00034111142,0.0004230691,0.00034623902,0.0001382348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008876269,0.00030497013,0.00038485316,0.0010032888,0.0007160651,0.0010110817,0.0006421807,0.0006473628,0.0021141598],"category_scores_gemma":[0.00827062,0.0002494755,0.00041779224,0.0007725592,0.001057956,0.0019312219,0.00090513896,0.0011273146,0.00024870888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008818408,0.000035345645,0.0008952296,0.00015212278,0.000017281198,0.00024679795,0.0002941225,0.42906752,0.00820588,0.52451146,0.0027889656,0.03369703],"study_design_scores_gemma":[0.00000889725,0.000028222788,0.00030102726,0.000018024142,0.000008796824,0.00019047684,0.000053512158,0.890533,0.0012855013,0.10460123,0.0029595061,0.000011843902],"about_ca_topic_score_codex":0.0019289007,"about_ca_topic_score_gemma":0.0016991113,"teacher_disagreement_score":0.0021141598,"about_ca_system_score_codex":0.0009923602,"about_ca_system_score_gemma":0.0005951483,"threshold_uncertainty_score":0.007200122},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10061361,0.0009906408,0.8870835,0.0003332864,0.000043983466,0.00004631212,0.000052115625,0.00009232541,0.01074416],"genre_scores_gemma":[0.9690926,0.0010393875,0.02659381,0.00006506098,0.000043209133,0.00008581672,0.000030122319,0.000014484085,0.003035475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935156,0.00027972413,0.000015088725,0.00007053074,0.00016791429,0.00011514975],"domain_scores_gemma":[0.9989202,0.00067712564,0.0001529741,0.00006036217,0.00015490044,0.00003435045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010724942,0.00042865257,0.00037275476,0.00032226657,0.00040953135,0.00069385365,0.000630199,0.00057349936,0.00080120243],"category_scores_gemma":[0.00283835,0.0002415686,0.0003127148,0.00063230953,0.0007469075,0.0009086676,0.000845564,0.0004031184,0.00021763447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015019959,0.000061296145,0.0018814777,0.00017085901,0.000048660742,0.00069754664,0.0006521909,0.74585295,0.010011529,0.21291383,0.0010034618,0.026556116],"study_design_scores_gemma":[0.000018983963,0.00006302212,0.00020676575,0.000013144278,0.000020870595,0.0001417592,0.00009537069,0.96190244,0.0012129539,0.034899697,0.0014119328,0.0000130336075],"about_ca_topic_score_codex":0.0028123695,"about_ca_topic_score_gemma":0.0021016023,"teacher_disagreement_score":0.0028123695,"about_ca_system_score_codex":0.00077537034,"about_ca_system_score_gemma":0.0006065201,"threshold_uncertainty_score":0.005671978},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03369329,0.0018006362,0.9583783,0.00040613368,0.000047377962,0.000058876627,0.00011980664,0.00026136576,0.0052341544],"genre_scores_gemma":[0.86455536,0.0029944794,0.123964034,0.00031581,0.0001276053,0.00038968722,0.00033782673,0.00021661537,0.007098533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794143,0.0007445724,0.00006970208,0.00021998919,0.0007712654,0.00025302498],"domain_scores_gemma":[0.9852347,0.0116864,0.0008410887,0.000456738,0.0016769451,0.00010427439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005274127,0.001606066,0.00149554,0.0011128624,0.00053621887,0.0021234339,0.0014062645,0.0017810573,0.0030736716],"category_scores_gemma":[0.023303669,0.0005588319,0.0004992242,0.0012398455,0.0022311383,0.002836306,0.0015514644,0.001224501,0.0006977172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004109705,0.000025334979,0.00032959846,0.000116352785,0.000023450899,0.00009543739,0.00015484563,0.9569561,0.0010789414,0.033296213,0.00041762058,0.0074649905],"study_design_scores_gemma":[0.0000088073375,0.000023439512,0.00013637306,0.000030252295,0.000008919394,0.000065282235,0.000038664726,0.98464173,0.00049769174,0.014278717,0.00025766468,0.0000124605685],"about_ca_topic_score_codex":0.0032026751,"about_ca_topic_score_gemma":0.0022982245,"teacher_disagreement_score":0.005274127,"about_ca_system_score_codex":0.0025264877,"about_ca_system_score_gemma":0.0015448013,"threshold_uncertainty_score":0.02789259},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05965567,0.013165638,0.7615104,0.0048140204,0.0009728659,0.00028906853,0.0024397776,0.0035457094,0.15360697],"genre_scores_gemma":[0.5655164,0.01156108,0.36567068,0.0016934809,0.0017426814,0.00062979304,0.0029862807,0.0021327275,0.04806688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949479,0.00067263993,0.00018027742,0.0009329014,0.0017638258,0.0015023843],"domain_scores_gemma":[0.98115575,0.0111770425,0.0009072484,0.0030991577,0.0026976261,0.00096307934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004146937,0.002205177,0.0020738374,0.0027919195,0.0029454217,0.003379033,0.005874699,0.00195718,0.022865452],"category_scores_gemma":[0.02351966,0.0010463494,0.0015496063,0.0034272303,0.0026179736,0.012148738,0.0049058176,0.005103502,0.0053300564],"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.00083558774,0.0003596287,0.0023981582,0.000994842,0.00008453145,0.0002826839,0.0010385441,0.10577215,0.012371354,0.6739661,0.050004683,0.15189178],"study_design_scores_gemma":[0.00007866179,0.00021938258,0.0012900452,0.00031294915,0.0001581192,0.0006299612,0.00040313552,0.29604614,0.010226459,0.6405958,0.04991318,0.00012616153],"about_ca_topic_score_codex":0.0077424073,"about_ca_topic_score_gemma":0.010299489,"teacher_disagreement_score":0.022865452,"about_ca_system_score_codex":0.0056183496,"about_ca_system_score_gemma":0.0031725878,"threshold_uncertainty_score":0.07649255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26135254,0.0029297436,0.72104734,0.00021023139,0.00005963547,0.0000352188,0.00011368313,0.0006140078,0.013637573],"genre_scores_gemma":[0.98892283,0.0010712518,0.008931071,0.00002386449,0.000025234232,0.000018685118,0.000029165165,0.000025942705,0.0009519346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956006,0.00012402516,0.00002390302,0.000060811148,0.00015327016,0.00007791837],"domain_scores_gemma":[0.9981609,0.0011107451,0.00023515428,0.00015933138,0.00029173912,0.000042121854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008910699,0.00084240426,0.0007697806,0.00074954215,0.0003956689,0.0010848494,0.00061586767,0.00047608028,0.0008171732],"category_scores_gemma":[0.004142099,0.00036806767,0.00035929913,0.00075714214,0.0008572494,0.0014429498,0.0007770038,0.0004945299,0.00032682816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017279088,0.000040906194,0.0018977188,0.00017155285,0.00004832488,0.0007762265,0.0003105217,0.899344,0.016339578,0.04957506,0.000803175,0.030520143],"study_design_scores_gemma":[0.0000037877535,0.000052355983,0.00055175123,0.000014940392,0.000023954686,0.0002865859,0.00004486495,0.9889819,0.0021864723,0.007358416,0.0004747601,0.000020164385],"about_ca_topic_score_codex":0.0015612429,"about_ca_topic_score_gemma":0.0012361676,"teacher_disagreement_score":0.0015612429,"about_ca_system_score_codex":0.00091215386,"about_ca_system_score_gemma":0.0004918721,"threshold_uncertainty_score":0.0066182017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116761535,0.00078289607,0.872184,0.00042292857,0.00006188284,0.00005715177,0.00014000683,0.000120664896,0.009468934],"genre_scores_gemma":[0.972843,0.0007986083,0.023545392,0.00009420433,0.00007113873,0.000077355326,0.000063650354,0.000019174213,0.0024874392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989285,0.00036028202,0.000033859487,0.00015657871,0.0003080298,0.00021269922],"domain_scores_gemma":[0.99343216,0.004836393,0.00084903766,0.0002810964,0.00050626125,0.00009501595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013224946,0.0011236849,0.00069215335,0.0005587198,0.0005713701,0.0009786101,0.0010073071,0.0012510486,0.0012698948],"category_scores_gemma":[0.0069838497,0.00041608754,0.0004729872,0.0008587807,0.0018112365,0.0016859255,0.0012527657,0.0011453601,0.0002524723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016414435,0.000061605104,0.00090243673,0.00020704839,0.00007418313,0.00057719304,0.0003425623,0.76100105,0.0074262377,0.22111495,0.00058803294,0.0075405873],"study_design_scores_gemma":[0.000015053445,0.00005825032,0.00021277435,0.000012396331,0.000025864822,0.000121509256,0.000050379684,0.9703386,0.0017533365,0.026972933,0.00042190216,0.000016952925],"about_ca_topic_score_codex":0.0024303682,"about_ca_topic_score_gemma":0.0015345387,"teacher_disagreement_score":0.0024303682,"about_ca_system_score_codex":0.0010584787,"about_ca_system_score_gemma":0.00079341826,"threshold_uncertainty_score":0.00767982},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14750126,0.0004888923,0.8420652,0.0007694239,0.00008883155,0.00011323899,0.00027084845,0.00024548985,0.0084568625],"genre_scores_gemma":[0.9371981,0.0005587894,0.05809347,0.00010383267,0.00011503461,0.00012173134,0.00014067262,0.000031212607,0.003637097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733067,0.0009305904,0.00012978322,0.0005340089,0.0005377268,0.0005371471],"domain_scores_gemma":[0.9880701,0.00848828,0.0011104688,0.0014227318,0.0006161025,0.00029227367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003193837,0.0006942476,0.0011141973,0.00054015394,0.0010547729,0.0016542822,0.0012961574,0.0011510196,0.0024582013],"category_scores_gemma":[0.008973501,0.0002939297,0.00053220114,0.00097556744,0.0021533698,0.0049954564,0.002135529,0.001516519,0.0004228171],"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.0005548082,0.00008962035,0.0006453084,0.00025309954,0.000039013918,0.00033419224,0.00030581997,0.43664733,0.007881584,0.53120244,0.0013936588,0.020653099],"study_design_scores_gemma":[0.00003640886,0.00007816326,0.00011229564,0.000020137451,0.0000123000145,0.00009828424,0.00008970098,0.81763,0.0068236943,0.17399955,0.0010676257,0.000031942596],"about_ca_topic_score_codex":0.0016960882,"about_ca_topic_score_gemma":0.0012682569,"teacher_disagreement_score":0.003193837,"about_ca_system_score_codex":0.0011933214,"about_ca_system_score_gemma":0.0012193234,"threshold_uncertainty_score":0.016890824},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007940145,0.00016501694,0.99091,0.000053996842,0.000019463847,0.000025029667,0.000015016246,0.00006697711,0.00080441934],"genre_scores_gemma":[0.5381205,0.00056970696,0.45794865,0.00010625338,0.000105991356,0.00016840955,0.00008902397,0.000027683322,0.0028637992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937576,0.00020410624,0.0000446971,0.000107622815,0.00021389987,0.000053993153],"domain_scores_gemma":[0.9992285,0.00028626036,0.00011154034,0.00011924257,0.00023282946,0.000021681995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009876578,0.0007818171,0.00072796404,0.00029501365,0.00029330348,0.0007119658,0.0006834835,0.00075319526,0.0012121369],"category_scores_gemma":[0.001911651,0.00033330327,0.00045160908,0.0003477495,0.00043982387,0.0009644961,0.0007087769,0.00060841854,0.00056871003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021523725,0.00012534604,0.0012311233,0.00044749273,0.00020670818,0.0004106389,0.0003533818,0.6377426,0.107790254,0.050607618,0.0019913283,0.19887832],"study_design_scores_gemma":[0.000040948158,0.00029322787,0.00025732836,0.000022929915,0.000055996832,0.00041255253,0.000044424054,0.97123295,0.019238137,0.005082535,0.0032884814,0.000030421383],"about_ca_topic_score_codex":0.00032262778,"about_ca_topic_score_gemma":0.00061856036,"teacher_disagreement_score":0.0012121369,"about_ca_system_score_codex":0.00024438492,"about_ca_system_score_gemma":0.0006125666,"threshold_uncertainty_score":0.005223334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10502401,0.0002798799,0.8902183,0.0002554896,0.00002369354,0.000029233881,0.000029153505,0.00012524694,0.0040148855],"genre_scores_gemma":[0.9291283,0.00018561885,0.068691,0.00006358015,0.000013965027,0.00005812965,0.00002746005,0.000022234517,0.001809739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967813,0.00011926471,0.0000065219333,0.000053243697,0.00007007935,0.000072733594],"domain_scores_gemma":[0.9994821,0.00033141422,0.00006924859,0.000024580499,0.0000614688,0.00003127536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076487305,0.00078603544,0.00069153885,0.00046515785,0.00039837105,0.00063753297,0.0006313779,0.0007876892,0.00055960345],"category_scores_gemma":[0.0012954781,0.00032153862,0.00036462463,0.00080710626,0.0009046204,0.0006722295,0.0008168171,0.00045526706,0.00009692759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021980157,0.000015501977,0.0001286327,0.000010164728,0.000009471533,0.00001684453,0.000017924154,0.98785406,0.0010679786,0.0047135064,0.00012559243,0.006018312],"study_design_scores_gemma":[0.0000060931516,0.000015258446,0.000052873966,8.827505e-7,0.0000026009077,0.0000044518288,0.0000069568587,0.9963917,0.00032926467,0.0031232138,0.00006399611,0.0000027018712],"about_ca_topic_score_codex":0.004521788,"about_ca_topic_score_gemma":0.005165589,"teacher_disagreement_score":0.004521788,"about_ca_system_score_codex":0.0010478831,"about_ca_system_score_gemma":0.0010681389,"threshold_uncertainty_score":0.008990943},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.711847,0.001296986,0.27838808,0.0002809741,0.000042315573,0.000033488424,0.00006173954,0.00016232792,0.00788699],"genre_scores_gemma":[0.99496436,0.00020413529,0.004253571,0.0000138282,0.000012568574,0.000008139838,0.000010261135,0.000004507115,0.00052859157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927515,0.0002695116,0.000027165168,0.000081555954,0.00020113117,0.00014553293],"domain_scores_gemma":[0.9968266,0.0021788757,0.00042333032,0.00011090609,0.00038313156,0.00007721132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010264595,0.00068898645,0.00082191627,0.00059927674,0.00052750076,0.0008932941,0.0005318545,0.0010335319,0.00042621742],"category_scores_gemma":[0.0035021119,0.00045387592,0.0003142267,0.0006252257,0.0009434444,0.0009089975,0.00071079057,0.00047615284,0.00015273542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051911356,0.0000629507,0.0016891712,0.000118518605,0.0000649234,0.0007879513,0.00021333084,0.9502519,0.020263465,0.011841326,0.00028422542,0.013903193],"study_design_scores_gemma":[0.000010413544,0.00011164801,0.00040543193,0.000005902204,0.000024079576,0.00011376769,0.000030936604,0.99525946,0.0019331445,0.0019933984,0.000097288765,0.000014564584],"about_ca_topic_score_codex":0.0016004134,"about_ca_topic_score_gemma":0.0015111408,"teacher_disagreement_score":0.0016004134,"about_ca_system_score_codex":0.0007522875,"about_ca_system_score_gemma":0.00046386538,"threshold_uncertainty_score":0.0054582357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015532062,0.0003488925,0.9748635,0.00026640925,0.000053726177,0.00016657035,0.000034669247,0.00009866219,0.008635489],"genre_scores_gemma":[0.7361604,0.00058179226,0.25562027,0.00014668428,0.000071529255,0.00039384415,0.000055201304,0.000060590355,0.0069097346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807334,0.0010251418,0.000069605274,0.00013942958,0.00048471257,0.0002077027],"domain_scores_gemma":[0.998743,0.00071335083,0.0001159183,0.000110697816,0.00020083322,0.00011616929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036250646,0.00093023665,0.0012219073,0.0008874387,0.0011191858,0.0022414438,0.0022022233,0.0015735053,0.0026529827],"category_scores_gemma":[0.0050480147,0.00048674233,0.0008204815,0.0010768232,0.0021092421,0.0023323037,0.0014336482,0.0011678615,0.00046747125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022078468,0.00014830615,0.0002984258,0.0001803247,0.00007458184,0.00024701538,0.0002652155,0.5435501,0.004422232,0.4054664,0.0028788366,0.04224791],"study_design_scores_gemma":[0.00006637755,0.00008542959,0.00006773012,0.000019610166,0.000014986735,0.00009340475,0.00003212675,0.91701114,0.0004918989,0.08031731,0.0017716817,0.000028328004],"about_ca_topic_score_codex":0.0024084074,"about_ca_topic_score_gemma":0.0021081674,"teacher_disagreement_score":0.0036250646,"about_ca_system_score_codex":0.0021734145,"about_ca_system_score_gemma":0.0030446374,"threshold_uncertainty_score":0.019171417},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047423183,0.0005810385,0.9898066,0.000654517,0.000065348875,0.00006834554,0.000030321035,0.00007140678,0.0039801006],"genre_scores_gemma":[0.69251895,0.004284295,0.2901707,0.00049497845,0.0004924528,0.00047353105,0.00015998883,0.00007773726,0.01132735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874324,0.0004897427,0.00004469919,0.00013561276,0.0005175166,0.00006925702],"domain_scores_gemma":[0.9985221,0.0008200746,0.00012669316,0.00023386326,0.00026135228,0.00003594929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009969254,0.00044831986,0.0005388234,0.0008924246,0.000578688,0.0011087192,0.0017012503,0.0013406428,0.0009539538],"category_scores_gemma":[0.0043466846,0.0003265469,0.00044803298,0.0011071519,0.0015063077,0.0021204392,0.0010434804,0.0011425028,0.00029111627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050957555,0.000030270463,0.00029453172,0.00024732566,0.000033858985,0.00020530217,0.00032474558,0.2990129,0.008993051,0.64395887,0.0030098513,0.04383841],"study_design_scores_gemma":[0.00002767284,0.00011903864,0.00017098674,0.000041373387,0.000038166345,0.00036434023,0.00010549358,0.81027967,0.0059046317,0.17007461,0.012843878,0.000030181182],"about_ca_topic_score_codex":0.0015533239,"about_ca_topic_score_gemma":0.0011188058,"teacher_disagreement_score":0.0017012503,"about_ca_system_score_codex":0.0012363096,"about_ca_system_score_gemma":0.00094450207,"threshold_uncertainty_score":0.008970082},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19158289,0.0009103953,0.80097383,0.0002701011,0.00004676549,0.000059134658,0.00013020988,0.00036216495,0.005664375],"genre_scores_gemma":[0.97342354,0.0003832492,0.024882557,0.000033930333,0.00001556595,0.00005365812,0.000042169035,0.0000112651305,0.0011540544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993604,0.00023330233,0.000030447185,0.00005705489,0.0001882552,0.00013051553],"domain_scores_gemma":[0.9982974,0.0009945793,0.00023387888,0.00018920265,0.00020722517,0.0000777795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009396905,0.0005914386,0.00068730104,0.00070095056,0.0003944265,0.00088400766,0.00062684325,0.0005936159,0.0008000527],"category_scores_gemma":[0.002906648,0.0002637996,0.00033139487,0.0010704017,0.0006933358,0.0012171326,0.0012599623,0.00048242602,0.00013917095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000872648,0.000017588956,0.00032599567,0.00004515114,0.000015237092,0.00010438255,0.00006856538,0.9568403,0.0027924937,0.021150582,0.00022689966,0.018325571],"study_design_scores_gemma":[0.000004640437,0.000022787595,0.00007482097,0.000004985651,0.000004564157,0.00001628657,0.00001120976,0.9928926,0.00057944824,0.006203723,0.0001791228,0.000005789339],"about_ca_topic_score_codex":0.0046604155,"about_ca_topic_score_gemma":0.003827775,"teacher_disagreement_score":0.0046604155,"about_ca_system_score_codex":0.0011424897,"about_ca_system_score_gemma":0.0007123689,"threshold_uncertainty_score":0.009266615},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014077411,0.00030284977,0.97960234,0.00038811303,0.000059835522,0.00008413797,0.00014365121,0.00025726066,0.005084494],"genre_scores_gemma":[0.71455544,0.0010667307,0.27001497,0.0004952722,0.00022624346,0.0006617812,0.00043850866,0.00022352874,0.012317519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99676657,0.0010406611,0.00014753902,0.000372652,0.0011532699,0.0005192541],"domain_scores_gemma":[0.9863697,0.007204318,0.0017258229,0.0026063262,0.001674582,0.00041921603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022684992,0.0009916697,0.00094902853,0.0009384074,0.0007614212,0.0018717028,0.0018566162,0.0013772623,0.003296241],"category_scores_gemma":[0.013004073,0.0005519934,0.0006919242,0.0010621101,0.002340344,0.0030615926,0.002858326,0.0029140234,0.00094884174],"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.00013049282,0.000036917852,0.00026453377,0.000079301346,0.000022756405,0.00011321507,0.00017019827,0.23403554,0.0035029037,0.7391114,0.0020035382,0.020529196],"study_design_scores_gemma":[0.000037801023,0.000077565026,0.000079785335,0.000045695815,0.000012917411,0.000092210415,0.000030045398,0.7485661,0.0025718021,0.24455012,0.0039025252,0.00003346348],"about_ca_topic_score_codex":0.0013831911,"about_ca_topic_score_gemma":0.0013770013,"teacher_disagreement_score":0.003296241,"about_ca_system_score_codex":0.0020371142,"about_ca_system_score_gemma":0.002333941,"threshold_uncertainty_score":0.014780343},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034439027,0.00010795843,0.9618503,0.00026997627,0.000017387172,0.00004882337,0.000019219946,0.00006802117,0.0031793043],"genre_scores_gemma":[0.94012517,0.00009445465,0.057219412,0.00008992389,0.000021900261,0.00013181801,0.000030262794,0.000020557718,0.0022665379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987092,0.00066730654,0.000037728983,0.00018612966,0.00022350858,0.00017614053],"domain_scores_gemma":[0.9973291,0.0019095711,0.00023174177,0.00013523904,0.0002248345,0.00016952005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018957133,0.00069648813,0.0011119113,0.0005002856,0.00051417795,0.0010987603,0.0015892363,0.0010779661,0.0013740127],"category_scores_gemma":[0.005355617,0.00032930964,0.00049490435,0.0005980759,0.0020585966,0.0015395845,0.0016060155,0.0011334124,0.00016501886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006735904,0.000045820063,0.0002710115,0.00003085139,0.000025682439,0.000052054158,0.00005572726,0.9423572,0.00093393354,0.04371702,0.00036823866,0.012075273],"study_design_scores_gemma":[0.0000137453335,0.000020109217,0.000034375083,0.0000029580501,0.0000028684765,0.000009629047,0.000007590402,0.98131853,0.00016906204,0.018285932,0.0001313679,0.0000038448384],"about_ca_topic_score_codex":0.0027213984,"about_ca_topic_score_gemma":0.0015402107,"teacher_disagreement_score":0.0027213984,"about_ca_system_score_codex":0.0014493915,"about_ca_system_score_gemma":0.0012127409,"threshold_uncertainty_score":0.010516107},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15325886,0.001314251,0.84068406,0.00019053092,0.00005397691,0.000052446547,0.00013139984,0.0002174612,0.004096998],"genre_scores_gemma":[0.97629386,0.00066763675,0.021589914,0.0000383408,0.000014334905,0.000030370184,0.000049991715,0.000016366215,0.0012990332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994671,0.00016783267,0.00002955461,0.00009744743,0.00014671554,0.00009145778],"domain_scores_gemma":[0.9964489,0.002566401,0.0004261238,0.00018902475,0.0003223445,0.000047216457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012986795,0.0010992194,0.0007124722,0.0003728395,0.0002807715,0.00097220665,0.0010807259,0.0006433642,0.00073439896],"category_scores_gemma":[0.0051207794,0.00031143395,0.00023349066,0.0005184729,0.0009306817,0.0015134556,0.0005372413,0.00054807216,0.00016511315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030098617,0.000036552123,0.0007216734,0.0001611759,0.000040420367,0.0004227642,0.00015243929,0.92830914,0.018986518,0.035002116,0.0003213236,0.015544923],"study_design_scores_gemma":[0.000019741326,0.00015062826,0.0002396348,0.000016051974,0.000028804054,0.00016298515,0.000030880732,0.9823842,0.008773659,0.007683261,0.00048707306,0.000023005454],"about_ca_topic_score_codex":0.0018341796,"about_ca_topic_score_gemma":0.002137892,"teacher_disagreement_score":0.0018341796,"about_ca_system_score_codex":0.0008478016,"about_ca_system_score_gemma":0.0008172971,"threshold_uncertainty_score":0.0068681836},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010939803,0.00045121412,0.98289883,0.00009330459,0.000024789788,0.000024389868,0.0000621622,0.00019545894,0.005309959],"genre_scores_gemma":[0.69734925,0.0020841218,0.29009342,0.0001840799,0.00010869262,0.00025675385,0.00022904658,0.00028987616,0.009404863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950135,0.00012571849,0.000023568811,0.000043893768,0.0002453803,0.00006013991],"domain_scores_gemma":[0.99836713,0.0009911022,0.000115411254,0.00014175399,0.00035573402,0.000028903049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010574799,0.00085701665,0.0007693853,0.0007697355,0.00031193317,0.0009585356,0.0009438067,0.0011530069,0.0024080158],"category_scores_gemma":[0.0057097175,0.0004322613,0.0005607522,0.0006782732,0.00079194084,0.0017277284,0.00075087085,0.0010533736,0.0008111039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030594852,0.000020847268,0.0002487682,0.0001326188,0.000017229937,0.00014453937,0.00013622432,0.8965895,0.0042255605,0.07177698,0.00075381034,0.025923401],"study_design_scores_gemma":[0.0000038460003,0.000010059598,0.00006825545,0.000015104213,0.0000030689553,0.000057308327,0.00001608441,0.984728,0.0008198489,0.013752865,0.00051870133,0.000006950101],"about_ca_topic_score_codex":0.0015333521,"about_ca_topic_score_gemma":0.0014143485,"teacher_disagreement_score":0.0024080158,"about_ca_system_score_codex":0.0012059577,"about_ca_system_score_gemma":0.0010337968,"threshold_uncertainty_score":0.008749843},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58186656,0.0018621156,0.40367407,0.00022785121,0.000053232867,0.000059815837,0.00011168655,0.0006683958,0.011476326],"genre_scores_gemma":[0.98949265,0.0002022671,0.009894288,0.000014244159,0.000013009008,0.000012173953,0.000028020568,0.000017915505,0.0003254399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805695,0.0008098949,0.00007340479,0.000115598756,0.000676761,0.00026735733],"domain_scores_gemma":[0.99376786,0.0038793073,0.0007666841,0.0005126606,0.0009921612,0.00008131342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003427976,0.0008121929,0.0011675439,0.0006783854,0.0003887146,0.001006425,0.0006868957,0.00061796285,0.000672848],"category_scores_gemma":[0.007361608,0.00020892452,0.0004413804,0.00072844845,0.0009392318,0.0009943751,0.00074803474,0.00042510685,0.00017831534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030468023,0.000052725543,0.0016164572,0.000121413104,0.00007426352,0.00033694904,0.00011630087,0.95901084,0.013298213,0.006793125,0.00040891804,0.017866071],"study_design_scores_gemma":[0.000011501395,0.00015708998,0.00063458557,0.0000132344285,0.000058815163,0.000167223,0.000031517204,0.98895687,0.008705815,0.0009865575,0.00025700557,0.000019759298],"about_ca_topic_score_codex":0.0030183354,"about_ca_topic_score_gemma":0.0015646889,"teacher_disagreement_score":0.003427976,"about_ca_system_score_codex":0.0009242504,"about_ca_system_score_gemma":0.0006876499,"threshold_uncertainty_score":0.01812911},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037777454,0.0005043819,0.99252665,0.00013814286,0.000114279304,0.000060419596,0.000055759854,0.00036380527,0.0024588094],"genre_scores_gemma":[0.35693875,0.0017944704,0.62730616,0.0006940516,0.00039107256,0.00027321844,0.00043650484,0.00006094345,0.012104796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991271,0.00020534154,0.000037621936,0.00018780639,0.00037215574,0.00006999165],"domain_scores_gemma":[0.99960667,0.00012195429,0.000044581186,0.000078712124,0.00012737175,0.00002075944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081070943,0.00093113905,0.0007792818,0.00041029256,0.00045090687,0.0009496138,0.0011130584,0.0013581314,0.0031150708],"category_scores_gemma":[0.001280859,0.00041773668,0.0005346898,0.0005119648,0.00047004997,0.0011289503,0.0010642766,0.0012794232,0.0021964745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003865127,0.0001773299,0.0015452341,0.0007695745,0.00015377287,0.00066050503,0.00025968914,0.113416456,0.24317183,0.20540789,0.009912381,0.42413884],"study_design_scores_gemma":[0.00010772425,0.0009011173,0.00044215214,0.000097287164,0.0001044663,0.0018830441,0.000049370487,0.8545896,0.0621874,0.023456497,0.05609569,0.00008564284],"about_ca_topic_score_codex":0.0002699868,"about_ca_topic_score_gemma":0.0004970675,"teacher_disagreement_score":0.0031150708,"about_ca_system_score_codex":0.000683208,"about_ca_system_score_gemma":0.0013290396,"threshold_uncertainty_score":0.010420918},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03584279,0.31820527,0.43500787,0.1471675,0.008424436,0.00008043034,0.00035458265,0.0010673901,0.05384981],"genre_scores_gemma":[0.69404984,0.1982311,0.07161989,0.008762035,0.006590354,0.00017783859,0.00023660998,0.00019461522,0.020137712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992335,0.00037763896,0.00002729796,0.00009232183,0.00016556804,0.00010374896],"domain_scores_gemma":[0.9956067,0.003105573,0.00028698458,0.0004938827,0.0003532173,0.00015365939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026621835,0.0013738275,0.00096831773,0.00053972006,0.0007065164,0.003349107,0.002382123,0.0027362069,0.0046424055],"category_scores_gemma":[0.010599772,0.0006030265,0.0005357075,0.0007315365,0.002750456,0.020982532,0.001814214,0.002467132,0.0016587503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043556636,0.00007124856,0.0008902492,0.0011061108,0.00010450153,0.00026679906,0.00037999035,0.031953003,0.002758446,0.70461166,0.020095313,0.23732717],"study_design_scores_gemma":[0.00009206187,0.00025792368,0.00034433272,0.0006787126,0.00012325456,0.00042224614,0.00048062226,0.037120882,0.0041850754,0.85103875,0.10515594,0.00010022503],"about_ca_topic_score_codex":0.00156853,"about_ca_topic_score_gemma":0.0011056835,"teacher_disagreement_score":0.0046424055,"about_ca_system_score_codex":0.0011734309,"about_ca_system_score_gemma":0.0008260923,"threshold_uncertainty_score":0.015530348},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060363003,0.00005204016,0.9981831,0.000052846215,0.000018579714,0.000025744703,0.000022472128,0.0000857364,0.0009558291],"genre_scores_gemma":[0.094584465,0.00046862577,0.8986339,0.00018042665,0.00012433273,0.0004958774,0.0002313388,0.00012806311,0.0051529296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998934,0.0004427636,0.00004492622,0.00015913334,0.00035822662,0.00006102547],"domain_scores_gemma":[0.99814117,0.0010979143,0.00013736368,0.000108832864,0.00046950986,0.000045287885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018630703,0.0012578424,0.0010796639,0.00040188004,0.00038535192,0.0017467005,0.0009270925,0.0016494957,0.0081825135],"category_scores_gemma":[0.0047335625,0.00055378163,0.0005330355,0.00063619844,0.0010661762,0.0014644475,0.0012544708,0.0016135097,0.0032437195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014115692,0.000159292,0.0002733699,0.00056334975,0.00005591259,0.00018695797,0.00023206962,0.6797075,0.018979259,0.08091923,0.009982014,0.20879984],"study_design_scores_gemma":[0.000048300295,0.00014888155,0.000084255924,0.00004979052,0.000012486389,0.00021223996,0.00006449354,0.96657604,0.0045480654,0.02281951,0.005411665,0.000024293562],"about_ca_topic_score_codex":0.0005802327,"about_ca_topic_score_gemma":0.0010187149,"teacher_disagreement_score":0.0081825135,"about_ca_system_score_codex":0.0005906068,"about_ca_system_score_gemma":0.0014555674,"threshold_uncertainty_score":0.027373254},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04453147,0.001257801,0.9506287,0.00023954747,0.00004573885,0.00008003331,0.00006477686,0.00028754087,0.0028642684],"genre_scores_gemma":[0.82449657,0.0010086043,0.17231746,0.00009981927,0.00004710355,0.00013805163,0.000073072384,0.000018220615,0.0018011404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995472,0.00018015745,0.000023069853,0.00004941241,0.00014760546,0.00005245697],"domain_scores_gemma":[0.99907684,0.00047609312,0.00010389288,0.00016263589,0.00015373742,0.000026758344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009925555,0.00077557133,0.00051690947,0.00052361,0.00056477805,0.00049727934,0.0010372808,0.0006652343,0.0008815948],"category_scores_gemma":[0.001579724,0.00021334476,0.00036891905,0.0005232782,0.00081135356,0.00090424763,0.0007207924,0.00047946858,0.00028846067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046056358,0.00011065602,0.001092764,0.00032838964,0.00010603534,0.0006527607,0.00040669565,0.6682326,0.053976405,0.11228367,0.0026591127,0.15969032],"study_design_scores_gemma":[0.000043361113,0.00022066123,0.0001371118,0.000014086934,0.000036377918,0.00034744793,0.000027471728,0.96675974,0.013483909,0.015976425,0.0029242318,0.000029130826],"about_ca_topic_score_codex":0.001606905,"about_ca_topic_score_gemma":0.0030759794,"teacher_disagreement_score":0.001606905,"about_ca_system_score_codex":0.0005518805,"about_ca_system_score_gemma":0.00079555856,"threshold_uncertainty_score":0.0052492023},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048995644,0.0021955457,0.9405803,0.00040406594,0.00018373282,0.0001403077,0.0000846207,0.00039068496,0.00702505],"genre_scores_gemma":[0.7052093,0.0014348414,0.2878502,0.00017584128,0.00012248161,0.00010295491,0.00009081329,0.000016363105,0.0049971757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994646,0.00018608526,0.000037699054,0.000077078614,0.00017455904,0.00006012508],"domain_scores_gemma":[0.9995215,0.00013549006,0.000079737445,0.00013335641,0.000108240914,0.000021712609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005971615,0.0006830156,0.0006103398,0.00048645565,0.00050705264,0.0006389907,0.00074691675,0.00060262374,0.000700085],"category_scores_gemma":[0.0008724486,0.00018836178,0.00035120966,0.00048216994,0.00046194415,0.0009114523,0.00050050736,0.00040573176,0.0003456344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006406943,0.00027933158,0.0028900714,0.00072503515,0.00028531312,0.0015707854,0.0005401357,0.23987605,0.14611927,0.20292822,0.004336325,0.3998088],"study_design_scores_gemma":[0.00013295094,0.0006794256,0.0007833405,0.0000636477,0.00015722547,0.001981568,0.00006466856,0.88940585,0.057651453,0.029911568,0.019044695,0.00012358825],"about_ca_topic_score_codex":0.0011192205,"about_ca_topic_score_gemma":0.0020383962,"teacher_disagreement_score":0.0011192205,"about_ca_system_score_codex":0.00043346392,"about_ca_system_score_gemma":0.00062678737,"threshold_uncertainty_score":0.003158152},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051257275,0.0011071207,0.942106,0.00040769365,0.000060435465,0.000036061345,0.0000270477,0.00017956593,0.004818818],"genre_scores_gemma":[0.97754556,0.0005088982,0.020222044,0.000054611333,0.000055557313,0.000080290534,0.000023167158,0.00003166176,0.0014782703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986259,0.0008193319,0.00003101515,0.00014015593,0.00023266442,0.00015098309],"domain_scores_gemma":[0.99713576,0.0021324924,0.00022535736,0.00014914799,0.00022310582,0.00013415789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002221158,0.0011178193,0.0012246694,0.0004645335,0.0006328748,0.0013848565,0.0012032647,0.0008970244,0.0010080457],"category_scores_gemma":[0.0048810584,0.00039086703,0.00040317283,0.0009047558,0.0018221412,0.001240832,0.0013915118,0.0008660718,0.00020543818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009596497,0.000031621214,0.00021893902,0.00010512456,0.000035777168,0.00019065358,0.00012258174,0.92742836,0.003196826,0.058867697,0.0009291275,0.008777382],"study_design_scores_gemma":[0.000010334894,0.000024810262,0.00004390485,0.0000042374254,0.000006147633,0.00002131625,0.000016489399,0.9809667,0.0003021255,0.018364554,0.00023471133,0.0000046206137],"about_ca_topic_score_codex":0.0009602431,"about_ca_topic_score_gemma":0.0009838064,"teacher_disagreement_score":0.002221158,"about_ca_system_score_codex":0.0012767098,"about_ca_system_score_gemma":0.0008524672,"threshold_uncertainty_score":0.011746705},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5622136,0.0019547252,0.42635363,0.0005492644,0.000024916948,0.00006065739,0.00015224738,0.0002809881,0.008409912],"genre_scores_gemma":[0.9948907,0.00029524023,0.0042415764,0.000022869672,0.000013906152,0.000019323543,0.00002435667,0.00001376933,0.00047835466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983063,0.0008247627,0.00004745955,0.000153296,0.0004317392,0.00023636992],"domain_scores_gemma":[0.98371756,0.012960147,0.0012917946,0.0006061943,0.0013015859,0.00012277918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034387233,0.0009647677,0.0008411806,0.00078260084,0.00043299663,0.0009362668,0.0008066807,0.00087253714,0.00067183014],"category_scores_gemma":[0.016279813,0.00038282215,0.00031664062,0.0008262084,0.0015383784,0.0014659131,0.0011898533,0.00048415287,0.00014059509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045011013,0.00000942741,0.00078963995,0.000029802488,0.000019307445,0.00007280524,0.000063570384,0.9900712,0.0010877101,0.005110422,0.00007605282,0.0026250437],"study_design_scores_gemma":[0.0000042201236,0.00004572161,0.0004759072,0.000005499976,0.000012070746,0.00005666698,0.000022353983,0.9960658,0.00081816333,0.0024170752,0.00006798799,0.00000863189],"about_ca_topic_score_codex":0.0034816468,"about_ca_topic_score_gemma":0.0015826742,"teacher_disagreement_score":0.0034816468,"about_ca_system_score_codex":0.0015998061,"about_ca_system_score_gemma":0.0007523076,"threshold_uncertainty_score":0.018185914},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02037506,0.00057737425,0.9740796,0.00011046316,0.000023055973,0.000034009332,0.000057893543,0.0001744989,0.0045679663],"genre_scores_gemma":[0.88003916,0.0012210775,0.114018366,0.00010260478,0.00005894159,0.00016383099,0.00015087493,0.00007927488,0.0041658124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981053,0.00048571048,0.00007604227,0.00016223727,0.00094645657,0.00022423253],"domain_scores_gemma":[0.99266726,0.005187064,0.0004576374,0.0005074336,0.0010967068,0.00008395149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025633252,0.0010046456,0.0011540942,0.00087165757,0.0004587793,0.0013732716,0.0013315026,0.00075660436,0.0026566756],"category_scores_gemma":[0.013750815,0.00061182556,0.0005825482,0.00095452345,0.0010425707,0.00218763,0.0013005653,0.0007621156,0.00063226675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010653763,0.000027625128,0.0006724197,0.00011651717,0.000033030894,0.00019626746,0.00014848639,0.9121082,0.0036748666,0.05489598,0.0006669628,0.027353138],"study_design_scores_gemma":[0.0000053574113,0.00002269413,0.00015473418,0.000010601101,0.000008241356,0.0001214804,0.000018408666,0.9884298,0.0009642908,0.009912975,0.00034305468,0.000008399054],"about_ca_topic_score_codex":0.0019887886,"about_ca_topic_score_gemma":0.0015930414,"teacher_disagreement_score":0.0026566756,"about_ca_system_score_codex":0.0019458446,"about_ca_system_score_gemma":0.0012941234,"threshold_uncertainty_score":0.014118135},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039971814,0.0012388105,0.95369446,0.00038679395,0.000034915287,0.000034585606,0.00005334782,0.00015617786,0.0044290987],"genre_scores_gemma":[0.8553277,0.0012784216,0.14055414,0.0001035442,0.00006945995,0.00015004938,0.000073948904,0.000065265034,0.0023774728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991725,0.0005058653,0.000017345337,0.00006222798,0.000130143,0.000111764304],"domain_scores_gemma":[0.99918777,0.0006209788,0.00006802933,0.00004012747,0.000057333003,0.000025874464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011632944,0.00050569174,0.0007209339,0.00045608237,0.0005394871,0.0008376361,0.0006938424,0.0008440969,0.0010414693],"category_scores_gemma":[0.002439588,0.00039749226,0.0003627479,0.0007708215,0.0008822221,0.0012759228,0.00065287284,0.0005843338,0.00013452978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003998699,0.00002418492,0.00019273214,0.000052742624,0.0000092807895,0.000044016913,0.00004965373,0.94564813,0.00062804815,0.041067746,0.00064195844,0.011601558],"study_design_scores_gemma":[0.000008689641,0.000014202524,0.000036601537,0.000004507773,0.0000028879174,0.00001099919,0.000013541885,0.97687554,0.00017761123,0.022476496,0.00037603886,0.0000029957564],"about_ca_topic_score_codex":0.0019913474,"about_ca_topic_score_gemma":0.0020655938,"teacher_disagreement_score":0.0019913474,"about_ca_system_score_codex":0.0013428861,"about_ca_system_score_gemma":0.00083156547,"threshold_uncertainty_score":0.0097433925},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31297636,0.00035416218,0.6842952,0.00017214351,0.00003285313,0.00008894301,0.000023806482,0.00039583814,0.0016607016],"genre_scores_gemma":[0.98173517,0.00010443132,0.017754864,0.000020637832,0.000010129753,0.000034613982,0.000012483979,0.000012039239,0.0003156384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929583,0.00019855786,0.000043772634,0.000112191825,0.00024613904,0.00010359585],"domain_scores_gemma":[0.99637234,0.0021003261,0.00069535803,0.00024578598,0.0004883108,0.00009796272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014525536,0.00047593008,0.00030539345,0.000564019,0.0003973269,0.00053580734,0.0006813941,0.0002798348,0.00024159071],"category_scores_gemma":[0.004497974,0.00016722183,0.00015490362,0.00042928683,0.0008668627,0.0006988515,0.00076580007,0.00048919686,0.00006186273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006643391,0.00018558955,0.0042575947,0.00013579873,0.000079042875,0.00027266605,0.00061366166,0.64764374,0.20789135,0.017965088,0.0005733814,0.11971783],"study_design_scores_gemma":[0.000036167938,0.00022446063,0.0005674272,0.000008562413,0.000032531705,0.0001059135,0.00003969348,0.9553007,0.04029674,0.0028263847,0.00053988514,0.00002150241],"about_ca_topic_score_codex":0.0025798168,"about_ca_topic_score_gemma":0.0022268242,"teacher_disagreement_score":0.0025798168,"about_ca_system_score_codex":0.000750521,"about_ca_system_score_gemma":0.00084920635,"threshold_uncertainty_score":0.007681906},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021664696,0.0008796889,0.97095764,0.00034353085,0.000031801676,0.000053922227,0.000076907934,0.000080265076,0.0059115784],"genre_scores_gemma":[0.87102866,0.001874076,0.12023961,0.00012228267,0.00010037913,0.00025485584,0.00012503564,0.00007125444,0.0061837845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930453,0.00036164027,0.00002323101,0.000095080955,0.00013471677,0.00008079481],"domain_scores_gemma":[0.99891925,0.00081366865,0.00010576781,0.00003408304,0.000101803824,0.000025417216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011563986,0.0016297796,0.001127342,0.0005704056,0.00041414218,0.0014772866,0.0008467795,0.0016423747,0.0016456478],"category_scores_gemma":[0.0026576815,0.0005448701,0.0005889721,0.0012339324,0.00096379383,0.0013751908,0.0008898782,0.0008254943,0.00043971484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005642241,0.0000335498,0.00018986242,0.00010305791,0.00002988156,0.00013654555,0.00005735867,0.9679319,0.002172854,0.015441552,0.00058444386,0.013262556],"study_design_scores_gemma":[0.000014264569,0.000033855693,0.000074888405,0.000006332388,0.000009585084,0.000044258086,0.00001911344,0.9930333,0.00044625017,0.00602536,0.0002851801,0.0000075840885],"about_ca_topic_score_codex":0.0027279956,"about_ca_topic_score_gemma":0.0023630385,"teacher_disagreement_score":0.0027279956,"about_ca_system_score_codex":0.0013430498,"about_ca_system_score_gemma":0.00085833896,"threshold_uncertainty_score":0.009744585},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6987979,0.0008027093,0.28378358,0.0006255001,0.00019519328,0.00032326352,0.00043215416,0.00610341,0.008936379],"genre_scores_gemma":[0.9634274,0.00010973437,0.034045257,0.000106677275,0.00003057737,0.000047939902,0.0001426913,0.00002376753,0.0020658642],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999082,0.0000121144685,0.0000070596047,0.000021788166,0.000026311262,0.000024477944],"domain_scores_gemma":[0.9997671,0.000027530086,0.00001843403,0.000031295796,0.00010526392,0.000050322906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012757364,0.00030615053,0.00038616481,0.00027526732,0.00047507364,0.00029942303,0.00052123546,0.00030943798,0.0015853143],"category_scores_gemma":[0.00028916914,0.000108215056,0.00017465338,0.00021980662,0.00010947205,0.00036101328,0.0004233523,0.00024043578,0.00035362734],"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.0020120975,0.000493128,0.0066697346,0.00033819,0.000095339754,0.0019412127,0.00038199677,0.02551771,0.6247594,0.004732876,0.015654545,0.3174038],"study_design_scores_gemma":[0.00029070172,0.0009577402,0.0058004106,0.000033794604,0.00010502606,0.0011041372,0.00018828257,0.83284914,0.1476021,0.0010993464,0.0098892655,0.00008003475],"about_ca_topic_score_codex":0.0041047097,"about_ca_topic_score_gemma":0.0049130674,"teacher_disagreement_score":0.0041047097,"about_ca_system_score_codex":0.00033407946,"about_ca_system_score_gemma":0.00044495007,"threshold_uncertainty_score":0.008161604},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9111172,0.0012004955,0.08216569,0.00028485188,0.000017118922,0.000014137633,0.000105235194,0.00025893375,0.0048362785],"genre_scores_gemma":[0.9983901,0.00013565921,0.0011884226,0.000013348642,0.0000056295553,0.0000042661404,0.000017140681,0.0000063282955,0.00023918902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990428,0.00034544748,0.000045000754,0.00006897737,0.00029291085,0.00020481554],"domain_scores_gemma":[0.9898183,0.007989066,0.00071447645,0.0003857001,0.00089833536,0.00019414104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017508277,0.00062091154,0.0006943538,0.00064203196,0.0007055518,0.0009842189,0.00038280265,0.0009177492,0.0005938021],"category_scores_gemma":[0.010872231,0.0002594554,0.00019709047,0.00089087925,0.001319462,0.0006796796,0.0009981628,0.00041934178,0.00016589224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039596012,0.000050060902,0.0096957665,0.00011763219,0.000055700693,0.00049335894,0.0005720096,0.95616984,0.009401614,0.008960954,0.0004659108,0.013621279],"study_design_scores_gemma":[0.000022813134,0.00018760822,0.0023878932,0.000017286815,0.00003157576,0.00032291142,0.0001581339,0.98942685,0.0032241754,0.00401614,0.00017991332,0.00002471475],"about_ca_topic_score_codex":0.006672018,"about_ca_topic_score_gemma":0.003695503,"teacher_disagreement_score":0.006672018,"about_ca_system_score_codex":0.0013861939,"about_ca_system_score_gemma":0.0007415164,"threshold_uncertainty_score":0.013266385},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052247632,0.00036773333,0.9423249,0.0002192553,0.000026699834,0.000032123236,0.000046224428,0.0001278545,0.004607556],"genre_scores_gemma":[0.944939,0.00053406134,0.051018257,0.00008855292,0.00004465167,0.00007781814,0.00006559422,0.00010658433,0.0031255884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936897,0.00027393948,0.000013463009,0.000080929654,0.00017288337,0.00008989726],"domain_scores_gemma":[0.9989134,0.00067650696,0.00010128929,0.00005400153,0.00020685392,0.00004794246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008538581,0.0007497569,0.00077498506,0.00043735275,0.0002905603,0.0009200936,0.00077776203,0.00052502006,0.0012469395],"category_scores_gemma":[0.0033035385,0.00030255716,0.0002008417,0.0009812644,0.0009886939,0.0011152846,0.00078477326,0.0004869057,0.00021330753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012904989,0.000029198405,0.00041701578,0.00006121419,0.000018620445,0.00008310739,0.0000840294,0.9299834,0.0036902025,0.042409014,0.0009604283,0.022134708],"study_design_scores_gemma":[0.000006645381,0.00003240889,0.000052811465,0.0000022872032,0.0000038776584,0.000025743777,0.000020174115,0.9921881,0.0006740497,0.006674563,0.00031620226,0.0000031431475],"about_ca_topic_score_codex":0.0018575753,"about_ca_topic_score_gemma":0.0014789813,"teacher_disagreement_score":0.0018575753,"about_ca_system_score_codex":0.0013238305,"about_ca_system_score_gemma":0.0008772643,"threshold_uncertainty_score":0.00960511},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013196557,0.0002095714,0.98317313,0.00013725559,0.000016709355,0.000052333522,0.000022203936,0.00006682952,0.00312552],"genre_scores_gemma":[0.8414582,0.0005040771,0.15520675,0.00012642976,0.0000651048,0.00040529625,0.000065312575,0.0000607466,0.002107985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965199,0.0022774872,0.000085520194,0.0002543591,0.00055077334,0.0003119613],"domain_scores_gemma":[0.99555004,0.0032182303,0.0003041233,0.00042385276,0.00036960037,0.00013421192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044181477,0.0011360439,0.001375344,0.0008095607,0.00092198513,0.0012596432,0.001131689,0.0010019954,0.001482373],"category_scores_gemma":[0.010660183,0.00053964136,0.00046013703,0.0014664815,0.0026158316,0.0021096868,0.002342137,0.0009544151,0.0003827988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010588054,0.00004840986,0.00024410947,0.00008509145,0.000021125037,0.000106696025,0.00020027152,0.76582724,0.0025041427,0.21189629,0.00080051477,0.018160246],"study_design_scores_gemma":[0.000012892382,0.00004538945,0.000039598595,0.000011892875,0.0000051177503,0.0000427989,0.000028244864,0.9284801,0.0012807434,0.06942461,0.00061676244,0.000011897514],"about_ca_topic_score_codex":0.0008611189,"about_ca_topic_score_gemma":0.0008127557,"teacher_disagreement_score":0.0044181477,"about_ca_system_score_codex":0.001452046,"about_ca_system_score_gemma":0.0017153044,"threshold_uncertainty_score":0.023365676},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72922456,0.0014352585,0.2517847,0.00027795497,0.0000480731,0.000105955914,0.0002158314,0.00029902603,0.01660858],"genre_scores_gemma":[0.99467504,0.00033284738,0.003908105,0.000017959253,0.000010079773,0.000025109679,0.000038440587,0.000017034252,0.0009753793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929845,0.0002094658,0.000035341458,0.00010192642,0.00015944272,0.00019538777],"domain_scores_gemma":[0.99292266,0.0052218107,0.0006954805,0.0004466068,0.0005620393,0.0001513925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019837068,0.00046946786,0.0005708669,0.0006224031,0.00042718268,0.00093189074,0.00068948243,0.0005456538,0.0010220318],"category_scores_gemma":[0.010723376,0.00028077792,0.00028597264,0.00062107487,0.0009938466,0.0010703364,0.00067000627,0.00050926645,0.00018288151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050935306,0.000082412174,0.0039202175,0.00017358911,0.00004983111,0.0005603365,0.0007049931,0.8435962,0.011378891,0.10015987,0.0014481724,0.03741598],"study_design_scores_gemma":[0.000022070566,0.00011298077,0.0016398663,0.000022280185,0.000039358023,0.00038560294,0.00018384327,0.97040254,0.004153133,0.022369048,0.0006286615,0.000040691546],"about_ca_topic_score_codex":0.0022450993,"about_ca_topic_score_gemma":0.0017070221,"teacher_disagreement_score":0.0022450993,"about_ca_system_score_codex":0.0012157741,"about_ca_system_score_gemma":0.00075386703,"threshold_uncertainty_score":0.010490954},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108718984,0.0009175226,0.8856796,0.00028181134,0.000019117624,0.000024787374,0.00007890666,0.00014024133,0.004139144],"genre_scores_gemma":[0.9791231,0.00067728374,0.01855275,0.00003530686,0.000027043461,0.000032334392,0.000047328373,0.000039163366,0.0014655684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994149,0.00026969277,0.000015717462,0.00005734702,0.000145461,0.00009686696],"domain_scores_gemma":[0.9973272,0.002145744,0.00019628114,0.00007350519,0.00021238904,0.000044915636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014231557,0.0006451617,0.0008019766,0.00063933677,0.00036082766,0.0006325708,0.0006249296,0.0005118084,0.001089097],"category_scores_gemma":[0.004941302,0.00030872162,0.0003136416,0.00079270045,0.0010032243,0.0010021843,0.0006895869,0.00051111955,0.00015838411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016877553,0.0000068936897,0.0002107401,0.000017691016,0.000007049393,0.000052531705,0.000027845388,0.9907286,0.0003864925,0.006058414,0.00017238499,0.0023144751],"study_design_scores_gemma":[0.0000016888557,0.0000058879264,0.00007989909,0.0000012374741,0.000002625097,0.000012821716,0.000011414555,0.9973749,0.00012799402,0.0023284515,0.000051533232,0.0000015920941],"about_ca_topic_score_codex":0.0039250934,"about_ca_topic_score_gemma":0.002494259,"teacher_disagreement_score":0.0039250934,"about_ca_system_score_codex":0.001546284,"about_ca_system_score_gemma":0.0005660345,"threshold_uncertainty_score":0.011219084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85730714,0.0019172198,0.13048796,0.00046807574,0.00006722967,0.00004721198,0.00025769798,0.00036861887,0.009078771],"genre_scores_gemma":[0.9982734,0.00016371156,0.0012149956,0.000016524269,0.0000100176985,0.000007778567,0.00002621444,0.0000063002794,0.0002811247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987332,0.00050435844,0.00004759055,0.00016066269,0.00022923906,0.00032497093],"domain_scores_gemma":[0.9949805,0.0031952236,0.00049717375,0.00024591078,0.0008859152,0.00019525891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017721326,0.0014747889,0.0014145734,0.00061550445,0.00077188696,0.0014936535,0.0007980357,0.0012985051,0.00095844106],"category_scores_gemma":[0.0047211894,0.00039739528,0.0005108441,0.00067289965,0.0015810393,0.0012094686,0.0013701872,0.00056399807,0.00021920659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033375283,0.00003024936,0.0018207286,0.00006404119,0.00007259531,0.00020508745,0.000100665755,0.9865632,0.0040979586,0.0028905063,0.00019920568,0.0036219337],"study_design_scores_gemma":[0.000027153996,0.00019675186,0.0007862029,0.000009235026,0.000037927606,0.00007940727,0.000054475095,0.9955309,0.0013012425,0.001873189,0.00007847144,0.000025078254],"about_ca_topic_score_codex":0.007421467,"about_ca_topic_score_gemma":0.0030605623,"teacher_disagreement_score":0.007421467,"about_ca_system_score_codex":0.0012982591,"about_ca_system_score_gemma":0.0010677741,"threshold_uncertainty_score":0.01475656},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.567255,0.0025874877,0.4198548,0.00082248694,0.0001103108,0.00006221977,0.0002585148,0.00039726376,0.008651927],"genre_scores_gemma":[0.9955759,0.000434199,0.0035090083,0.000028150842,0.000016906919,0.000011899304,0.00004618224,0.000014985659,0.0003627564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979086,0.00085957797,0.00006332865,0.0001533165,0.0006315627,0.0003836958],"domain_scores_gemma":[0.9780701,0.018140152,0.0013309141,0.0008206752,0.0014743049,0.00016381884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034062783,0.0010050117,0.0009202593,0.0005119882,0.0006241207,0.0009938565,0.0006551788,0.0009676749,0.00050177367],"category_scores_gemma":[0.02801368,0.00043756023,0.00023567202,0.00068594,0.0017722938,0.0016075033,0.0011773603,0.0008018777,0.00014260173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009117972,0.000010724767,0.0009427023,0.000030046613,0.00001842453,0.0000634655,0.00003660247,0.9906562,0.0009482064,0.0034235194,0.00012438794,0.0036545552],"study_design_scores_gemma":[0.000008022118,0.00007917531,0.0010867675,0.000016327862,0.00002177811,0.00007725143,0.000036675276,0.9928813,0.0021441786,0.0034925076,0.0001365864,0.000019439916],"about_ca_topic_score_codex":0.0071529374,"about_ca_topic_score_gemma":0.0048424443,"teacher_disagreement_score":0.0071529374,"about_ca_system_score_codex":0.001474409,"about_ca_system_score_gemma":0.0011187227,"threshold_uncertainty_score":0.018014312},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015600891,0.00022165396,0.9807194,0.00029507212,0.000033111475,0.000022948316,0.000039458413,0.000045115336,0.0030223134],"genre_scores_gemma":[0.4654086,0.00094942463,0.53044534,0.0002296635,0.00010417962,0.00021003357,0.0001599031,0.000057135723,0.0024356924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994518,0.00023932992,0.000021646467,0.00005401951,0.00019517301,0.000037988593],"domain_scores_gemma":[0.99861753,0.0006163411,0.00018033938,0.00023829397,0.00030670033,0.00004084575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010804706,0.000512842,0.00040555038,0.0004958166,0.00031100135,0.00071577623,0.0005787089,0.0007354253,0.00087989034],"category_scores_gemma":[0.0032934067,0.00022810635,0.00031675564,0.00070653757,0.0011201543,0.0009205658,0.0012322641,0.0011838909,0.0004476473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016180318,0.000036020836,0.0005416764,0.00014171014,0.000021117718,0.0002362463,0.00033859137,0.485212,0.025559785,0.44325504,0.0014419091,0.043054126],"study_design_scores_gemma":[0.000019136332,0.00004322127,0.00013405303,0.000034206656,0.000006443633,0.000121551144,0.000025629475,0.88305795,0.0044805,0.10914373,0.002914259,0.000019323794],"about_ca_topic_score_codex":0.00048131237,"about_ca_topic_score_gemma":0.0004086297,"teacher_disagreement_score":0.0010804706,"about_ca_system_score_codex":0.0006650859,"about_ca_system_score_gemma":0.0006175287,"threshold_uncertainty_score":0.0057141185},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09763239,0.00060794,0.8944962,0.00044723134,0.000054636497,0.000048241465,0.000028180675,0.00010238805,0.006582803],"genre_scores_gemma":[0.9702908,0.0002237839,0.028306022,0.00006873071,0.000030574232,0.00006775697,0.000010883037,0.000014423347,0.0009870707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858356,0.00075502536,0.000027835162,0.00013760554,0.00022467825,0.00027138047],"domain_scores_gemma":[0.99749666,0.0019305705,0.00020354381,0.00013135096,0.00013165498,0.00010622386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023003533,0.0008464314,0.00081513915,0.000519437,0.00064170774,0.0013018729,0.001239447,0.0012958631,0.000569559],"category_scores_gemma":[0.004874814,0.0004491797,0.00045630155,0.0010405559,0.0020528613,0.0014656278,0.0013016757,0.0008827224,0.00011212232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023724333,0.000019541865,0.000097453514,0.000011665521,0.000011099983,0.000046998735,0.000030238212,0.98319083,0.00036457067,0.013172666,0.0001698422,0.002861368],"study_design_scores_gemma":[0.000013265257,0.000018593268,0.000035868256,0.0000018641429,0.000004727925,0.000010689024,0.00001432434,0.98825336,0.0001490852,0.011380063,0.00011362722,0.0000044952567],"about_ca_topic_score_codex":0.004431295,"about_ca_topic_score_gemma":0.003210097,"teacher_disagreement_score":0.004431295,"about_ca_system_score_codex":0.0011156178,"about_ca_system_score_gemma":0.0014461935,"threshold_uncertainty_score":0.012165546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032290764,0.001376607,0.9522208,0.00032347644,0.00009293413,0.000118444535,0.000093787894,0.000596991,0.012886193],"genre_scores_gemma":[0.9176902,0.0010504349,0.07659015,0.00015776951,0.0000885612,0.00016001212,0.00008383183,0.000048475362,0.004130472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945015,0.00018568797,0.000028256401,0.00009192151,0.00014890185,0.00009512637],"domain_scores_gemma":[0.9996599,0.00008850584,0.00004226025,0.000037056012,0.00014950303,0.000022726015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004984109,0.00072349975,0.0004117584,0.00033719218,0.0005794515,0.0009683103,0.0009929867,0.00063572236,0.0020075324],"category_scores_gemma":[0.0011038523,0.00024554992,0.0002887044,0.00030936304,0.00035242416,0.0005566157,0.0005450906,0.00036286775,0.00087683805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044755876,0.00009486084,0.0019191285,0.00038391192,0.00012529264,0.001332664,0.0008564726,0.597374,0.12162275,0.0692593,0.00838984,0.19819418],"study_design_scores_gemma":[0.00003827114,0.00040253522,0.0006073453,0.00004378411,0.000072279414,0.0007473258,0.0001838203,0.96260834,0.0143456375,0.0073313266,0.013584859,0.000034421093],"about_ca_topic_score_codex":0.0033280128,"about_ca_topic_score_gemma":0.004750506,"teacher_disagreement_score":0.0033280128,"about_ca_system_score_codex":0.0009744169,"about_ca_system_score_gemma":0.0006406833,"threshold_uncertainty_score":0.0070699453},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27754992,0.0029564665,0.6945111,0.00075663667,0.00010684768,0.000050222025,0.0004914067,0.0005613805,0.023016065],"genre_scores_gemma":[0.99260336,0.0006398062,0.0046392228,0.0000491065,0.00005376142,0.00003840529,0.000116999625,0.000037794332,0.0018216548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987997,0.0002832085,0.000041360865,0.00010357028,0.00034332802,0.00042882393],"domain_scores_gemma":[0.99570256,0.0028541991,0.00039895304,0.00027246765,0.0006585545,0.000113278744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013593917,0.0009768853,0.00090796663,0.0011234692,0.00065534085,0.0014957963,0.0009639321,0.0009271129,0.0018933899],"category_scores_gemma":[0.0054840054,0.00035899284,0.0006499955,0.0012157074,0.0017255216,0.0018489645,0.0011718314,0.0007520355,0.00045649428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006943842,0.00002340229,0.0008215996,0.000066357316,0.00006246541,0.00026654336,0.000110152236,0.94616115,0.0024573235,0.043846153,0.0006256984,0.005489764],"study_design_scores_gemma":[0.000002739968,0.000011108063,0.0002594365,0.000009266452,0.00001416542,0.00007421392,0.000024063605,0.98995095,0.00057742407,0.00886263,0.00019911975,0.000014866045],"about_ca_topic_score_codex":0.0060851253,"about_ca_topic_score_gemma":0.0025912812,"teacher_disagreement_score":0.0060851253,"about_ca_system_score_codex":0.0021946253,"about_ca_system_score_gemma":0.0014014957,"threshold_uncertainty_score":0.015923202},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12217034,0.0032292213,0.8476019,0.00045400902,0.00005944493,0.000053169035,0.0003380856,0.00044323146,0.02565065],"genre_scores_gemma":[0.9857965,0.0014450432,0.010366049,0.000057105066,0.00007645059,0.00005242439,0.00011322103,0.000054836597,0.0020382595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994186,0.0001573749,0.000021261158,0.00004490577,0.00021350753,0.00014441257],"domain_scores_gemma":[0.9968094,0.0021968225,0.0002773045,0.00017947562,0.00046948795,0.00006740762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096452236,0.00094079546,0.00063300657,0.0013059686,0.00044385792,0.000929783,0.00077114877,0.00051545014,0.0017314235],"category_scores_gemma":[0.0051502082,0.00021271246,0.00051838794,0.0011682571,0.0013283247,0.0011267312,0.00077782536,0.000750364,0.00038623423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003568505,0.000015376649,0.0004983073,0.00007576523,0.000025373263,0.00024423242,0.00011929746,0.912255,0.0037876423,0.07632231,0.0006323692,0.0059886416],"study_design_scores_gemma":[0.0000011109695,0.000008222006,0.00022838524,0.000011921492,0.0000070709666,0.00006924781,0.000020990301,0.98753566,0.0008232167,0.010992077,0.00029231567,0.000009774587],"about_ca_topic_score_codex":0.004886625,"about_ca_topic_score_gemma":0.002569691,"teacher_disagreement_score":0.004886625,"about_ca_system_score_codex":0.0019953914,"about_ca_system_score_gemma":0.00087229605,"threshold_uncertainty_score":0.014477611},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028343548,0.000380245,0.99525553,0.00009464082,0.000018247427,0.000008954172,0.00001189661,0.00011548335,0.0012807051],"genre_scores_gemma":[0.52984923,0.0022173233,0.4564768,0.0003710912,0.00035122654,0.00014219352,0.00013826377,0.0001169537,0.010336874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924195,0.0002825247,0.00002483131,0.00013595895,0.00025331945,0.0000614545],"domain_scores_gemma":[0.9992617,0.00039436054,0.00009823087,0.00007667173,0.00015669399,0.000012404815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086904113,0.00060336426,0.0006406759,0.00023639464,0.00024954093,0.00074423285,0.00072031753,0.0010485861,0.0015450183],"category_scores_gemma":[0.0017377265,0.0002631224,0.00040921703,0.0005287033,0.0006909361,0.00083388283,0.0005994476,0.0012833752,0.00088430045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009378719,0.00006526523,0.0007728388,0.00033284124,0.00008578184,0.00031359636,0.00024151811,0.750063,0.034511782,0.11990856,0.0025971092,0.09101389],"study_design_scores_gemma":[0.000012131352,0.00006736238,0.00009732986,0.000014156799,0.000017038115,0.000094089504,0.000017784312,0.9852461,0.0039017883,0.008556154,0.0019618843,0.0000141108085],"about_ca_topic_score_codex":0.00067159394,"about_ca_topic_score_gemma":0.0009034145,"teacher_disagreement_score":0.0015450183,"about_ca_system_score_codex":0.00045830154,"about_ca_system_score_gemma":0.0006619346,"threshold_uncertainty_score":0.005168557},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067540007,0.00025921554,0.9890577,0.00018809295,0.000022946753,0.00002550477,0.00005294619,0.000056135144,0.0035834173],"genre_scores_gemma":[0.6320527,0.0016926491,0.35605633,0.00026398565,0.00011061556,0.00025927232,0.00017192657,0.000058225967,0.009334306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994209,0.00024749726,0.000021221624,0.000095385214,0.00015592406,0.000059065496],"domain_scores_gemma":[0.9993568,0.00040178222,0.00007797135,0.000048372018,0.00009919606,0.000015916265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078533735,0.0009281669,0.00073497655,0.00022972564,0.00031981128,0.00082742336,0.0006746517,0.0010563331,0.002501047],"category_scores_gemma":[0.0017343129,0.00032473417,0.0003564556,0.00079299876,0.0005443583,0.001357395,0.00059109903,0.00064073055,0.0008203185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000717364,0.00004697558,0.0003938431,0.00018597781,0.000038176127,0.00017734453,0.000086168446,0.8718136,0.009405049,0.07070698,0.0016025541,0.04547163],"study_design_scores_gemma":[0.000017601711,0.00006390522,0.00010301319,0.000011487377,0.000014334307,0.00007375612,0.000029998597,0.9783773,0.0023724688,0.016803786,0.0021210127,0.0000113811675],"about_ca_topic_score_codex":0.0013656776,"about_ca_topic_score_gemma":0.0017592475,"teacher_disagreement_score":0.002501047,"about_ca_system_score_codex":0.00049909385,"about_ca_system_score_gemma":0.0006643514,"threshold_uncertainty_score":0.008366823},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006546842,0.00005626694,0.9915803,0.00011310234,0.000019245219,0.00004299567,0.000037961432,0.00026912664,0.0013341438],"genre_scores_gemma":[0.53768146,0.0002558811,0.4569234,0.00015460912,0.00009595322,0.00036325885,0.00025537112,0.00013353075,0.0041364934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979766,0.0008215885,0.00009784433,0.00029000465,0.000535423,0.00027855104],"domain_scores_gemma":[0.99588615,0.0017885912,0.00039968282,0.0012696359,0.0005297755,0.00012614019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017198782,0.00053375616,0.0007346975,0.0011683278,0.0013286922,0.0013096051,0.0019620957,0.00091323437,0.002235031],"category_scores_gemma":[0.007588882,0.00032230865,0.0005182373,0.0021874812,0.0015882191,0.003925578,0.0032732238,0.0012380641,0.0006332006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006061711,0.00011606882,0.000904643,0.00011760243,0.000062548,0.00021191221,0.00060458685,0.38071582,0.01195038,0.39638722,0.004278084,0.20404492],"study_design_scores_gemma":[0.000025591213,0.000062904,0.00012947203,0.000015688414,0.000013280548,0.00011694525,0.000112975125,0.87952584,0.008347767,0.107476756,0.0041417344,0.000030989417],"about_ca_topic_score_codex":0.0028011536,"about_ca_topic_score_gemma":0.002182028,"teacher_disagreement_score":0.0028011536,"about_ca_system_score_codex":0.0012478556,"about_ca_system_score_gemma":0.0019395817,"threshold_uncertainty_score":0.009095669},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018989671,0.0006022483,0.9764197,0.00009612192,0.000027203185,0.00006285154,0.000051587238,0.00013567312,0.0036150531],"genre_scores_gemma":[0.59107924,0.00072993716,0.40554285,0.000116307216,0.00004240053,0.00019212319,0.00010689676,0.000025520667,0.0021647052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953425,0.00020366724,0.000033748576,0.000060754104,0.0001259403,0.000041669162],"domain_scores_gemma":[0.9994555,0.00018058575,0.00011186613,0.00010658361,0.00012202123,0.000023463426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060596823,0.00044230005,0.0002794101,0.00027520483,0.00022229846,0.00038773016,0.00060763996,0.0003553612,0.0013164073],"category_scores_gemma":[0.0015846331,0.00018853624,0.00019464361,0.00036179918,0.0003084966,0.0005730188,0.0005154091,0.00030332283,0.0003399677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024206373,0.00006320644,0.0010183604,0.00052376126,0.00006785137,0.00022330857,0.0002938707,0.44773093,0.09894574,0.17705166,0.0026432602,0.27119598],"study_design_scores_gemma":[0.000051804047,0.00033552686,0.00064767944,0.00005826647,0.00004179613,0.0002854213,0.000045987585,0.93230677,0.01742827,0.036846966,0.011914266,0.000037166308],"about_ca_topic_score_codex":0.00035579034,"about_ca_topic_score_gemma":0.0006483943,"teacher_disagreement_score":0.0013164073,"about_ca_system_score_codex":0.00052886485,"about_ca_system_score_gemma":0.00040817852,"threshold_uncertainty_score":0.00440377},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042970933,0.00037208622,0.95294976,0.00015987418,0.000022578439,0.000022790728,0.00006528604,0.00010718531,0.0033295024],"genre_scores_gemma":[0.9045944,0.00078394625,0.09027436,0.00009512334,0.00005306133,0.000049882266,0.00016747336,0.000029590477,0.0039521526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995771,0.00015460342,0.00002125281,0.000055629527,0.00013115704,0.000060279985],"domain_scores_gemma":[0.9990938,0.00051885087,0.00012542034,0.00009946927,0.00012624415,0.000036295674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062178203,0.0006000235,0.00061660475,0.00023408425,0.00029004965,0.00067645113,0.0005309565,0.00054896274,0.0011649072],"category_scores_gemma":[0.0017255225,0.00024328343,0.0003365685,0.00055670325,0.0005597136,0.0009703887,0.00053989916,0.0005584898,0.00026622976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017202471,0.00004475783,0.00041942747,0.00018048506,0.000038059563,0.0004723681,0.00019652284,0.8520928,0.01332207,0.082630746,0.001054512,0.04937632],"study_design_scores_gemma":[0.000019965466,0.00008653519,0.00018106624,0.000009254173,0.00001573232,0.00015052606,0.00005061281,0.96913725,0.0037608554,0.025661401,0.0009116864,0.000014974965],"about_ca_topic_score_codex":0.0014184619,"about_ca_topic_score_gemma":0.0019166259,"teacher_disagreement_score":0.0014184619,"about_ca_system_score_codex":0.0005319334,"about_ca_system_score_gemma":0.0008026861,"threshold_uncertainty_score":0.0038970113},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007570729,0.00027331992,0.98953515,0.00012643724,0.000020221436,0.000022648594,0.000024996418,0.0000884389,0.0023379822],"genre_scores_gemma":[0.871678,0.00068103016,0.12438509,0.00013348483,0.00005888108,0.00022638105,0.00007882444,0.00007268639,0.0026855073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989951,0.0003577801,0.00003427227,0.00016944103,0.00030292847,0.00014042226],"domain_scores_gemma":[0.9983498,0.0011089505,0.00023638744,0.00009810735,0.00016569477,0.000041168572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016036822,0.0013979598,0.0011311749,0.000554694,0.00039708248,0.0012776995,0.001186232,0.0009061076,0.000992354],"category_scores_gemma":[0.004682956,0.0006024681,0.00066780817,0.0008407195,0.0013865834,0.0011503417,0.0012875679,0.000977005,0.0002605342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012007704,0.000009071543,0.000049625567,0.000018023256,0.000011256842,0.00002486199,0.00001505028,0.9878358,0.00036100115,0.008131055,0.00014841817,0.0033837776],"study_design_scores_gemma":[0.0000028621148,0.000008214063,0.0000147054125,0.0000017320396,0.0000024545184,0.0000043285113,0.0000028724812,0.9968195,0.00010005919,0.002965152,0.00007591766,0.0000021532178],"about_ca_topic_score_codex":0.004738262,"about_ca_topic_score_gemma":0.0032487246,"teacher_disagreement_score":0.004738262,"about_ca_system_score_codex":0.0016954795,"about_ca_system_score_gemma":0.0015015054,"threshold_uncertainty_score":0.012301683},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18808502,0.001342125,0.79727757,0.0007091163,0.00011343305,0.000073427065,0.00013332236,0.0002939784,0.011971988],"genre_scores_gemma":[0.9637747,0.00041308746,0.034406237,0.000052310334,0.000030613548,0.000054600423,0.00003602499,0.000018130973,0.0012143898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888784,0.0004938375,0.00003041744,0.00005959115,0.0003635455,0.00016479226],"domain_scores_gemma":[0.9968534,0.0023727035,0.00020811701,0.00022716257,0.00029409834,0.000044502514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023389882,0.0005983325,0.00063235656,0.0004018739,0.0003424725,0.00093347166,0.0007999856,0.0006780958,0.0010527651],"category_scores_gemma":[0.0058667203,0.00027020258,0.00027599628,0.00069346005,0.0010845497,0.0013526034,0.0010797632,0.000759689,0.00017714263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016153327,0.000043861815,0.0003110679,0.000104529216,0.000016672822,0.00013602478,0.0001032277,0.91073215,0.0065592784,0.06776718,0.0006479732,0.013416455],"study_design_scores_gemma":[0.000013626146,0.000032080756,0.000063774234,0.000009051693,0.0000055523137,0.000025183503,0.000009525037,0.99089384,0.0012111408,0.00753054,0.0001990224,0.0000066815032],"about_ca_topic_score_codex":0.0024511232,"about_ca_topic_score_gemma":0.0025563426,"teacher_disagreement_score":0.0024511232,"about_ca_system_score_codex":0.0011131803,"about_ca_system_score_gemma":0.0011746756,"threshold_uncertainty_score":0.012369931},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5801045,0.0013166787,0.41258115,0.000154583,0.00005096119,0.000048371356,0.000055339322,0.00011340347,0.005575007],"genre_scores_gemma":[0.99075246,0.00043353095,0.007999389,0.000012556866,0.000015133924,0.000008592136,0.0000128829315,0.000004175023,0.00076136406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993662,0.00021446607,0.000021162257,0.000100481906,0.00017677927,0.00012081379],"domain_scores_gemma":[0.9980926,0.0012893623,0.00025370633,0.00013473946,0.00018725266,0.00004235655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006041201,0.00087339804,0.0006092715,0.00042917102,0.00037485475,0.0005549893,0.0006291671,0.0006310597,0.00030766297],"category_scores_gemma":[0.0021042237,0.00023186763,0.00036258955,0.0005575202,0.0007330376,0.0009878615,0.0006030443,0.0003774565,0.0001006587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015821545,0.00007026924,0.001700828,0.00010291593,0.000058053593,0.0007139505,0.00012906999,0.9466679,0.020294068,0.012070619,0.00014667437,0.017887466],"study_design_scores_gemma":[0.000007692013,0.00013742365,0.00037121747,0.000004317055,0.00002291397,0.00023257826,0.000028890405,0.9927193,0.004432223,0.0017330137,0.0002986247,0.000011811242],"about_ca_topic_score_codex":0.0017780904,"about_ca_topic_score_gemma":0.0018658796,"teacher_disagreement_score":0.0017780904,"about_ca_system_score_codex":0.00059937674,"about_ca_system_score_gemma":0.0003352884,"threshold_uncertainty_score":0.004348755},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15773869,0.0011732423,0.83383965,0.00048663802,0.00011244832,0.000066513785,0.0001359311,0.00028422184,0.0061627473],"genre_scores_gemma":[0.94658095,0.00045257184,0.05035246,0.000052210384,0.00005236207,0.000053389114,0.00004279198,0.0000280988,0.0023851034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994875,0.00020049514,0.00003284497,0.00008572106,0.00010159794,0.00009171968],"domain_scores_gemma":[0.9985815,0.000981834,0.00016652525,0.00008755277,0.00013190087,0.00005064291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010884606,0.00072242494,0.00087744574,0.00034798964,0.00056249136,0.0012848116,0.0006791283,0.0010873553,0.0013218033],"category_scores_gemma":[0.0033420844,0.0006039134,0.00020171415,0.0005535809,0.0007552685,0.0012398803,0.0008282137,0.0007339784,0.00035330755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012809281,0.00014140885,0.0018174016,0.0002838162,0.00007560989,0.00087973446,0.0005997963,0.75180084,0.06441227,0.10414053,0.0016554497,0.072912246],"study_design_scores_gemma":[0.000113569404,0.0002615278,0.00031894704,0.000017891947,0.000043522214,0.00027299617,0.00008593566,0.97166,0.008522987,0.017895093,0.00076960307,0.00003793889],"about_ca_topic_score_codex":0.00086789334,"about_ca_topic_score_gemma":0.0015906026,"teacher_disagreement_score":0.0013218033,"about_ca_system_score_codex":0.0005150835,"about_ca_system_score_gemma":0.00087708666,"threshold_uncertainty_score":0.005756378},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034852974,0.0007410937,0.9608177,0.00024320844,0.000044263637,0.000027633883,0.000024835714,0.0002116656,0.0030366734],"genre_scores_gemma":[0.9084913,0.0006826763,0.08886766,0.00014305336,0.00005183639,0.000051298768,0.000033584758,0.000020880334,0.0016576906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942636,0.00014561022,0.000031500927,0.00009563641,0.00024277753,0.0000581776],"domain_scores_gemma":[0.99893314,0.00063065876,0.00010597343,0.000120920246,0.00016398371,0.000045354038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000704729,0.00033413747,0.0005016477,0.0004094968,0.0002478945,0.0005574806,0.00051490753,0.0005625477,0.00031413054],"category_scores_gemma":[0.0027987596,0.00017968759,0.00023258437,0.00050787174,0.0008227724,0.00091535255,0.00082733424,0.00053092535,0.00014099719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023682407,0.00009365086,0.0008033241,0.0003169024,0.000064759406,0.00037398498,0.00040536767,0.44696635,0.13041998,0.2505277,0.0025805212,0.1672106],"study_design_scores_gemma":[0.000026461292,0.00018417664,0.00017801285,0.000018388537,0.000014131853,0.00026352966,0.000033904336,0.9085768,0.016721891,0.07202046,0.0019415935,0.0000205837],"about_ca_topic_score_codex":0.00028532554,"about_ca_topic_score_gemma":0.00028808165,"teacher_disagreement_score":0.000704729,"about_ca_system_score_codex":0.00048983586,"about_ca_system_score_gemma":0.00047752375,"threshold_uncertainty_score":0.0037270188},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01872938,0.00096551375,0.9755172,0.00035309076,0.000040461193,0.00002386063,0.000025512958,0.00007702916,0.0042680367],"genre_scores_gemma":[0.81634516,0.0018819355,0.17770189,0.00012816602,0.00026301097,0.00015384854,0.00007710255,0.00011822374,0.003330635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986481,0.000644916,0.000043281663,0.00012488612,0.00040778436,0.00013104614],"domain_scores_gemma":[0.9971945,0.0019356362,0.00025899019,0.0003018961,0.00026586626,0.000042972148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025996184,0.0007677232,0.0006718404,0.0007323913,0.00042104718,0.0011706047,0.0007354666,0.0007791693,0.00075938395],"category_scores_gemma":[0.0069122226,0.0003421176,0.00048608342,0.0016384029,0.0014253041,0.0023034478,0.0008659826,0.0010209214,0.00019068475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007768178,0.000057068162,0.0005179549,0.000075467025,0.000035611472,0.000036951755,0.000062421444,0.8093267,0.0036977387,0.14315604,0.00072542543,0.04223091],"study_design_scores_gemma":[0.000007764555,0.000047663707,0.00022915394,0.000014091098,0.000011572123,0.00002651008,0.000016466875,0.942628,0.0026395728,0.053484555,0.0008844805,0.000010153513],"about_ca_topic_score_codex":0.0015169125,"about_ca_topic_score_gemma":0.0011181398,"teacher_disagreement_score":0.0025996184,"about_ca_system_score_codex":0.0013503876,"about_ca_system_score_gemma":0.001406742,"threshold_uncertainty_score":0.013748229},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11372962,0.000619948,0.87779385,0.00010977016,0.000033774897,0.00005844188,0.00007675378,0.00023918955,0.0073386985],"genre_scores_gemma":[0.9342827,0.0004287584,0.06339585,0.000026630756,0.000033438402,0.000061664025,0.000040716255,0.000008532312,0.001721659],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994936,0.00014053562,0.00003583981,0.00007875893,0.00018112473,0.00007010031],"domain_scores_gemma":[0.9988005,0.0005987384,0.00020648623,0.00015713036,0.00020235691,0.00003468098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065296993,0.0007965242,0.00055817823,0.00047084125,0.00048246302,0.0010106633,0.0006854368,0.0005635819,0.00068149704],"category_scores_gemma":[0.0021852623,0.00030166312,0.00032195853,0.00074466167,0.0005152745,0.000882442,0.00065411004,0.00042290983,0.00023427785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045677385,0.00014359875,0.0047315517,0.00024068133,0.00012153444,0.0009869925,0.00042450038,0.7893893,0.026403522,0.052877877,0.0010709794,0.12315269],"study_design_scores_gemma":[0.000019855437,0.00012036267,0.00031641283,0.000009837566,0.00003255768,0.000504208,0.000047565536,0.9874786,0.0029271499,0.0076583163,0.0008691464,0.000015888152],"about_ca_topic_score_codex":0.0012180987,"about_ca_topic_score_gemma":0.002148305,"teacher_disagreement_score":0.0012180987,"about_ca_system_score_codex":0.00055276207,"about_ca_system_score_gemma":0.0006093697,"threshold_uncertainty_score":0.004010558},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011271101,0.0001406001,0.98787093,0.000039529696,0.000012246406,0.000019899824,0.000006613955,0.000070254704,0.0005687726],"genre_scores_gemma":[0.6882735,0.00032186677,0.30942708,0.000061148494,0.000048183578,0.00013107427,0.000040550425,0.000018704312,0.0016778897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940073,0.0002749315,0.000021477754,0.00011331487,0.00013555275,0.00005399661],"domain_scores_gemma":[0.9993309,0.00039541465,0.00008207001,0.000097562275,0.00006923085,0.00002492104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007673344,0.00048596808,0.00082444045,0.00028625794,0.0005173879,0.00050086144,0.0009206197,0.00055227807,0.0007039825],"category_scores_gemma":[0.0016083599,0.00024624082,0.00025481757,0.0005238226,0.00062037585,0.00089871953,0.0008500321,0.0004890898,0.00027883105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022788861,0.00014823282,0.00094882795,0.0001366202,0.00005263543,0.00033596312,0.00028552275,0.72405976,0.01928489,0.049092628,0.0019451855,0.20348187],"study_design_scores_gemma":[0.0000255132,0.00008331206,0.00009543397,0.0000034682218,0.000009090343,0.00011098209,0.000028285955,0.9870662,0.0028970467,0.008754065,0.00091751793,0.0000090390095],"about_ca_topic_score_codex":0.00047133543,"about_ca_topic_score_gemma":0.0007229952,"teacher_disagreement_score":0.0009206197,"about_ca_system_score_codex":0.00034686152,"about_ca_system_score_gemma":0.0005799587,"threshold_uncertainty_score":0.0040581226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054531273,0.0012660022,0.93702996,0.00042212752,0.000047062564,0.000059840673,0.000065812244,0.00011934802,0.006458613],"genre_scores_gemma":[0.9584386,0.0009487165,0.037950166,0.00005056717,0.000045808665,0.0000793859,0.000034230376,0.000030991137,0.002421683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990314,0.0004868525,0.000037154758,0.00011262497,0.00018780166,0.00014411165],"domain_scores_gemma":[0.99842715,0.0010698495,0.00019582153,0.00008460716,0.0001760577,0.000046644018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014424016,0.0012294463,0.001167479,0.0005400919,0.0005245036,0.0013013484,0.0007732276,0.0010583038,0.0020778864],"category_scores_gemma":[0.004063938,0.0005481105,0.00044357794,0.00077675213,0.0013047135,0.0014165537,0.0010730354,0.00085721957,0.0005231024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008656859,0.000021688906,0.00020205943,0.00007573595,0.000026255419,0.00014908865,0.00009333341,0.9523238,0.0021440384,0.036653653,0.0004574847,0.007766426],"study_design_scores_gemma":[0.000015182847,0.000021083717,0.00003065107,0.0000039892802,0.0000051155807,0.00001904657,0.000016944507,0.99125165,0.00035906723,0.008092357,0.00018004156,0.000004835922],"about_ca_topic_score_codex":0.0021378968,"about_ca_topic_score_gemma":0.0016164675,"teacher_disagreement_score":0.0021378968,"about_ca_system_score_codex":0.0012736043,"about_ca_system_score_gemma":0.00081394153,"threshold_uncertainty_score":0.009240687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.693729,0.002735068,0.287304,0.0008644438,0.00007959149,0.000056498917,0.0006218317,0.0005815782,0.014028069],"genre_scores_gemma":[0.9947731,0.00033797108,0.0042329165,0.000034022076,0.000026178735,0.000016928394,0.00009830625,0.000018372724,0.0004621626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651176,0.0013346549,0.00018880391,0.00030855258,0.0009403105,0.0007159696],"domain_scores_gemma":[0.9686628,0.025982758,0.0022009916,0.0010108859,0.0017715427,0.00037092972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004319744,0.0012494856,0.0018965129,0.00096548814,0.0008843603,0.0015568065,0.0009866758,0.0016226734,0.0010938201],"category_scores_gemma":[0.019407552,0.0005764837,0.00054366345,0.001267026,0.0025126212,0.0018352005,0.001585534,0.0007931806,0.0002331592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011721082,0.00005879211,0.006803835,0.00022909069,0.00014283779,0.0012995845,0.00033647005,0.95042574,0.0075988593,0.017570857,0.0008919001,0.013469929],"study_design_scores_gemma":[0.000047897047,0.000233283,0.0030960082,0.00003369509,0.00011992575,0.00093533896,0.00014280176,0.9795163,0.0055766352,0.009928271,0.00030946918,0.000060381582],"about_ca_topic_score_codex":0.0038787185,"about_ca_topic_score_gemma":0.002376017,"teacher_disagreement_score":0.004319744,"about_ca_system_score_codex":0.0019135698,"about_ca_system_score_gemma":0.0013991792,"threshold_uncertainty_score":0.022845268},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054426815,0.0022031008,0.93032855,0.0011713749,0.000079155434,0.00007410302,0.00009259619,0.00014303483,0.011481269],"genre_scores_gemma":[0.9416699,0.0012161377,0.0531157,0.00015507218,0.00007954762,0.0001481234,0.000059827522,0.000058728234,0.003496921],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982911,0.0009093222,0.000054903405,0.00020513077,0.00029483333,0.0002448267],"domain_scores_gemma":[0.997118,0.0023108246,0.00019988748,0.00010092949,0.00017696928,0.000093284354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019341002,0.00080323854,0.0011830437,0.0006652169,0.0005641024,0.0016299,0.0009622483,0.0012594837,0.0016611946],"category_scores_gemma":[0.006464592,0.00070291763,0.000319343,0.0012042687,0.001596248,0.0014616436,0.0013210638,0.0008778337,0.00021944099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004195672,0.000022707243,0.00018186361,0.00005338206,0.000020739659,0.00006762156,0.000043274078,0.9316953,0.0005868514,0.05869579,0.00071264204,0.007877907],"study_design_scores_gemma":[0.000020982368,0.000018325212,0.00007883617,0.000007768594,0.000005424072,0.000018398461,0.000021877653,0.9506286,0.00018624989,0.048438884,0.0005677184,0.000006963185],"about_ca_topic_score_codex":0.0027726935,"about_ca_topic_score_gemma":0.0017942777,"teacher_disagreement_score":0.0027726935,"about_ca_system_score_codex":0.0021292707,"about_ca_system_score_gemma":0.0013945379,"threshold_uncertainty_score":0.015449047},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049397044,0.0028135737,0.9309057,0.0005643549,0.0000957109,0.000054579436,0.000100327896,0.0003091572,0.015759584],"genre_scores_gemma":[0.9457855,0.0020213143,0.04840185,0.00021771481,0.00011251419,0.000072704504,0.000046774156,0.000030986586,0.003310616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992065,0.00027504328,0.00003786018,0.00012528361,0.00018882798,0.0001665829],"domain_scores_gemma":[0.9981981,0.00091652176,0.00020859936,0.000412305,0.00019646171,0.000068066634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011156858,0.00074849505,0.00083819946,0.00063382694,0.0008079277,0.0010916101,0.0008818898,0.00087271386,0.0015507356],"category_scores_gemma":[0.0044504516,0.00025241647,0.00050926255,0.0007981707,0.0017484674,0.0021063997,0.0019695754,0.00080949167,0.00032521685],"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.00008835897,0.000019100366,0.0003113288,0.00019052894,0.000032892345,0.00037450364,0.0003609153,0.14354989,0.0048143454,0.80881345,0.001773246,0.039671496],"study_design_scores_gemma":[0.000023769864,0.00010414518,0.00020875162,0.000065885244,0.00006278599,0.0007592431,0.00009886444,0.6084825,0.0030184248,0.37876326,0.00836696,0.000045456152],"about_ca_topic_score_codex":0.0015341026,"about_ca_topic_score_gemma":0.0014901651,"teacher_disagreement_score":0.0015507356,"about_ca_system_score_codex":0.0012627924,"about_ca_system_score_gemma":0.0008855526,"threshold_uncertainty_score":0.009162307},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113155365,0.0008628813,0.87954,0.00027278918,0.00004159374,0.0000342038,0.00007026146,0.00013076069,0.0058921203],"genre_scores_gemma":[0.9587147,0.00090353115,0.038657002,0.000050032842,0.000024053204,0.00003538557,0.000042749143,0.000024908353,0.0015476336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999433,0.00026864055,0.000015500176,0.00005651423,0.00016521463,0.00006105508],"domain_scores_gemma":[0.99835,0.001259266,0.00014014072,0.000094472474,0.00012907636,0.00002694199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00103117,0.00071310997,0.0006339889,0.00035893315,0.00023812563,0.00060203526,0.0005017675,0.00060941034,0.0007059591],"category_scores_gemma":[0.0036505263,0.00022434663,0.00038726287,0.00056652736,0.0010138995,0.00094594894,0.000812449,0.0005446253,0.0001415927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006838433,0.000009899288,0.0002129133,0.000044740238,0.000017025715,0.00010875885,0.000045947778,0.9675743,0.0033445533,0.022026611,0.0001473743,0.00639935],"study_design_scores_gemma":[0.0000031800787,0.000023910441,0.000056235833,0.0000033446431,0.0000038316625,0.000022059243,0.000008594781,0.9958127,0.00087015575,0.003093551,0.00009761904,0.00000477538],"about_ca_topic_score_codex":0.0018421971,"about_ca_topic_score_gemma":0.0015211413,"teacher_disagreement_score":0.0018421971,"about_ca_system_score_codex":0.0008292245,"about_ca_system_score_gemma":0.00042231803,"threshold_uncertainty_score":0.0060164332},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03336369,0.001778747,0.95682484,0.0006600245,0.00014743565,0.00013373696,0.000093770876,0.00024447637,0.0067531937],"genre_scores_gemma":[0.7299465,0.0029758373,0.26124018,0.00032971008,0.00042864602,0.00026900554,0.00020250604,0.000108804525,0.004498858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997971,0.00094032247,0.00007325162,0.00022348146,0.0004374935,0.00035449277],"domain_scores_gemma":[0.9957795,0.0033097642,0.0003549418,0.00020870152,0.0002564843,0.00009058083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023240314,0.0009917454,0.0015734349,0.00060382043,0.0011846963,0.0016057465,0.0012677865,0.0009669736,0.0016442037],"category_scores_gemma":[0.0056808977,0.0005667703,0.0006097758,0.0019417384,0.0014347873,0.0019256859,0.0011047391,0.0012328242,0.0003426642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118691365,0.000064472944,0.00023542254,0.00014625206,0.000027718599,0.00010033647,0.00008236052,0.9265336,0.0013112483,0.043357916,0.0019762681,0.02604576],"study_design_scores_gemma":[0.000031668365,0.00003402241,0.000069462396,0.000007192382,0.0000097917,0.000033985703,0.00003335532,0.9754826,0.0005937534,0.02275734,0.000938852,0.000008001499],"about_ca_topic_score_codex":0.0066763423,"about_ca_topic_score_gemma":0.005451071,"teacher_disagreement_score":0.0066763423,"about_ca_system_score_codex":0.0020394167,"about_ca_system_score_gemma":0.002521038,"threshold_uncertainty_score":0.0147970915},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6245058,0.002352592,0.30875874,0.0017219369,0.00013033704,0.00019188088,0.0019247314,0.0006001138,0.059813816],"genre_scores_gemma":[0.99203205,0.00069797796,0.00491861,0.00009151829,0.00008642305,0.000099250305,0.00026065367,0.000031077485,0.0017824384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984126,0.0003819838,0.000047642196,0.00023811105,0.00045657303,0.00046315658],"domain_scores_gemma":[0.99414474,0.0041658687,0.0004944775,0.0005051452,0.00045107334,0.00023879603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014617661,0.0008455503,0.00097510876,0.0013890186,0.0010478782,0.0032328411,0.0013484868,0.00096989743,0.0038031533],"category_scores_gemma":[0.007041636,0.00028678516,0.00052070507,0.0013000532,0.0023268478,0.002810685,0.0014712653,0.0013160914,0.00047658762],"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.0003774926,0.000069415095,0.0009178146,0.00015377502,0.000051415376,0.00031340247,0.000409629,0.16825376,0.0056627947,0.8031801,0.0038560266,0.016754406],"study_design_scores_gemma":[0.00006152355,0.00007251078,0.00046766567,0.00005652835,0.000032630254,0.0003565442,0.00012702092,0.5451736,0.0038584832,0.4452334,0.004509254,0.000050761217],"about_ca_topic_score_codex":0.0014712806,"about_ca_topic_score_gemma":0.0005070369,"teacher_disagreement_score":0.0038031533,"about_ca_system_score_codex":0.0017425001,"about_ca_system_score_gemma":0.0011102521,"threshold_uncertainty_score":0.01272285},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030485202,0.0012023785,0.96584177,0.00015770156,0.00008800028,0.000056445675,0.0000290838,0.00032401184,0.0018154324],"genre_scores_gemma":[0.87292033,0.0012151637,0.12334274,0.00015947508,0.000107120846,0.00013757947,0.0000746409,0.000018040682,0.0020249032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993554,0.0002325315,0.00003462296,0.00012412245,0.00018586931,0.000067467416],"domain_scores_gemma":[0.9993794,0.0002625381,0.00009595889,0.00008978614,0.00014351451,0.000028788872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006755428,0.00062821107,0.0005412852,0.00042789424,0.0005076992,0.00046302535,0.0011529614,0.00045086644,0.00065861613],"category_scores_gemma":[0.0016298952,0.00016785445,0.00035436268,0.000646923,0.00048406172,0.0007886795,0.00071449636,0.00047414936,0.00028333228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000492367,0.00015573416,0.0028181197,0.00059345074,0.00020165909,0.0011708,0.0008125842,0.41220888,0.08749436,0.089162946,0.0048372364,0.40005192],"study_design_scores_gemma":[0.000058311914,0.00035510506,0.0004290065,0.000019464953,0.00007916207,0.0006233905,0.000060987117,0.9708118,0.0077247676,0.013249038,0.0065530417,0.000035807057],"about_ca_topic_score_codex":0.00072417024,"about_ca_topic_score_gemma":0.0008010307,"teacher_disagreement_score":0.0011529614,"about_ca_system_score_codex":0.0003653942,"about_ca_system_score_gemma":0.000372002,"threshold_uncertainty_score":0.0035726428},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034616324,0.0001606263,0.99573684,0.000039284525,0.000009939961,0.000010006291,0.00001085162,0.0000449897,0.00052586803],"genre_scores_gemma":[0.6298322,0.00088245375,0.3668016,0.00013080165,0.00006766565,0.00016924426,0.000073354466,0.00003098302,0.002011695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994702,0.00020328262,0.00002532071,0.000083731175,0.00017632787,0.000041113602],"domain_scores_gemma":[0.9994419,0.00027402065,0.00009201916,0.00005664305,0.00011881948,0.00001659872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072016614,0.00084218517,0.0006468068,0.00027490643,0.00022064803,0.000532262,0.00077843753,0.00074544764,0.0008819876],"category_scores_gemma":[0.0015022219,0.00027744524,0.00041616271,0.0004638713,0.00048335397,0.0007785551,0.0005432625,0.0005502055,0.00037922038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013111484,0.000046296725,0.0003407249,0.0002496986,0.000078742116,0.00014833048,0.000114084134,0.8143157,0.04685665,0.033358093,0.001166229,0.103194244],"study_design_scores_gemma":[0.000009474794,0.00007224061,0.000054400323,0.0000070475385,0.000010653296,0.00004553964,0.000009212857,0.9929705,0.003121095,0.0029145929,0.0007759224,0.000009462235],"about_ca_topic_score_codex":0.0006306974,"about_ca_topic_score_gemma":0.0006812863,"teacher_disagreement_score":0.0008819876,"about_ca_system_score_codex":0.00033671936,"about_ca_system_score_gemma":0.0004187041,"threshold_uncertainty_score":0.0038086772},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010277613,0.000600633,0.9876423,0.00010429779,0.00002593146,0.000019421988,0.00004071134,0.00034958028,0.00093937555],"genre_scores_gemma":[0.7284259,0.0016640156,0.2668744,0.00013922848,0.000131121,0.000092116425,0.00024287228,0.00008927294,0.002341098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990742,0.0003905338,0.00005174435,0.0001252202,0.00029138156,0.000066854336],"domain_scores_gemma":[0.99719965,0.0018182629,0.0003019912,0.00024169919,0.0004000783,0.000038289298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013644912,0.000993282,0.0009484808,0.0006793358,0.00034669027,0.00092038204,0.00088332186,0.0006796978,0.0009928548],"category_scores_gemma":[0.0066528628,0.0004844841,0.00047506887,0.00071511214,0.0006755924,0.0021396412,0.0008426339,0.0009471231,0.0004417131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022548021,0.000038822538,0.0008522465,0.00022338015,0.00007132962,0.00016831317,0.00014707385,0.8558625,0.0097169895,0.010887634,0.001036118,0.12077006],"study_design_scores_gemma":[0.0000061799974,0.000026710055,0.0001761536,0.000010339663,0.000012211297,0.000054760076,0.000013956861,0.99437535,0.002398241,0.002574486,0.00033996438,0.000011547419],"about_ca_topic_score_codex":0.002661376,"about_ca_topic_score_gemma":0.0032614481,"teacher_disagreement_score":0.002661376,"about_ca_system_score_codex":0.00065376505,"about_ca_system_score_gemma":0.00092458504,"threshold_uncertainty_score":0.0072161555},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09032023,0.0013156612,0.90503377,0.00022565019,0.00012572242,0.000046041216,0.000037685197,0.00014017688,0.0027550685],"genre_scores_gemma":[0.9413777,0.00047526933,0.056512654,0.00007066525,0.00007608429,0.000054147404,0.000037588994,0.000030304962,0.0013656509],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993013,0.00035938542,0.000024571835,0.000097279284,0.00012618105,0.00009131773],"domain_scores_gemma":[0.9988164,0.00068625115,0.00015380849,0.00009398736,0.00018124885,0.000068304136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016960624,0.0006832213,0.00065406424,0.00029645074,0.0005255468,0.0010019414,0.0006326791,0.0004900248,0.0011996523],"category_scores_gemma":[0.0023194752,0.00036053985,0.00033259857,0.00048360883,0.0006316834,0.00080799044,0.0008218051,0.00061822915,0.00022639615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009954602,0.00005977209,0.00044908188,0.000050777235,0.00003872419,0.00014091826,0.00006992718,0.9602464,0.004436817,0.016932108,0.0006339069,0.016842017],"study_design_scores_gemma":[0.000008403658,0.000023996115,0.000065507294,0.0000016494058,0.0000063683997,0.000016348175,0.0000099859135,0.99697244,0.0006122476,0.0020462973,0.00023365802,0.0000031569066],"about_ca_topic_score_codex":0.002186112,"about_ca_topic_score_gemma":0.0022006365,"teacher_disagreement_score":0.002186112,"about_ca_system_score_codex":0.0009443482,"about_ca_system_score_gemma":0.0011451686,"threshold_uncertainty_score":0.008969784},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20171246,0.0013198756,0.79267615,0.00016550622,0.000044029828,0.000052134652,0.00012063672,0.0003494953,0.003559566],"genre_scores_gemma":[0.9766526,0.0003827021,0.022386339,0.000019799894,0.000008517551,0.000033267228,0.00003592054,0.000013183462,0.00046763173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872714,0.00054647675,0.00005188507,0.00008961551,0.00037273194,0.00021204233],"domain_scores_gemma":[0.99404824,0.0041742506,0.0005134379,0.00039577115,0.0007215241,0.00014669573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020882285,0.0010884305,0.00097426,0.0006523497,0.00037289923,0.0010450338,0.00075601484,0.00068673794,0.0007333223],"category_scores_gemma":[0.0060429727,0.0002901625,0.00046397085,0.0010267313,0.0011117709,0.0013817068,0.0013334875,0.0006667494,0.00016955101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012290072,0.000016010705,0.0003718749,0.000056584086,0.000038980197,0.00011228315,0.00006729396,0.97171694,0.004060012,0.016195875,0.0001282737,0.0071129925],"study_design_scores_gemma":[0.000010671957,0.000037523183,0.00008373085,0.0000056810486,0.000012519835,0.00003803453,0.000011401505,0.9936026,0.0019073491,0.0041705533,0.00010893299,0.000011055039],"about_ca_topic_score_codex":0.0031633377,"about_ca_topic_score_gemma":0.0020238862,"teacher_disagreement_score":0.0031633377,"about_ca_system_score_codex":0.0012205105,"about_ca_system_score_gemma":0.000799595,"threshold_uncertainty_score":0.011043787},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01265123,0.00043235833,0.98102415,0.00017136386,0.000033970922,0.000034288103,0.0000089250825,0.00003940681,0.0056042676],"genre_scores_gemma":[0.8562802,0.0010621436,0.13792123,0.000113893526,0.000084126026,0.00019840531,0.000017804256,0.00003628219,0.004286035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974915,0.0015802862,0.00007411298,0.000258846,0.00041633545,0.0001789846],"domain_scores_gemma":[0.9987332,0.000886063,0.00012796363,0.000100998164,0.00010221043,0.00004952397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029949995,0.0008162911,0.0010920699,0.00061875174,0.00091129605,0.0015272689,0.0016369107,0.0012678608,0.0017624191],"category_scores_gemma":[0.0040294817,0.0004747572,0.0006388172,0.0011443262,0.0019274657,0.0027945917,0.00161871,0.001064348,0.0004090651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010319979,0.00003570509,0.00026445766,0.00008562804,0.00004516181,0.000308538,0.0002656519,0.6891874,0.0038402844,0.28517509,0.0005274176,0.020161433],"study_design_scores_gemma":[0.000021524624,0.000035236357,0.000041427527,0.00001060078,0.000010676874,0.00005732908,0.000043904245,0.9158578,0.0006916926,0.082062155,0.0011551542,0.000012520527],"about_ca_topic_score_codex":0.0006560845,"about_ca_topic_score_gemma":0.00052511937,"teacher_disagreement_score":0.0029949995,"about_ca_system_score_codex":0.0011809275,"about_ca_system_score_gemma":0.0005898943,"threshold_uncertainty_score":0.015839279},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008690921,0.00024791158,0.98816526,0.00012120859,0.000032182972,0.00003307717,0.000035302222,0.000063043786,0.0026110818],"genre_scores_gemma":[0.8492789,0.0009434379,0.14425528,0.00011899786,0.000081016646,0.00021531481,0.00009466152,0.000027516986,0.0049848426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994672,0.00021106559,0.000019089064,0.0001034077,0.00014531249,0.000053973996],"domain_scores_gemma":[0.9994979,0.00025100377,0.000089775895,0.000034468267,0.000103710125,0.00002327274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063478394,0.0008560814,0.0006310666,0.00029475446,0.0003848422,0.0007910983,0.000761509,0.0008624776,0.0019213138],"category_scores_gemma":[0.0014539799,0.00030754684,0.0003638453,0.0006822711,0.00045772042,0.00094359583,0.00053533696,0.00068392203,0.00046405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055915025,0.000037348636,0.00023434016,0.0001032328,0.000021392118,0.00014737408,0.00006259702,0.9365409,0.0081105055,0.03007449,0.00075869315,0.02385325],"study_design_scores_gemma":[0.000008990595,0.000040026185,0.000063652355,0.0000037913903,0.000005587373,0.000025822696,0.000010550277,0.9940714,0.0004620412,0.0047878856,0.00051502534,0.000005196182],"about_ca_topic_score_codex":0.0016103949,"about_ca_topic_score_gemma":0.0026194756,"teacher_disagreement_score":0.0019213138,"about_ca_system_score_codex":0.00078685535,"about_ca_system_score_gemma":0.0005695959,"threshold_uncertainty_score":0.006427467},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27832037,0.009555265,0.5516316,0.021108499,0.0018254615,0.0004758893,0.008396714,0.0060686185,0.12261753],"genre_scores_gemma":[0.8681781,0.0037970466,0.10412313,0.0019143573,0.0018671341,0.000800436,0.0043127276,0.0009088181,0.01409815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935854,0.0015228573,0.0001950813,0.0009893067,0.0023139396,0.0013934063],"domain_scores_gemma":[0.94919324,0.037352487,0.001964694,0.007158206,0.0028680416,0.001463329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047189444,0.0024688095,0.0018175876,0.0021873636,0.0015446071,0.0039931694,0.003837969,0.0022662997,0.011573691],"category_scores_gemma":[0.041514497,0.0012879573,0.0015067288,0.0021671287,0.0036583045,0.010199095,0.005304868,0.006334646,0.0037693777],"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.004011449,0.00076618197,0.007103384,0.001315373,0.00027640615,0.0010280367,0.00096705236,0.30331227,0.05060349,0.42281678,0.080321595,0.12747797],"study_design_scores_gemma":[0.00021994032,0.00029805355,0.0016986621,0.00021764846,0.00011454379,0.00041948757,0.00017524874,0.6108712,0.01561714,0.35998625,0.010260435,0.000121504876],"about_ca_topic_score_codex":0.0026096161,"about_ca_topic_score_gemma":0.0038926643,"teacher_disagreement_score":0.011573691,"about_ca_system_score_codex":0.003756138,"about_ca_system_score_gemma":0.004020364,"threshold_uncertainty_score":0.038717866},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0775764,0.00043402394,0.9143455,0.00032604102,0.000025977302,0.000029190194,0.000029894676,0.00004565677,0.0071873716],"genre_scores_gemma":[0.95911753,0.00034693177,0.03744961,0.000069377755,0.000021076226,0.000050229788,0.000015310572,0.000018061644,0.0029118636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997595,0.000090160655,0.0000054520933,0.000041474985,0.00006182838,0.00004157407],"domain_scores_gemma":[0.9997068,0.00020016081,0.0000386898,0.000011672688,0.00003174252,0.000010878585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004900839,0.00057073904,0.0005284431,0.0002803772,0.00030832397,0.0007380933,0.00039238873,0.0007527694,0.00080693205],"category_scores_gemma":[0.0012126992,0.0002250223,0.00029915938,0.0003709249,0.0006730263,0.0007613926,0.00048583033,0.0004731407,0.000106520754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000684808,0.000047326816,0.00027325368,0.00005929679,0.000016122329,0.0001495373,0.000121260666,0.93193513,0.006136104,0.043460872,0.00045254044,0.017280083],"study_design_scores_gemma":[0.000007641975,0.000024770035,0.000051044124,0.0000029508496,0.000004668176,0.000019004003,0.000024399364,0.98931736,0.00083484786,0.009381534,0.00032803437,0.0000038035341],"about_ca_topic_score_codex":0.0019635267,"about_ca_topic_score_gemma":0.0017446912,"teacher_disagreement_score":0.0019635267,"about_ca_system_score_codex":0.00081246183,"about_ca_system_score_gemma":0.0005599895,"threshold_uncertainty_score":0.00589478},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5474807,0.000652161,0.4456151,0.0002820868,0.000052138133,0.000048124704,0.000038794948,0.00011633896,0.0057145576],"genre_scores_gemma":[0.9881942,0.00015100239,0.010762245,0.000019589701,0.000013980756,0.00001259719,0.000008333487,0.0000025999836,0.00083530176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999548,0.00013458173,0.000023575372,0.00007608656,0.00014314913,0.000074590585],"domain_scores_gemma":[0.99844617,0.0008769335,0.0002561441,0.00014414002,0.00024041228,0.00003626271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007386362,0.00057232426,0.00061168155,0.0002624722,0.0004586588,0.0007633167,0.0005985079,0.0008521947,0.0002842693],"category_scores_gemma":[0.001704036,0.00023928772,0.00022736962,0.00039859762,0.0005388568,0.00078877195,0.00065100973,0.00034712997,0.00013369038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010528922,0.00020720874,0.007530535,0.00037045212,0.00024734144,0.003315732,0.0009049928,0.6688823,0.17794646,0.04099124,0.0009771633,0.09757367],"study_design_scores_gemma":[0.000029524455,0.00036603617,0.00084655604,0.000011364806,0.000079587204,0.0007377079,0.00015486004,0.9689214,0.021731762,0.005853581,0.0012447858,0.000022780509],"about_ca_topic_score_codex":0.000820663,"about_ca_topic_score_gemma":0.0010034518,"teacher_disagreement_score":0.0008521947,"about_ca_system_score_codex":0.00034539145,"about_ca_system_score_gemma":0.00036174123,"threshold_uncertainty_score":0.0039063096},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11138712,0.004109119,0.8708639,0.00040933312,0.00006396214,0.000039165217,0.000084442756,0.00009388082,0.012949093],"genre_scores_gemma":[0.9597901,0.0023327256,0.03408242,0.00007597618,0.000054771317,0.00003366565,0.00003662319,0.00001075311,0.0035829586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997867,0.00009436549,0.000004681445,0.00002647034,0.00006138026,0.000026442987],"domain_scores_gemma":[0.99942243,0.00039856366,0.00005524684,0.00005124689,0.000060975002,0.000011446784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048479988,0.0003007878,0.00029220516,0.00020932511,0.0002512656,0.0004996863,0.00027942983,0.00039472064,0.0010026786],"category_scores_gemma":[0.0011692541,0.00010961808,0.00022433614,0.0002704459,0.00052168925,0.0007692075,0.0003150528,0.000412902,0.00018401147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009322921,0.00002725724,0.00037549488,0.00019498204,0.000030575608,0.00033342058,0.0002559044,0.5485773,0.022053113,0.39432064,0.0012245141,0.032513533],"study_design_scores_gemma":[0.000007197207,0.00007172154,0.00020739624,0.000011514571,0.000010784811,0.00017807409,0.000032049345,0.95032024,0.002633605,0.044052757,0.0024593403,0.000015329271],"about_ca_topic_score_codex":0.0009715553,"about_ca_topic_score_gemma":0.00085004506,"teacher_disagreement_score":0.0010026786,"about_ca_system_score_codex":0.0005665114,"about_ca_system_score_gemma":0.00034640517,"threshold_uncertainty_score":0.0041103363},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20061637,0.0018378387,0.7373487,0.0015233783,0.00015672526,0.00007232759,0.00080378895,0.00051421666,0.05712668],"genre_scores_gemma":[0.97054267,0.0011139975,0.018771498,0.0001861437,0.00015692071,0.00009607496,0.0004912641,0.000102793805,0.008538762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993774,0.00021444497,0.000023037092,0.0000700395,0.0002129694,0.00010215987],"domain_scores_gemma":[0.9955075,0.002991054,0.00027914552,0.00030421646,0.0007843773,0.000133641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014859948,0.001116956,0.00086214434,0.0008291237,0.0004569745,0.0016851536,0.00068184757,0.0011638486,0.003413611],"category_scores_gemma":[0.008942817,0.0006987279,0.0005407865,0.00092088245,0.0017726794,0.0019511712,0.0014330626,0.0011227379,0.00092351704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036305987,0.00010365659,0.0032305503,0.00030293575,0.000088754736,0.0007277117,0.00027494712,0.7429371,0.012333897,0.21732736,0.0036069138,0.01870314],"study_design_scores_gemma":[0.000016205318,0.00004162571,0.0017147501,0.000043299286,0.000020697073,0.00032697842,0.00008280163,0.94462585,0.0010053695,0.051661566,0.00043469027,0.00002617603],"about_ca_topic_score_codex":0.0015181147,"about_ca_topic_score_gemma":0.0018055642,"teacher_disagreement_score":0.003413611,"about_ca_system_score_codex":0.0008798862,"about_ca_system_score_gemma":0.0012232745,"threshold_uncertainty_score":0.0114197135},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031294988,0.0028735674,0.971037,0.001061321,0.0001487601,0.00009155967,0.00023039819,0.00014505403,0.021282874],"genre_scores_gemma":[0.52733773,0.016179204,0.42595154,0.0009420999,0.0010143985,0.0013266195,0.0010566147,0.00043995059,0.025751736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861515,0.0006225067,0.00006749624,0.00025917965,0.00030458986,0.00013100184],"domain_scores_gemma":[0.99718744,0.0020459245,0.0002126341,0.0001740418,0.00027637582,0.000103503255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020662192,0.0019863492,0.0014365619,0.001307858,0.0007660737,0.0019779962,0.0015777444,0.0017186947,0.006896865],"category_scores_gemma":[0.0068471525,0.0007210472,0.0009013278,0.0023652113,0.0026056538,0.00230656,0.0022505173,0.0019510457,0.0009414644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045038705,0.000017692244,0.00015535619,0.00018668291,0.00004715539,0.00012395246,0.00007339879,0.64147794,0.00050984195,0.32871822,0.0040446795,0.02460001],"study_design_scores_gemma":[0.000022933833,0.000039370945,0.00008079302,0.000055517216,0.00001548056,0.00004105464,0.000032668588,0.6441788,0.00029566715,0.34719315,0.008027292,0.000017279861],"about_ca_topic_score_codex":0.0060988134,"about_ca_topic_score_gemma":0.0044454136,"teacher_disagreement_score":0.006896865,"about_ca_system_score_codex":0.0025639883,"about_ca_system_score_gemma":0.0018673571,"threshold_uncertainty_score":0.023072302},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07949856,0.0025003797,0.8497847,0.00095481303,0.000085983025,0.0001124436,0.00026449724,0.0002671925,0.06653143],"genre_scores_gemma":[0.96801066,0.00197202,0.019241165,0.0002011254,0.00013727599,0.00011443321,0.00010762602,0.000114508104,0.010101206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916923,0.00023317718,0.00001838064,0.00006965479,0.00036238116,0.00014732832],"domain_scores_gemma":[0.99854964,0.0008717306,0.00016686601,0.00006861385,0.00029953924,0.000043560867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012929037,0.0009038924,0.00080379983,0.00071811804,0.00055859284,0.001470198,0.0009011839,0.0011145927,0.005454723],"category_scores_gemma":[0.0028696025,0.000476991,0.00082126615,0.0011203726,0.00092395715,0.0014002575,0.0007771956,0.0007542745,0.00070165336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006971993,0.000022029632,0.0008300848,0.00012383994,0.00006663237,0.00039398918,0.00017476312,0.88812464,0.0054272106,0.09515672,0.0012903127,0.008319996],"study_design_scores_gemma":[0.0000028473949,0.000019465855,0.0002302487,0.000011345955,0.000012955461,0.000092959446,0.000025089752,0.98958045,0.00037857526,0.009207933,0.00042921217,0.000008936664],"about_ca_topic_score_codex":0.0033505524,"about_ca_topic_score_gemma":0.0022867096,"teacher_disagreement_score":0.005454723,"about_ca_system_score_codex":0.0020204461,"about_ca_system_score_gemma":0.0007964821,"threshold_uncertainty_score":0.018247843},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034400433,0.0010487532,0.9574464,0.00037903537,0.000049958504,0.00005992728,0.000029695,0.00027491385,0.006310988],"genre_scores_gemma":[0.70477474,0.0014512077,0.2898715,0.00016154743,0.000090522124,0.0001766864,0.00008080119,0.00009515024,0.0032979776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99904805,0.00042610592,0.00003077529,0.000085556494,0.00035728456,0.00005226214],"domain_scores_gemma":[0.99753076,0.0017665807,0.000116006275,0.00021760742,0.0003088775,0.00006017064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014526151,0.00031305873,0.00041857877,0.0004380811,0.00062202505,0.00070183555,0.0007937851,0.00079670944,0.0013815771],"category_scores_gemma":[0.0051326086,0.00023748942,0.00021660971,0.0005416204,0.0017791163,0.0014989945,0.0009206667,0.00085602177,0.00030302166],"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.00016013383,0.00006700533,0.0006285286,0.00019451216,0.00001679899,0.00024476994,0.00037204157,0.5835377,0.022549596,0.31948343,0.001335764,0.07140962],"study_design_scores_gemma":[0.000020069285,0.000050472318,0.00009532791,0.000021631738,0.000005458985,0.00008561469,0.00003815912,0.91645205,0.0065486995,0.07366334,0.0030037512,0.000015487589],"about_ca_topic_score_codex":0.0022040086,"about_ca_topic_score_gemma":0.0014014596,"teacher_disagreement_score":0.0022040086,"about_ca_system_score_codex":0.0008521882,"about_ca_system_score_gemma":0.00085336925,"threshold_uncertainty_score":0.0076822042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1419944,0.0021765647,0.8375748,0.00030764876,0.000098328244,0.00006352461,0.000057045665,0.000447231,0.017280431],"genre_scores_gemma":[0.93024343,0.0009269719,0.06642154,0.000058124766,0.000058400863,0.000053487074,0.000044572815,0.000037708443,0.0021556513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945754,0.00017593913,0.000017868804,0.000041926607,0.00019348323,0.00011322571],"domain_scores_gemma":[0.9987041,0.0007036922,0.000101483565,0.0002485448,0.00021029326,0.000032012802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006915231,0.00058745674,0.00045268962,0.0008249973,0.00061501627,0.0005780678,0.0007664089,0.0005784161,0.0018648782],"category_scores_gemma":[0.0024298956,0.00013575229,0.00025440878,0.00082990824,0.00057277747,0.0012652611,0.0011111075,0.0005341178,0.0003816545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043884173,0.00016187724,0.0019466855,0.0003663825,0.00006557491,0.00047270235,0.00046001913,0.3868065,0.122759335,0.18771876,0.003733269,0.29507008],"study_design_scores_gemma":[0.00001810772,0.00013757922,0.00046135092,0.000035206493,0.000033227243,0.000393152,0.00008003891,0.93651676,0.03361851,0.022277592,0.0064000846,0.000028399689],"about_ca_topic_score_codex":0.00077009614,"about_ca_topic_score_gemma":0.00094201136,"teacher_disagreement_score":0.0018648782,"about_ca_system_score_codex":0.00057891797,"about_ca_system_score_gemma":0.0005031008,"threshold_uncertainty_score":0.0062386394},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008923257,0.00019122325,0.9887372,0.00016129356,0.00010601835,0.00005355008,0.000018694316,0.00043138323,0.001377246],"genre_scores_gemma":[0.5133457,0.00042309475,0.4823116,0.00030778509,0.00015281534,0.00027645158,0.00012779408,0.00012603078,0.00292876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994179,0.0001160752,0.000026310952,0.000059978986,0.00031028455,0.00006944751],"domain_scores_gemma":[0.9993167,0.000291953,0.000058175934,0.00007913171,0.00019826551,0.00005585635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069293816,0.0005236856,0.00054976915,0.00053120655,0.0005732559,0.00058655237,0.0013633994,0.00058094686,0.000999946],"category_scores_gemma":[0.002749487,0.00020420118,0.00019935507,0.0004195433,0.00065866037,0.0011367546,0.001256293,0.0011929856,0.0002894524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003989341,0.0001956942,0.001198311,0.00013418304,0.00004763087,0.00018296823,0.00021967842,0.4085905,0.029982751,0.06056311,0.007554807,0.49093148],"study_design_scores_gemma":[0.000021565464,0.00004072441,0.00006754982,0.0000051721836,0.000005330298,0.000045470155,0.00000813815,0.99036205,0.0031756398,0.0048668124,0.0013929554,0.000008606517],"about_ca_topic_score_codex":0.0027170004,"about_ca_topic_score_gemma":0.0020039845,"teacher_disagreement_score":0.0027170004,"about_ca_system_score_codex":0.0005675729,"about_ca_system_score_gemma":0.0015459756,"threshold_uncertainty_score":0.005402386},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049776632,0.0005063105,0.9459047,0.000103612416,0.000027321272,0.0000429429,0.000028745526,0.000121388795,0.0034883756],"genre_scores_gemma":[0.95558494,0.00027629884,0.042771157,0.000045243527,0.000022641521,0.00005350467,0.000020249523,0.000015308247,0.0012105764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949896,0.00022595243,0.000019774578,0.00007891477,0.000106073705,0.000070303],"domain_scores_gemma":[0.9991497,0.000493581,0.000102352664,0.000116311836,0.00010151946,0.000036607766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089708203,0.00064481416,0.00065601105,0.0003812025,0.0003916729,0.000746509,0.0011284299,0.00051045953,0.001447426],"category_scores_gemma":[0.0026134767,0.00021099388,0.00031837053,0.00066369766,0.00067973306,0.000887566,0.0008162596,0.0004380454,0.0002452675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008206971,0.000039420353,0.00030784114,0.000040804207,0.000034067645,0.00013573516,0.0000878909,0.9352282,0.0046780226,0.025165264,0.00055053545,0.033650164],"study_design_scores_gemma":[0.000012061307,0.000027552896,0.00007270875,0.0000029921152,0.000010028082,0.000029151577,0.00001267788,0.9917064,0.0006805511,0.0071460577,0.00029551785,0.0000045113893],"about_ca_topic_score_codex":0.0011347439,"about_ca_topic_score_gemma":0.0011835677,"teacher_disagreement_score":0.001447426,"about_ca_system_score_codex":0.00082549115,"about_ca_system_score_gemma":0.0003135967,"threshold_uncertainty_score":0.0059894323},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081011735,0.00034729968,0.91537905,0.00018109745,0.000017065824,0.00005190464,0.000077446995,0.000114684226,0.002819645],"genre_scores_gemma":[0.91756773,0.00041290364,0.07889941,0.00006521176,0.00003238991,0.000087410575,0.000055244524,0.000016306687,0.0028634064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993056,0.0003053049,0.00003480301,0.00012972698,0.00013831335,0.000086209286],"domain_scores_gemma":[0.9992797,0.00045002004,0.00009257543,0.00004481243,0.00011149331,0.000021409449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080539146,0.0006298189,0.0007408402,0.00022151331,0.00027723212,0.00087253883,0.00041205506,0.000660903,0.0011829382],"category_scores_gemma":[0.0014830297,0.00034648707,0.00031805807,0.0002681843,0.0005722675,0.00081184856,0.00048319323,0.0004060535,0.00031330145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028075944,0.00006899637,0.0007773753,0.00017968946,0.00009619882,0.0003293357,0.0002166611,0.8918686,0.022696666,0.027691988,0.0007264152,0.055067316],"study_design_scores_gemma":[0.000026316122,0.000084326195,0.00019815456,0.000006250282,0.000020152042,0.00007251218,0.000029381676,0.99177843,0.0029098114,0.0044184336,0.0004452527,0.000011037753],"about_ca_topic_score_codex":0.0015735668,"about_ca_topic_score_gemma":0.0019386995,"teacher_disagreement_score":0.0015735668,"about_ca_system_score_codex":0.0006481888,"about_ca_system_score_gemma":0.0007487155,"threshold_uncertainty_score":0.0047029257},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03300418,0.00088277354,0.9635619,0.00012745583,0.000035522917,0.000042494772,0.000019003262,0.00006312241,0.002263677],"genre_scores_gemma":[0.83625287,0.0011753297,0.15895098,0.00016833218,0.00007712242,0.00017673089,0.00006558441,0.000019005687,0.0031140181],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994313,0.00027224282,0.000023722681,0.000066859095,0.00017151564,0.000034323646],"domain_scores_gemma":[0.999286,0.00039394948,0.00009570363,0.000079908714,0.00012192702,0.000022521817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008061716,0.00042660153,0.00031771985,0.00029702391,0.00033775845,0.0004005456,0.0006109174,0.00037572987,0.0008805983],"category_scores_gemma":[0.0014097261,0.00015375698,0.00017676974,0.00029944212,0.00030577133,0.0006432266,0.0006002817,0.00028353848,0.0002195804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000331188,0.00018254721,0.0023601432,0.0005397514,0.00011505095,0.00096088485,0.0007218678,0.28455782,0.10624453,0.18274096,0.0025429574,0.41870227],"study_design_scores_gemma":[0.000041500396,0.00025510768,0.00055605767,0.000027468122,0.000029585544,0.00038005825,0.00008223805,0.9491559,0.013785213,0.030757634,0.0048990087,0.000030188092],"about_ca_topic_score_codex":0.00027309763,"about_ca_topic_score_gemma":0.00054366916,"teacher_disagreement_score":0.0008805983,"about_ca_system_score_codex":0.00026885862,"about_ca_system_score_gemma":0.00028794268,"threshold_uncertainty_score":0.0042634606},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.388463,0.0006916014,0.60420984,0.000548624,0.000051555806,0.00008295273,0.00011157507,0.00015557553,0.005685346],"genre_scores_gemma":[0.95448536,0.00047828897,0.042885713,0.00007880013,0.000054234617,0.000067410256,0.00006369579,0.000021931122,0.0018645979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970573,0.000089654226,0.000010270818,0.000032583335,0.00009754137,0.00006422183],"domain_scores_gemma":[0.9971644,0.0019363698,0.0003401992,0.00020443473,0.0002646069,0.00008995373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007025948,0.00046155325,0.00034363155,0.0004755224,0.00034937184,0.00052610185,0.00051202724,0.0005596277,0.00088020856],"category_scores_gemma":[0.0044356687,0.00014926486,0.00029337592,0.00046862636,0.0011947721,0.0010635067,0.00071711856,0.0009205079,0.00011647667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017621084,0.00005472925,0.0009996084,0.00013059573,0.00002148629,0.00018054042,0.0001920235,0.4954927,0.021463774,0.46028352,0.0006758841,0.020328969],"study_design_scores_gemma":[0.000018953455,0.000066684865,0.00015744804,0.0000151423155,0.000008087154,0.000075565295,0.00003594299,0.92592853,0.006778534,0.0660614,0.00084000087,0.000013750783],"about_ca_topic_score_codex":0.0010579772,"about_ca_topic_score_gemma":0.00077748566,"teacher_disagreement_score":0.0010579772,"about_ca_system_score_codex":0.00066866796,"about_ca_system_score_gemma":0.00063921034,"threshold_uncertainty_score":0.0048515797},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044559352,0.00044118756,0.9528776,0.00016268752,0.000020393887,0.000054634464,0.000013425472,0.00010091994,0.0017697768],"genre_scores_gemma":[0.9554085,0.00033985285,0.042834647,0.000071113085,0.000029054312,0.000087671775,0.000020706142,0.000011489456,0.0011969839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993357,0.00034550755,0.000021630496,0.00010303972,0.00011436107,0.00007969221],"domain_scores_gemma":[0.9979506,0.0015046868,0.0001670881,0.00010706557,0.00022260117,0.000047986272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016192481,0.0005752139,0.0006696829,0.00035439376,0.00043201,0.0005869435,0.0011283923,0.0007367381,0.00078751816],"category_scores_gemma":[0.004151413,0.00026255855,0.00035807324,0.0005157121,0.00094314024,0.0011146627,0.00068821735,0.00044895412,0.00022584897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086781954,0.000101464284,0.00072350615,0.00006662909,0.00004279441,0.00013362068,0.0001335794,0.934062,0.004051495,0.022190407,0.00055524375,0.037852567],"study_design_scores_gemma":[0.000008171549,0.00005009272,0.000058573594,0.0000024103279,0.0000055911487,0.000027761214,0.00000927646,0.9954797,0.0004966016,0.0036672128,0.00019057519,0.0000040341565],"about_ca_topic_score_codex":0.0017756966,"about_ca_topic_score_gemma":0.0014014476,"teacher_disagreement_score":0.0017756966,"about_ca_system_score_codex":0.00070906273,"about_ca_system_score_gemma":0.00061615417,"threshold_uncertainty_score":0.0085635185},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016445937,0.00071951066,0.97822714,0.00020946503,0.00015530072,0.00011745711,0.000064029366,0.0003718684,0.0036893368],"genre_scores_gemma":[0.5829901,0.0009946398,0.40450013,0.00028675323,0.00022006764,0.00036608626,0.00018282255,0.00008144918,0.01037795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896216,0.00033946734,0.000048251117,0.00009248188,0.0004653633,0.00009224141],"domain_scores_gemma":[0.99878544,0.0005872695,0.00007326528,0.00023857395,0.00028443628,0.000031073872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013887904,0.0006285267,0.00068193465,0.0005113527,0.00052042474,0.00076866715,0.0013054382,0.0007056123,0.0015289896],"category_scores_gemma":[0.002336885,0.00030244183,0.00035002342,0.0006015913,0.00058007595,0.0009868945,0.0012724216,0.00087321043,0.000521596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073901814,0.0002463845,0.00050658965,0.00034558243,0.00015300434,0.0006432183,0.0005419526,0.2824008,0.1348561,0.21080521,0.012332992,0.35642922],"study_design_scores_gemma":[0.000104618,0.00033668583,0.0002550813,0.000019541012,0.00009412195,0.00042145417,0.000041475338,0.9481767,0.011793936,0.02837354,0.010328145,0.000054766246],"about_ca_topic_score_codex":0.000992278,"about_ca_topic_score_gemma":0.002424718,"teacher_disagreement_score":0.0015289896,"about_ca_system_score_codex":0.00046927165,"about_ca_system_score_gemma":0.0009060191,"threshold_uncertainty_score":0.0073447227},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022076895,0.00032219576,0.97441846,0.00018154684,0.000017681012,0.000026839189,0.00006519489,0.00009665568,0.0027945642],"genre_scores_gemma":[0.8339927,0.00088108797,0.15937619,0.00010709064,0.00008431107,0.00014026306,0.00015483017,0.00009604433,0.005167527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899477,0.00045339088,0.000030240315,0.00014838416,0.00024438484,0.00012884317],"domain_scores_gemma":[0.99857056,0.00097153644,0.00013424487,0.0000967377,0.00018149323,0.000045369805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012615199,0.0009218828,0.0010412986,0.0003223535,0.0003160311,0.001266073,0.0005621548,0.0009520883,0.0014455898],"category_scores_gemma":[0.0029449232,0.00052012596,0.00049741875,0.00075874163,0.0009611639,0.001412785,0.00090863596,0.0008487158,0.00044928546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008067919,0.000028763647,0.00022272626,0.00007130785,0.000040184987,0.00008407513,0.00006471747,0.9608691,0.0032454003,0.01830915,0.00049404224,0.016489828],"study_design_scores_gemma":[0.000010251641,0.000027188673,0.00007549551,0.0000035153214,0.0000077535315,0.000023065882,0.000011846945,0.9930061,0.0011794054,0.005459926,0.00018910298,0.0000062766903],"about_ca_topic_score_codex":0.0022849012,"about_ca_topic_score_gemma":0.0018720004,"teacher_disagreement_score":0.0022849012,"about_ca_system_score_codex":0.0009913193,"about_ca_system_score_gemma":0.0011815986,"threshold_uncertainty_score":0.007192552},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028517481,0.0016366614,0.96058375,0.00060917164,0.000059583388,0.000058303074,0.00009735059,0.00012793395,0.008309782],"genre_scores_gemma":[0.91365886,0.0018879604,0.07926198,0.0001342931,0.000114079325,0.00020298202,0.00008061749,0.00006655044,0.004592649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986393,0.00074734044,0.000039170496,0.00014826673,0.00024637784,0.00017950371],"domain_scores_gemma":[0.9981317,0.0014118757,0.00018211933,0.0000687716,0.00015701314,0.000048442365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016898416,0.0013207117,0.0012926944,0.00057998,0.00045244975,0.0015159154,0.0010539729,0.0010631001,0.0022157854],"category_scores_gemma":[0.00450559,0.00050149875,0.0004069818,0.0011888376,0.0011051149,0.0016756194,0.0011680145,0.00087557413,0.0005355117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007957149,0.00003415301,0.00019536345,0.000108682536,0.00003699695,0.00019940616,0.000060977523,0.9423945,0.0014617861,0.03836922,0.0010311138,0.016028099],"study_design_scores_gemma":[0.000021165548,0.000034405308,0.000058307567,0.0000060169777,0.000008447657,0.00004396688,0.00001651205,0.9838124,0.00037089825,0.014995374,0.0006256262,0.0000070086585],"about_ca_topic_score_codex":0.0017630467,"about_ca_topic_score_gemma":0.0012919736,"teacher_disagreement_score":0.0022157854,"about_ca_system_score_codex":0.0011119817,"about_ca_system_score_gemma":0.0008092302,"threshold_uncertainty_score":0.008936822},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43202522,0.0015633763,0.5441938,0.0007209976,0.000051368235,0.00005594911,0.00024762205,0.00019365492,0.020947972],"genre_scores_gemma":[0.99160284,0.0004721308,0.00615568,0.00004502827,0.0000334879,0.00003334783,0.00004728662,0.000020405778,0.0015898177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941933,0.00019366229,0.000019603025,0.00005536851,0.00022321471,0.00008877021],"domain_scores_gemma":[0.993178,0.005096863,0.0006619257,0.0001750401,0.00076463417,0.00012346607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013401819,0.0005133445,0.00047357683,0.0007503658,0.00042770032,0.0007077317,0.000653528,0.00069376675,0.0014081642],"category_scores_gemma":[0.00840881,0.0002599541,0.00028421215,0.0006652669,0.00093809725,0.0009396725,0.00057535345,0.0005182882,0.00017905272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013225705,0.00003366309,0.001663209,0.000106456944,0.000037212783,0.0003755801,0.00028478762,0.8587832,0.010609082,0.117589064,0.00087196537,0.00951358],"study_design_scores_gemma":[0.0000040980613,0.000023269431,0.00024436967,0.0000060128546,0.000007955808,0.00009249204,0.00002586527,0.98969406,0.0007614524,0.008944773,0.0001900773,0.0000054944694],"about_ca_topic_score_codex":0.0017090248,"about_ca_topic_score_gemma":0.0010651803,"teacher_disagreement_score":0.0017090248,"about_ca_system_score_codex":0.0014774237,"about_ca_system_score_gemma":0.00048490916,"threshold_uncertainty_score":0.010719478},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83557576,0.0015960431,0.15005273,0.0004928514,0.00003878716,0.000042420736,0.00025967718,0.00022128675,0.011720401],"genre_scores_gemma":[0.9981159,0.0001608845,0.0012994651,0.000015047665,0.000005637598,0.000010193584,0.000034318084,0.000006288697,0.00035230318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986123,0.0005857044,0.000047211102,0.00016097771,0.00032462404,0.00026906916],"domain_scores_gemma":[0.99305975,0.0048002084,0.00059250224,0.00031079922,0.0011226325,0.00011414239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002105114,0.0010033537,0.0007425262,0.00064544374,0.00045562678,0.0012075704,0.00070571894,0.0008919512,0.00070799544],"category_scores_gemma":[0.007368155,0.00025681636,0.00031322232,0.00068591314,0.001118435,0.0010230581,0.0011120659,0.00042778172,0.00017263656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026452568,0.000034236687,0.0024461732,0.00008197789,0.000048353995,0.00016126255,0.00012293413,0.97742075,0.0058459397,0.0069410903,0.00024735476,0.006385407],"study_design_scores_gemma":[0.000010556951,0.00017409693,0.00092072954,0.000010878734,0.00001881854,0.00010922777,0.0000781666,0.99265796,0.0029754383,0.0028993087,0.0001274531,0.000017377506],"about_ca_topic_score_codex":0.0036737584,"about_ca_topic_score_gemma":0.0022350652,"teacher_disagreement_score":0.0036737584,"about_ca_system_score_codex":0.0012582139,"about_ca_system_score_gemma":0.00097480376,"threshold_uncertainty_score":0.011133075},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34379685,0.0007567693,0.6505337,0.00033908887,0.000048977636,0.000092561175,0.00003956741,0.00032537212,0.004067171],"genre_scores_gemma":[0.97158754,0.00027231904,0.026589373,0.000041080006,0.00005150951,0.0000444856,0.00003460405,0.000016463253,0.0013626266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994947,0.0001893947,0.000018299197,0.00010011658,0.0001361736,0.00006125049],"domain_scores_gemma":[0.9979139,0.0013123415,0.00023800893,0.00015511792,0.0002825054,0.00009806864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095032423,0.0005175159,0.000498054,0.00044375367,0.0005129828,0.00064188946,0.000870515,0.00066165614,0.0005060722],"category_scores_gemma":[0.0039072963,0.00022055884,0.00020142393,0.00074672356,0.0005409775,0.0011308942,0.00072784646,0.0004226211,0.00010849331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003958741,0.00017737059,0.0021958353,0.00022212064,0.00009671922,0.00065543153,0.00075413124,0.8287894,0.042695567,0.030729957,0.0013050609,0.091982484],"study_design_scores_gemma":[0.000024232852,0.00010194388,0.00020959161,0.0000028121606,0.000012179943,0.000053338692,0.000058311824,0.9891433,0.002629936,0.0070300675,0.0007292635,0.0000049788946],"about_ca_topic_score_codex":0.0024146447,"about_ca_topic_score_gemma":0.0015009593,"teacher_disagreement_score":0.0024146447,"about_ca_system_score_codex":0.00060332543,"about_ca_system_score_gemma":0.00035439566,"threshold_uncertainty_score":0.0050258636},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010930438,0.000552446,0.9863144,0.00009129104,0.000014449851,0.000019140549,0.000020925432,0.0000925931,0.0019643784],"genre_scores_gemma":[0.82564974,0.0011822142,0.1701938,0.000130256,0.00006176539,0.00013124468,0.000046755606,0.00011727127,0.0024868068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782974,0.0012807358,0.00009327495,0.00027877686,0.00039286312,0.00012462799],"domain_scores_gemma":[0.99736124,0.0017995404,0.0003018409,0.00019220733,0.000295812,0.000049299037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024865982,0.0012974445,0.0011196017,0.0005875245,0.00032191467,0.0010338918,0.0010380277,0.00091265107,0.0010108497],"category_scores_gemma":[0.0057822224,0.00045977157,0.0003672057,0.00087167835,0.0011658658,0.0019799627,0.0008167186,0.00070823135,0.00037153895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009495888,0.0000324151,0.00025258455,0.00013233707,0.000042229673,0.000104578365,0.000065047236,0.9157312,0.006131287,0.046410203,0.0004801779,0.030522956],"study_design_scores_gemma":[0.000011501116,0.00008740826,0.000107042055,0.000013274124,0.000016603199,0.00009772416,0.000012716646,0.9754847,0.003097502,0.020183386,0.0008761052,0.000011958003],"about_ca_topic_score_codex":0.0005119726,"about_ca_topic_score_gemma":0.00042947964,"teacher_disagreement_score":0.0024865982,"about_ca_system_score_codex":0.0011002172,"about_ca_system_score_gemma":0.0005407002,"threshold_uncertainty_score":0.013150573},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01915587,0.002876311,0.967644,0.00018564299,0.000057676705,0.000060861603,0.000052569358,0.00020196318,0.009765138],"genre_scores_gemma":[0.84618616,0.0068510585,0.13828085,0.00014147695,0.00012370333,0.000237431,0.00013449772,0.000088245724,0.007956547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884593,0.0004738087,0.000041882333,0.00010040584,0.00040467686,0.0001331758],"domain_scores_gemma":[0.9960103,0.002790524,0.00031693824,0.00033704744,0.0004933103,0.000051899202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002290273,0.0010524127,0.00074934255,0.0009864405,0.00045692353,0.0014423378,0.0009701225,0.0009487407,0.0018993872],"category_scores_gemma":[0.009478302,0.0003203679,0.00063975697,0.0015033102,0.0011456911,0.0017026139,0.00094380847,0.0013372615,0.0008408565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046972542,0.000028771028,0.0004609194,0.00014455074,0.000026452484,0.00014241965,0.0002940636,0.85943604,0.0030875655,0.11603972,0.000814225,0.019478185],"study_design_scores_gemma":[0.000003013282,0.00002614635,0.00010673516,0.000019242594,0.0000071898007,0.00009440029,0.000029457357,0.9859724,0.0005113593,0.012163399,0.0010567936,0.000009945998],"about_ca_topic_score_codex":0.0028721825,"about_ca_topic_score_gemma":0.0012066592,"teacher_disagreement_score":0.0028721825,"about_ca_system_score_codex":0.001498784,"about_ca_system_score_gemma":0.00052828476,"threshold_uncertainty_score":0.0121123195},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38139182,0.0022870144,0.59993464,0.00052316766,0.00027933504,0.00011682859,0.00011543315,0.0007879762,0.014563874],"genre_scores_gemma":[0.98304164,0.00026618547,0.013943405,0.000033373908,0.00004490428,0.000016854754,0.00003167683,0.000016585218,0.0026052988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997483,0.00006792386,0.000012875536,0.000027591439,0.00006498316,0.000078343706],"domain_scores_gemma":[0.9990602,0.0006075625,0.00004824743,0.000112703325,0.00013981416,0.000031432442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067048246,0.00040459292,0.00042643808,0.0004115239,0.00081035995,0.00076372415,0.0005721835,0.0004585987,0.0022982594],"category_scores_gemma":[0.0014365605,0.0002100749,0.00022905397,0.0003496202,0.00038423017,0.0005702113,0.000702707,0.00043631942,0.00033808738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011311946,0.00030809894,0.0031048388,0.00023392013,0.00009444056,0.0019170945,0.00071708835,0.35268173,0.17121002,0.049773116,0.005879297,0.4129492],"study_design_scores_gemma":[0.000037534784,0.0003375796,0.0009729889,0.000019189165,0.000100434416,0.00061571016,0.0002209415,0.96623516,0.017562155,0.0108367065,0.0030302892,0.00003128594],"about_ca_topic_score_codex":0.0021570567,"about_ca_topic_score_gemma":0.005907867,"teacher_disagreement_score":0.0022982594,"about_ca_system_score_codex":0.00037590507,"about_ca_system_score_gemma":0.00040962466,"threshold_uncertainty_score":0.0076884627},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37359452,0.0032998547,0.6127305,0.0005040171,0.00008013428,0.00006573368,0.00015692032,0.00063352764,0.008934849],"genre_scores_gemma":[0.975298,0.0009894054,0.022952985,0.0000475193,0.00002652119,0.000019350135,0.000040100258,0.000045038323,0.0005812511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790335,0.0008395581,0.00008316002,0.00026920525,0.0006321629,0.00027254358],"domain_scores_gemma":[0.9831166,0.0132292975,0.001506284,0.0009402727,0.0011197227,0.000087750945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003087459,0.0015992464,0.0009411927,0.0007424976,0.0004446897,0.001272761,0.0011465204,0.0012267663,0.0007487732],"category_scores_gemma":[0.014442537,0.00028038363,0.00048567334,0.0009376813,0.0018857123,0.0015275708,0.0011058969,0.0008897137,0.00021395179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002561521,0.000059095055,0.0021863985,0.00018220933,0.00006610913,0.00072304753,0.00022821587,0.948377,0.01804191,0.010626596,0.00024814522,0.019005038],"study_design_scores_gemma":[0.000009298868,0.0002875577,0.001149989,0.000048815415,0.00006590713,0.0005140585,0.00007700233,0.9757784,0.018534787,0.0031662148,0.00033251513,0.000035434026],"about_ca_topic_score_codex":0.0031603076,"about_ca_topic_score_gemma":0.002750102,"teacher_disagreement_score":0.0031603076,"about_ca_system_score_codex":0.0011822123,"about_ca_system_score_gemma":0.00083047984,"threshold_uncertainty_score":0.016328275},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.631368,0.0033208488,0.1442179,0.0027120658,0.00037004764,0.00011221202,0.0014675375,0.00043763613,0.21599375],"genre_scores_gemma":[0.97134584,0.0010939505,0.010504264,0.00034333504,0.0001935482,0.00005073492,0.00058991666,0.00004689668,0.015831549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973994,0.000020637348,0.0000123674745,0.0000780843,0.00008345112,0.00006555659],"domain_scores_gemma":[0.9986866,0.0005417332,0.00020217046,0.00017376454,0.00022186851,0.0001738267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038787545,0.00058022194,0.0006099147,0.0018601977,0.0014226326,0.0023777424,0.0010805452,0.0011568503,0.0070906556],"category_scores_gemma":[0.0022995654,0.00043663045,0.0006376153,0.0016406844,0.0020856676,0.0032256485,0.0013493738,0.0019614,0.00059796934],"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.000045029108,0.000026016325,0.0003004626,0.00007353876,0.000010359185,0.0001138441,0.00018716237,0.0026331122,0.0021660072,0.9836887,0.002144794,0.008610911],"study_design_scores_gemma":[0.000013845295,0.00001695148,0.00048333406,0.0000254191,0.000014682041,0.00029882844,0.00009893621,0.0066958726,0.00091986323,0.98734146,0.0040794164,0.000011347166],"about_ca_topic_score_codex":0.0020384747,"about_ca_topic_score_gemma":0.0020418735,"teacher_disagreement_score":0.0070906556,"about_ca_system_score_codex":0.0012831771,"about_ca_system_score_gemma":0.0007705461,"threshold_uncertainty_score":0.023720622},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15673703,0.001656055,0.8162735,0.0006846896,0.0003409394,0.00020021836,0.00048751323,0.0013104321,0.022309598],"genre_scores_gemma":[0.8583728,0.0007100043,0.13004199,0.00020771875,0.00009610504,0.0001273413,0.0002328466,0.00004262232,0.010168558],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995291,0.0001488808,0.000036876987,0.000060985294,0.00015022475,0.000073949384],"domain_scores_gemma":[0.99886155,0.0004619309,0.00012709196,0.00025050758,0.00026701132,0.000032063137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008643809,0.0009395119,0.0009351595,0.00054581976,0.0005400013,0.0008683524,0.0007302301,0.0012116105,0.0029001187],"category_scores_gemma":[0.0018593727,0.00028823575,0.00038669736,0.000933997,0.0004332268,0.0009703282,0.0011366762,0.00072961004,0.00078283355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023301688,0.0002960311,0.002256136,0.0008681517,0.00029541345,0.0021514397,0.0010609969,0.1447998,0.41312158,0.11528123,0.0056573716,0.31188178],"study_design_scores_gemma":[0.00014227373,0.0008126103,0.001133635,0.00011328326,0.0002582815,0.001998295,0.00009491574,0.8157808,0.14821745,0.02247231,0.008818425,0.00015776014],"about_ca_topic_score_codex":0.00060692284,"about_ca_topic_score_gemma":0.0014583999,"teacher_disagreement_score":0.0029001187,"about_ca_system_score_codex":0.00042213104,"about_ca_system_score_gemma":0.00063802407,"threshold_uncertainty_score":0.009701908},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58500254,0.00094809,0.38665143,0.0003466833,0.00009318013,0.00013543892,0.00018436389,0.0004597286,0.026178516],"genre_scores_gemma":[0.9877822,0.00017940441,0.010400037,0.00006345717,0.000012024148,0.000035065175,0.00004934774,0.0000131809675,0.0014653477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977112,0.0010216881,0.00004642947,0.00015506054,0.00045026338,0.0006154001],"domain_scores_gemma":[0.9942826,0.0035568306,0.00047380532,0.0005308524,0.0010017018,0.00015430443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025893115,0.0010438433,0.0010309254,0.0007011597,0.0007466719,0.0011596147,0.00084838265,0.0010481122,0.0012351854],"category_scores_gemma":[0.0040362156,0.00028790234,0.0004496012,0.0009385849,0.0011437257,0.0013259901,0.001502116,0.00052200636,0.00029315782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011847119,0.00022367007,0.0046901153,0.00023447264,0.0001328148,0.0014314728,0.00045469185,0.8526121,0.034998465,0.07608299,0.0022915527,0.025662987],"study_design_scores_gemma":[0.00007685325,0.00044753755,0.00075983343,0.000015609263,0.000059998187,0.0005600615,0.0001261542,0.9706476,0.014460846,0.010780133,0.002026179,0.000039207673],"about_ca_topic_score_codex":0.0017083008,"about_ca_topic_score_gemma":0.0016321914,"teacher_disagreement_score":0.0025893115,"about_ca_system_score_codex":0.0010102205,"about_ca_system_score_gemma":0.0008799352,"threshold_uncertainty_score":0.01369375},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012534887,0.00030623304,0.9836457,0.00010860242,0.000020397913,0.000038556274,0.000026909482,0.000114568174,0.0032041464],"genre_scores_gemma":[0.8424003,0.0009907113,0.14943479,0.0001661871,0.00010448077,0.00026819922,0.000102033715,0.000049791797,0.006483564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947876,0.00020355827,0.000018311615,0.00007624923,0.00016799396,0.000055117598],"domain_scores_gemma":[0.99931145,0.00035150806,0.00010212886,0.000040410065,0.00017861024,0.000015949823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075781636,0.00067483465,0.00048667347,0.00024271254,0.00023795426,0.0007749168,0.00049050193,0.00065083976,0.0021454552],"category_scores_gemma":[0.0017909544,0.00033565224,0.0002501882,0.00034429127,0.0005322202,0.0006401306,0.0004966967,0.000587023,0.0007884649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009089065,0.000061857856,0.00054407277,0.0002523279,0.00006570319,0.00027804263,0.0002579299,0.88513553,0.02659643,0.030916674,0.0014956816,0.05430495],"study_design_scores_gemma":[0.000016733533,0.00012627417,0.000087932,0.0000139199765,0.00001698167,0.0000785044,0.00003318027,0.99224126,0.0026099435,0.0036420014,0.0011222643,0.000010979541],"about_ca_topic_score_codex":0.001045879,"about_ca_topic_score_gemma":0.0012388427,"teacher_disagreement_score":0.0021454552,"about_ca_system_score_codex":0.00055550906,"about_ca_system_score_gemma":0.0006335274,"threshold_uncertainty_score":0.0071772933},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2782861,0.0010811152,0.71435934,0.0002626526,0.000023491333,0.00019356246,0.000059172613,0.00027769015,0.005456893],"genre_scores_gemma":[0.9660153,0.00026435452,0.03315391,0.0000307406,0.000013269167,0.0000745676,0.000021678006,0.00000853219,0.00041768898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810153,0.00095825084,0.00006398384,0.00016888262,0.00051676773,0.00019065427],"domain_scores_gemma":[0.9971898,0.001379146,0.0003051522,0.00024873586,0.00078734214,0.00008981218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016811795,0.00085217436,0.0007922035,0.0004476407,0.0003694498,0.0010000265,0.0007453819,0.0010304139,0.0006079876],"category_scores_gemma":[0.00416027,0.00026270552,0.00034063307,0.000679909,0.0008382661,0.0006984327,0.0008829227,0.00038838494,0.00016232711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001875307,0.00008809393,0.0018209333,0.00010114863,0.00008072482,0.00027762115,0.000089559755,0.95933264,0.010979492,0.0048851217,0.00022172763,0.021935463],"study_design_scores_gemma":[0.000015256196,0.00022855385,0.00018861619,0.0000042753586,0.000033266424,0.00011473125,0.000028068842,0.9958334,0.0029078112,0.00047848682,0.00015955127,0.0000079938845],"about_ca_topic_score_codex":0.0032436503,"about_ca_topic_score_gemma":0.0024647452,"teacher_disagreement_score":0.0032436503,"about_ca_system_score_codex":0.0010149969,"about_ca_system_score_gemma":0.0010369419,"threshold_uncertainty_score":0.008891046},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6590503,0.0029189864,0.3137753,0.0002848893,0.00009138877,0.00021358355,0.00028721822,0.0003692361,0.023009127],"genre_scores_gemma":[0.98970836,0.0005562914,0.008581109,0.00002243028,0.000013887648,0.000049269995,0.00005765698,0.000020972062,0.0009899173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871755,0.00038049428,0.00007802551,0.00018913,0.00032835559,0.000306467],"domain_scores_gemma":[0.9895235,0.0074885963,0.0010986958,0.0008071029,0.00088674796,0.00019538376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031422146,0.00068702403,0.00078587,0.0009511341,0.0005095578,0.0013102894,0.00088627514,0.0006620286,0.0012162651],"category_scores_gemma":[0.014991903,0.00030770816,0.00048067624,0.000957397,0.0010906766,0.0013173562,0.0009992198,0.0006281183,0.00020829657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012509937,0.00014238358,0.0073425644,0.00037326352,0.00011481273,0.00060220336,0.0009182955,0.75862646,0.014908401,0.10056686,0.0018675079,0.113286205],"study_design_scores_gemma":[0.00004971684,0.0005510926,0.004341536,0.0000672522,0.00016266691,0.000999711,0.00051906874,0.9517942,0.013230272,0.02628845,0.0018944424,0.00010155766],"about_ca_topic_score_codex":0.0020629624,"about_ca_topic_score_gemma":0.0020538608,"teacher_disagreement_score":0.0031422146,"about_ca_system_score_codex":0.0015926128,"about_ca_system_score_gemma":0.0010730145,"threshold_uncertainty_score":0.016617775},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026084151,0.0035148032,0.9505672,0.0006167213,0.0002360499,0.0000756805,0.000044043038,0.00033924895,0.018522097],"genre_scores_gemma":[0.86189044,0.002853398,0.1247955,0.00038822013,0.0003188178,0.00017258227,0.00007219241,0.000035286663,0.009473667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995043,0.00013229942,0.000015417085,0.00006032517,0.00022611424,0.00006148611],"domain_scores_gemma":[0.9994678,0.00024124053,0.000032319545,0.00006632717,0.00016844388,0.00002392209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004664546,0.00036116337,0.00034992964,0.00047460993,0.00080928806,0.000576836,0.00058029353,0.00049892307,0.001845424],"category_scores_gemma":[0.001106917,0.00019983656,0.00023334399,0.0007031487,0.0006125482,0.00075990765,0.00060456764,0.0008813474,0.00060266966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002031238,0.00018575875,0.001108358,0.0005500088,0.00014327948,0.0010860626,0.0014701638,0.15553634,0.20320874,0.2972791,0.011084168,0.32814494],"study_design_scores_gemma":[0.0000874598,0.00076119514,0.0011166033,0.00014128083,0.00009836953,0.0023282843,0.00034235182,0.7500422,0.06252032,0.122727275,0.05971535,0.00011936986],"about_ca_topic_score_codex":0.00070439995,"about_ca_topic_score_gemma":0.0009441579,"teacher_disagreement_score":0.001845424,"about_ca_system_score_codex":0.00056909584,"about_ca_system_score_gemma":0.000535428,"threshold_uncertainty_score":0.006173551},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02648122,0.00028167357,0.97130424,0.00019055788,0.000020872449,0.000016764001,0.000007802455,0.000055255325,0.0016416397],"genre_scores_gemma":[0.8535058,0.00029766787,0.14434576,0.00011979386,0.000028216607,0.00009102727,0.000024573905,0.000026229034,0.0015611168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996717,0.0001665899,0.000010682888,0.000053342057,0.00006616568,0.000031516804],"domain_scores_gemma":[0.9995028,0.00031602682,0.00008602933,0.000028437913,0.000045319317,0.000021435215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059541187,0.00062881905,0.0006810792,0.00035739527,0.00036571012,0.00062597997,0.0007044973,0.00064661546,0.0005447034],"category_scores_gemma":[0.0017721528,0.0002819448,0.00034197085,0.00042153875,0.00088940136,0.0007423985,0.00075976143,0.00050250744,0.00010080374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023718827,0.000022923923,0.00029769333,0.000031835214,0.000028894743,0.00003411387,0.00003409861,0.9694266,0.00230257,0.010619899,0.00017880542,0.01699888],"study_design_scores_gemma":[0.000007613298,0.000013356785,0.000059715618,0.0000019213192,0.000003862384,0.00001072196,0.000004117537,0.99644715,0.00022486567,0.003080523,0.0001434428,0.0000026733499],"about_ca_topic_score_codex":0.0017185728,"about_ca_topic_score_gemma":0.0013675563,"teacher_disagreement_score":0.0017185728,"about_ca_system_score_codex":0.00061253563,"about_ca_system_score_gemma":0.00058540737,"threshold_uncertainty_score":0.004444301},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27634048,0.002846375,0.6988114,0.00070375466,0.00005663174,0.00007813354,0.00008418837,0.00032155955,0.020757448],"genre_scores_gemma":[0.98877674,0.00045470143,0.009660195,0.000035573114,0.000026016194,0.000034957236,0.000018871438,0.000013350533,0.000979671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888796,0.00046689785,0.000028413075,0.000083147504,0.00031731572,0.00021619436],"domain_scores_gemma":[0.99507743,0.0036262302,0.00047502865,0.00020705516,0.00051419355,0.00009995035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017158099,0.0011597924,0.0010464172,0.00071656314,0.00070449326,0.001121169,0.0013130296,0.0012612381,0.0010185563],"category_scores_gemma":[0.005090961,0.00041914175,0.00046312445,0.001291366,0.0016092316,0.0011156194,0.0013372762,0.00070400396,0.00021221211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011852684,0.000039535127,0.0004313048,0.000085390486,0.000035316316,0.00023868804,0.00014323131,0.96495926,0.0039356886,0.0215392,0.00030681983,0.008166988],"study_design_scores_gemma":[0.0000067035744,0.000044738317,0.00012294471,0.000006311976,0.000017149647,0.00009327655,0.00003799018,0.9939926,0.0008541357,0.004677545,0.00013678441,0.000009815678],"about_ca_topic_score_codex":0.0026694746,"about_ca_topic_score_gemma":0.0032237326,"teacher_disagreement_score":0.0026694746,"about_ca_system_score_codex":0.0016211275,"about_ca_system_score_gemma":0.0008550558,"threshold_uncertainty_score":0.011762142},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06842833,0.0003719704,0.9270272,0.00028163672,0.000026350115,0.00006462206,0.00008078151,0.000151692,0.003567434],"genre_scores_gemma":[0.8664631,0.0002888634,0.13097839,0.000060315586,0.00002623519,0.00013936215,0.00008035068,0.0000549603,0.0019084269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908364,0.0004890043,0.000029359499,0.00010736371,0.00015509196,0.00013545419],"domain_scores_gemma":[0.99871135,0.0009090667,0.0001249617,0.00008753518,0.00010834974,0.000058715566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017399034,0.0010455815,0.0012744822,0.0005838809,0.00043392074,0.0012480565,0.00074955425,0.0011814013,0.0013606838],"category_scores_gemma":[0.0040947595,0.00067499804,0.0005450914,0.00086006476,0.0009316151,0.0013238871,0.0011938222,0.000812211,0.00032465925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047211593,0.000032911605,0.00016542707,0.00003137406,0.00001362304,0.000054663924,0.000034237903,0.9830617,0.00082947203,0.0075603775,0.00029715258,0.007871753],"study_design_scores_gemma":[0.000011171713,0.000018371411,0.000026612275,0.000001749174,0.000004073577,0.000009821849,0.000009773765,0.9948538,0.00024766923,0.004706967,0.0001066202,0.0000034078691],"about_ca_topic_score_codex":0.0020768247,"about_ca_topic_score_gemma":0.0021999895,"teacher_disagreement_score":0.0020768247,"about_ca_system_score_codex":0.0009850763,"about_ca_system_score_gemma":0.0011842895,"threshold_uncertainty_score":0.009201586},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009984002,0.00026535807,0.9881827,0.000043567466,0.0000113223905,0.000017967193,0.0000047557046,0.000081728744,0.0014085496],"genre_scores_gemma":[0.83420694,0.0003823929,0.16358605,0.000081848375,0.000043093936,0.000085069245,0.0000173494,0.000035774236,0.00156163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941933,0.00025272203,0.000024628369,0.00007211285,0.00017725461,0.0000539709],"domain_scores_gemma":[0.99917513,0.0005892184,0.000083074694,0.00006135506,0.00007516619,0.000016096104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006831742,0.00057069823,0.0004359856,0.00029805079,0.00033131274,0.0007454182,0.00080971187,0.00040909587,0.0008626366],"category_scores_gemma":[0.0022806528,0.0002137954,0.00027410922,0.00029768274,0.00058068166,0.00066959194,0.00051519374,0.00050553586,0.0001922396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016726935,0.00012511895,0.00043926062,0.00021695037,0.00006596904,0.00017932791,0.00029197885,0.6895903,0.025110368,0.06996258,0.00095025316,0.21290064],"study_design_scores_gemma":[0.000020485462,0.00006497378,0.00012664561,0.000009357316,0.000012145074,0.00007532161,0.000015474316,0.9785688,0.0041804775,0.016310653,0.00060637173,0.000009316179],"about_ca_topic_score_codex":0.00048890733,"about_ca_topic_score_gemma":0.00082297705,"teacher_disagreement_score":0.0008626366,"about_ca_system_score_codex":0.0005092138,"about_ca_system_score_gemma":0.00052626035,"threshold_uncertainty_score":0.0036946535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021939104,0.0005134441,0.97420233,0.00010893641,0.00006119625,0.000042777523,0.000013471434,0.00018918696,0.0029294963],"genre_scores_gemma":[0.94601285,0.00033651548,0.05241041,0.0000930816,0.00006527167,0.000081800485,0.000024787138,0.000020260099,0.0009551305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992698,0.00023075298,0.000030354868,0.0000830458,0.000285201,0.00010089239],"domain_scores_gemma":[0.99819946,0.0009052735,0.00023785235,0.00021878327,0.00032706728,0.00011145385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088835025,0.00069788547,0.00051543984,0.000628796,0.0006737078,0.0005110265,0.0014994094,0.00041976056,0.00048323188],"category_scores_gemma":[0.0027012497,0.00021020153,0.00030695164,0.0006412629,0.0008289784,0.0009835839,0.001099476,0.0005962083,0.00012238715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013041265,0.000115807816,0.0010984418,0.00015407805,0.00009299121,0.0003804106,0.00029859896,0.7997004,0.037976105,0.048767917,0.001673493,0.10961144],"study_design_scores_gemma":[0.000017604307,0.00008549316,0.00013845447,0.000005827022,0.000020431347,0.000111456786,0.000022986087,0.98876524,0.003276428,0.006262955,0.0012798378,0.000013363421],"about_ca_topic_score_codex":0.0013442937,"about_ca_topic_score_gemma":0.0021869608,"teacher_disagreement_score":0.0014994094,"about_ca_system_score_codex":0.00047584705,"about_ca_system_score_gemma":0.00064403506,"threshold_uncertainty_score":0.0046980977},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19275485,0.002922277,0.78794223,0.00042521287,0.00016382158,0.000085435815,0.00007820892,0.00034916753,0.015278755],"genre_scores_gemma":[0.9706528,0.00058659277,0.02641712,0.00004746757,0.000026558446,0.000040331062,0.000025150426,0.000019399096,0.0021844497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937147,0.00018343775,0.000013874716,0.000055749995,0.00021688006,0.00015874382],"domain_scores_gemma":[0.99794513,0.001345706,0.00017170001,0.0001330387,0.00035366724,0.00005072293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008531619,0.00060603005,0.0006175728,0.00061490136,0.00054266705,0.0012439092,0.00068647007,0.00078881707,0.0009823762],"category_scores_gemma":[0.0036843172,0.00017876647,0.0003248159,0.0010028181,0.0011371175,0.0009608246,0.00081599865,0.00069506885,0.00017181662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005559546,0.000120730554,0.0007782534,0.00026012174,0.000077161436,0.00033700882,0.000313418,0.8076293,0.02300073,0.093676664,0.00173773,0.07151296],"study_design_scores_gemma":[0.000011925021,0.00012113224,0.00015391594,0.000017143542,0.000022557144,0.00012337443,0.000051511743,0.98386985,0.0058982233,0.008587801,0.0011227408,0.000019937199],"about_ca_topic_score_codex":0.0046384456,"about_ca_topic_score_gemma":0.0040577105,"teacher_disagreement_score":0.0046384456,"about_ca_system_score_codex":0.0016907164,"about_ca_system_score_gemma":0.001295586,"threshold_uncertainty_score":0.012267053},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012180213,0.0012194957,0.97097284,0.0002561214,0.0000753392,0.000064677144,0.00015053713,0.00023544118,0.01484538],"genre_scores_gemma":[0.6993408,0.00395934,0.26355204,0.000312346,0.0002673379,0.0004912728,0.000477039,0.00019470551,0.031405006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994987,0.00008792074,0.000024251915,0.00005224235,0.00025684587,0.00007986454],"domain_scores_gemma":[0.99860114,0.0007170671,0.00012978917,0.00008348112,0.00044387826,0.000024669584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009493677,0.00082705636,0.0009918276,0.0009527307,0.00049373275,0.001474824,0.0009974488,0.0013430108,0.0053021763],"category_scores_gemma":[0.004751649,0.000610833,0.0007040882,0.0012469318,0.0007381524,0.001861216,0.00065286446,0.0010129662,0.0011381042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002862224,0.000023890292,0.0003742317,0.00018108056,0.00002420503,0.00021096757,0.00021002047,0.8898512,0.0021214907,0.07858784,0.0019587183,0.026427645],"study_design_scores_gemma":[0.0000046929945,0.000008006901,0.00008918917,0.000016498305,0.0000039125634,0.000057376332,0.000028861252,0.98698205,0.00017829338,0.011740512,0.0008839215,0.0000066824928],"about_ca_topic_score_codex":0.0057593286,"about_ca_topic_score_gemma":0.005234673,"teacher_disagreement_score":0.0057593286,"about_ca_system_score_codex":0.0018689121,"about_ca_system_score_gemma":0.001607319,"threshold_uncertainty_score":0.017737567},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2560608,0.00041146553,0.7384721,0.00036495828,0.00008128717,0.00006450718,0.00007600151,0.00018151576,0.0042874035],"genre_scores_gemma":[0.9531129,0.00014752909,0.044445198,0.000045513912,0.000044968136,0.000058109516,0.000024960314,0.000012826114,0.002107995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996439,0.00013299525,0.000019372175,0.00006025608,0.00007241011,0.000070993396],"domain_scores_gemma":[0.998958,0.00058389624,0.000104342806,0.00013196634,0.00018157231,0.000040158513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062948675,0.00054595794,0.0007456882,0.00031625113,0.0007945203,0.0007773808,0.0008069571,0.0007950425,0.0014326376],"category_scores_gemma":[0.0017065412,0.00026152996,0.00030931822,0.0006710232,0.0006431739,0.0006447773,0.00078194676,0.00032886787,0.00036453462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013815812,0.00024672112,0.002293187,0.00025470866,0.00017708051,0.0013538735,0.00094575476,0.7201655,0.082585186,0.05069017,0.0029293017,0.13697691],"study_design_scores_gemma":[0.00004002847,0.00011717768,0.0001882968,0.0000058567493,0.00003809717,0.00013285596,0.000047314046,0.9906775,0.0026408616,0.0056323414,0.0004655464,0.000014220351],"about_ca_topic_score_codex":0.0018229696,"about_ca_topic_score_gemma":0.0035647259,"teacher_disagreement_score":0.0018229696,"about_ca_system_score_codex":0.0005606373,"about_ca_system_score_gemma":0.0006524582,"threshold_uncertainty_score":0.0047926307},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26096192,0.0051926346,0.72421235,0.00050055544,0.00007340639,0.0000699302,0.00009635975,0.00011927107,0.008773605],"genre_scores_gemma":[0.9825403,0.0014874532,0.014232592,0.00003532954,0.000030183182,0.000030072046,0.000030153666,0.000032473057,0.0015813471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994324,0.00019926339,0.00002816824,0.00006151576,0.00022169694,0.00005699635],"domain_scores_gemma":[0.9956117,0.0032840709,0.0004790809,0.00015728851,0.00038381372,0.00008393313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013756866,0.0006860763,0.00055966823,0.0004808119,0.0002441348,0.00076014234,0.00045444435,0.00045643054,0.0008765507],"category_scores_gemma":[0.0071673277,0.00030196065,0.00027716023,0.00034360844,0.0009101016,0.0012885923,0.00057510595,0.0006084246,0.00023978653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020997063,0.000045407603,0.0014821409,0.00020682892,0.00005737251,0.0005086545,0.00039336507,0.8763337,0.0267757,0.07713674,0.00050913007,0.016341018],"study_design_scores_gemma":[0.000014260923,0.00006635599,0.0004269215,0.000017771006,0.0000134198635,0.00028008918,0.00006487371,0.9760494,0.004673889,0.017812537,0.0005561603,0.000024364443],"about_ca_topic_score_codex":0.0007205345,"about_ca_topic_score_gemma":0.00040414714,"teacher_disagreement_score":0.0014013401,"about_ca_system_score_codex":0.0014013401,"about_ca_system_score_gemma":0.0004001075,"threshold_uncertainty_score":0.01016742},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0889647,0.0027149438,0.86528,0.001810117,0.000100211895,0.00006892878,0.0005277431,0.0003849495,0.04014853],"genre_scores_gemma":[0.9373067,0.0020386863,0.05514039,0.0002843076,0.00013544019,0.00034806068,0.0004038867,0.00009212396,0.004250375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983877,0.0005964507,0.000049255308,0.00011120792,0.00054972933,0.00030563478],"domain_scores_gemma":[0.99021953,0.0073046237,0.00057437835,0.00055819354,0.0010649059,0.00027842724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026429018,0.0007269332,0.00083425397,0.0011736428,0.00058889156,0.002207829,0.0010460903,0.0008200321,0.003606909],"category_scores_gemma":[0.010435716,0.00034524628,0.0005079299,0.0013224939,0.0026920522,0.0025196427,0.0020680388,0.0019119314,0.00066993246],"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.00013880218,0.00003100142,0.00024702007,0.00010992278,0.000022988981,0.000091225615,0.00019009424,0.39313522,0.002868362,0.5881988,0.0026598969,0.012306701],"study_design_scores_gemma":[0.000016174112,0.000021294883,0.000084581814,0.000035517325,0.000005076118,0.00004523933,0.000041006933,0.76232874,0.0009977343,0.23497628,0.0014300862,0.00001841297],"about_ca_topic_score_codex":0.0023164593,"about_ca_topic_score_gemma":0.0012417111,"teacher_disagreement_score":0.003606909,"about_ca_system_score_codex":0.0024315629,"about_ca_system_score_gemma":0.0013569633,"threshold_uncertainty_score":0.01764226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09008733,0.005633977,0.8032882,0.0008605995,0.00030076702,0.00017127417,0.0002595371,0.00038214735,0.0990162],"genre_scores_gemma":[0.92958987,0.005774663,0.04704804,0.00029031027,0.00029591392,0.00017160072,0.00018811316,0.00010097377,0.016540537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993261,0.0002312586,0.000017715618,0.000058949154,0.00025397382,0.00011193947],"domain_scores_gemma":[0.9984742,0.0009164771,0.000105236824,0.00013948038,0.0003352537,0.000029378969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011174883,0.0008585799,0.0005890858,0.0009104134,0.000552614,0.00092863385,0.00066146575,0.00082214194,0.002595644],"category_scores_gemma":[0.002855475,0.0002046981,0.00041047373,0.0012144997,0.0016260667,0.0010343154,0.0008160659,0.00054990436,0.0010102465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031605223,0.00006394874,0.00070150354,0.0004821871,0.00007900556,0.0012354489,0.00041910645,0.4573063,0.029551005,0.43327755,0.011345096,0.06522286],"study_design_scores_gemma":[0.000039831728,0.00037240217,0.0006182856,0.000116062474,0.000070293805,0.0012149145,0.00012492303,0.85152924,0.013387673,0.11684633,0.015608703,0.000071330534],"about_ca_topic_score_codex":0.0021467388,"about_ca_topic_score_gemma":0.0020329219,"teacher_disagreement_score":0.002595644,"about_ca_system_score_codex":0.00102924,"about_ca_system_score_gemma":0.0006043193,"threshold_uncertainty_score":0.008683264},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043669783,0.0012081607,0.95227623,0.00012723541,0.000013514701,0.00004711115,0.000012274837,0.00011833231,0.0025273627],"genre_scores_gemma":[0.9327683,0.0009953445,0.065301746,0.00003017047,0.000034735207,0.000092215865,0.000019189227,0.00002190183,0.0007364911],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855727,0.0007235807,0.000040986404,0.00013145102,0.0004522399,0.000094558614],"domain_scores_gemma":[0.9955712,0.003313537,0.00035620958,0.00025046227,0.00046222357,0.00004641692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026307493,0.00096412905,0.0006791102,0.0005423209,0.00032540265,0.00088250166,0.0008582723,0.0007121002,0.00065533747],"category_scores_gemma":[0.008654366,0.00037283046,0.00038321104,0.0005724917,0.00094751065,0.0009767648,0.000635517,0.00047703917,0.00016584291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007716009,0.0000328606,0.00045025136,0.00008848583,0.000030600717,0.00006136522,0.00007875176,0.94526196,0.0064739166,0.016256446,0.00018576095,0.031002536],"study_design_scores_gemma":[0.0000107662845,0.000113326016,0.00011046386,0.0000069456687,0.000011926421,0.00005157752,0.000012301205,0.99501485,0.0012572797,0.0031815746,0.00022379034,0.0000051188567],"about_ca_topic_score_codex":0.0008505953,"about_ca_topic_score_gemma":0.0006985169,"teacher_disagreement_score":0.0026307493,"about_ca_system_score_codex":0.0011221387,"about_ca_system_score_gemma":0.00061183807,"threshold_uncertainty_score":0.013912916},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8783199,0.00047925668,0.11695879,0.00015683194,0.000019060886,0.000026042188,0.000049673123,0.00010250184,0.0038878294],"genre_scores_gemma":[0.9976539,0.000063519314,0.0019630378,0.00000750002,0.0000030385643,0.000007941349,0.000007694341,0.0000030259996,0.00029032477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992849,0.0003154831,0.000026238024,0.00008207931,0.00016962149,0.000121670884],"domain_scores_gemma":[0.99322987,0.004711229,0.0006796529,0.0003024268,0.00088075746,0.00019600302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016519221,0.0009619289,0.0008353804,0.0005721113,0.00055045367,0.0008465846,0.000753402,0.00095607305,0.0004446662],"category_scores_gemma":[0.006834579,0.000254313,0.00033449344,0.0006818716,0.0015659037,0.0009717062,0.0011566135,0.00043523582,0.000094459734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012314176,0.000019629762,0.000800929,0.00002694003,0.000024203184,0.000097864664,0.00007198451,0.99098396,0.0031922485,0.002611461,0.000048265978,0.0019993745],"study_design_scores_gemma":[0.000008531586,0.00007985634,0.00020039118,0.0000036872518,0.000012302555,0.000035198453,0.00002675253,0.9972806,0.0014358531,0.0008823824,0.000025421374,0.000009071889],"about_ca_topic_score_codex":0.0041448185,"about_ca_topic_score_gemma":0.0030355023,"teacher_disagreement_score":0.0041448185,"about_ca_system_score_codex":0.0012195732,"about_ca_system_score_gemma":0.00082122267,"threshold_uncertainty_score":0.008848667},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04709459,0.0007683015,0.9476349,0.00039814977,0.000035531728,0.000070990194,0.00015581626,0.0001511815,0.0036905967],"genre_scores_gemma":[0.8752468,0.0009308804,0.1194375,0.00011772004,0.000039413077,0.00017296943,0.00013045216,0.000021233876,0.00390306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945205,0.0001868132,0.00003151111,0.00009407929,0.0001428712,0.000092762515],"domain_scores_gemma":[0.9989568,0.0006551774,0.000108040564,0.000127303,0.0001202499,0.000032366795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010539388,0.0010087327,0.00092144636,0.00038864234,0.00057552516,0.0008419084,0.0011350374,0.0008759483,0.0016843181],"category_scores_gemma":[0.002785936,0.00034805085,0.000581521,0.0005358947,0.0011598814,0.0016530581,0.0012226711,0.0006833161,0.00031120837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028444966,0.000052449905,0.00039183738,0.00031712942,0.00008094176,0.0003019428,0.00040091417,0.78191155,0.015030066,0.16089392,0.0017452661,0.0385896],"study_design_scores_gemma":[0.000033630313,0.00011224856,0.00008242748,0.0000205054,0.0000355129,0.00015616708,0.000029198382,0.9719319,0.0032862264,0.023075657,0.0012149506,0.000021705266],"about_ca_topic_score_codex":0.0029345166,"about_ca_topic_score_gemma":0.0031014567,"teacher_disagreement_score":0.0029345166,"about_ca_system_score_codex":0.0012002519,"about_ca_system_score_gemma":0.0011605269,"threshold_uncertainty_score":0.008708537},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13398056,0.0033344156,0.85788685,0.00028407664,0.00006111029,0.000041571897,0.000042522453,0.00015699965,0.0042118877],"genre_scores_gemma":[0.96787363,0.0012855465,0.029646635,0.00005330078,0.000042529628,0.000037426253,0.0000144371725,0.000012267213,0.0010341007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949884,0.00016905906,0.000023379293,0.00006615045,0.00017378449,0.00006868334],"domain_scores_gemma":[0.9977882,0.0016230247,0.00023533161,0.00011370129,0.00021407558,0.000025634847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009011268,0.0006408707,0.00040739035,0.000379928,0.00037749394,0.0007415401,0.0006241674,0.0005336468,0.00066047045],"category_scores_gemma":[0.0044022356,0.00020708503,0.00018915674,0.00046941545,0.0005656085,0.0008460166,0.00050055026,0.00052772963,0.00015826998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000204949,0.000044908196,0.00086665526,0.00027647236,0.00004546955,0.00037030276,0.00024464843,0.82285124,0.041658115,0.078010716,0.00063814456,0.054788377],"study_design_scores_gemma":[0.000010264355,0.00008791202,0.00021195032,0.0000135205,0.000016308322,0.000099093864,0.000021007247,0.98381907,0.0044727526,0.010486606,0.00074741675,0.000014199419],"about_ca_topic_score_codex":0.0013332195,"about_ca_topic_score_gemma":0.001875049,"teacher_disagreement_score":0.0013332195,"about_ca_system_score_codex":0.0010073483,"about_ca_system_score_gemma":0.00044420754,"threshold_uncertainty_score":0.0073088408},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10804658,0.00038789524,0.8850087,0.00031833228,0.000051187253,0.00007522597,0.000056001212,0.00019623783,0.0058598537],"genre_scores_gemma":[0.90157676,0.00018348695,0.09499468,0.00008519869,0.000023964154,0.0001046849,0.00006232211,0.000018205532,0.0029507184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902666,0.0004458429,0.000032611606,0.000120948855,0.00019880712,0.00017521658],"domain_scores_gemma":[0.99843556,0.00091752474,0.00016599719,0.00017913299,0.00022131744,0.000080432765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011884889,0.00036801066,0.0005357195,0.0005855653,0.00070381415,0.0009951759,0.000967221,0.00064408995,0.0010222329],"category_scores_gemma":[0.0039044914,0.00025999278,0.00022913501,0.0007049305,0.0011555051,0.0011739966,0.0013226678,0.00063690345,0.00019708897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001239078,0.000093222494,0.0005501714,0.00003347325,0.000018035813,0.00013208095,0.00012426803,0.86011255,0.0042851176,0.07085972,0.0008830941,0.06278434],"study_design_scores_gemma":[0.000006041725,0.000017881623,0.00004192361,0.0000031604718,0.0000022102147,0.000017926734,0.000012791711,0.990231,0.00073345634,0.008523974,0.0004064457,0.0000032713488],"about_ca_topic_score_codex":0.004462241,"about_ca_topic_score_gemma":0.006133963,"teacher_disagreement_score":0.004462241,"about_ca_system_score_codex":0.0011783516,"about_ca_system_score_gemma":0.0015195966,"threshold_uncertainty_score":0.008872509},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25572726,0.0029587043,0.72977257,0.00028060272,0.000073023606,0.000080017235,0.000048434697,0.00028010085,0.010779255],"genre_scores_gemma":[0.92976207,0.00060898124,0.06691237,0.000053204123,0.000022928485,0.000052322004,0.000019406076,0.000010457247,0.0025582307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996147,0.00014205815,0.000023371258,0.00005134261,0.00012887544,0.000039609768],"domain_scores_gemma":[0.9978162,0.0015214485,0.00020376538,0.00017774274,0.0002334578,0.000047354806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009459867,0.0007729111,0.00061325415,0.00038868995,0.00036990704,0.00060073216,0.00072826486,0.0006614916,0.0014037859],"category_scores_gemma":[0.0027655936,0.0001749307,0.00041194743,0.00046906705,0.0006935228,0.0009075273,0.00051249086,0.00035410875,0.00029070856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036532493,0.00013365777,0.0013652204,0.00045585207,0.00017179879,0.00034831415,0.00036047783,0.7329922,0.027426539,0.040405672,0.0006824725,0.19529252],"study_design_scores_gemma":[0.000034058212,0.00033795668,0.00046728418,0.000026329015,0.000066167406,0.00029944387,0.00008692815,0.9742905,0.014480947,0.00895713,0.00092755683,0.000025684298],"about_ca_topic_score_codex":0.000999067,"about_ca_topic_score_gemma":0.002243678,"teacher_disagreement_score":0.0014037859,"about_ca_system_score_codex":0.00046663205,"about_ca_system_score_gemma":0.00042166997,"threshold_uncertainty_score":0.005002916},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010449934,0.0003180273,0.9867741,0.0001017747,0.000024429259,0.00001646401,0.0000212388,0.000045639732,0.0022483408],"genre_scores_gemma":[0.7650573,0.0015034871,0.2274266,0.00010992391,0.000079310725,0.00016007232,0.00007422766,0.00002304739,0.005565939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997857,0.00007968416,0.000007472549,0.000036988116,0.00006097408,0.000029120234],"domain_scores_gemma":[0.9997187,0.00016574028,0.00003437837,0.00002012837,0.00005298145,0.000008015206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042899678,0.00063567667,0.000472682,0.00019028535,0.00022928143,0.0004561174,0.00047691437,0.0007294745,0.0015454221],"category_scores_gemma":[0.00092924724,0.00020347547,0.00033698126,0.00049150345,0.0004941702,0.00066045154,0.0004481571,0.00043010828,0.00042151383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007288943,0.0000324461,0.00034416755,0.00015338654,0.000036490845,0.00019837469,0.000102864506,0.8843214,0.016338082,0.058894336,0.001030838,0.038474813],"study_design_scores_gemma":[0.00000819743,0.000035511843,0.00005903411,0.0000057583193,0.000010582205,0.00003121983,0.000015211948,0.9905363,0.0014892152,0.0069883065,0.0008138543,0.000006908863],"about_ca_topic_score_codex":0.0014900529,"about_ca_topic_score_gemma":0.0022132348,"teacher_disagreement_score":0.0015454221,"about_ca_system_score_codex":0.00044715538,"about_ca_system_score_gemma":0.0004725131,"threshold_uncertainty_score":0.0051699877},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07346308,0.0006918606,0.92300814,0.00016763288,0.000011284899,0.000028328866,0.000025389934,0.000096243544,0.0025079874],"genre_scores_gemma":[0.95794386,0.00035740805,0.04046581,0.000032405685,0.000023818056,0.000059847072,0.000028139812,0.000013688312,0.0010750055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993135,0.00037755937,0.000021550703,0.00008112234,0.00014955785,0.000056815912],"domain_scores_gemma":[0.9993175,0.00046512036,0.000060742666,0.00007211678,0.00006269422,0.000021783997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012792893,0.00044021124,0.0005931047,0.00040042744,0.00033921623,0.00050385157,0.00068068114,0.0005160858,0.00042828603],"category_scores_gemma":[0.0023432092,0.00028144527,0.0002446136,0.000737606,0.00055314257,0.0010724717,0.0007619936,0.00026840146,0.00008815929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004851035,0.000027365591,0.00045023946,0.00004153942,0.000018918478,0.00006740277,0.00006619673,0.9490406,0.0034913763,0.015015637,0.0003656374,0.0313666],"study_design_scores_gemma":[0.000008499895,0.000048247715,0.00021724781,0.000004023334,0.000007657755,0.000023072454,0.000022671768,0.9843418,0.0011687295,0.013638082,0.00051518244,0.000004773746],"about_ca_topic_score_codex":0.00081097486,"about_ca_topic_score_gemma":0.0012775358,"teacher_disagreement_score":0.0012792893,"about_ca_system_score_codex":0.00062865455,"about_ca_system_score_gemma":0.00039410536,"threshold_uncertainty_score":0.0067656636},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07035695,0.00042103644,0.92697227,0.00014791486,0.000012890313,0.000022063401,0.000047891448,0.0001377375,0.0018812349],"genre_scores_gemma":[0.9188776,0.00035366285,0.07849855,0.000055585275,0.000022320291,0.00008326666,0.000059031107,0.000036573223,0.0020134188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989159,0.0006235363,0.000046041292,0.00012448232,0.00018092754,0.000109079716],"domain_scores_gemma":[0.99834466,0.0010892854,0.00013376435,0.00017079538,0.00021859357,0.000042894135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019649868,0.0010686076,0.0009445097,0.00030044987,0.00027485847,0.0008559504,0.00064679113,0.00095510203,0.00061083416],"category_scores_gemma":[0.0048735742,0.0004984843,0.00030206607,0.00061378157,0.0008677706,0.0012318768,0.0009160702,0.0004971763,0.00027919761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064079446,0.000018253899,0.00029342563,0.00003623739,0.000031374042,0.000053213073,0.00006239616,0.9759971,0.002260855,0.00692095,0.00022744518,0.014034781],"study_design_scores_gemma":[0.00001889237,0.000060835333,0.00012444398,0.000006093006,0.000018987415,0.00003140351,0.000020483432,0.98878574,0.002259167,0.008396639,0.0002692385,0.000008119798],"about_ca_topic_score_codex":0.0015468656,"about_ca_topic_score_gemma":0.001902389,"teacher_disagreement_score":0.0019649868,"about_ca_system_score_codex":0.00048906164,"about_ca_system_score_gemma":0.000962462,"threshold_uncertainty_score":0.010391951},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05041513,0.0002847716,0.94651306,0.0002527059,0.000036439505,0.000022616785,0.000033836357,0.00021863371,0.0022227478],"genre_scores_gemma":[0.8602228,0.00037761213,0.1383559,0.00007805416,0.000045438144,0.000063167216,0.000075980584,0.00004849974,0.0007326005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992829,0.0002880522,0.000018903818,0.0000849142,0.0002653246,0.00005987345],"domain_scores_gemma":[0.9938253,0.0041571413,0.00043961752,0.00081368384,0.000695126,0.00006915267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018331436,0.00048005875,0.0005056763,0.00054820016,0.00040588263,0.00065946375,0.0009297295,0.0006915883,0.0004908651],"category_scores_gemma":[0.0115449745,0.0002625643,0.00031642456,0.00050498534,0.0009157015,0.0020910774,0.001161702,0.000799127,0.00016430666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042901727,0.000017798822,0.0011575269,0.000023618228,0.0000110898645,0.000036998135,0.00006527903,0.953041,0.0021190383,0.025649806,0.00040668345,0.017428266],"study_design_scores_gemma":[0.0000022150346,0.000007738732,0.00007215676,0.0000028131226,0.0000016447543,0.000008211757,0.00000678479,0.99470806,0.0005803184,0.0044717994,0.000135091,0.0000031831953],"about_ca_topic_score_codex":0.0050574257,"about_ca_topic_score_gemma":0.0035516536,"teacher_disagreement_score":0.0050574257,"about_ca_system_score_codex":0.0006513706,"about_ca_system_score_gemma":0.0008229653,"threshold_uncertainty_score":0.010055959},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003713126,0.00024450163,0.9906951,0.0006165599,0.000048129707,0.00009223062,0.000028120863,0.00013431895,0.004427978],"genre_scores_gemma":[0.3691126,0.0011915165,0.61706257,0.00048751038,0.00031620075,0.00049086305,0.00014803547,0.00010706736,0.011083602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872786,0.0004516275,0.00005227419,0.00016760189,0.00054254255,0.000058087782],"domain_scores_gemma":[0.99759704,0.0010981277,0.00018611028,0.0005675526,0.00047882504,0.000072419694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014381572,0.0005036706,0.0005154403,0.00145486,0.0009083028,0.0015854117,0.0017732455,0.0012225343,0.0017772662],"category_scores_gemma":[0.0042226,0.0003401059,0.00041975433,0.0015098433,0.0013034294,0.0026724646,0.0013583848,0.0011306276,0.0005186823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012031263,0.00020756105,0.0006549218,0.00039687098,0.000084233114,0.00026792294,0.00063839724,0.13356896,0.05123782,0.6130365,0.0067180977,0.19306837],"study_design_scores_gemma":[0.000056562345,0.00021949432,0.000358773,0.00005739087,0.00006069759,0.0006622859,0.00019242894,0.77293,0.029010357,0.1575324,0.038876534,0.000043064603],"about_ca_topic_score_codex":0.0006153956,"about_ca_topic_score_gemma":0.00083119195,"teacher_disagreement_score":0.0017772662,"about_ca_system_score_codex":0.0011597666,"about_ca_system_score_gemma":0.001128453,"threshold_uncertainty_score":0.008414805},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032672405,0.00022510512,0.9663389,0.00005652284,0.000013736858,0.000014724699,0.000024312396,0.00007193516,0.0005824218],"genre_scores_gemma":[0.8189389,0.0006585817,0.17863505,0.000043296848,0.00006014303,0.000056648707,0.00006945963,0.000019985264,0.001518019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932945,0.00022172506,0.000028068058,0.00012912908,0.00022564452,0.00006602461],"domain_scores_gemma":[0.99767643,0.0016908557,0.00025162654,0.00016206366,0.00018257766,0.000036388785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010352258,0.000601792,0.00068249315,0.00033157342,0.0003648188,0.0006053218,0.0007578102,0.0008478412,0.00048390141],"category_scores_gemma":[0.0038848382,0.00048392126,0.0005741825,0.00042005835,0.00073725014,0.001320977,0.0007422935,0.00079303735,0.00017011457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016757681,0.000033411456,0.00076962006,0.00009368035,0.000037286856,0.00024524634,0.00017747153,0.9248297,0.008176698,0.012725045,0.00033807926,0.05240622],"study_design_scores_gemma":[0.0000042083593,0.00002652328,0.00012944048,0.0000034860252,0.0000064609603,0.000051163977,0.0000076226142,0.9964903,0.0015191812,0.0016211795,0.00013262601,0.000007755534],"about_ca_topic_score_codex":0.0033081246,"about_ca_topic_score_gemma":0.0025214136,"teacher_disagreement_score":0.0033081246,"about_ca_system_score_codex":0.00047020408,"about_ca_system_score_gemma":0.0005452343,"threshold_uncertainty_score":0.00657773},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004845183,0.0009238158,0.9866149,0.00017592972,0.00021167027,0.000048865382,0.00013178412,0.00024487672,0.0068030204],"genre_scores_gemma":[0.5168122,0.0031227577,0.45934314,0.00043996275,0.00036215244,0.00035173364,0.0009656329,0.000087935085,0.018514479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915075,0.00021851549,0.000033127984,0.0001268404,0.00037416533,0.00009664982],"domain_scores_gemma":[0.99911135,0.00028122336,0.00007274007,0.00021496727,0.00028431453,0.000035325604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005171657,0.00046845461,0.0006086453,0.000435484,0.00033785007,0.00084413186,0.00073761656,0.0005768533,0.0025138357],"category_scores_gemma":[0.0016091173,0.00017920678,0.00028733746,0.00096009666,0.00060003204,0.00085561606,0.0007840781,0.0008325557,0.001255213],"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.000362779,0.00007859336,0.0007013325,0.00023344654,0.000067240435,0.00020670761,0.000107352185,0.22167158,0.025638405,0.45794913,0.0103218425,0.2826616],"study_design_scores_gemma":[0.00006089301,0.0001363154,0.00023756328,0.00003473625,0.000025461592,0.0002898335,0.000022203632,0.8816088,0.00996548,0.07367713,0.033915825,0.000025764672],"about_ca_topic_score_codex":0.0015569422,"about_ca_topic_score_gemma":0.001974883,"teacher_disagreement_score":0.0025138357,"about_ca_system_score_codex":0.0007180907,"about_ca_system_score_gemma":0.00091310777,"threshold_uncertainty_score":0.00840956},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15083644,0.0009975324,0.8372342,0.00025784248,0.00003614792,0.000045656227,0.000052149604,0.00027065296,0.01026935],"genre_scores_gemma":[0.95041126,0.0007788552,0.04688439,0.00009413777,0.000038765822,0.00003911953,0.000033989385,0.000014355315,0.0017052117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990459,0.00036601175,0.000058524107,0.00008662114,0.0003221031,0.000120803634],"domain_scores_gemma":[0.9982589,0.0010543315,0.00024666506,0.0001807394,0.00023588557,0.000023490264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012296243,0.00068045186,0.0006448034,0.0005009173,0.00042622065,0.0009773485,0.00039747125,0.00060518936,0.0005847923],"category_scores_gemma":[0.0030662958,0.00024546636,0.00037350922,0.0008858762,0.0006918369,0.0009519346,0.0006413638,0.0004118987,0.00035675106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004042067,0.00007541783,0.0040339227,0.00031372445,0.00012721973,0.0008946993,0.000561035,0.6653806,0.075699605,0.12550637,0.0010210895,0.1259821],"study_design_scores_gemma":[0.000018054598,0.0002426519,0.0013001437,0.000036115034,0.00009002959,0.00066860975,0.00008905551,0.928399,0.035146527,0.031817228,0.002151592,0.0000410615],"about_ca_topic_score_codex":0.00052096497,"about_ca_topic_score_gemma":0.0007480907,"teacher_disagreement_score":0.0012296243,"about_ca_system_score_codex":0.00067430775,"about_ca_system_score_gemma":0.00043332923,"threshold_uncertainty_score":0.006502986},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8273887,0.0015862637,0.16190925,0.00045184803,0.000042185828,0.00004078408,0.00016293807,0.00039341697,0.0080244895],"genre_scores_gemma":[0.99699867,0.000283755,0.0023754765,0.000023400147,0.000009347306,0.0000092505115,0.000023960318,0.00001917116,0.00025693356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983596,0.0006800047,0.00006613653,0.000119814555,0.00047387055,0.00030049274],"domain_scores_gemma":[0.98486996,0.012191182,0.0012995682,0.00057829334,0.0009815926,0.0000794223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023213762,0.00094188616,0.0008584649,0.0006741812,0.00054143125,0.0010738749,0.00041517982,0.00088037725,0.0004869228],"category_scores_gemma":[0.019286165,0.0002592984,0.00036624496,0.00057207746,0.001446458,0.0015153671,0.0006856198,0.0006336956,0.00014005585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014819417,0.000030716223,0.0025343802,0.0000612811,0.00004828397,0.00020642608,0.000112285874,0.9816622,0.0058700624,0.0039349906,0.00011864378,0.0052725296],"study_design_scores_gemma":[0.000008209676,0.0001601074,0.0022106045,0.000016830547,0.000048370224,0.00019127985,0.00007721435,0.98686755,0.008739842,0.0015145949,0.000137304,0.000028167753],"about_ca_topic_score_codex":0.0032899072,"about_ca_topic_score_gemma":0.0022920095,"teacher_disagreement_score":0.0032899072,"about_ca_system_score_codex":0.0013921838,"about_ca_system_score_gemma":0.00077708677,"threshold_uncertainty_score":0.012276769},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15747295,0.00049173966,0.8385777,0.00042892137,0.000042183863,0.000029831988,0.000041103605,0.00008327455,0.0028322905],"genre_scores_gemma":[0.96307415,0.00042586043,0.035340514,0.000042112923,0.00003497349,0.000052215215,0.000031637497,0.000013514997,0.0009849394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959403,0.00016284442,0.000013852393,0.00005018198,0.0001320909,0.00004703998],"domain_scores_gemma":[0.9983125,0.0010551296,0.0002496146,0.00020057938,0.00013992499,0.00004228822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069336087,0.00040367738,0.00038537523,0.0003706091,0.00044479614,0.00045736955,0.00050672673,0.00058340334,0.00041924004],"category_scores_gemma":[0.003464118,0.00016363499,0.00029075288,0.0005219685,0.0010999275,0.0012145749,0.0011119965,0.00059933536,0.000077597506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108620006,0.00003658467,0.0006612948,0.00012328842,0.00002979673,0.00017637396,0.00018326212,0.8308355,0.0179688,0.119968034,0.00054937677,0.029359171],"study_design_scores_gemma":[0.000013851473,0.00008512541,0.00018007099,0.000010174443,0.000008324968,0.00009550282,0.000044341665,0.946055,0.004164547,0.048588023,0.0007431861,0.00001194738],"about_ca_topic_score_codex":0.0005467862,"about_ca_topic_score_gemma":0.0005318431,"teacher_disagreement_score":0.00069336087,"about_ca_system_score_codex":0.00047431162,"about_ca_system_score_gemma":0.0004978983,"threshold_uncertainty_score":0.0036669374},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018867729,0.00049875665,0.99549305,0.00011964362,0.000038636736,0.000047463986,0.000019220854,0.00035164846,0.0015448433],"genre_scores_gemma":[0.2861801,0.0022166977,0.7045639,0.00019508995,0.00020471471,0.00078027195,0.00022282392,0.00024487806,0.0053914553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908924,0.0002608529,0.00005610269,0.00015723634,0.00035785954,0.00007867963],"domain_scores_gemma":[0.9985501,0.0009556131,0.00013140544,0.0001641458,0.00017099059,0.00002769353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015280719,0.0014932945,0.001058018,0.0007078022,0.00067922863,0.0013120858,0.0013442438,0.001048273,0.0035104624],"category_scores_gemma":[0.005213563,0.0005378377,0.00046513323,0.0013783127,0.0011462348,0.002023603,0.001232432,0.002173104,0.00097451534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038961884,0.000040168008,0.00016597241,0.000096519085,0.000024045054,0.000031799944,0.000056765373,0.8328255,0.001520121,0.05007606,0.0026797042,0.11244444],"study_design_scores_gemma":[0.000018049315,0.000013407076,0.000025072237,0.000008233845,0.00000270431,0.000011033273,0.000007010734,0.97801673,0.00037306754,0.020337053,0.0011835768,0.000004022031],"about_ca_topic_score_codex":0.002960103,"about_ca_topic_score_gemma":0.0033094673,"teacher_disagreement_score":0.0035104624,"about_ca_system_score_codex":0.001095464,"about_ca_system_score_gemma":0.0014735304,"threshold_uncertainty_score":0.011743724},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26743624,0.0024905526,0.68249416,0.0019383895,0.00013618251,0.000095106174,0.00080939993,0.00045172285,0.0441483],"genre_scores_gemma":[0.9855854,0.0010366328,0.009953921,0.00011208433,0.00014569769,0.000109833425,0.00022055069,0.000039478582,0.0027964222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826777,0.0006549537,0.000043815813,0.00017935551,0.0004563451,0.00039774796],"domain_scores_gemma":[0.9861013,0.01067728,0.0009810069,0.0006231736,0.0012903126,0.00032702973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017998077,0.00073997764,0.0006660799,0.0014148625,0.000600018,0.0015398661,0.00091716443,0.0007842186,0.0038675885],"category_scores_gemma":[0.010551007,0.00036492632,0.0004674127,0.0013845705,0.0025545743,0.0030828814,0.0014046109,0.0013767973,0.00035280097],"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.00018328962,0.000038214737,0.0005097439,0.0001491051,0.000031456657,0.00019080019,0.00021024473,0.36094576,0.0036359753,0.62397456,0.0022577208,0.007873144],"study_design_scores_gemma":[0.0000100273055,0.0000322342,0.00022859007,0.000028793018,0.000008499439,0.00006908983,0.00007247032,0.79986954,0.001212425,0.1976732,0.00076675246,0.000028383709],"about_ca_topic_score_codex":0.0025448462,"about_ca_topic_score_gemma":0.0010984228,"teacher_disagreement_score":0.0038675885,"about_ca_system_score_codex":0.002274471,"about_ca_system_score_gemma":0.0014889147,"threshold_uncertainty_score":0.0165025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0678843,0.00042692435,0.9260146,0.00064945896,0.000026857577,0.000084031846,0.00009646094,0.000063977706,0.0047532613],"genre_scores_gemma":[0.9155293,0.000710379,0.080854505,0.00013823142,0.00004555863,0.0001640656,0.00007963105,0.00002324279,0.0024551095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997792,0.0008569591,0.00012377331,0.00026835708,0.00069317897,0.00026561713],"domain_scores_gemma":[0.99150276,0.0062729646,0.0011070113,0.0005903018,0.00035560713,0.00017129112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035371631,0.001333998,0.001261801,0.00059727137,0.0006684723,0.0020525097,0.0014540427,0.0020167024,0.001130492],"category_scores_gemma":[0.009328802,0.00055650005,0.00076214975,0.0010810328,0.0023964697,0.0028191805,0.0035002073,0.0018563644,0.00031509876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039314566,0.00010806785,0.0010951293,0.00046133008,0.0001390309,0.00096176635,0.0008386284,0.6237566,0.015535743,0.33448902,0.0008680346,0.021353533],"study_design_scores_gemma":[0.00007452976,0.00019742706,0.00029597853,0.000047004294,0.00005818477,0.00058286934,0.00014871283,0.86174935,0.013981721,0.12150849,0.0013067281,0.000048988637],"about_ca_topic_score_codex":0.00054541073,"about_ca_topic_score_gemma":0.00034549207,"teacher_disagreement_score":0.0035371631,"about_ca_system_score_codex":0.0014615343,"about_ca_system_score_gemma":0.0011333018,"threshold_uncertainty_score":0.0187065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029038372,0.0038516764,0.00026176317,0.021785293,0.972809,0.000014041476,0.000022634871,0.000033654145,0.0011929104],"genre_scores_gemma":[0.00034475615,0.0035519109,0.00014151691,0.009520026,0.9801854,0.000017452197,0.000017177203,0.000033898432,0.0061878287],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99617225,0.0005163809,0.00042252144,0.00045332912,0.0021835621,0.00025196173],"domain_scores_gemma":[0.9813069,0.0069378,0.0010281323,0.00047965368,0.008403337,0.0018440987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005378386,0.0033203661,0.0026830635,0.0033061253,0.0024809004,0.006530037,0.0030092401,0.011147677,0.011121898],"category_scores_gemma":[0.019369755,0.0009560329,0.0023508405,0.0012139168,0.0028036667,0.0040521147,0.001225923,0.020090654,0.01138434],"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.000035934485,0.000014653457,0.000021680975,0.00014457174,0.000014125311,0.000089319336,0.000009410492,0.00003367662,0.00008819821,0.0007269514,0.99350315,0.0053183986],"study_design_scores_gemma":[0.000060852726,0.000042678752,0.00021510107,0.00034405387,0.000048038306,0.00029075128,0.00003120759,0.00033285434,0.00023905646,0.0021465814,0.996227,0.000021829337],"about_ca_topic_score_codex":0.0006637157,"about_ca_topic_score_gemma":0.0015517022,"teacher_disagreement_score":0.011147677,"about_ca_system_score_codex":0.0022353171,"about_ca_system_score_gemma":0.0020146163,"threshold_uncertainty_score":0.03720647},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6267807,0.0016164798,0.3652395,0.0002488761,0.000066454624,0.000058619495,0.000034625,0.0010868949,0.0048679276],"genre_scores_gemma":[0.99039674,0.00011545509,0.009030332,0.000015117355,0.000005301567,0.000007926697,0.0000089624955,0.000007972306,0.00041219543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955076,0.0001504884,0.000014190993,0.00006547684,0.00013008006,0.000088911875],"domain_scores_gemma":[0.9990946,0.0004999666,0.000062069856,0.000107367545,0.00020340514,0.00003255199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080751017,0.00057053566,0.0004179942,0.00046221897,0.00045274507,0.00050874293,0.0006971885,0.0003988945,0.00064200565],"category_scores_gemma":[0.0018072581,0.00013850386,0.00026434596,0.00042887084,0.00047585793,0.0006878905,0.0006934101,0.00038722574,0.000084681335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012319778,0.00035546612,0.0043453076,0.0003551295,0.00023498408,0.0008072153,0.0009889492,0.5097537,0.22207932,0.019310627,0.002530146,0.23800713],"study_design_scores_gemma":[0.00003058219,0.0005457717,0.000899435,0.000009134148,0.000105173356,0.000249668,0.00009053541,0.9432151,0.050667357,0.002815138,0.0013479263,0.000024194116],"about_ca_topic_score_codex":0.0019468821,"about_ca_topic_score_gemma":0.0019387172,"teacher_disagreement_score":0.0019468821,"about_ca_system_score_codex":0.00061201013,"about_ca_system_score_gemma":0.0004118522,"threshold_uncertainty_score":0.004440427},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012323802,0.00032028582,0.98405474,0.00011000517,0.000019497282,0.000020967522,0.000024270314,0.00005918102,0.0030672436],"genre_scores_gemma":[0.9257533,0.0005261258,0.0710086,0.000072006194,0.000057263558,0.00008683758,0.00003657838,0.000022392629,0.0024368642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907947,0.00034422294,0.00003321999,0.00016679046,0.000255228,0.00012101767],"domain_scores_gemma":[0.99848384,0.0010057272,0.0002206125,0.000124696,0.00014252143,0.000022680691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014434006,0.0009673531,0.00066591747,0.00035305755,0.00031840333,0.0011463026,0.0008671911,0.0011564179,0.0010715761],"category_scores_gemma":[0.0046354504,0.000359497,0.000463088,0.00056183233,0.0012609876,0.0012052044,0.0008491635,0.000776734,0.00020594691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004224616,0.000014625663,0.00010765151,0.00004239311,0.000020373109,0.000062146595,0.000039394316,0.9519813,0.0015888126,0.035172332,0.00016168173,0.010767061],"study_design_scores_gemma":[0.000012308154,0.00004536291,0.000072768235,0.0000060415505,0.000011723608,0.000031211624,0.000011171372,0.9802045,0.0011087247,0.018001048,0.0004856981,0.0000093255685],"about_ca_topic_score_codex":0.001800542,"about_ca_topic_score_gemma":0.0013390809,"teacher_disagreement_score":0.001800542,"about_ca_system_score_codex":0.000878342,"about_ca_system_score_gemma":0.0009230491,"threshold_uncertainty_score":0.0076335073},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021800188,0.0007579963,0.97442484,0.00035069635,0.00022206764,0.0002600208,0.000059170306,0.00067595823,0.0014491784],"genre_scores_gemma":[0.68659765,0.0008641125,0.3073027,0.00021518786,0.00027554831,0.00047881267,0.0001353506,0.00007375957,0.0040567867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975516,0.00073920324,0.00024102822,0.00025364038,0.0009787772,0.00023568001],"domain_scores_gemma":[0.9964149,0.0010193175,0.000729116,0.0010142215,0.00062840775,0.00019408607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002445339,0.000733618,0.0011100507,0.0010398161,0.0014968186,0.0014514059,0.002229393,0.0012039486,0.001769982],"category_scores_gemma":[0.005539379,0.00044321147,0.0006933041,0.001235312,0.0010475282,0.004775721,0.0023310115,0.0015984921,0.0006771936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016435767,0.00049282855,0.0019609109,0.0007618021,0.00018611051,0.0010181675,0.00064222736,0.15200256,0.073355004,0.34553456,0.012049035,0.41035327],"study_design_scores_gemma":[0.0002613379,0.0007549489,0.0006475557,0.000057268277,0.000118710406,0.0009910305,0.00006548487,0.902867,0.01637264,0.057786867,0.019905807,0.00017132619],"about_ca_topic_score_codex":0.0005027065,"about_ca_topic_score_gemma":0.00035400174,"teacher_disagreement_score":0.002445339,"about_ca_system_score_codex":0.001003457,"about_ca_system_score_gemma":0.0014458329,"threshold_uncertainty_score":0.01293236},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054461528,0.00093093107,0.9396273,0.00020830242,0.0000620098,0.00009304859,0.00009870214,0.00043429606,0.0040838392],"genre_scores_gemma":[0.82765925,0.0006575754,0.1687986,0.00012571752,0.00005135725,0.00015176521,0.00011024109,0.000028318143,0.0024170415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993906,0.00019843642,0.000043757467,0.000074563475,0.00021294602,0.000079820726],"domain_scores_gemma":[0.9990847,0.0003434977,0.00011473036,0.0002325745,0.0001814527,0.00004298255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007936172,0.00081789773,0.0008606189,0.00043859,0.00057439297,0.00066314824,0.0013620581,0.00064229296,0.0019423843],"category_scores_gemma":[0.0016619381,0.00037389845,0.0004538197,0.0005560658,0.00062141736,0.0017608275,0.0014938477,0.0007640753,0.0005401938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006610274,0.00020256932,0.0008230837,0.0008417415,0.00016520082,0.001024034,0.00084080757,0.37058115,0.24119934,0.11402979,0.004612,0.26501936],"study_design_scores_gemma":[0.00006825444,0.0003965585,0.00027836667,0.000035095458,0.000039905095,0.00074101216,0.00005107606,0.9608178,0.021119652,0.013525804,0.0028406119,0.000085926295],"about_ca_topic_score_codex":0.0005029303,"about_ca_topic_score_gemma":0.0006645604,"teacher_disagreement_score":0.0019423843,"about_ca_system_score_codex":0.00045404793,"about_ca_system_score_gemma":0.00061048556,"threshold_uncertainty_score":0.006497979},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02381252,0.0001596472,0.97485006,0.00007901745,0.00001749936,0.000023581693,0.00001945925,0.000055502962,0.0009828532],"genre_scores_gemma":[0.88701123,0.00037943036,0.11088752,0.000086479675,0.000046395257,0.00013705397,0.000050320145,0.000015116067,0.0013864835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996006,0.00015996161,0.000015765196,0.00006046438,0.00011116372,0.0000521328],"domain_scores_gemma":[0.99930334,0.000410201,0.0000802084,0.000043222004,0.00014326784,0.00001971127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058996293,0.00059053086,0.000520489,0.00018964236,0.00022130074,0.00052285835,0.0005312306,0.000651815,0.00062886224],"category_scores_gemma":[0.001791634,0.00027227736,0.0002530473,0.0003397535,0.0005871374,0.00036843488,0.00044347858,0.00036788982,0.00019607642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008648637,0.000039214614,0.0005921182,0.00009140733,0.00003549377,0.00009572155,0.00012148555,0.94468987,0.014718705,0.008593495,0.00051127916,0.03042473],"study_design_scores_gemma":[0.000011225073,0.00005481759,0.0000882539,0.0000046810874,0.0000074046525,0.000022926659,0.000008691345,0.9969512,0.00124476,0.0014166688,0.0001843234,0.0000050766316],"about_ca_topic_score_codex":0.0018536319,"about_ca_topic_score_gemma":0.0021677848,"teacher_disagreement_score":0.0018536319,"about_ca_system_score_codex":0.00042717595,"about_ca_system_score_gemma":0.0007831275,"threshold_uncertainty_score":0.0036857128},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26164716,0.00006953519,0.73406565,0.00013910056,0.000015985974,0.000070335394,0.000066533496,0.00045694128,0.003468712],"genre_scores_gemma":[0.9393717,0.000043760057,0.059267715,0.000029931147,0.0000070161595,0.00006842074,0.000049532187,0.00003826431,0.0011236169],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958986,0.00014914523,0.000020371597,0.00005977219,0.0001154778,0.00006541829],"domain_scores_gemma":[0.9978242,0.0012253942,0.0002917884,0.0003485582,0.0001858447,0.000124312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008241966,0.00029685773,0.00032674777,0.0003174525,0.000340827,0.0004583863,0.0006682309,0.00035784955,0.0005903426],"category_scores_gemma":[0.003918416,0.00021745815,0.00018126109,0.00031805137,0.001006158,0.0009811532,0.0006705649,0.0004325698,0.0001537174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045085145,0.000112211885,0.00083291397,0.0001286977,0.000031020172,0.00024729373,0.0003951776,0.7831204,0.066429354,0.11343653,0.0009874373,0.03382813],"study_design_scores_gemma":[0.000030364448,0.000106143874,0.00013300151,0.000004727434,0.000007124372,0.000038801736,0.000032833424,0.9652142,0.012826054,0.021124871,0.00047214486,0.000009761934],"about_ca_topic_score_codex":0.0014862162,"about_ca_topic_score_gemma":0.0018762008,"teacher_disagreement_score":0.0014862162,"about_ca_system_score_codex":0.00062438456,"about_ca_system_score_gemma":0.0008547336,"threshold_uncertainty_score":0.004530251},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6932901,0.0016377153,0.2921944,0.00042125382,0.00004971551,0.00004124077,0.00015035868,0.00032198377,0.01189316],"genre_scores_gemma":[0.9963766,0.00019434975,0.0028736896,0.000028274713,0.000010473874,0.000013246924,0.000030044448,0.0000070705532,0.0004663571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980867,0.00071465696,0.00006181995,0.00018355239,0.00063518004,0.0003180982],"domain_scores_gemma":[0.99441,0.0037532658,0.0004729292,0.00032983586,0.000938662,0.00009528952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028257205,0.0007807468,0.0006587301,0.0005204451,0.0005344287,0.001123306,0.0004715882,0.0009291556,0.00065541425],"category_scores_gemma":[0.00833786,0.00023240966,0.00019838952,0.000695901,0.001158302,0.0010051214,0.0012786638,0.00040154974,0.00026401397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047022896,0.00008172725,0.0042032287,0.0001208838,0.00010273766,0.00027907235,0.00040962576,0.9265427,0.0141081875,0.026209425,0.00048326323,0.02698892],"study_design_scores_gemma":[0.00003652252,0.0002760502,0.0022285036,0.000017845377,0.000039429826,0.00019783883,0.00012576721,0.9762906,0.007469975,0.012863312,0.00041513715,0.00003896941],"about_ca_topic_score_codex":0.0026869131,"about_ca_topic_score_gemma":0.0016948218,"teacher_disagreement_score":0.0028257205,"about_ca_system_score_codex":0.0008594852,"about_ca_system_score_gemma":0.00097370567,"threshold_uncertainty_score":0.014944017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027449436,0.0004876082,0.9695599,0.00018453502,0.00005190877,0.000058586946,0.000028720162,0.0001243181,0.0020550003],"genre_scores_gemma":[0.8150625,0.00025401407,0.18183419,0.00013388679,0.00010386243,0.0000900878,0.000034523433,0.000053611355,0.0024333769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975442,0.0012416531,0.00009371648,0.00027092535,0.00045906284,0.00039040495],"domain_scores_gemma":[0.9960193,0.0030900568,0.00023537321,0.00025613827,0.0002894425,0.0001096907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004304243,0.0012165711,0.0015617149,0.00068991265,0.0009505669,0.001512118,0.0019928454,0.00119538,0.0012833946],"category_scores_gemma":[0.0068400027,0.00060593995,0.0005414202,0.00097109674,0.0011164391,0.0015383697,0.0016110138,0.0010748556,0.00018490707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009737039,0.00019910395,0.000765309,0.00015679546,0.00012509266,0.00013257541,0.0002942455,0.81322086,0.006837329,0.062652975,0.0023527227,0.11228933],"study_design_scores_gemma":[0.000028338329,0.00006496006,0.00007785995,0.00000517786,0.000012807616,0.00003179971,0.000016820275,0.9835187,0.0015274164,0.014213841,0.00049101067,0.000011218725],"about_ca_topic_score_codex":0.0024977468,"about_ca_topic_score_gemma":0.0029131933,"teacher_disagreement_score":0.004304243,"about_ca_system_score_codex":0.0017069987,"about_ca_system_score_gemma":0.0015004941,"threshold_uncertainty_score":0.022763312},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083925776,0.0075655435,0.8563872,0.0035434717,0.0005588375,0.000049403145,0.00027715758,0.00038885087,0.047303855],"genre_scores_gemma":[0.89054245,0.0067677656,0.093840495,0.0014601771,0.00025825255,0.00012193705,0.00020627757,0.00016542623,0.006637144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996551,0.00011352708,0.000013491211,0.000047523492,0.000104458355,0.00006590513],"domain_scores_gemma":[0.9980666,0.0011463303,0.00020905021,0.0002848516,0.00023507646,0.000058033766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008351535,0.00042254513,0.00063230644,0.00031874076,0.00024029506,0.001033366,0.0008016007,0.0009717677,0.003993776],"category_scores_gemma":[0.0059287474,0.00033735138,0.00036684386,0.00038590224,0.0015438426,0.003982518,0.000984142,0.0011380825,0.0010303677],"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.00015242954,0.000032475327,0.00040743113,0.00024658954,0.000033192522,0.00014818808,0.00021838209,0.07447927,0.004578782,0.857804,0.004404112,0.057495072],"study_design_scores_gemma":[0.000022135087,0.000071341135,0.0002707524,0.00008690529,0.000016079004,0.00036812702,0.000101590944,0.21762581,0.0032706102,0.76747364,0.010655975,0.00003704774],"about_ca_topic_score_codex":0.0006972532,"about_ca_topic_score_gemma":0.0005896214,"teacher_disagreement_score":0.003993776,"about_ca_system_score_codex":0.0004851868,"about_ca_system_score_gemma":0.0004883773,"threshold_uncertainty_score":0.0133605},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10904758,0.0022618955,0.87047595,0.00078413234,0.00008010737,0.000098527074,0.00021921379,0.0004453974,0.016587105],"genre_scores_gemma":[0.98102057,0.0012772162,0.014918584,0.00011039064,0.00008547469,0.00010230039,0.000073170086,0.0000727571,0.0023394828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774134,0.00084489567,0.000046880086,0.00019496036,0.00067378464,0.000498196],"domain_scores_gemma":[0.99242085,0.0055608945,0.0006458713,0.00039133523,0.00085542706,0.00012562085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032726356,0.0010601322,0.0014105393,0.0012801046,0.0009395405,0.0020190782,0.0016080361,0.0010569572,0.0018513545],"category_scores_gemma":[0.0112188775,0.0005751972,0.0006893445,0.0015521774,0.0020098696,0.0025779402,0.0014854458,0.0013853189,0.00037571983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009878669,0.00002581816,0.00055609684,0.00007953008,0.0000305916,0.000282636,0.0002293532,0.86628324,0.0026119398,0.12622413,0.00065319886,0.0029246775],"study_design_scores_gemma":[0.000004466422,0.000015246615,0.00009571239,0.000006551462,0.000006812949,0.000040660507,0.000025224397,0.98731637,0.00042269053,0.0118960375,0.00016250931,0.000007847791],"about_ca_topic_score_codex":0.005939954,"about_ca_topic_score_gemma":0.0020048076,"teacher_disagreement_score":0.005939954,"about_ca_system_score_codex":0.003453343,"about_ca_system_score_gemma":0.001759684,"threshold_uncertainty_score":0.025055885},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24568242,0.0029426827,0.7356347,0.0017298942,0.00018708727,0.00013941104,0.00028390207,0.0007224067,0.01267751],"genre_scores_gemma":[0.9549881,0.001455084,0.037329562,0.00015648923,0.00013558366,0.00009424642,0.00016268519,0.000090003836,0.005588265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885404,0.0004917595,0.000044182194,0.000163756,0.00022768337,0.00021857145],"domain_scores_gemma":[0.9919769,0.006102434,0.0005304547,0.00046957756,0.0006816797,0.0002388318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017128631,0.00045808183,0.0014913348,0.0015179558,0.0017206651,0.002560665,0.0015295715,0.00143765,0.0015261082],"category_scores_gemma":[0.011725538,0.00082248275,0.0003900145,0.002718091,0.0016903131,0.0026540614,0.0018958759,0.00096242025,0.00031903232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060292776,0.000087749526,0.0023611698,0.0003155961,0.000060229297,0.000545219,0.00089256035,0.7654147,0.0055990918,0.16812421,0.004456605,0.051539924],"study_design_scores_gemma":[0.000023756022,0.000026515765,0.00020278998,0.000013419644,0.000023543787,0.00007370332,0.0001300718,0.9680011,0.0007508323,0.029886555,0.000856455,0.00001115246],"about_ca_topic_score_codex":0.009406949,"about_ca_topic_score_gemma":0.009061621,"teacher_disagreement_score":0.009406949,"about_ca_system_score_codex":0.0023524987,"about_ca_system_score_gemma":0.001069238,"threshold_uncertainty_score":0.018704414},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5321929,0.0032495302,0.44901422,0.00024764266,0.00011400774,0.00013821536,0.000107520966,0.00042015227,0.014515868],"genre_scores_gemma":[0.9766158,0.0004513672,0.022290897,0.000036119036,0.000024593322,0.000018027227,0.000024654495,0.00001306803,0.00052557624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993825,0.00026560956,0.000029795196,0.00006601193,0.00015074314,0.00010537888],"domain_scores_gemma":[0.999154,0.00032624925,0.0001343656,0.00018810738,0.00014926458,0.000048058755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091224426,0.000520302,0.0004824159,0.00040902512,0.0003547313,0.00060840027,0.0007095575,0.00049894565,0.00069561286],"category_scores_gemma":[0.0015280523,0.00009539062,0.00030553588,0.00031645922,0.00043466926,0.0005860514,0.00035381585,0.00024410058,0.00017921669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001917462,0.00045400957,0.004719465,0.0002674338,0.00019132234,0.0006466113,0.00031122606,0.5690466,0.17566776,0.02207729,0.001863352,0.22283748],"study_design_scores_gemma":[0.00004782551,0.0013654663,0.0037195887,0.000023820628,0.00011997434,0.0006398811,0.00012377082,0.9419581,0.04767551,0.0022894926,0.0019992262,0.000037237805],"about_ca_topic_score_codex":0.0018637904,"about_ca_topic_score_gemma":0.0027764656,"teacher_disagreement_score":0.0018637904,"about_ca_system_score_codex":0.0006861158,"about_ca_system_score_gemma":0.00037815503,"threshold_uncertainty_score":0.0049781203},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10568081,0.0014726771,0.8704028,0.0005509501,0.0000916542,0.00014272798,0.00026019893,0.00019835557,0.021199778],"genre_scores_gemma":[0.9159493,0.001726741,0.07537742,0.00017892224,0.00006189341,0.00015253107,0.00015518832,0.00006518887,0.0063327975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995053,0.00010898982,0.000022022605,0.000057222347,0.00020215547,0.00010420103],"domain_scores_gemma":[0.9985669,0.0007828394,0.0001667418,0.0002572388,0.00018558263,0.000040636976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001113095,0.00108448,0.00070409424,0.0007093864,0.00058022444,0.0010949179,0.0006514393,0.00085771555,0.0025785828],"category_scores_gemma":[0.0032010055,0.00020440575,0.00061077625,0.0007186613,0.001519041,0.0019303428,0.00093352277,0.0011500305,0.000337701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020850173,0.0000787503,0.00056576985,0.00017836412,0.000042866784,0.00033638522,0.00019764884,0.3437359,0.015708229,0.6116376,0.0012439449,0.026065964],"study_design_scores_gemma":[0.000023587116,0.000086402746,0.00024019608,0.000025766218,0.00003014316,0.0003131684,0.00005240811,0.880859,0.017349582,0.098538496,0.0024410163,0.000040301125],"about_ca_topic_score_codex":0.0022507762,"about_ca_topic_score_gemma":0.0019118076,"teacher_disagreement_score":0.0025785828,"about_ca_system_score_codex":0.0011278689,"about_ca_system_score_gemma":0.0009823706,"threshold_uncertainty_score":0.008626223},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014482921,0.00095171673,0.9691676,0.00020256302,0.000051103838,0.00005847467,0.0001268162,0.00014248161,0.014816253],"genre_scores_gemma":[0.7469911,0.0028760505,0.22839332,0.0002188613,0.00014170233,0.00038792516,0.00029966247,0.00010095121,0.020590458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951327,0.00008758641,0.00002787612,0.000055487795,0.0002128154,0.00010303111],"domain_scores_gemma":[0.9988067,0.0006080946,0.000116425814,0.00008818666,0.00034814127,0.00003241475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009408063,0.00079906033,0.0010468683,0.0007948682,0.00048132482,0.0015409038,0.0012431643,0.001514337,0.004497675],"category_scores_gemma":[0.0038217867,0.00060701394,0.00068791176,0.0010929295,0.0007176292,0.0016798035,0.0009778617,0.00082429795,0.0009231445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003653439,0.000029252105,0.00046937243,0.0001534709,0.000019498893,0.00026534798,0.00019629282,0.8732218,0.0020757087,0.09289218,0.0017371692,0.028903455],"study_design_scores_gemma":[0.00000471238,0.0000084601725,0.000078486366,0.0000116897345,0.0000033995777,0.000058044836,0.000030640993,0.9875635,0.00015806958,0.0114143845,0.0006623503,0.000006154572],"about_ca_topic_score_codex":0.0041502146,"about_ca_topic_score_gemma":0.004221599,"teacher_disagreement_score":0.004497675,"about_ca_system_score_codex":0.0015752787,"about_ca_system_score_gemma":0.0015147626,"threshold_uncertainty_score":0.015046239},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010663974,0.00025288464,0.9863511,0.00013810798,0.000016554784,0.000025524689,0.00003099496,0.000050291852,0.0024706156],"genre_scores_gemma":[0.694891,0.0009946378,0.29823443,0.00011420096,0.00007182726,0.00022713952,0.00007633484,0.000049075497,0.005341377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956685,0.00021855313,0.00001718211,0.000060582857,0.000091800655,0.00004512551],"domain_scores_gemma":[0.9995346,0.00033562546,0.00004504421,0.00002026456,0.00005126139,0.000013278307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064552744,0.0006656411,0.0005825182,0.00027290397,0.0002440836,0.0007103785,0.00052677724,0.0008276007,0.0017515586],"category_scores_gemma":[0.0020568636,0.00032489054,0.00020185576,0.0007323422,0.00058210746,0.0010511286,0.0005284451,0.0004731141,0.00040910018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005421684,0.000026465952,0.00017713016,0.000063114654,0.000015097197,0.000069825124,0.000047446472,0.92865497,0.0037631257,0.030048471,0.0006918689,0.036388278],"study_design_scores_gemma":[0.00001840025,0.00002400234,0.000071269824,0.0000058755177,0.0000047070844,0.000023541617,0.000015959042,0.98415434,0.00087377935,0.014296204,0.0005058093,0.000006043786],"about_ca_topic_score_codex":0.0013191898,"about_ca_topic_score_gemma":0.0014629149,"teacher_disagreement_score":0.0017515586,"about_ca_system_score_codex":0.00062635355,"about_ca_system_score_gemma":0.0005423224,"threshold_uncertainty_score":0.0058596134},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012159452,0.000493,0.9844232,0.00018890893,0.00003480163,0.000021556769,0.000009015409,0.000052609015,0.0026173862],"genre_scores_gemma":[0.55505365,0.0016972023,0.43979073,0.00024611485,0.00017587526,0.00015985715,0.00003984772,0.0000820474,0.0027545926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994041,0.00024181619,0.000016979911,0.00005235081,0.00021362033,0.00007113859],"domain_scores_gemma":[0.9994568,0.00025429984,0.00008185334,0.00006562415,0.00010475843,0.000036684316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015404768,0.0005626292,0.000626298,0.0006502954,0.00049983204,0.0008128789,0.00086950033,0.0006754266,0.00084180856],"category_scores_gemma":[0.0035749786,0.0003992812,0.00037186744,0.000422017,0.00089998223,0.0012188915,0.0014810913,0.0010689725,0.000271909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013013677,0.00005944242,0.00040354827,0.00009291556,0.000025437334,0.00009927354,0.00018303096,0.5718388,0.009995988,0.35332638,0.0017377124,0.062107384],"study_design_scores_gemma":[0.000011320712,0.000019576055,0.000037495178,0.0000088099805,0.0000039280503,0.000019749565,0.0000121925605,0.9611234,0.00084209495,0.036883917,0.0010317632,0.0000057916673],"about_ca_topic_score_codex":0.00085897394,"about_ca_topic_score_gemma":0.00089275086,"teacher_disagreement_score":0.0015404768,"about_ca_system_score_codex":0.00080198917,"about_ca_system_score_gemma":0.0008594897,"threshold_uncertainty_score":0.008146942},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18051776,0.0042458926,0.77983224,0.002451956,0.0002948954,0.000059761984,0.00007246326,0.00027910777,0.032245863],"genre_scores_gemma":[0.9650069,0.0016244479,0.031712193,0.00016702435,0.000111407455,0.000021559661,0.000024174982,0.00001909559,0.0013132616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994773,0.00020235022,0.000009308527,0.000037077487,0.0001642459,0.000109627974],"domain_scores_gemma":[0.9978381,0.0016130487,0.00015655285,0.0001280631,0.00022005309,0.000044183962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009651051,0.0006311625,0.0004136543,0.00030854478,0.00022907778,0.00058373535,0.00054736086,0.0006946105,0.0008768452],"category_scores_gemma":[0.004891534,0.00019136321,0.00028342928,0.0004891943,0.0008901296,0.0016152299,0.00045300325,0.0005577716,0.0001516362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117700845,0.000092376176,0.0016561488,0.00018470557,0.00007425813,0.00014324485,0.00006319153,0.84894395,0.012886875,0.062999435,0.0010857049,0.07175238],"study_design_scores_gemma":[0.0000082825645,0.00012738544,0.0003157571,0.000017023058,0.000028720016,0.000078968485,0.000039102826,0.977562,0.0046700956,0.016197365,0.0009441129,0.000011233648],"about_ca_topic_score_codex":0.00334305,"about_ca_topic_score_gemma":0.0035431515,"teacher_disagreement_score":0.00334305,"about_ca_system_score_codex":0.0005473663,"about_ca_system_score_gemma":0.00063416053,"threshold_uncertainty_score":0.0066471696},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051787674,0.00079755473,0.9418295,0.00021291514,0.00004026101,0.000081168386,0.000078091114,0.00030248333,0.00487028],"genre_scores_gemma":[0.834157,0.0009543102,0.16027936,0.000108893386,0.000046884063,0.0001819077,0.000089402994,0.000022235346,0.004160019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915946,0.0003914341,0.000035676916,0.0000887793,0.00024830858,0.00007628566],"domain_scores_gemma":[0.9982268,0.0010121774,0.00020951832,0.00026272118,0.00025691563,0.000031838244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091863686,0.00064367,0.00047497175,0.00041121335,0.00037423542,0.00083861005,0.0006063788,0.00079932006,0.00071519904],"category_scores_gemma":[0.0028910611,0.00026234737,0.00030163955,0.0006786466,0.0007662781,0.0011643387,0.0006824158,0.0006161489,0.0002765547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002708577,0.00009138924,0.00075921265,0.0002648403,0.00007001218,0.0005531832,0.00029418408,0.8383551,0.029610533,0.070520766,0.0011206132,0.058089305],"study_design_scores_gemma":[0.00003209806,0.00008860944,0.00015070775,0.000013931125,0.000022149383,0.00019273849,0.000014280246,0.9794433,0.010089788,0.00842904,0.0015041906,0.000019149324],"about_ca_topic_score_codex":0.002004631,"about_ca_topic_score_gemma":0.0022890018,"teacher_disagreement_score":0.002004631,"about_ca_system_score_codex":0.0007816174,"about_ca_system_score_gemma":0.0007573838,"threshold_uncertainty_score":0.0056710243},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02386036,0.0005887172,0.97309285,0.00023161487,0.00006030459,0.00005680353,0.000020480671,0.00013063858,0.0019581965],"genre_scores_gemma":[0.8239959,0.00047429616,0.17330134,0.00013157999,0.0001542963,0.00013881217,0.000025219304,0.000053282045,0.0017251961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979486,0.0010421794,0.00007797502,0.0002979528,0.00044571146,0.00018761941],"domain_scores_gemma":[0.99713135,0.0018076947,0.00038893626,0.0003219104,0.00022647045,0.00012362249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005330243,0.0006987459,0.0011072683,0.00047487894,0.0013097143,0.0014466081,0.0018114194,0.0008832365,0.00070527854],"category_scores_gemma":[0.0069538085,0.00041695032,0.00040795212,0.0008021096,0.0015018836,0.002023346,0.0011538562,0.0009953798,0.00017106302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002498493,0.00008849269,0.0008131593,0.00011303426,0.000044555727,0.0001241828,0.0001978055,0.8352728,0.00410013,0.11168803,0.0008792893,0.046428606],"study_design_scores_gemma":[0.00002164956,0.000049206756,0.00009668732,0.000007667047,0.000008225612,0.00003369546,0.0000177324,0.9625309,0.0011940702,0.035127662,0.0009026076,0.000009896523],"about_ca_topic_score_codex":0.0016943612,"about_ca_topic_score_gemma":0.0021241838,"teacher_disagreement_score":0.005330243,"about_ca_system_score_codex":0.0022382522,"about_ca_system_score_gemma":0.0021023443,"threshold_uncertainty_score":0.02818942},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0119866105,0.00030687772,0.9817639,0.00015793621,0.000057480305,0.000119446624,0.00007578332,0.00019323622,0.0053387294],"genre_scores_gemma":[0.6684719,0.00087307417,0.32629177,0.00023688354,0.000071408074,0.00043580687,0.00024220362,0.000047891488,0.0033290647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932516,0.00021363524,0.00003157124,0.00011911929,0.00022216752,0.00008834358],"domain_scores_gemma":[0.99887055,0.0003052241,0.00013985149,0.00015192278,0.0004947656,0.00003774415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079497765,0.0006477494,0.00034155708,0.0004295834,0.0003752579,0.00052980916,0.0009334503,0.00046420394,0.0010460563],"category_scores_gemma":[0.0019424971,0.00019681122,0.00023252271,0.00062165526,0.0006276482,0.00068142754,0.00068193267,0.00061700627,0.00025410068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002866697,0.00012446677,0.0013519226,0.00023236473,0.00009234838,0.00037080274,0.0002139789,0.5364744,0.07718619,0.15585546,0.0047162045,0.22309521],"study_design_scores_gemma":[0.000018393723,0.00012333502,0.00021026905,0.000024251018,0.00001909965,0.00014634445,0.000018717801,0.9756512,0.01214833,0.0068330937,0.0047831596,0.00002392231],"about_ca_topic_score_codex":0.003165317,"about_ca_topic_score_gemma":0.0034607847,"teacher_disagreement_score":0.003165317,"about_ca_system_score_codex":0.00090359483,"about_ca_system_score_gemma":0.001241137,"threshold_uncertainty_score":0.006556034},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098600745,0.0010580083,0.88792175,0.000526786,0.00004147594,0.00004186376,0.00004914758,0.00007288494,0.0116874045],"genre_scores_gemma":[0.95384926,0.00081368344,0.041965958,0.000084125524,0.000030878473,0.00006988006,0.000030532643,0.000020769632,0.0031348802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996927,0.000126004,0.00000809318,0.00003298523,0.000079844845,0.000060390073],"domain_scores_gemma":[0.99928623,0.00055711734,0.00005592655,0.000020405261,0.0000630869,0.000017255867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068520854,0.0008094493,0.0007084399,0.00032043786,0.00034405687,0.00080555724,0.00045215723,0.00081608654,0.00071022863],"category_scores_gemma":[0.0018536443,0.0002653277,0.0003844742,0.0005431688,0.0005488204,0.00072450086,0.00063891825,0.000662198,0.00012491585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006743883,0.000044526925,0.00027286532,0.00008122156,0.00002117054,0.00021789147,0.00016640345,0.94152296,0.0053162137,0.037738573,0.00062995375,0.0139208045],"study_design_scores_gemma":[0.000005212736,0.000024912373,0.000041828975,0.000002702257,0.0000039268816,0.000024088491,0.000015482714,0.9940889,0.00059957796,0.0049783546,0.00021115362,0.0000039351517],"about_ca_topic_score_codex":0.0032014027,"about_ca_topic_score_gemma":0.0027249595,"teacher_disagreement_score":0.0032014027,"about_ca_system_score_codex":0.00074096164,"about_ca_system_score_gemma":0.0006191741,"threshold_uncertainty_score":0.0063655376},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85214764,0.0019148989,0.1319987,0.0001757623,0.00007040452,0.000020416774,0.0001325943,0.00073134556,0.012808186],"genre_scores_gemma":[0.992546,0.00019473472,0.006570671,0.00001783007,0.000015376992,0.0000058202563,0.000023216639,0.000007509837,0.00061885803],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998073,0.000074694646,0.0000058859846,0.000021136617,0.000043476863,0.000047501995],"domain_scores_gemma":[0.9994832,0.000335146,0.00004671273,0.00007195616,0.000044000764,0.000018932311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041141018,0.000463723,0.00028962852,0.0004069085,0.00022174978,0.00049032405,0.00040961689,0.0002875142,0.0012607866],"category_scores_gemma":[0.0007434439,0.000095568714,0.00016040106,0.00040700004,0.00036675436,0.00033233644,0.00028628935,0.00017997598,0.00018843291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024274671,0.00032400398,0.0040088138,0.00036112143,0.0001412615,0.0005159774,0.00040219634,0.3773382,0.3932066,0.019724056,0.0032156766,0.1983346],"study_design_scores_gemma":[0.000057316895,0.0006417789,0.0030551306,0.00001895468,0.0001461744,0.00037897544,0.00009675275,0.8970692,0.093111135,0.0034426367,0.0019573974,0.000024621217],"about_ca_topic_score_codex":0.0010850898,"about_ca_topic_score_gemma":0.0012881199,"teacher_disagreement_score":0.0012607866,"about_ca_system_score_codex":0.00045061766,"about_ca_system_score_gemma":0.00023673252,"threshold_uncertainty_score":0.004217744},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82948923,0.0016771369,0.15143594,0.00057412416,0.00009880316,0.00008333966,0.000377801,0.00041465875,0.015849058],"genre_scores_gemma":[0.99431616,0.000162249,0.004745996,0.000025378387,0.000010786195,0.000017096874,0.000042111784,0.000012470106,0.0006678136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979153,0.0009722736,0.000057198973,0.00015687286,0.00055900984,0.0003393418],"domain_scores_gemma":[0.9864362,0.010518868,0.0007524762,0.0005808572,0.0015423452,0.00016925193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029775316,0.0011251963,0.00095268764,0.00055742747,0.000513096,0.0012894786,0.0010181813,0.0012647634,0.0013242227],"category_scores_gemma":[0.00906272,0.0002824202,0.00037231226,0.00069906435,0.0015638667,0.0013251279,0.0010218108,0.000629806,0.00016160558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009744726,0.00008093487,0.0010770672,0.00017986128,0.00006267471,0.00014838875,0.00008092994,0.9710751,0.008102461,0.009567148,0.00042576267,0.008225079],"study_design_scores_gemma":[0.000034568824,0.00022714515,0.00041321793,0.000013720453,0.000024909774,0.000065742715,0.000027160722,0.9939009,0.0035086228,0.0016802334,0.00008448063,0.000019340749],"about_ca_topic_score_codex":0.0047023315,"about_ca_topic_score_gemma":0.0029129772,"teacher_disagreement_score":0.0047023315,"about_ca_system_score_codex":0.0013278782,"about_ca_system_score_gemma":0.0012167686,"threshold_uncertainty_score":0.015746891},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060611192,0.00036806686,0.9344101,0.00018988713,0.00004504304,0.00007810161,0.00003214829,0.00021385164,0.004051578],"genre_scores_gemma":[0.83610857,0.00031106136,0.16147193,0.000070679715,0.00004373921,0.00009743267,0.000050621646,0.000023858465,0.0018220647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984145,0.0008145763,0.0000472581,0.00014025006,0.00037773847,0.00020563055],"domain_scores_gemma":[0.9987418,0.00075590407,0.000094551564,0.00020362868,0.00013798862,0.00006613964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017641825,0.00070585514,0.0011499516,0.00034399555,0.0006030124,0.0010503522,0.0009042649,0.0010622229,0.0010524943],"category_scores_gemma":[0.0023287116,0.0004138525,0.00052790466,0.0005055476,0.00096772873,0.0013666488,0.001289964,0.00082950067,0.00038639034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037544649,0.00010307135,0.0006842137,0.00011960968,0.000039137067,0.0003369005,0.00021851002,0.8607854,0.014819369,0.076203994,0.0008246852,0.04548964],"study_design_scores_gemma":[0.00001771677,0.00008053285,0.000058594313,0.0000044785825,0.000008065601,0.00008069314,0.000018482342,0.9893995,0.003005696,0.0068079517,0.0005076669,0.000010584949],"about_ca_topic_score_codex":0.0009981238,"about_ca_topic_score_gemma":0.0010391031,"teacher_disagreement_score":0.0017641825,"about_ca_system_score_codex":0.0008520704,"about_ca_system_score_gemma":0.0010820919,"threshold_uncertainty_score":0.009329975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18647473,0.0000864534,0.80938196,0.00016788655,0.000017974626,0.00007944979,0.00008043724,0.0005467155,0.0031643314],"genre_scores_gemma":[0.89301425,0.00007000876,0.10533749,0.000051623985,0.0000108014465,0.00010490985,0.00007309451,0.00005692574,0.0012808682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941933,0.00020931079,0.00002733396,0.00009264579,0.0001490062,0.000102373066],"domain_scores_gemma":[0.99696404,0.0018029662,0.00037835664,0.00045672132,0.00023024337,0.00016768143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010440144,0.00038688647,0.00041544286,0.0003371165,0.00039240744,0.0004970547,0.00083808287,0.00046828634,0.00067429617],"category_scores_gemma":[0.00506294,0.0002562477,0.00021171189,0.00039155118,0.0010967551,0.0010447452,0.00071153644,0.0005022309,0.00019521496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039421843,0.00012801585,0.0007074128,0.00012796703,0.000028271046,0.00019509422,0.00028858532,0.81469136,0.047126796,0.0984711,0.0013113642,0.036529955],"study_design_scores_gemma":[0.000026615797,0.0000797663,0.00008374973,0.000004201755,0.000005803634,0.00002504387,0.000021900449,0.9757165,0.007835764,0.015791062,0.00040214707,0.0000074848695],"about_ca_topic_score_codex":0.0021437632,"about_ca_topic_score_gemma":0.0027572345,"teacher_disagreement_score":0.0021437632,"about_ca_system_score_codex":0.00081293576,"about_ca_system_score_gemma":0.0013793429,"threshold_uncertainty_score":0.005898297},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17712273,0.0018320433,0.8055494,0.0003595853,0.000052029613,0.000099361205,0.00025083558,0.0003615522,0.014372477],"genre_scores_gemma":[0.95264304,0.0009698589,0.044969153,0.000048279107,0.000015834119,0.00013956534,0.000107395215,0.00003430872,0.0010726533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882525,0.00045027165,0.00007129232,0.00012524346,0.00029109174,0.0002367828],"domain_scores_gemma":[0.993541,0.0048313565,0.0005610648,0.00033514228,0.0006185383,0.00011292249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030023113,0.0012279453,0.00087273424,0.00093813206,0.0006299693,0.0016093848,0.0013630372,0.000976182,0.0014920201],"category_scores_gemma":[0.008185664,0.00035564302,0.0006250538,0.00095390156,0.001432139,0.0017963886,0.001251995,0.0008860294,0.00035020648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021866038,0.000049767157,0.000489314,0.0002769163,0.00006292472,0.00024335009,0.00030671406,0.84337294,0.014104253,0.12237862,0.00079098484,0.017705569],"study_design_scores_gemma":[0.00003199353,0.000111180016,0.00024198156,0.000056695477,0.000047918315,0.00021481725,0.00010075477,0.9535688,0.008704752,0.036130697,0.00075096096,0.0000393612],"about_ca_topic_score_codex":0.0013023106,"about_ca_topic_score_gemma":0.0011270312,"teacher_disagreement_score":0.0030023113,"about_ca_system_score_codex":0.0016645241,"about_ca_system_score_gemma":0.0011253518,"threshold_uncertainty_score":0.015877962},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23643064,0.0028617827,0.7373724,0.00070326705,0.00009952821,0.00012890648,0.0001382784,0.000109193985,0.022155985],"genre_scores_gemma":[0.9878991,0.000654168,0.010301662,0.000047659953,0.000032808668,0.000048069178,0.000017314163,0.000007721236,0.0009914686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893194,0.00046973195,0.000038589715,0.00012795396,0.0002088531,0.00022293569],"domain_scores_gemma":[0.9959006,0.0031307496,0.00040737938,0.000122067526,0.00035160626,0.000087670414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001649611,0.0012244735,0.00079654396,0.0006482759,0.0007861119,0.0017234022,0.00077718234,0.00097412366,0.0009454723],"category_scores_gemma":[0.004730625,0.0004238132,0.00039581847,0.000807948,0.0013011068,0.0013086045,0.0010614981,0.0006527207,0.00012909388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002914548,0.000098407145,0.0011473208,0.00039898345,0.00014092021,0.000903105,0.0004679393,0.77239865,0.028954914,0.1663668,0.0009899447,0.027841527],"study_design_scores_gemma":[0.000019713287,0.00019559478,0.00022906066,0.00002853732,0.00005063006,0.0003220599,0.00011464557,0.96917087,0.0034329034,0.025842113,0.0005572737,0.000036515317],"about_ca_topic_score_codex":0.00147591,"about_ca_topic_score_gemma":0.001746525,"teacher_disagreement_score":0.0017234022,"about_ca_system_score_codex":0.0015609502,"about_ca_system_score_gemma":0.0012021547,"threshold_uncertainty_score":0.011325598},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016816465,0.000330206,0.9802581,0.00009883372,0.000022611239,0.000018529638,0.000010312844,0.00007429653,0.0023706593],"genre_scores_gemma":[0.9207268,0.0006300972,0.076657414,0.00010601481,0.000043443586,0.00008699914,0.00002131156,0.000013372629,0.0017145941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996476,0.00014585484,0.000011515734,0.000042097865,0.000108185835,0.00004464424],"domain_scores_gemma":[0.9994955,0.00030483247,0.000055675562,0.00003048774,0.00009720767,0.0000163302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006789801,0.00068796484,0.00036999202,0.00030799373,0.00023434641,0.00054362405,0.000478202,0.00053766853,0.0010795663],"category_scores_gemma":[0.0019280096,0.00019818118,0.00031022815,0.00053882186,0.00049128314,0.0005598478,0.000410416,0.00042007095,0.0002660978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013877524,0.000042877105,0.0006587406,0.00013875685,0.00004624591,0.00027221267,0.00012330031,0.8720686,0.019337026,0.042417888,0.00089387386,0.063861705],"study_design_scores_gemma":[0.000017354363,0.00007360901,0.00013879394,0.0000056489166,0.000011548631,0.000048444235,0.000021686668,0.991441,0.0011304597,0.0066828127,0.00042083405,0.000007858024],"about_ca_topic_score_codex":0.0013229103,"about_ca_topic_score_gemma":0.0015748132,"teacher_disagreement_score":0.0013229103,"about_ca_system_score_codex":0.00040342347,"about_ca_system_score_gemma":0.00046414376,"threshold_uncertainty_score":0.003611505},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00872374,0.0031608988,0.97674197,0.00044043973,0.00029781202,0.000021538443,0.000026727039,0.000098775396,0.010488018],"genre_scores_gemma":[0.54017055,0.016024191,0.4244697,0.00084303215,0.001072435,0.0001548802,0.0001228395,0.00051304616,0.016629372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970335,0.000116836796,0.000018605757,0.00003511585,0.00010435665,0.000021652948],"domain_scores_gemma":[0.9990914,0.0006476226,0.00006637254,0.00007362861,0.00009507554,0.000025936519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013943095,0.0010684666,0.0007483841,0.0010756985,0.0006327159,0.0013738459,0.0010561896,0.001126905,0.0017410236],"category_scores_gemma":[0.005206233,0.00028689345,0.00075736153,0.0013225356,0.0019278261,0.003062249,0.0009985428,0.0023991503,0.00071627024],"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.000021414988,0.00003133414,0.00012807152,0.00016901187,0.000016380403,0.00020051925,0.0002225848,0.031095745,0.00343672,0.9397353,0.0011824089,0.023760581],"study_design_scores_gemma":[0.0000121767,0.000050457733,0.00013473655,0.000091417794,0.000019713252,0.0005026502,0.00011153447,0.36958912,0.002401111,0.6143012,0.01274717,0.000038735463],"about_ca_topic_score_codex":0.00044953972,"about_ca_topic_score_gemma":0.00029172,"teacher_disagreement_score":0.0017410236,"about_ca_system_score_codex":0.00067084807,"about_ca_system_score_gemma":0.0006619336,"threshold_uncertainty_score":0.007373929},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01435152,0.0012948853,0.9619539,0.0011155523,0.000112136164,0.00005891318,0.00012258413,0.00008378723,0.020906804],"genre_scores_gemma":[0.77663136,0.0067834076,0.19384204,0.0010772964,0.0005919051,0.000630929,0.00047842093,0.00018160751,0.019783134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883026,0.0005895894,0.000040803752,0.000100866666,0.0003067414,0.00013174652],"domain_scores_gemma":[0.9952173,0.0037020908,0.00027930192,0.0003257411,0.0003723992,0.00010313014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020493378,0.00071093184,0.0006112258,0.0009290166,0.0005954851,0.0012278312,0.00096226484,0.0011131873,0.0031708584],"category_scores_gemma":[0.0100366175,0.00024773288,0.0006011122,0.0012481224,0.0019451873,0.002830244,0.0020012227,0.0020163187,0.0004315186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022126282,0.000009561498,0.00008296545,0.000052330393,0.0000076054025,0.000040726314,0.00006271394,0.071895316,0.00051405473,0.91716594,0.0014521991,0.00869453],"study_design_scores_gemma":[0.000014414971,0.000014222868,0.000048129386,0.00003210808,0.0000050169233,0.000034118297,0.000019404015,0.31023,0.00030121775,0.686768,0.0025230972,0.000010248735],"about_ca_topic_score_codex":0.0018839254,"about_ca_topic_score_gemma":0.001169327,"teacher_disagreement_score":0.0031708584,"about_ca_system_score_codex":0.0015433348,"about_ca_system_score_gemma":0.0010248505,"threshold_uncertainty_score":0.011197686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06415475,0.0011361695,0.93061566,0.00018631214,0.0001045928,0.000093184375,0.0001207647,0.00069870485,0.0028897857],"genre_scores_gemma":[0.8951709,0.00041260404,0.10128486,0.00013285193,0.00007277353,0.00011919952,0.00011036019,0.000038869704,0.0026575737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903476,0.0004006565,0.00009412722,0.00022477249,0.00014437006,0.00010144981],"domain_scores_gemma":[0.997804,0.0009774911,0.00029041417,0.00054809276,0.00028951955,0.00009043484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015829508,0.0010945549,0.0009680884,0.00051882095,0.00076060573,0.0011817665,0.002316563,0.0005054033,0.0016738462],"category_scores_gemma":[0.0025906565,0.00037874168,0.0004206001,0.00044564492,0.00077130494,0.0021790888,0.0012754423,0.00047030812,0.00048313083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032837745,0.00022209722,0.0044894125,0.0006547864,0.00035901618,0.0014311284,0.0011480555,0.34853026,0.13886693,0.20783903,0.008164888,0.28501073],"study_design_scores_gemma":[0.00017397596,0.0007857533,0.0006959045,0.000053650823,0.00019097993,0.0013264901,0.00019596847,0.8667676,0.07424941,0.041028086,0.014420852,0.0001112249],"about_ca_topic_score_codex":0.0005579181,"about_ca_topic_score_gemma":0.00078587706,"teacher_disagreement_score":0.002316563,"about_ca_system_score_codex":0.0007242444,"about_ca_system_score_gemma":0.0006030116,"threshold_uncertainty_score":0.008371532},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06646396,0.0006157387,0.9263707,0.00018268327,0.00009466309,0.00014756055,0.00011980946,0.00039670055,0.005608242],"genre_scores_gemma":[0.85021996,0.0003304094,0.14468597,0.00010613821,0.000034680364,0.00016152795,0.00014436117,0.00002397915,0.004292995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995388,0.00013847658,0.00002048194,0.000045488694,0.00016396426,0.00009284403],"domain_scores_gemma":[0.999037,0.0002846637,0.000090837806,0.0001733813,0.00034287453,0.00007116939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061380817,0.0007486095,0.00050479936,0.0004935523,0.00072425924,0.00054590637,0.0010306726,0.0006800642,0.0013731328],"category_scores_gemma":[0.0017095439,0.00019331544,0.00028942068,0.0007465372,0.0005966429,0.00084138307,0.0010410998,0.0005060167,0.0004553934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010877262,0.00026898048,0.0011735472,0.00042427736,0.00015722273,0.0012948123,0.000749624,0.40414628,0.15120788,0.14456138,0.007559378,0.2873689],"study_design_scores_gemma":[0.0000670285,0.00033231152,0.00034443563,0.000027515234,0.00006720919,0.0006806431,0.00005686839,0.9520923,0.029456787,0.011902991,0.0048788087,0.00009318569],"about_ca_topic_score_codex":0.0027197355,"about_ca_topic_score_gemma":0.004551255,"teacher_disagreement_score":0.0027197355,"about_ca_system_score_codex":0.0006490852,"about_ca_system_score_gemma":0.0011638098,"threshold_uncertainty_score":0.00540787},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03562743,0.00023991818,0.9592067,0.00013504294,0.000036485646,0.0001098128,0.000042057003,0.00015841269,0.0044441223],"genre_scores_gemma":[0.89816916,0.00030835954,0.09869388,0.00009815181,0.000026399799,0.00023304284,0.00007189163,0.000023739445,0.0023753215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922216,0.00022872767,0.00003394585,0.00007644004,0.00034021935,0.000098505036],"domain_scores_gemma":[0.9980514,0.0010232966,0.00022116523,0.0002878723,0.00030545346,0.00011083045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011721116,0.00046458203,0.0004308786,0.0003706782,0.0005496979,0.0006219498,0.0011390852,0.00040228784,0.0008435718],"category_scores_gemma":[0.0035375669,0.00021685688,0.00023887034,0.000516354,0.00079478306,0.00094072154,0.0018095952,0.0005624365,0.00023961307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000426599,0.00028025176,0.0032094624,0.00024138497,0.00008979584,0.00070869253,0.00091558084,0.42930225,0.06415795,0.27146614,0.0036808832,0.22552098],"study_design_scores_gemma":[0.0000510608,0.00016085338,0.00023069656,0.000015239876,0.000025791283,0.0003260658,0.00009419387,0.9626574,0.008701272,0.023090592,0.004605596,0.000041270083],"about_ca_topic_score_codex":0.0016249927,"about_ca_topic_score_gemma":0.0023419019,"teacher_disagreement_score":0.0016249927,"about_ca_system_score_codex":0.00054205966,"about_ca_system_score_gemma":0.0014172771,"threshold_uncertainty_score":0.006198764},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4477811,0.0012195467,0.54257345,0.0002886433,0.000058434885,0.0001345547,0.00015479547,0.00021690539,0.0075725187],"genre_scores_gemma":[0.980488,0.0002956666,0.017412717,0.000022910586,0.000012418942,0.00004565653,0.000030313471,0.000007010742,0.0016853703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940467,0.00028301947,0.000023498014,0.00009115193,0.00010453472,0.000093178016],"domain_scores_gemma":[0.9982021,0.0011884265,0.0002540768,0.00011298668,0.00018979178,0.00005257446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012678945,0.0010526653,0.0009680151,0.00048503836,0.00035556892,0.0009078826,0.0014440446,0.001139896,0.0008891899],"category_scores_gemma":[0.0030064934,0.00036987322,0.0004960858,0.00049919373,0.0010519259,0.001342452,0.0007340708,0.00034472713,0.00019638178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021762945,0.000055444965,0.0005146018,0.00009102496,0.0000501108,0.00048646494,0.00013507534,0.95859367,0.008729646,0.025705738,0.00014773484,0.0052728504],"study_design_scores_gemma":[0.000020751966,0.00009208493,0.00007016424,0.000003941655,0.000020243368,0.00006676972,0.00001200593,0.994682,0.0015415972,0.0033540209,0.00012663248,0.000009673753],"about_ca_topic_score_codex":0.002466382,"about_ca_topic_score_gemma":0.001888466,"teacher_disagreement_score":0.002466382,"about_ca_system_score_codex":0.00092312746,"about_ca_system_score_gemma":0.00056506693,"threshold_uncertainty_score":0.0067053437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048544426,0.00036229327,0.9481084,0.00006747476,0.000021659765,0.000024343999,0.000012485897,0.00010069217,0.0027582448],"genre_scores_gemma":[0.8929267,0.00015892136,0.105682336,0.00003163199,0.000020828342,0.00004472412,0.000009997799,0.000009484177,0.0011153495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995981,0.00021847285,0.000013693635,0.00006105136,0.00007243759,0.000036249265],"domain_scores_gemma":[0.9995522,0.00027876504,0.000046731682,0.000060693346,0.000040417377,0.000021255828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005468636,0.00035753584,0.00030063125,0.00020367347,0.00029045728,0.00037584972,0.00050409226,0.0003267565,0.00036924327],"category_scores_gemma":[0.0015110048,0.00016330517,0.00015325667,0.00031718746,0.0006232285,0.00041110048,0.0003946439,0.00029434697,0.00011070098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022701331,0.00006296224,0.00091394194,0.0000704954,0.000044000062,0.00020235222,0.00032565562,0.7434929,0.030948222,0.06506153,0.0011609095,0.1574901],"study_design_scores_gemma":[0.000011114464,0.00010632165,0.00027808666,0.000004647013,0.000012269805,0.00011917309,0.000027760983,0.9857211,0.0047124345,0.007928879,0.0010669753,0.000011237286],"about_ca_topic_score_codex":0.0012756523,"about_ca_topic_score_gemma":0.0022442888,"teacher_disagreement_score":0.0012756523,"about_ca_system_score_codex":0.00032276558,"about_ca_system_score_gemma":0.00036684386,"threshold_uncertainty_score":0.002892077},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15344328,0.0029362845,0.8226588,0.0008716021,0.000053939693,0.0000507882,0.00047117058,0.00038425066,0.01912985],"genre_scores_gemma":[0.9847216,0.0018058753,0.010679631,0.00009518286,0.00008684867,0.00006225765,0.00014983838,0.00006290279,0.0023357768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898356,0.0003089945,0.000032212705,0.00006282317,0.00039862504,0.00021389709],"domain_scores_gemma":[0.995131,0.0036055828,0.00034681745,0.00019962201,0.0006481294,0.000068723144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015292205,0.0008858311,0.0009463703,0.0011011679,0.00051606464,0.0009590316,0.0005847669,0.0005765779,0.0016715984],"category_scores_gemma":[0.007518878,0.00031788557,0.00039343323,0.001077769,0.0011542635,0.0011581326,0.00097117637,0.00075732113,0.00030625126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050060666,0.000016982862,0.0005840633,0.00008823285,0.000025819452,0.00023275321,0.0001598692,0.9419053,0.0026105735,0.045676403,0.00088884647,0.00776105],"study_design_scores_gemma":[0.0000024588558,0.00000982274,0.00024818094,0.000009770617,0.000006983591,0.00006487047,0.000030184696,0.99108785,0.0005034051,0.007790414,0.0002385208,0.000007483473],"about_ca_topic_score_codex":0.0071712574,"about_ca_topic_score_gemma":0.0032716137,"teacher_disagreement_score":0.0071712574,"about_ca_system_score_codex":0.0018764909,"about_ca_system_score_gemma":0.0009030444,"threshold_uncertainty_score":0.014258981},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029813044,0.0005740285,0.96495485,0.00012747293,0.000022393404,0.000029660217,0.00001638474,0.00008286378,0.0043792943],"genre_scores_gemma":[0.9522065,0.0003120667,0.04559052,0.0000642757,0.00002615303,0.00006652506,0.0000152457205,0.000021611002,0.0016970817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961734,0.00014509086,0.000013000162,0.00006168855,0.000095169155,0.000067635796],"domain_scores_gemma":[0.9996306,0.00023295316,0.000048068105,0.000018616722,0.000056761575,0.0000131217785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065960083,0.00065677863,0.00061744865,0.0003086657,0.0002505711,0.0007223461,0.00067421654,0.00049047667,0.00090385706],"category_scores_gemma":[0.0012297707,0.0002742619,0.0003661308,0.00052319415,0.00058447523,0.00069687754,0.0005601651,0.0003782688,0.00015296627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056502024,0.000027833863,0.00018898402,0.0000568539,0.00003767279,0.00006362297,0.00004415338,0.9637938,0.0028460508,0.015417506,0.00042353934,0.017043514],"study_design_scores_gemma":[0.0000047131034,0.000018830598,0.000046680514,0.0000020322564,0.0000057398597,0.000017125096,0.0000065187996,0.9968279,0.00031745227,0.0026240093,0.00012599028,0.0000031346883],"about_ca_topic_score_codex":0.0019602776,"about_ca_topic_score_gemma":0.0019609698,"teacher_disagreement_score":0.0019602776,"about_ca_system_score_codex":0.0006664803,"about_ca_system_score_gemma":0.00065621175,"threshold_uncertainty_score":0.004835725},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018206256,0.0005395218,0.97875756,0.000083488805,0.000047360045,0.000055215314,0.000018411785,0.000096485484,0.0021956845],"genre_scores_gemma":[0.7409598,0.0012403848,0.25336072,0.00010919284,0.00008759036,0.00013883179,0.0000577333,0.000024362218,0.004021298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958116,0.00014374116,0.000014973786,0.000041430903,0.00018125016,0.00003741186],"domain_scores_gemma":[0.99968374,0.00013878755,0.000048697366,0.000053244352,0.000062989566,0.000012481044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045419103,0.0008289282,0.0006172921,0.00032747877,0.00040164238,0.00054584263,0.00073433836,0.0006559226,0.0010511226],"category_scores_gemma":[0.0007786616,0.00026437215,0.0004694479,0.00037119517,0.0007020246,0.0006064866,0.00047442786,0.0004691232,0.00027647932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001320533,0.00011332363,0.00048503454,0.00027700988,0.00010345409,0.0005930108,0.00021475964,0.6459426,0.05913826,0.15957707,0.0018376262,0.13158579],"study_design_scores_gemma":[0.000017216165,0.0002014213,0.00011380207,0.00000903718,0.000022021806,0.0002779452,0.00001029493,0.98286325,0.0032446517,0.010833189,0.002386577,0.000020578169],"about_ca_topic_score_codex":0.0006465606,"about_ca_topic_score_gemma":0.0014164433,"teacher_disagreement_score":0.0010511226,"about_ca_system_score_codex":0.0006159959,"about_ca_system_score_gemma":0.00050265907,"threshold_uncertainty_score":0.0044693947},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051436644,0.0007855945,0.94377995,0.00030219965,0.000025759558,0.000033537384,0.00006929803,0.00011127084,0.0034557127],"genre_scores_gemma":[0.8611723,0.0010680816,0.13550751,0.000092927025,0.00005701312,0.00007864382,0.00009507122,0.000027218575,0.0019013829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992937,0.00028718798,0.00003529181,0.0001020956,0.00021016755,0.00007158211],"domain_scores_gemma":[0.9990545,0.00053558074,0.00016916788,0.0000987883,0.00011829198,0.000023790824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007670405,0.00057769683,0.0005504883,0.00034398388,0.00021595045,0.0005255325,0.00043273089,0.0006262455,0.0007054815],"category_scores_gemma":[0.0030136628,0.00030428907,0.00020341671,0.00065081683,0.00093820225,0.00075813744,0.00053596083,0.00045656564,0.00026137417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013244373,0.00004524735,0.00044005012,0.0001459309,0.000025082485,0.00017152572,0.00021939231,0.83933854,0.02031519,0.08021772,0.001055782,0.05789309],"study_design_scores_gemma":[0.00003139183,0.00009866463,0.00019504639,0.000017362423,0.0000099580675,0.0000774302,0.00002542079,0.95627874,0.0048750676,0.0371069,0.0012684264,0.000015631706],"about_ca_topic_score_codex":0.00084526115,"about_ca_topic_score_gemma":0.0010207478,"teacher_disagreement_score":0.00084526115,"about_ca_system_score_codex":0.0005847179,"about_ca_system_score_gemma":0.00065854273,"threshold_uncertainty_score":0.00424248},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06278512,0.002567142,0.8577044,0.0010144847,0.00013199545,0.00021216199,0.00017192497,0.00016056791,0.07525226],"genre_scores_gemma":[0.9194583,0.0025044824,0.07238499,0.0003550763,0.00022241226,0.0003695676,0.0000942086,0.00006073852,0.004550242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961965,0.0014198417,0.00032106374,0.00070283504,0.00100932,0.0003504127],"domain_scores_gemma":[0.9834509,0.012786898,0.0014955514,0.0010144771,0.0009851727,0.00026696047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003976536,0.000981021,0.0006067039,0.0012007499,0.0005517672,0.0029179011,0.0019296521,0.0020267584,0.003335277],"category_scores_gemma":[0.022147058,0.00038487758,0.0003760601,0.0008769137,0.0028192059,0.0035975473,0.0018933133,0.001827742,0.00058903696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008975819,0.00006691415,0.0006297887,0.00014323948,0.000025641091,0.00012251711,0.00034187277,0.047883715,0.0047996677,0.9051293,0.0006380376,0.040129624],"study_design_scores_gemma":[0.0000702827,0.00041588716,0.0014092049,0.00014600698,0.00006580021,0.0008828564,0.00028923393,0.39200148,0.005915715,0.59419703,0.004517581,0.00008892068],"about_ca_topic_score_codex":0.00047397582,"about_ca_topic_score_gemma":0.00031190043,"teacher_disagreement_score":0.003976536,"about_ca_system_score_codex":0.0011151683,"about_ca_system_score_gemma":0.0007828679,"threshold_uncertainty_score":0.021030188},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7009461,0.003036858,0.2839312,0.0004962714,0.00010933757,0.000026495725,0.00006817874,0.0004985679,0.010886925],"genre_scores_gemma":[0.98551416,0.0005344316,0.013003873,0.00002970557,0.000017020062,0.0000066287403,0.000027655466,0.00000775172,0.0008587911],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995409,0.00015498104,0.000027752909,0.00005296379,0.00016486949,0.000058498852],"domain_scores_gemma":[0.9989506,0.0004878942,0.00012660655,0.00011570359,0.0003000642,0.000019129155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000695893,0.00052424346,0.00033382446,0.00028942095,0.00018771937,0.00043361352,0.000292376,0.00056380697,0.0005962452],"category_scores_gemma":[0.0016386042,0.00014014696,0.00014121342,0.0003006499,0.00020240966,0.0003971052,0.00030176266,0.00028991752,0.0003110894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001774271,0.00020970409,0.0057908804,0.00030275184,0.00011994956,0.00059919094,0.0003770047,0.28931826,0.44288498,0.010648078,0.0018002448,0.24617475],"study_design_scores_gemma":[0.00004477784,0.00077106786,0.0030352904,0.000027021197,0.00008495452,0.0005188515,0.000054472406,0.88025904,0.111990534,0.000978657,0.0021939774,0.000041447063],"about_ca_topic_score_codex":0.00066345197,"about_ca_topic_score_gemma":0.00084358186,"teacher_disagreement_score":0.000695893,"about_ca_system_score_codex":0.00024736632,"about_ca_system_score_gemma":0.00017658107,"threshold_uncertainty_score":0.0036802888},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11372261,0.00054504245,0.87768906,0.0005338424,0.000022333572,0.000056341833,0.00007371713,0.00013242348,0.0072245686],"genre_scores_gemma":[0.94921535,0.00047654466,0.045793492,0.000064132844,0.000027316675,0.00007695237,0.000041189556,0.00003593357,0.0042690844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994435,0.00027381416,0.00002164831,0.00008521943,0.00013188172,0.00004393017],"domain_scores_gemma":[0.99884546,0.0007986526,0.00011842715,0.000050140003,0.00016362785,0.000023685025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087892264,0.00072443177,0.0006374995,0.00029488374,0.00028757425,0.00093720434,0.00053452014,0.00091872603,0.001749479],"category_scores_gemma":[0.0020662704,0.00041579688,0.00028893765,0.00034968954,0.00077961676,0.0011033698,0.0006289219,0.00050035206,0.00036367518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001373618,0.00003748403,0.0004984082,0.00011943501,0.000050216328,0.0002776889,0.00015458737,0.94761175,0.0128104165,0.022827363,0.0003714999,0.015103797],"study_design_scores_gemma":[0.00001999465,0.000058279802,0.0001551362,0.0000045387683,0.000015450889,0.000045145738,0.000022490625,0.99182886,0.0015363551,0.0060635693,0.0002426237,0.0000074988166],"about_ca_topic_score_codex":0.0012699438,"about_ca_topic_score_gemma":0.0010255934,"teacher_disagreement_score":0.001749479,"about_ca_system_score_codex":0.00086140115,"about_ca_system_score_gemma":0.0004701976,"threshold_uncertainty_score":0.0062499642},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022456983,0.00016391442,0.9760551,0.000074756324,0.000008708787,0.000016678341,0.000016623777,0.00007584426,0.0011314404],"genre_scores_gemma":[0.9591772,0.00014870695,0.039703052,0.000037558366,0.000017000779,0.000047917314,0.000020046662,0.000010096663,0.0008383834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958247,0.00011495459,0.000018545707,0.00009531934,0.0001308282,0.000057860103],"domain_scores_gemma":[0.99961025,0.00021024977,0.000074598924,0.00003838592,0.00005416386,0.000012360941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045639678,0.000545548,0.00048214305,0.00022142989,0.00034363204,0.00054349453,0.0006460161,0.0005230864,0.0005436772],"category_scores_gemma":[0.0012273613,0.00021883528,0.00028799486,0.00029638546,0.00052203843,0.00062953896,0.0005723226,0.00036659653,0.00012605618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044371947,0.000013521418,0.00024001779,0.000034335073,0.000022083226,0.00009923384,0.00004904221,0.9521064,0.008440939,0.011257532,0.00026412992,0.027428355],"study_design_scores_gemma":[0.0000055573714,0.000026607191,0.000059873604,0.0000019564345,0.0000058377104,0.000032599346,0.000005622006,0.9960819,0.0010532647,0.0025164555,0.00020593854,0.000004513335],"about_ca_topic_score_codex":0.0015417762,"about_ca_topic_score_gemma":0.0013171321,"teacher_disagreement_score":0.0015417762,"about_ca_system_score_codex":0.00069370953,"about_ca_system_score_gemma":0.00038145098,"threshold_uncertainty_score":0.0050332546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036041074,0.00018780066,0.9624377,0.00006163901,0.000016209582,0.000027939484,0.000010285559,0.00008908123,0.0011282288],"genre_scores_gemma":[0.8245067,0.000116624324,0.17382908,0.00005950569,0.000014276489,0.000089557645,0.000024512181,0.00001055173,0.0013491944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995177,0.00019298238,0.000028444112,0.00007147481,0.00013036103,0.000059001348],"domain_scores_gemma":[0.99936265,0.0003560139,0.00008620195,0.00006964177,0.00009855329,0.00002697773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009073535,0.00036739334,0.00050523883,0.00038654896,0.00036363618,0.00044131643,0.00096024445,0.0005392257,0.00056566886],"category_scores_gemma":[0.0023244317,0.00018640999,0.00028550733,0.00037142544,0.00044673655,0.0006286327,0.0006509564,0.0003777913,0.00012806471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015541245,0.00017088492,0.0010088332,0.000051472987,0.00005832393,0.00011298875,0.00014155864,0.7999354,0.011745964,0.0155570535,0.00047280602,0.1705892],"study_design_scores_gemma":[0.000020538555,0.00005718811,0.00015481781,0.00000325832,0.000009436123,0.00006101051,0.000009270086,0.9941858,0.0024004506,0.0026035542,0.0004872632,0.0000074276127],"about_ca_topic_score_codex":0.0010785861,"about_ca_topic_score_gemma":0.0016426546,"teacher_disagreement_score":0.0010785861,"about_ca_system_score_codex":0.00042130152,"about_ca_system_score_gemma":0.0005483713,"threshold_uncertainty_score":0.004798591},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0230324,0.00026421485,0.9724023,0.000115813404,0.000045046443,0.000052781426,0.00008099704,0.00014062651,0.0038658187],"genre_scores_gemma":[0.57723063,0.00069081265,0.41530412,0.00022254464,0.000094842864,0.0002976717,0.00027762848,0.00004263645,0.005839025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994654,0.000152814,0.000022652921,0.00006965929,0.00023018861,0.00005925821],"domain_scores_gemma":[0.9988845,0.0004041448,0.00011016918,0.00032308005,0.00023163528,0.00004647627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055337144,0.00036106852,0.0003953303,0.00045332743,0.00036656333,0.0005807492,0.000841066,0.0004578688,0.0014400128],"category_scores_gemma":[0.0016988752,0.0001367853,0.00025412563,0.00074662536,0.00059458165,0.0014231821,0.001263019,0.0006954803,0.00033165785],"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.00016868193,0.00008981338,0.001092865,0.00016461877,0.000046403795,0.0003424737,0.00016476028,0.3075366,0.042512465,0.4858043,0.002132003,0.159945],"study_design_scores_gemma":[0.000012202048,0.00008371311,0.00024192923,0.000013495427,0.000011615793,0.0002484291,0.000019764933,0.9271511,0.012090904,0.05325988,0.0068448735,0.00002214691],"about_ca_topic_score_codex":0.0006616801,"about_ca_topic_score_gemma":0.0011369783,"teacher_disagreement_score":0.0014400128,"about_ca_system_score_codex":0.00053876615,"about_ca_system_score_gemma":0.0007208459,"threshold_uncertainty_score":0.0048173666},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029537532,0.0022274947,0.9613418,0.0003487827,0.00008619687,0.00006503286,0.000045312016,0.0001302695,0.0062176087],"genre_scores_gemma":[0.9591496,0.0014400178,0.03636198,0.000095633986,0.00009971426,0.00012332693,0.00003920038,0.000022618953,0.0026680545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977998,0.0010958868,0.00008042019,0.0003056317,0.00044623064,0.0002719348],"domain_scores_gemma":[0.99519277,0.0035844294,0.0004931484,0.00023887276,0.00036734284,0.00012347479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020211039,0.0007133734,0.00097624806,0.00064464397,0.00068322656,0.001547606,0.0012320282,0.0012085118,0.00070991594],"category_scores_gemma":[0.0057917535,0.00044227034,0.00046739285,0.0010491022,0.0015140185,0.001646712,0.0010649378,0.00070472463,0.00012943789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013860562,0.000056553246,0.0014846273,0.0002656822,0.0001179323,0.000745214,0.00028274657,0.7148661,0.0035684393,0.2400964,0.0016164588,0.03676119],"study_design_scores_gemma":[0.000022208644,0.00005375356,0.00018482344,0.000012479789,0.000017424618,0.00015806977,0.000045427467,0.9405353,0.00043389396,0.0570772,0.0014447218,0.000014711392],"about_ca_topic_score_codex":0.0016981774,"about_ca_topic_score_gemma":0.0013376838,"teacher_disagreement_score":0.0020211039,"about_ca_system_score_codex":0.0012673656,"about_ca_system_score_gemma":0.0010535261,"threshold_uncertainty_score":0.010688722},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0561709,0.0011662936,0.92039925,0.0006404742,0.00012703698,0.00007885364,0.0004953766,0.00027752062,0.020644238],"genre_scores_gemma":[0.95373636,0.0017169191,0.031502884,0.00020555663,0.00016522767,0.00017602104,0.00021442515,0.00006311301,0.012219669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993032,0.00022398027,0.00002815778,0.00012558453,0.00019471812,0.00012426093],"domain_scores_gemma":[0.99857783,0.0006596618,0.00026934408,0.00013099544,0.00029759697,0.00006447645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000906586,0.0011203352,0.0014085928,0.0006931168,0.00062469614,0.0016574772,0.0020345033,0.0019532486,0.0022810618],"category_scores_gemma":[0.001973714,0.0005472761,0.00090825686,0.0013951216,0.0010338874,0.0016372536,0.00095971435,0.0017113677,0.000794135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000439864,0.000022188908,0.00040658764,0.0000454862,0.000026984422,0.00040177372,0.00006237441,0.9611475,0.001682699,0.032412168,0.0005813719,0.0031668688],"study_design_scores_gemma":[0.0000048930724,0.000016691089,0.00007750911,0.0000035315006,0.000010358417,0.00007463233,0.0000076952265,0.996829,0.00011497494,0.0026078834,0.00024396571,0.000008783038],"about_ca_topic_score_codex":0.0050286474,"about_ca_topic_score_gemma":0.0031871898,"teacher_disagreement_score":0.0050286474,"about_ca_system_score_codex":0.0012378673,"about_ca_system_score_gemma":0.0008216838,"threshold_uncertainty_score":0.009998739},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28098142,0.0022496742,0.68180895,0.0009202116,0.00006740666,0.000100515266,0.00036591743,0.00019807785,0.03330789],"genre_scores_gemma":[0.9753339,0.0012819157,0.018729052,0.0001267703,0.00007554029,0.000100641126,0.00015685322,0.00003864838,0.0041566542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989993,0.0002538027,0.000032249634,0.000080124526,0.00045679646,0.00017770927],"domain_scores_gemma":[0.99410206,0.0037194304,0.0004954702,0.00028477926,0.0012061491,0.00019211035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016054988,0.0006880492,0.00074693526,0.0011767526,0.00065266225,0.00092662097,0.00063929835,0.0006180454,0.0015510382],"category_scores_gemma":[0.006917756,0.0003862361,0.00036387704,0.0008062995,0.0012475644,0.0013609049,0.000873557,0.0009919329,0.00041376986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002880647,0.00007095263,0.0026008636,0.00018653067,0.000045671266,0.00040505896,0.00046852883,0.68606097,0.017237494,0.27299392,0.0016913784,0.017950563],"study_design_scores_gemma":[0.000019043882,0.00008157258,0.00083534775,0.000024945084,0.000015681362,0.0001897055,0.00007094945,0.93910164,0.0030687044,0.055765852,0.0007930144,0.000033450957],"about_ca_topic_score_codex":0.0033397123,"about_ca_topic_score_gemma":0.0020922858,"teacher_disagreement_score":0.0033397123,"about_ca_system_score_codex":0.0018903967,"about_ca_system_score_gemma":0.0014650103,"threshold_uncertainty_score":0.013715804},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017672278,0.0007494419,0.973146,0.00039531456,0.0000928956,0.00011000948,0.00007391028,0.00009047874,0.007669697],"genre_scores_gemma":[0.8445798,0.001705186,0.14338492,0.0002711184,0.00012613552,0.00033978152,0.00019335977,0.000043096406,0.009356633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992015,0.00024235075,0.000027861632,0.00015731534,0.00027950213,0.00009138867],"domain_scores_gemma":[0.9984855,0.0008248998,0.00020275392,0.00013673758,0.00028422018,0.00006594161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008596527,0.0007719315,0.00060067174,0.000622777,0.0006851805,0.0008160469,0.0014551136,0.0013486403,0.0020014732],"category_scores_gemma":[0.0030340336,0.00022787096,0.00032322935,0.0014328988,0.00072668795,0.0013424392,0.0014735942,0.0010112735,0.00037609326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016941525,0.00009895672,0.000817398,0.0004942898,0.00005991614,0.0005223976,0.00023145344,0.61291766,0.020718804,0.23554593,0.0047903075,0.12363353],"study_design_scores_gemma":[0.000028016897,0.00013978661,0.00014619407,0.00003200881,0.000015849593,0.00036873607,0.000094817726,0.940031,0.004981644,0.04499669,0.009137378,0.00002789487],"about_ca_topic_score_codex":0.0015450183,"about_ca_topic_score_gemma":0.0015326504,"teacher_disagreement_score":0.0020014732,"about_ca_system_score_codex":0.0009126211,"about_ca_system_score_gemma":0.0010032902,"threshold_uncertainty_score":0.0066955686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004661838,0.0002730525,0.99262625,0.00014864095,0.000018677092,0.000016301607,0.000013255413,0.00008697719,0.0021550457],"genre_scores_gemma":[0.77755636,0.0014353404,0.21636318,0.0001933663,0.00013506883,0.00021419422,0.00006428253,0.00018977316,0.0038484647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989141,0.00044012908,0.000038362297,0.00017600539,0.00033517295,0.00009614563],"domain_scores_gemma":[0.9984433,0.0010077918,0.00024234569,0.0001203459,0.00013435828,0.000051847273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014466556,0.0012198258,0.0006810514,0.00071577384,0.000393642,0.0012278664,0.001032355,0.0011223006,0.00093681633],"category_scores_gemma":[0.004424862,0.00049261673,0.0005301269,0.0007929391,0.002021956,0.0015358917,0.0015748243,0.0012596138,0.0002458064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002737137,0.000015023541,0.00010748833,0.000056219207,0.000016071293,0.0000726569,0.000055215547,0.9173078,0.003928568,0.06831042,0.00033700594,0.009766178],"study_design_scores_gemma":[0.000004665104,0.000023201348,0.00003092727,0.000007842236,0.0000041290073,0.00002193739,0.000011026553,0.96170604,0.0010401014,0.03639461,0.0007487916,0.000006624401],"about_ca_topic_score_codex":0.0017780514,"about_ca_topic_score_gemma":0.0011520924,"teacher_disagreement_score":0.0017780514,"about_ca_system_score_codex":0.0016681484,"about_ca_system_score_gemma":0.0009847197,"threshold_uncertainty_score":0.012103379},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023308438,0.00048402813,0.9958156,0.00012878171,0.00009929921,0.00011318382,0.000008874725,0.00016796398,0.00085135066],"genre_scores_gemma":[0.27497035,0.0015235723,0.71814793,0.00045214617,0.00024168727,0.0015779466,0.00012838976,0.00010999713,0.002847928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769336,0.000981078,0.00019977332,0.00025578993,0.0007377856,0.0001322344],"domain_scores_gemma":[0.9975909,0.00084782194,0.00027816975,0.00043681604,0.0007691222,0.00007730089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052781687,0.0008147431,0.00061141985,0.00056339416,0.0006704227,0.0016464462,0.0022640463,0.00095286017,0.001336203],"category_scores_gemma":[0.0064994493,0.00045647842,0.0005220061,0.00047419657,0.00089714996,0.0020054681,0.0013648447,0.0016440989,0.0005948177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025764108,0.0002121231,0.0008762106,0.0007350754,0.000334776,0.00069168623,0.00079199055,0.2863167,0.06918324,0.39689556,0.00766652,0.2360385],"study_design_scores_gemma":[0.00009682264,0.00026514995,0.00017340985,0.000060321676,0.00013430204,0.00038913797,0.00006486103,0.938671,0.012997135,0.029630825,0.01746647,0.00005060032],"about_ca_topic_score_codex":0.00048266613,"about_ca_topic_score_gemma":0.0006049746,"teacher_disagreement_score":0.0052781687,"about_ca_system_score_codex":0.00088263745,"about_ca_system_score_gemma":0.0011777477,"threshold_uncertainty_score":0.027913988},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3411077,0.0018370535,0.63741565,0.0032208303,0.00008250256,0.000080211394,0.00014553496,0.00023672111,0.015873915],"genre_scores_gemma":[0.97827244,0.0006557642,0.020240022,0.00007329744,0.000041577045,0.00004510198,0.000022917468,0.00003178921,0.0006170424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889106,0.0005031082,0.00003046195,0.000094808594,0.00031468342,0.00016580643],"domain_scores_gemma":[0.97229373,0.025114534,0.0010214627,0.00071074464,0.0006283124,0.0002311774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023116935,0.0005677787,0.0005022106,0.0009804645,0.000682168,0.0009498444,0.000641613,0.0010834113,0.0011740772],"category_scores_gemma":[0.022525856,0.00031864867,0.00035063524,0.0007702209,0.0023499841,0.002870989,0.0011828013,0.001063717,0.000111761205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011971521,0.00003527615,0.00089874514,0.00007484616,0.000019269437,0.0001246565,0.0001753829,0.85238993,0.0066038286,0.1292158,0.00041480066,0.00992775],"study_design_scores_gemma":[0.000010648418,0.000053166896,0.0004468172,0.000016502141,0.0000087034105,0.00008211672,0.00004487771,0.95014834,0.0016100374,0.04727729,0.00028412373,0.000017339065],"about_ca_topic_score_codex":0.002284924,"about_ca_topic_score_gemma":0.0012713125,"teacher_disagreement_score":0.0023116935,"about_ca_system_score_codex":0.002059355,"about_ca_system_score_gemma":0.00070295547,"threshold_uncertainty_score":0.014941752},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007764654,0.00014029723,0.9980475,0.00003797626,0.000013729415,0.000013517255,0.000008917216,0.00004305236,0.0009185753],"genre_scores_gemma":[0.2967637,0.0025842658,0.6934267,0.00025506224,0.00017525238,0.0010211123,0.00015524265,0.00025811928,0.005360507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988563,0.0005683378,0.000042356878,0.00009427875,0.00037469342,0.000063971915],"domain_scores_gemma":[0.9981225,0.0011675349,0.00015622427,0.00023529305,0.0002856241,0.00003279323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002198127,0.0012413048,0.00084781495,0.0008905754,0.00046099047,0.0015897577,0.0011516107,0.0012462236,0.0028310756],"category_scores_gemma":[0.0066016787,0.0006079354,0.00068745663,0.0012391879,0.0017376364,0.002041583,0.0010889657,0.0023347172,0.0010811276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052891763,0.00003479614,0.00020338365,0.00015274467,0.000045285702,0.000066569795,0.00011507693,0.7017869,0.0074966447,0.23765823,0.001319217,0.05106826],"study_design_scores_gemma":[0.000009919323,0.000040072242,0.00007647984,0.00002681197,0.000008979498,0.000045129906,0.000014536753,0.9460155,0.0013778849,0.048595086,0.0037686292,0.000021031416],"about_ca_topic_score_codex":0.0013187501,"about_ca_topic_score_gemma":0.0008088509,"teacher_disagreement_score":0.0028310756,"about_ca_system_score_codex":0.0013409563,"about_ca_system_score_gemma":0.0011190627,"threshold_uncertainty_score":0.011624932},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01931026,0.00033525334,0.9762191,0.00014704732,0.00002073218,0.000043744898,0.000047048296,0.00007644344,0.0038003963],"genre_scores_gemma":[0.7933605,0.0012087112,0.2009288,0.0001394582,0.000081984035,0.00031562493,0.0001726491,0.00010009788,0.0036921538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727577,0.00096345204,0.00008731054,0.00024226597,0.0010987973,0.0003324125],"domain_scores_gemma":[0.9903617,0.00600823,0.0011220806,0.00062218244,0.0017406459,0.00014513276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026064508,0.0010980817,0.0006948264,0.0012150424,0.00068080507,0.0016086602,0.0012069138,0.0010885332,0.0023298718],"category_scores_gemma":[0.014033629,0.00049610005,0.0005849846,0.0014883243,0.001630666,0.0018369247,0.0012730561,0.00084071915,0.0004367493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013632922,0.000026046544,0.000685799,0.00011216425,0.000039301027,0.00013280957,0.00022388663,0.7458467,0.006355087,0.2162954,0.0008673724,0.029279197],"study_design_scores_gemma":[0.000012845923,0.000056560406,0.0001417132,0.000028754204,0.000013910276,0.00012347838,0.000035478206,0.9653898,0.0026463082,0.03033026,0.0012024583,0.000018434239],"about_ca_topic_score_codex":0.0029082294,"about_ca_topic_score_gemma":0.0018126579,"teacher_disagreement_score":0.0029082294,"about_ca_system_score_codex":0.0020026623,"about_ca_system_score_gemma":0.0020401427,"threshold_uncertainty_score":0.014530361},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10957489,0.00044806043,0.88613033,0.0005213339,0.000016488213,0.000047473848,0.000080586324,0.00017055539,0.0030102604],"genre_scores_gemma":[0.9198503,0.00056024385,0.07768084,0.00007181263,0.000036278827,0.00014563925,0.00016800455,0.00006630494,0.0014206242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995078,0.00023714805,0.000012635386,0.00004465805,0.00015003658,0.000047790025],"domain_scores_gemma":[0.9985378,0.0010493641,0.00013146538,0.00009222457,0.00014668623,0.000042571166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011277152,0.00036742628,0.00039639793,0.0006451781,0.0004422073,0.0005134465,0.0006257524,0.0005757454,0.0007187678],"category_scores_gemma":[0.0046345945,0.00017693399,0.0003377076,0.0008450485,0.00062365603,0.0012697979,0.00054754136,0.00043749326,0.00009761454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009691677,0.00004292264,0.00070286467,0.00009979194,0.000017683282,0.00008038254,0.00015903408,0.8284279,0.007908707,0.11399098,0.001355503,0.047117267],"study_design_scores_gemma":[0.0000046914083,0.000022222006,0.00014904792,0.0000062213326,0.0000040458704,0.00003254114,0.00001956652,0.9685472,0.0012965449,0.029482463,0.00043081585,0.000004514274],"about_ca_topic_score_codex":0.001627349,"about_ca_topic_score_gemma":0.0019651991,"teacher_disagreement_score":0.001627349,"about_ca_system_score_codex":0.0012722883,"about_ca_system_score_gemma":0.0009261871,"threshold_uncertainty_score":0.00923115},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060237568,0.004052863,0.923678,0.00074636424,0.00021484264,0.00006154905,0.000045308127,0.00035651814,0.01060703],"genre_scores_gemma":[0.83960646,0.002984131,0.15367776,0.00020587657,0.00031760047,0.00007663864,0.000059022717,0.000027980273,0.0030446467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997229,0.00009854378,0.000011477667,0.000030595784,0.00010738067,0.000029069792],"domain_scores_gemma":[0.99910766,0.0005496234,0.00009624811,0.00007629131,0.00014531049,0.000024854195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045873795,0.00030118725,0.00022610686,0.00040605562,0.0003751209,0.0005500852,0.0004351106,0.00052206585,0.00037233162],"category_scores_gemma":[0.0015064218,0.00012474635,0.00016639238,0.00055264245,0.0005574376,0.0005916111,0.00039896692,0.0005617338,0.00015052434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021630306,0.00008051627,0.0014561376,0.00035789155,0.000055707933,0.00022919677,0.00020682304,0.15775718,0.164344,0.15198897,0.0033926575,0.5199147],"study_design_scores_gemma":[0.000040445026,0.00033553346,0.00085656554,0.000044603898,0.000053502117,0.0007887929,0.000052562755,0.83373517,0.061478566,0.084106006,0.01845593,0.000052344098],"about_ca_topic_score_codex":0.0006153927,"about_ca_topic_score_gemma":0.0009974573,"teacher_disagreement_score":0.0006153927,"about_ca_system_score_codex":0.00041504603,"about_ca_system_score_gemma":0.00034631684,"threshold_uncertainty_score":0.0030113459},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75695026,0.0013307891,0.23648779,0.00034220133,0.00005692091,0.000043921274,0.00010480657,0.00039565994,0.004287611],"genre_scores_gemma":[0.9966209,0.00015877154,0.0027734407,0.000016280841,0.000012290641,0.000016414888,0.0000257216,0.000011182222,0.0003649762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983278,0.00069093826,0.00007058412,0.00018376629,0.00046202543,0.00026487897],"domain_scores_gemma":[0.98622525,0.009867829,0.0012923367,0.0006632037,0.0017585965,0.00019286711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033822963,0.0010392007,0.0007315274,0.0008227167,0.00065244676,0.0010021133,0.0007054762,0.0009264881,0.00040644078],"category_scores_gemma":[0.014771925,0.0003686002,0.00029039607,0.00076997356,0.0014582332,0.0011987996,0.0009980715,0.0004207671,0.00018618954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019312846,0.000042232743,0.0025838846,0.000049809863,0.000054524746,0.00016302645,0.00014076802,0.9823877,0.005413156,0.00377837,0.00018320381,0.0050101094],"study_design_scores_gemma":[0.000010436632,0.00013534327,0.0008617995,0.0000059212502,0.000025136254,0.00007362207,0.000042089967,0.9939413,0.002588028,0.0022112862,0.00009246631,0.000012634398],"about_ca_topic_score_codex":0.0040059113,"about_ca_topic_score_gemma":0.0014008605,"teacher_disagreement_score":0.0040059113,"about_ca_system_score_codex":0.0013607233,"about_ca_system_score_gemma":0.00084499456,"threshold_uncertainty_score":0.017887473},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30992404,0.001825548,0.6790035,0.001069956,0.000067838904,0.00007418839,0.00021032708,0.00010877494,0.007715903],"genre_scores_gemma":[0.982464,0.0011518224,0.014836473,0.00007724445,0.00010421495,0.00005344824,0.000048446243,0.000019696517,0.0012446499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920124,0.00034272132,0.00002551611,0.00008484024,0.00019214624,0.0001536157],"domain_scores_gemma":[0.99109274,0.007272443,0.00064014376,0.00032981674,0.00045956852,0.00020526498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001815464,0.00095642096,0.00071692385,0.00045220315,0.0005544577,0.0009944822,0.0007886247,0.0009695354,0.0011118132],"category_scores_gemma":[0.009719779,0.00040841632,0.00034056357,0.0010139254,0.001450787,0.0022840775,0.001026171,0.0009609711,0.00015940407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002533669,0.000081059035,0.0016482645,0.00018778506,0.00006448799,0.00057744206,0.00030614008,0.73997086,0.013371063,0.22561517,0.00082191953,0.017102411],"study_design_scores_gemma":[0.000021987018,0.000096267344,0.0002446798,0.000013430822,0.000017516228,0.00020531783,0.000041304567,0.9441286,0.0017278255,0.053090785,0.0003973051,0.0000149726975],"about_ca_topic_score_codex":0.001153303,"about_ca_topic_score_gemma":0.0008034927,"teacher_disagreement_score":0.001815464,"about_ca_system_score_codex":0.0011207429,"about_ca_system_score_gemma":0.00058823836,"threshold_uncertainty_score":0.009601235},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033890281,0.00054375397,0.9920968,0.00028613026,0.00005251588,0.00002476984,0.0000381272,0.000052261123,0.0035167495],"genre_scores_gemma":[0.6189399,0.0053229854,0.353517,0.00076058425,0.0008760335,0.0005558359,0.00035180987,0.00037542405,0.019300485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757105,0.00096420717,0.000097065655,0.0001931252,0.0009840536,0.0001905453],"domain_scores_gemma":[0.99075073,0.0069822376,0.0005753401,0.0005303017,0.0010599325,0.000101569356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004524496,0.0015582615,0.00070179574,0.0014221214,0.0005551822,0.0013890808,0.0011998313,0.0013158012,0.0033500444],"category_scores_gemma":[0.017756872,0.0003789564,0.00067759026,0.0013271031,0.0027094046,0.0029170103,0.0018989091,0.002401371,0.0008918164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008610701,0.000035504105,0.0004981237,0.000104120256,0.000035792946,0.0001142299,0.00020482922,0.4433418,0.0026885099,0.52151597,0.001920589,0.02945446],"study_design_scores_gemma":[0.0000069553403,0.00002449256,0.00008486796,0.000020652144,0.0000061973683,0.000042647276,0.000015356725,0.88648903,0.0006884892,0.11166749,0.00093725114,0.000016598562],"about_ca_topic_score_codex":0.0024585603,"about_ca_topic_score_gemma":0.001564102,"teacher_disagreement_score":0.004524496,"about_ca_system_score_codex":0.0015799467,"about_ca_system_score_gemma":0.0011747305,"threshold_uncertainty_score":0.023928106},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39777353,0.0009372208,0.5945939,0.00023240756,0.000047038837,0.000047723035,0.00007876914,0.000218405,0.0060710018],"genre_scores_gemma":[0.9903922,0.00048107377,0.008096865,0.00004095709,0.00002417902,0.000026596214,0.000026426464,0.00000973125,0.0009019918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984686,0.0006767321,0.000029197976,0.00013734613,0.00035577983,0.0003324212],"domain_scores_gemma":[0.9908414,0.0069962516,0.00065406185,0.0004127769,0.00091755757,0.00017800392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018542707,0.0010523911,0.0008766447,0.0005497744,0.00051784667,0.0011693292,0.0005891153,0.0006822047,0.0005881453],"category_scores_gemma":[0.008362004,0.00029797465,0.0003306375,0.000912189,0.0019175584,0.0018042859,0.0009114076,0.000583435,0.0001654979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012926474,0.00003100824,0.0008313056,0.00003927146,0.000022746794,0.00018248451,0.00008108179,0.9670446,0.0030283437,0.022174682,0.00015043655,0.006284852],"study_design_scores_gemma":[0.000021314525,0.00009916576,0.00025480255,0.000005385112,0.000011828378,0.00013407087,0.000057548616,0.98005235,0.0016327039,0.017476752,0.00023429719,0.00001970247],"about_ca_topic_score_codex":0.0018300923,"about_ca_topic_score_gemma":0.0014836702,"teacher_disagreement_score":0.0018542707,"about_ca_system_score_codex":0.0008495758,"about_ca_system_score_gemma":0.00068426004,"threshold_uncertainty_score":0.009806454},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05316652,0.00020929401,0.93879044,0.00028806264,0.000035342964,0.000094063995,0.00010210044,0.00012822884,0.007186048],"genre_scores_gemma":[0.8076258,0.00023243019,0.18626389,0.00008217446,0.000032165317,0.00021918667,0.00007556194,0.000038234033,0.005430554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892396,0.0005006298,0.00004002203,0.00017439261,0.00023855788,0.00012242186],"domain_scores_gemma":[0.99931943,0.0003535258,0.00011064199,0.00007392985,0.00010262812,0.000039888702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015739647,0.001059854,0.0008886398,0.0003526332,0.0003008133,0.0009140016,0.0012772499,0.0011138316,0.0025220695],"category_scores_gemma":[0.0018148834,0.00038806113,0.00049352145,0.0007515001,0.00095143775,0.00080438785,0.0011043814,0.000737767,0.0004197565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025844778,0.000072265044,0.00028256697,0.00009083902,0.00005331851,0.00016797097,0.00009951647,0.8928158,0.016056053,0.058171116,0.0010810172,0.030851068],"study_design_scores_gemma":[0.000032020675,0.000070667775,0.00008169751,0.000004427469,0.0000119370325,0.000034184373,0.0000084851445,0.9928276,0.0014904303,0.005050557,0.0003785345,0.000009474704],"about_ca_topic_score_codex":0.0010974067,"about_ca_topic_score_gemma":0.00105538,"teacher_disagreement_score":0.0025220695,"about_ca_system_score_codex":0.0011431027,"about_ca_system_score_gemma":0.0011348174,"threshold_uncertainty_score":0.008437216},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3641522,0.001218406,0.5990706,0.001231094,0.00012992935,0.0001350719,0.000531314,0.0010829929,0.032448344],"genre_scores_gemma":[0.9766642,0.0002984348,0.021067096,0.000120863384,0.000030214751,0.00006145021,0.00016975137,0.0001198748,0.0014680708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692994,0.0007308759,0.00015024262,0.00030603257,0.0012506179,0.0006324],"domain_scores_gemma":[0.9714722,0.021518359,0.0017314951,0.0032864367,0.0016319171,0.00035959674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040601683,0.00082029076,0.0011968173,0.0008299031,0.0004713666,0.0015163284,0.0012292993,0.0009813836,0.002402237],"category_scores_gemma":[0.035098128,0.00034120656,0.00048948417,0.00078785623,0.0020295312,0.0034349996,0.0019525106,0.0014280718,0.00041475715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010778354,0.00017145464,0.004444795,0.00051998976,0.00011672539,0.0009185769,0.0005405334,0.465389,0.056437712,0.40739825,0.0029733295,0.06001188],"study_design_scores_gemma":[0.000074154246,0.0005155347,0.0023401047,0.00011170292,0.000071039,0.0010009877,0.00017964633,0.7433077,0.08343344,0.16570471,0.003154594,0.00010636571],"about_ca_topic_score_codex":0.0013174157,"about_ca_topic_score_gemma":0.00097534247,"teacher_disagreement_score":0.0040601683,"about_ca_system_score_codex":0.0012576417,"about_ca_system_score_gemma":0.0014294112,"threshold_uncertainty_score":0.021472454},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046445444,0.0008540862,0.94611305,0.00019777671,0.00004618833,0.0000384369,0.000051730498,0.00027226165,0.0059809946],"genre_scores_gemma":[0.93059,0.0006259848,0.06645113,0.00006529795,0.000041669064,0.000071929884,0.000051130457,0.000058631143,0.0020442035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920756,0.00031459646,0.000019825698,0.00006764419,0.00025283117,0.0001375978],"domain_scores_gemma":[0.99879503,0.0008943739,0.000102196194,0.00005016062,0.00012681665,0.00003150608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016994374,0.00076018577,0.0006965897,0.0006617514,0.0004413007,0.0009867812,0.0007036807,0.0005984218,0.0009471578],"category_scores_gemma":[0.0031035112,0.0003976833,0.0005996133,0.0008918518,0.00095139194,0.0008600774,0.00076166075,0.00073632784,0.00015213134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000139026615,0.00000660077,0.00010044735,0.000017955763,0.00000916448,0.000023307815,0.0000135199225,0.9900435,0.0005814442,0.005743532,0.000114652015,0.003332014],"study_design_scores_gemma":[0.0000023503965,0.00000970055,0.000040738505,0.0000023179416,0.0000020406328,0.0000045402785,0.0000047881463,0.9966635,0.00024207638,0.0029397546,0.00008612694,0.000001968279],"about_ca_topic_score_codex":0.0037868316,"about_ca_topic_score_gemma":0.002671537,"teacher_disagreement_score":0.0037868316,"about_ca_system_score_codex":0.0016103779,"about_ca_system_score_gemma":0.0011109277,"threshold_uncertainty_score":0.011684179},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36653253,0.0033127412,0.60183924,0.00071854115,0.00010300619,0.00011357251,0.00022930116,0.0004637945,0.026687255],"genre_scores_gemma":[0.99360996,0.00032504046,0.0053744526,0.000044730008,0.000021057227,0.000028925733,0.00003991032,0.000020220665,0.00053556164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976158,0.0010216036,0.0000944264,0.00028889105,0.0006071976,0.00037202775],"domain_scores_gemma":[0.9872736,0.009677218,0.000739357,0.0007533819,0.0014151611,0.00014136093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003423371,0.0017577794,0.0012980642,0.00077637885,0.0007771671,0.0014098972,0.0010023143,0.0014305619,0.0014544278],"category_scores_gemma":[0.019006483,0.00043541697,0.0005302077,0.0010019285,0.001406519,0.0019350733,0.0019664734,0.0007276998,0.00037556048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015652204,0.000043480482,0.00073291146,0.00006652491,0.00004634838,0.000102851525,0.0001203063,0.97481954,0.0028066498,0.009855905,0.00028876527,0.010960216],"study_design_scores_gemma":[0.000016791428,0.00012643501,0.00048413605,0.000016211283,0.000027989756,0.000087983644,0.000049110677,0.9931375,0.0013070657,0.0045524985,0.00017379675,0.000020521673],"about_ca_topic_score_codex":0.0037394662,"about_ca_topic_score_gemma":0.0023893816,"teacher_disagreement_score":0.0037394662,"about_ca_system_score_codex":0.0013345897,"about_ca_system_score_gemma":0.0010170096,"threshold_uncertainty_score":0.018104792},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01762027,0.0012907219,0.9759616,0.00017353884,0.00005367509,0.000024993726,0.00003128211,0.00007412046,0.004769727],"genre_scores_gemma":[0.7472463,0.002544257,0.24596477,0.00024334849,0.00014098687,0.00010122617,0.00009014343,0.00003848497,0.003630524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996474,0.000094105126,0.000013812909,0.00004529242,0.00015589694,0.000043560955],"domain_scores_gemma":[0.99929833,0.00038528786,0.00009751017,0.00007554227,0.00012850284,0.000014767591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036157577,0.00060804177,0.00032575184,0.0003155025,0.00045702024,0.0007098885,0.00036186093,0.0007100418,0.001376052],"category_scores_gemma":[0.0016867323,0.00017182251,0.00031257112,0.0006581672,0.00044942315,0.0005670813,0.00043536216,0.000634001,0.00041338487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017985364,0.00008056834,0.0018638939,0.00043651537,0.000074514806,0.00039447838,0.0002590574,0.48709726,0.049792476,0.12541373,0.003108775,0.33129877],"study_design_scores_gemma":[0.0000070783417,0.000102914404,0.00038740478,0.000048340145,0.000030521493,0.00032318218,0.000033995457,0.9704709,0.009062988,0.014652833,0.004851493,0.000028382712],"about_ca_topic_score_codex":0.0018103333,"about_ca_topic_score_gemma":0.003473839,"teacher_disagreement_score":0.0018103333,"about_ca_system_score_codex":0.0008392588,"about_ca_system_score_gemma":0.0007841132,"threshold_uncertainty_score":0.0060893297},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06556247,0.00523699,0.86865443,0.000886029,0.00072351587,0.00015226264,0.0004322499,0.0011327065,0.05721939],"genre_scores_gemma":[0.9237878,0.002842869,0.050843935,0.00042180528,0.00030780295,0.00015442715,0.00027001215,0.00004448155,0.021326808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994289,0.00013305292,0.000015477217,0.000120304656,0.00018039951,0.00012176991],"domain_scores_gemma":[0.9991394,0.0003027143,0.00009665407,0.00013989727,0.00024785977,0.00007351231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038001096,0.00064806495,0.0006060546,0.000561008,0.0005469303,0.00105292,0.0011168342,0.00080357544,0.003613892],"category_scores_gemma":[0.00101626,0.00023897013,0.00037773422,0.00083445356,0.00046773427,0.000906178,0.0012109055,0.00061637675,0.0010608288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002984559,0.00013275792,0.0010385423,0.0003142594,0.00014101191,0.0008023693,0.00038945966,0.5949875,0.021752981,0.21279307,0.013047759,0.1543018],"study_design_scores_gemma":[0.000026922147,0.0001091276,0.00023740943,0.000017796216,0.000025469062,0.00022088637,0.000061821374,0.9475188,0.002621229,0.037191622,0.011938415,0.000030486372],"about_ca_topic_score_codex":0.003065331,"about_ca_topic_score_gemma":0.0032991231,"teacher_disagreement_score":0.003613892,"about_ca_system_score_codex":0.0009188994,"about_ca_system_score_gemma":0.0004702597,"threshold_uncertainty_score":0.01208967},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78971404,0.004995286,0.17813781,0.0007129696,0.00012836952,0.00014560843,0.000364642,0.00032672024,0.025474554],"genre_scores_gemma":[0.9962101,0.0005569636,0.0022277737,0.000023196317,0.000026572501,0.000025632116,0.000048291316,0.0000122896545,0.0008690204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985821,0.0004736908,0.000042624324,0.00013100749,0.00045064872,0.00031985596],"domain_scores_gemma":[0.9871652,0.009552033,0.0008536348,0.00034806415,0.0018953639,0.00018577429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022058696,0.0017659428,0.0012059818,0.0008164859,0.0008124584,0.0012570483,0.0008617727,0.0014509169,0.0019157971],"category_scores_gemma":[0.009587639,0.00042614082,0.00054457336,0.0009093077,0.0013163891,0.0012741528,0.0012725664,0.0009150011,0.0003077771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052070146,0.00005234156,0.001835106,0.0002395344,0.00012239344,0.00034300468,0.0003787022,0.9652516,0.00788362,0.010714645,0.00052760507,0.0121306935],"study_design_scores_gemma":[0.000030188514,0.00044273215,0.0012484619,0.000030185374,0.00007900333,0.00017248116,0.00015279045,0.9915044,0.0024079806,0.0036082698,0.00029213438,0.00003141271],"about_ca_topic_score_codex":0.006398138,"about_ca_topic_score_gemma":0.0056840875,"teacher_disagreement_score":0.006398138,"about_ca_system_score_codex":0.0015438977,"about_ca_system_score_gemma":0.0007748049,"threshold_uncertainty_score":0.012721777},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018412488,0.0041881856,0.9431079,0.002766679,0.00019764964,0.00004178865,0.00013802723,0.00010056654,0.03104671],"genre_scores_gemma":[0.91285837,0.01089444,0.06568591,0.0009265423,0.00096585136,0.0004742433,0.00019817463,0.00011502022,0.007881376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986939,0.000401899,0.000034104218,0.00009466061,0.0006547898,0.00012077892],"domain_scores_gemma":[0.99681914,0.0021530846,0.0002664666,0.00022511357,0.00046525593,0.000071025745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002180248,0.00075396977,0.000690426,0.001371046,0.0007960423,0.0015351233,0.0017681775,0.0014424456,0.0019590643],"category_scores_gemma":[0.0089317225,0.00043435904,0.0005273389,0.0016415556,0.002412812,0.0028142317,0.0014803621,0.0015096039,0.0004483045],"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.000010067171,0.000018530072,0.00020575523,0.000095998854,0.000015167439,0.00008144272,0.00012533777,0.19896454,0.0008971438,0.79045784,0.0014552274,0.0076729213],"study_design_scores_gemma":[0.000005476917,0.000022479635,0.00009922644,0.00004434643,0.0000067413316,0.00007738781,0.00004861667,0.40614396,0.00026093813,0.5902951,0.0029844726,0.000011314451],"about_ca_topic_score_codex":0.0011464134,"about_ca_topic_score_gemma":0.00067141507,"teacher_disagreement_score":0.002180248,"about_ca_system_score_codex":0.0019215515,"about_ca_system_score_gemma":0.0009174139,"threshold_uncertainty_score":0.013941884},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8743385,0.0012498588,0.11917047,0.00025030592,0.000026002455,0.000031920095,0.00013160067,0.00025374288,0.0045476244],"genre_scores_gemma":[0.9958984,0.00023016053,0.0032795013,0.000026582864,0.000006914229,0.000015715226,0.000034969984,0.000008780908,0.0004990338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986267,0.00054252223,0.000059339578,0.00013143783,0.00039467865,0.0002454325],"domain_scores_gemma":[0.9891271,0.00824758,0.0007735422,0.00040155323,0.0012986826,0.00015150585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024263854,0.0011380407,0.0007948993,0.0007032463,0.0006868204,0.0011167092,0.0005326,0.0012340654,0.00055271806],"category_scores_gemma":[0.011207997,0.00028680157,0.00029148342,0.0005081502,0.0015010558,0.0012298228,0.001173304,0.00047879972,0.00019376296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037706693,0.000039681778,0.0025006253,0.00006281734,0.00005532098,0.00014289099,0.00017978798,0.97568464,0.008433299,0.0035230215,0.00015181927,0.008849061],"study_design_scores_gemma":[0.000026441276,0.0003319582,0.0013655549,0.000017780418,0.00004961514,0.00015011666,0.00007673844,0.98514396,0.009661843,0.002990824,0.00015109967,0.00003418031],"about_ca_topic_score_codex":0.0043616593,"about_ca_topic_score_gemma":0.0028784398,"teacher_disagreement_score":0.0043616593,"about_ca_system_score_codex":0.0013119883,"about_ca_system_score_gemma":0.00070972857,"threshold_uncertainty_score":0.012832105},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010209684,0.00007006023,0.9878477,0.0001214371,0.000023414303,0.0000111969,0.000021643664,0.000070664355,0.0016242677],"genre_scores_gemma":[0.8218485,0.00022305199,0.17200597,0.000082089195,0.000062270796,0.000113886,0.000089695175,0.000044223867,0.0055303597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918,0.00024041467,0.00003272398,0.00018897557,0.0002458382,0.00011201153],"domain_scores_gemma":[0.9987896,0.00071303244,0.00011271729,0.000119486554,0.00022062997,0.000044457407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010736571,0.0008003581,0.0008611156,0.00030306872,0.00032262562,0.00094795134,0.0007002889,0.0010929003,0.0016716867],"category_scores_gemma":[0.002633001,0.00031100874,0.00037313055,0.0006358269,0.0008717285,0.001043069,0.0008151127,0.0006303153,0.00033796608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096302494,0.000023821496,0.00020004873,0.000040924817,0.000020897405,0.000030952626,0.00002721707,0.9400316,0.0045269043,0.026888294,0.0005525783,0.027560448],"study_design_scores_gemma":[0.000013194256,0.000022546108,0.0000443184,0.0000017275288,0.0000031653049,0.000008891907,0.0000043168275,0.99404716,0.00086536194,0.004708316,0.00027798346,0.000002983661],"about_ca_topic_score_codex":0.0014076119,"about_ca_topic_score_gemma":0.0012966316,"teacher_disagreement_score":0.0016716867,"about_ca_system_score_codex":0.001007885,"about_ca_system_score_gemma":0.001160659,"threshold_uncertainty_score":0.0073127747},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2275584,0.010424305,0.6696888,0.0019010393,0.00012626793,0.000113604336,0.0009170375,0.0005768875,0.08869358],"genre_scores_gemma":[0.97329503,0.0030820915,0.017690027,0.00021995793,0.0001734725,0.0002544854,0.00025914758,0.000118813194,0.004906968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998423,0.000681939,0.00003850349,0.00008361026,0.00044333085,0.00032959096],"domain_scores_gemma":[0.97908235,0.017607959,0.0010645624,0.00053443154,0.0014063894,0.00030425008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003131851,0.00100821,0.0009629274,0.0016811163,0.00082307705,0.0023192568,0.001131087,0.0009781884,0.0034228114],"category_scores_gemma":[0.016502766,0.00063314865,0.00054606353,0.0012709299,0.0027411126,0.0020541677,0.00153847,0.0011849592,0.00055537984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016923403,0.000034102577,0.00042195505,0.00023400533,0.000060065573,0.00037815634,0.000392278,0.64176756,0.0037325968,0.34363267,0.0023157166,0.006861726],"study_design_scores_gemma":[0.000019359872,0.00003747087,0.00042230537,0.00008666255,0.000027026937,0.00014319587,0.000114731956,0.8421537,0.0016941219,0.1538116,0.0014436556,0.00004609923],"about_ca_topic_score_codex":0.003022879,"about_ca_topic_score_gemma":0.0016154927,"teacher_disagreement_score":0.0034228114,"about_ca_system_score_codex":0.0022780306,"about_ca_system_score_gemma":0.0011009439,"threshold_uncertainty_score":0.016562998},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55114305,0.0017283679,0.44260317,0.0005563417,0.00005587874,0.00005882865,0.00021210038,0.00029630042,0.003345945],"genre_scores_gemma":[0.9888123,0.0005305538,0.009067424,0.00003472911,0.000037409147,0.00004249147,0.00009782628,0.00004282571,0.0013344777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997652,0.0007920905,0.00013792892,0.00027989392,0.0008162473,0.00032184576],"domain_scores_gemma":[0.95242435,0.038718753,0.0045029083,0.0014742989,0.0025334875,0.0003462069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068297195,0.0012241085,0.0011346136,0.00152062,0.0005082791,0.0012993459,0.0012557553,0.0014548877,0.0011321855],"category_scores_gemma":[0.029650766,0.0006180692,0.0005465158,0.0009173047,0.0024451052,0.0022895944,0.0016229723,0.0009427377,0.00022778058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039283038,0.000041818905,0.0041146465,0.00010019405,0.000061978935,0.00031982083,0.00024886752,0.955754,0.0028766848,0.028071605,0.0002882666,0.0077293077],"study_design_scores_gemma":[0.000014217894,0.000049963295,0.001004036,0.00001418044,0.000023176246,0.00012654785,0.00003910583,0.99054235,0.0016231409,0.0064530848,0.00008241122,0.000027720325],"about_ca_topic_score_codex":0.0023001235,"about_ca_topic_score_gemma":0.0012619057,"teacher_disagreement_score":0.0068297195,"about_ca_system_score_codex":0.0015574499,"about_ca_system_score_gemma":0.00077387877,"threshold_uncertainty_score":0.03611946},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7258635,0.0030895548,0.2577551,0.00040641014,0.00010676585,0.00014922697,0.00020740411,0.00021600477,0.012205982],"genre_scores_gemma":[0.9898108,0.0003372794,0.009055328,0.000020606998,0.0000133350095,0.000041478994,0.000027226335,0.0000032712207,0.0006907179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905056,0.0004599944,0.000033142267,0.00009654709,0.00021849043,0.0001412033],"domain_scores_gemma":[0.9955646,0.0030439077,0.00045921325,0.00016171476,0.0006516067,0.00011913448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019173605,0.0008506329,0.00084241066,0.00058305863,0.0004929991,0.00089435524,0.0009963732,0.0007788879,0.0008688946],"category_scores_gemma":[0.0049691177,0.0002026217,0.00027316064,0.00081314927,0.0008222602,0.001125914,0.0011915982,0.00033199158,0.00016039067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028358705,0.00008868428,0.0010422426,0.00010104926,0.000053973847,0.00036142126,0.000106338855,0.9692871,0.004126543,0.012558407,0.00043616476,0.011554467],"study_design_scores_gemma":[0.000021816453,0.00018156286,0.00018019615,0.000004328361,0.000024743924,0.00006448762,0.0000264637,0.9961824,0.0008788087,0.0022187612,0.00020793607,0.000008332615],"about_ca_topic_score_codex":0.0023675514,"about_ca_topic_score_gemma":0.001821613,"teacher_disagreement_score":0.0023675514,"about_ca_system_score_codex":0.0009071892,"about_ca_system_score_gemma":0.00044380085,"threshold_uncertainty_score":0.010140121},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5618751,0.000988225,0.4305343,0.00037610842,0.00009785052,0.00009701795,0.00008258491,0.0011407662,0.004807988],"genre_scores_gemma":[0.9797824,0.000115843264,0.019574927,0.000026578826,0.000011692637,0.0000124625685,0.00002487438,0.000008062815,0.00044316638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997701,0.00006151778,0.000009841971,0.000024154846,0.000084291736,0.000050101105],"domain_scores_gemma":[0.99928194,0.0003353501,0.00007255322,0.00006326635,0.00021604358,0.000030859002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005520812,0.00026481666,0.00028697198,0.0003137956,0.0003331212,0.00035049423,0.0006049613,0.0003444765,0.00040815302],"category_scores_gemma":[0.0016074268,0.000099475576,0.00013219164,0.00030131848,0.00039515132,0.0005877519,0.00048159715,0.00037293162,0.000057680027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039825068,0.0001280924,0.005091001,0.00010511822,0.000062210675,0.0006730139,0.0001733199,0.7916163,0.03713064,0.009321704,0.001756382,0.15354398],"study_design_scores_gemma":[0.0000055232076,0.000032905602,0.00020628862,0.0000041181597,0.0000049765717,0.00003429943,0.000015229921,0.9943725,0.004422308,0.00053804164,0.0003584386,0.0000053273434],"about_ca_topic_score_codex":0.013172378,"about_ca_topic_score_gemma":0.010012507,"teacher_disagreement_score":0.013172378,"about_ca_system_score_codex":0.00094142364,"about_ca_system_score_gemma":0.00054226146,"threshold_uncertainty_score":0.026191413},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010334872,0.0022695893,0.9762431,0.00025938574,0.00008333557,0.000035840338,0.000016808623,0.000047629124,0.010709545],"genre_scores_gemma":[0.83985704,0.0065626246,0.14027718,0.0002443285,0.00033638612,0.00015715451,0.000040095594,0.00008119091,0.012444105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994597,0.0002245321,0.000017835217,0.00007538706,0.00018090365,0.000041673324],"domain_scores_gemma":[0.9993493,0.00044909617,0.000050095303,0.000031190903,0.00010944649,0.000010756429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008231916,0.0006755898,0.00051860814,0.00034707834,0.0004381318,0.00081260584,0.00066863897,0.00060602487,0.0018710963],"category_scores_gemma":[0.002347095,0.00035139488,0.00027953536,0.0005953154,0.00076600694,0.0010428012,0.00044354747,0.0005615625,0.00043865465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012350969,0.00006154697,0.0004259083,0.00028558052,0.000038805938,0.00028204726,0.00023590487,0.6174287,0.013939499,0.27838972,0.0031711138,0.08561763],"study_design_scores_gemma":[0.000008626029,0.000053235966,0.000115872666,0.000022105198,0.00001410715,0.00012555257,0.000033227152,0.95297736,0.0016273988,0.0420095,0.0030010103,0.000012120991],"about_ca_topic_score_codex":0.0011611156,"about_ca_topic_score_gemma":0.0010536631,"teacher_disagreement_score":0.0018710963,"about_ca_system_score_codex":0.00078009756,"about_ca_system_score_gemma":0.0005503868,"threshold_uncertainty_score":0.006259501},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019447515,0.00020885085,0.97893816,0.00011871907,0.000009582212,0.000019378951,0.000020818039,0.00007550275,0.0011615556],"genre_scores_gemma":[0.88879,0.00030895715,0.108793266,0.000067427274,0.00002860998,0.0001010342,0.000049336213,0.000026298847,0.0018350603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993774,0.00024565496,0.00002151914,0.00011950763,0.00014504704,0.00009077098],"domain_scores_gemma":[0.9993394,0.0004218774,0.000086114334,0.000041446332,0.00008676028,0.000024390125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086767296,0.00078876177,0.0011803118,0.00030164674,0.00046355528,0.0008604107,0.00086461403,0.00073657243,0.00065721787],"category_scores_gemma":[0.0015837499,0.0003816179,0.00040365235,0.00047980875,0.00071993633,0.0009590846,0.00077755156,0.0006807116,0.00015038533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045363577,0.000017506321,0.0001708606,0.00002981358,0.0000143983025,0.000046655794,0.00005443162,0.9710051,0.0012276238,0.007946063,0.00036039107,0.019081762],"study_design_scores_gemma":[0.0000066927482,0.000012497833,0.00002607183,0.0000015436701,0.0000033427043,0.00001287141,0.000007733345,0.9967685,0.00030963766,0.002740815,0.00010800024,0.000002273439],"about_ca_topic_score_codex":0.0035143746,"about_ca_topic_score_gemma":0.0029326489,"teacher_disagreement_score":0.0035143746,"about_ca_system_score_codex":0.0010223044,"about_ca_system_score_gemma":0.0008650767,"threshold_uncertainty_score":0.007417381},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15602124,0.00055377616,0.836172,0.0004920748,0.000057131594,0.000058625472,0.00010649427,0.00023987188,0.006298822],"genre_scores_gemma":[0.9753817,0.00021678617,0.022591738,0.00006289511,0.000055881363,0.00007111009,0.000030015155,0.000025299312,0.0015644408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779534,0.0008616803,0.00008308602,0.000325036,0.0003754337,0.00055941],"domain_scores_gemma":[0.9928658,0.0047741774,0.00079628074,0.00049098313,0.0006861234,0.0003865574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025313918,0.0010550518,0.0013361475,0.0008267341,0.0014987299,0.0020495504,0.0020165327,0.0011123244,0.0015151397],"category_scores_gemma":[0.0072932434,0.0005363265,0.00045175743,0.0014009279,0.0023626045,0.0027101059,0.0022084308,0.0009848366,0.00031071654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029093534,0.000080410726,0.0009235376,0.000076044846,0.000043146872,0.0006056635,0.00025820418,0.8834762,0.0042688553,0.09743244,0.0008826196,0.011661879],"study_design_scores_gemma":[0.000024811228,0.000045375014,0.00013053461,0.000004857105,0.000012554667,0.00007681378,0.0000520717,0.970189,0.00065532915,0.02845061,0.00034350023,0.000014628898],"about_ca_topic_score_codex":0.0032066277,"about_ca_topic_score_gemma":0.00245558,"teacher_disagreement_score":0.0032066277,"about_ca_system_score_codex":0.0017051284,"about_ca_system_score_gemma":0.0011777449,"threshold_uncertainty_score":0.013387442},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61506,0.0020510063,0.36949384,0.00043721593,0.00005456721,0.000045339773,0.000054635213,0.00042031388,0.012383095],"genre_scores_gemma":[0.993238,0.00034132262,0.005873901,0.000022318149,0.000011777225,0.000007127828,0.000009896971,0.00000600134,0.00048977375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996105,0.00018705871,0.000009201383,0.000025631603,0.000093549475,0.00007414572],"domain_scores_gemma":[0.9980282,0.0015534607,0.00012748865,0.000116191375,0.0001325796,0.0000420514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005947593,0.00046500514,0.00041452883,0.00044664115,0.00021606126,0.000518114,0.00029967775,0.0005622502,0.0005330564],"category_scores_gemma":[0.0024834552,0.00016688192,0.00022594417,0.0004940705,0.00058782415,0.00058907067,0.0006258219,0.00027586817,0.0001244771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036760405,0.000087010296,0.0021036942,0.00014619852,0.000053817243,0.00059062924,0.00034785617,0.8590612,0.062707126,0.018357351,0.00059815444,0.055579312],"study_design_scores_gemma":[0.000040475188,0.00031625465,0.001095699,0.000010992559,0.000032504588,0.0002885885,0.00005267047,0.97557276,0.01158914,0.009820761,0.0011558561,0.000024283043],"about_ca_topic_score_codex":0.0010716063,"about_ca_topic_score_gemma":0.00084344205,"teacher_disagreement_score":0.0010716063,"about_ca_system_score_codex":0.00047405623,"about_ca_system_score_gemma":0.00017598672,"threshold_uncertainty_score":0.003439486},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104610026,0.0012790337,0.88754445,0.00041344218,0.000037024118,0.00004923222,0.000029414925,0.00021753495,0.005819775],"genre_scores_gemma":[0.9069385,0.0014264666,0.08967429,0.00010554947,0.00013039476,0.0000759099,0.000026617874,0.000028966433,0.001593296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992472,0.000383227,0.000024834826,0.000077656325,0.00018781642,0.00007932953],"domain_scores_gemma":[0.99876714,0.0008447551,0.0001506078,0.00009127362,0.00012166525,0.000024510407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012185525,0.0010348062,0.00074800017,0.00034318696,0.00032171613,0.000651506,0.0006770084,0.0006637761,0.0008328914],"category_scores_gemma":[0.0038309456,0.00030161944,0.00024289032,0.0006194802,0.0007706937,0.001306822,0.00076690025,0.00034191285,0.0002342879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016066141,0.00007187362,0.00080680655,0.00008295545,0.000037973034,0.00013451367,0.00011781713,0.9035061,0.011275658,0.026587643,0.00073127786,0.05648683],"study_design_scores_gemma":[0.000027397564,0.00014016635,0.00013983043,0.0000054744933,0.000026773598,0.00008206953,0.000018128107,0.98565763,0.002651891,0.010680117,0.00056369125,0.0000068255836],"about_ca_topic_score_codex":0.0007018961,"about_ca_topic_score_gemma":0.0009165796,"teacher_disagreement_score":0.0012185525,"about_ca_system_score_codex":0.0005110496,"about_ca_system_score_gemma":0.0004900997,"threshold_uncertainty_score":0.0064443946},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09888582,0.0041579097,0.86228204,0.0014799646,0.00014847222,0.00011171619,0.0004083335,0.0006256965,0.03190011],"genre_scores_gemma":[0.95757556,0.0038790368,0.025978716,0.00029120367,0.00025881373,0.00024807506,0.00034476494,0.00015270435,0.011271293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987206,0.00044515746,0.00003676758,0.000167115,0.00040137427,0.00022894208],"domain_scores_gemma":[0.99012893,0.0068037314,0.0010473233,0.00042096627,0.0012816738,0.0003173913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028586264,0.0015009957,0.0015238624,0.0015888218,0.00087896234,0.0016213955,0.0016076152,0.0016625165,0.00435011],"category_scores_gemma":[0.016564453,0.0009148956,0.00082883507,0.001119076,0.0026851173,0.0036001496,0.0022955134,0.0018400766,0.00084639183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017288407,0.00005622164,0.0014446734,0.000299968,0.00008513959,0.0008430757,0.00031118363,0.77328956,0.00544212,0.20600466,0.003551506,0.008499008],"study_design_scores_gemma":[0.000011915969,0.00004421758,0.0003853393,0.000028305429,0.000024827079,0.00018656641,0.00008324642,0.96973354,0.000409431,0.028437871,0.0006340279,0.000020679663],"about_ca_topic_score_codex":0.0052584726,"about_ca_topic_score_gemma":0.0032796378,"teacher_disagreement_score":0.0052584726,"about_ca_system_score_codex":0.002743807,"about_ca_system_score_gemma":0.0015051845,"threshold_uncertainty_score":0.019907832},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08480753,0.0013001767,0.88137794,0.0010255728,0.00014491924,0.00010569555,0.00036391057,0.00038629983,0.030487895],"genre_scores_gemma":[0.8597115,0.0014859234,0.12420276,0.0005228343,0.00027713843,0.0003768171,0.00068410544,0.00013645102,0.012602393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980415,0.00059519627,0.00008459368,0.00029871264,0.00075854926,0.0002213369],"domain_scores_gemma":[0.9955493,0.002041884,0.00058448676,0.0007995012,0.00077694765,0.0002478003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012853427,0.00062200404,0.00060026057,0.0010027254,0.00087183947,0.0021658312,0.0008171947,0.000917171,0.0036705276],"category_scores_gemma":[0.006759515,0.00025173413,0.0004238421,0.0011581358,0.0022595387,0.002716228,0.0027702434,0.0022352468,0.0008137748],"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.00003483841,0.00000838299,0.00011222652,0.000026083779,0.0000053572603,0.000039587892,0.000088087094,0.0118146315,0.0009888656,0.97660077,0.000880758,0.00940047],"study_design_scores_gemma":[0.000035194644,0.00012307602,0.00030732495,0.00004117591,0.000013015501,0.00024194589,0.00007536807,0.15705058,0.0060382998,0.82173014,0.014287897,0.000056043737],"about_ca_topic_score_codex":0.0008979586,"about_ca_topic_score_gemma":0.0005286983,"teacher_disagreement_score":0.0036705276,"about_ca_system_score_codex":0.0013487905,"about_ca_system_score_gemma":0.0011736881,"threshold_uncertainty_score":0.012279093},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014113863,0.003942122,0.04354645,0.005062106,0.012216051,0.00045139578,0.0070026717,0.010360833,0.916007],"genre_scores_gemma":[0.015577711,0.004148482,0.01845088,0.003331889,0.0019653628,0.00044935566,0.01106037,0.0030782656,0.9419377],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982103,0.00026469454,0.00012065379,0.00042513438,0.00079458096,0.00018465339],"domain_scores_gemma":[0.9969964,0.00034701833,0.00012862898,0.0009652521,0.0010510489,0.0005117964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016625117,0.0011261356,0.0010522412,0.0022478066,0.0017568792,0.005482365,0.0026355016,0.0029953853,0.68049014],"category_scores_gemma":[0.006357426,0.00072960305,0.0009456136,0.0018647023,0.0012102587,0.00293431,0.004357954,0.0026605674,0.49720824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017809615,0.00006513806,0.00044019797,0.00060129754,0.000039177565,0.00033068936,0.00010978182,0.00086404453,0.004039994,0.037479978,0.71203184,0.24381983],"study_design_scores_gemma":[0.000016280856,0.000016286183,0.00014770639,0.000054085125,0.0000060605253,0.0001644978,0.000021048792,0.00039994417,0.0006859385,0.0036031366,0.99487466,0.000010514328],"about_ca_topic_score_codex":0.001454186,"about_ca_topic_score_gemma":0.001912115,"teacher_disagreement_score":0.68049014,"about_ca_system_score_codex":0.0015516409,"about_ca_system_score_gemma":0.0022063723,"threshold_uncertainty_score":0},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014397591,0.0027285346,0.9108789,0.006954801,0.0015856415,0.00080055837,0.00034614708,0.018649792,0.043658115],"genre_scores_gemma":[0.33936185,0.0036998442,0.5911811,0.003985885,0.0013548093,0.0011076323,0.0019340675,0.0028699918,0.05450482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976023,0.00040562564,0.00017785435,0.00028723557,0.0010412487,0.00048565603],"domain_scores_gemma":[0.99722254,0.00016459457,0.00013473748,0.00068186916,0.0010060943,0.0007901934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004121797,0.00057890365,0.00074514543,0.0009327187,0.0024579617,0.0051327082,0.0041118055,0.0017311614,0.005778164],"category_scores_gemma":[0.0033109982,0.00061509537,0.0008927895,0.0012890907,0.0014485215,0.00820187,0.0060660546,0.0032853212,0.0036960666],"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.00061532983,0.00045656684,0.0026978478,0.00040301666,0.00012043283,0.00080495863,0.001020425,0.02022149,0.013386385,0.58056855,0.19610685,0.18359809],"study_design_scores_gemma":[0.00019015642,0.00026026138,0.0012314947,0.00018768419,0.00012850636,0.0008970108,0.00032036257,0.29072738,0.008859665,0.1303976,0.5665997,0.00020014998],"about_ca_topic_score_codex":0.005777112,"about_ca_topic_score_gemma":0.005637649,"teacher_disagreement_score":0.005778164,"about_ca_system_score_codex":0.002608085,"about_ca_system_score_gemma":0.0052551706,"threshold_uncertainty_score":0.021798372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25171095,0.0020200019,0.7370841,0.00030451303,0.000042267147,0.000032027743,0.00014575665,0.0003041044,0.008356243],"genre_scores_gemma":[0.9746052,0.00066785916,0.02297834,0.0000691461,0.000029279083,0.000034899334,0.00008871307,0.000032383534,0.0014942312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985759,0.00037790296,0.00006401498,0.00014481659,0.000675405,0.00016181811],"domain_scores_gemma":[0.9946424,0.0035329221,0.0005222931,0.00036221204,0.0008644045,0.000075783784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017841749,0.00082766503,0.0008309971,0.00085885805,0.00044248605,0.00080193835,0.000800193,0.00089313835,0.0009256317],"category_scores_gemma":[0.009082084,0.0003014771,0.000313145,0.0008957347,0.0007847359,0.0015009508,0.0008191047,0.00059561024,0.0002582077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014232978,0.000025977319,0.00096794206,0.00011867117,0.000030405541,0.00014845247,0.00013641693,0.9422546,0.008473778,0.02773747,0.0003433196,0.019620603],"study_design_scores_gemma":[0.000004517994,0.000045767927,0.00044785065,0.00001030442,0.000010892567,0.00010460969,0.000026307389,0.98986393,0.0015280171,0.007711041,0.0002341456,0.000012608226],"about_ca_topic_score_codex":0.0016821336,"about_ca_topic_score_gemma":0.001256603,"teacher_disagreement_score":0.0017841749,"about_ca_system_score_codex":0.0014957037,"about_ca_system_score_gemma":0.00050246,"threshold_uncertainty_score":0.010852158},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06739419,0.0007305346,0.92700446,0.00024376536,0.00010751489,0.00011373069,0.00008491432,0.00019502494,0.004125824],"genre_scores_gemma":[0.9493436,0.00026573375,0.048778176,0.00004657578,0.000059571164,0.00009805948,0.00003375755,0.00002467707,0.0013498819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888736,0.00046019984,0.000035905345,0.00017245929,0.00022885152,0.00021514628],"domain_scores_gemma":[0.99814,0.001132947,0.00017024946,0.00019186859,0.00023854282,0.00012629863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002298956,0.00076436193,0.0008979843,0.00054615544,0.0010070849,0.0011737468,0.0013698693,0.0006766575,0.0014502765],"category_scores_gemma":[0.004975799,0.00031619234,0.00031951233,0.0008049449,0.0011259854,0.0013107898,0.0010132312,0.00054756436,0.00023115159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001904415,0.000049249702,0.00032155906,0.000047630765,0.000030861203,0.00009252549,0.000080309386,0.92892605,0.002132388,0.041867416,0.0012350235,0.0250266],"study_design_scores_gemma":[0.000014821227,0.000023058072,0.000059090336,0.000002357796,0.0000059469307,0.000013110233,0.000014555559,0.9879892,0.0003231737,0.011154086,0.00039552967,0.000005017694],"about_ca_topic_score_codex":0.0059047174,"about_ca_topic_score_gemma":0.0074864635,"teacher_disagreement_score":0.0059047174,"about_ca_system_score_codex":0.0025227906,"about_ca_system_score_gemma":0.0023217725,"threshold_uncertainty_score":0.018304229},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6981523,0.0035900867,0.25463352,0.0005102941,0.00022427623,0.00017179726,0.00022857888,0.00039574842,0.042093337],"genre_scores_gemma":[0.98598063,0.00045905312,0.012411355,0.00003563806,0.000026154474,0.000030264384,0.00007622693,0.000025907022,0.00095461984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855155,0.000595237,0.000062480474,0.000111397305,0.000516825,0.00016245816],"domain_scores_gemma":[0.99588794,0.0024176417,0.00024503967,0.0004394775,0.000922731,0.00008726025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018910274,0.0005998205,0.00059564604,0.001023082,0.00056232227,0.0009023348,0.0011346451,0.0006236168,0.0015613344],"category_scores_gemma":[0.0051842723,0.00012922294,0.00032906045,0.00073458266,0.00043106015,0.0012281529,0.00043774003,0.00026876995,0.00020933009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010907038,0.00016261694,0.002923905,0.00028596123,0.00013786703,0.00048171973,0.00013917086,0.74852866,0.027243294,0.07206528,0.0019479848,0.14499289],"study_design_scores_gemma":[0.00005997651,0.000651946,0.0014732063,0.000025678597,0.00012356185,0.00047440326,0.00015537004,0.9686919,0.00945309,0.016535327,0.0023113901,0.00004416271],"about_ca_topic_score_codex":0.0015141274,"about_ca_topic_score_gemma":0.0024764815,"teacher_disagreement_score":0.0018910274,"about_ca_system_score_codex":0.0011732683,"about_ca_system_score_gemma":0.00058730197,"threshold_uncertainty_score":0.010000825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05100636,0.006545853,0.9103506,0.0018097194,0.00023038797,0.00013929006,0.0002723336,0.00093653833,0.028708842],"genre_scores_gemma":[0.9284487,0.007807044,0.05180557,0.00062550674,0.0007088116,0.0007674749,0.00023793297,0.00037299402,0.009226049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998395,0.00051423284,0.00006391854,0.00018790553,0.0005089701,0.0003299676],"domain_scores_gemma":[0.98359656,0.012469074,0.0013636928,0.0009027546,0.0013835294,0.00028448686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029964023,0.0013160645,0.001299711,0.0016403478,0.001020284,0.0022400697,0.0014431869,0.001304677,0.0039384835],"category_scores_gemma":[0.023282874,0.0007034078,0.0006925453,0.0015650108,0.0025070678,0.0035789078,0.0012431708,0.0022589657,0.0010183206],"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.00007846013,0.000056857167,0.00089546834,0.0003036409,0.00005298448,0.0004001888,0.00056951813,0.4224775,0.0038146935,0.5474946,0.005582375,0.01827368],"study_design_scores_gemma":[0.000012554788,0.000030513911,0.00046133235,0.000053629632,0.00001761342,0.00014516227,0.00006023529,0.8558256,0.00049468304,0.14085029,0.0020237402,0.000024772904],"about_ca_topic_score_codex":0.0026846346,"about_ca_topic_score_gemma":0.0010617296,"teacher_disagreement_score":0.0039384835,"about_ca_system_score_codex":0.0025584435,"about_ca_system_score_gemma":0.0009807363,"threshold_uncertainty_score":0.018562853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098347016,0.00080039795,0.8950234,0.00039493365,0.00003211803,0.000065542525,0.000045915298,0.000053636264,0.005237083],"genre_scores_gemma":[0.9538667,0.00085649843,0.04293918,0.00009027264,0.000040153056,0.00013334295,0.000038791914,0.000014912574,0.0020201597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899143,0.00046975835,0.000033526023,0.00015442459,0.0002051334,0.00014561154],"domain_scores_gemma":[0.9963457,0.0027359722,0.0003805777,0.00017289213,0.00026665573,0.0000982165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016089496,0.0011248812,0.0010071449,0.0005663413,0.0006054063,0.0013626256,0.0012420033,0.0013565678,0.001077829],"category_scores_gemma":[0.0039586583,0.0003696291,0.00061206525,0.00081137294,0.0019958452,0.0016800074,0.0014002243,0.00077224156,0.00017789994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016838833,0.00005711536,0.00041374075,0.00024245051,0.000073011535,0.00053088646,0.00033696313,0.8171995,0.009032677,0.15629017,0.000699249,0.014955752],"study_design_scores_gemma":[0.000024051475,0.00008257888,0.0000723926,0.000011047973,0.000022750553,0.000118534284,0.000063424144,0.9694318,0.0012803212,0.028497657,0.00038158425,0.000013839658],"about_ca_topic_score_codex":0.0016256758,"about_ca_topic_score_gemma":0.00105875,"teacher_disagreement_score":0.0016256758,"about_ca_system_score_codex":0.0010934033,"about_ca_system_score_gemma":0.00082239887,"threshold_uncertainty_score":0.00850904},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40023825,0.0055486574,0.4622405,0.0032394691,0.00033812362,0.00020595375,0.00083002564,0.00031828057,0.12704073],"genre_scores_gemma":[0.989374,0.0013515704,0.007032632,0.00014197071,0.000092331364,0.00006263058,0.00007102513,0.000078050565,0.0017957796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707246,0.0015124606,0.000059798924,0.00015427207,0.0006715767,0.0005294863],"domain_scores_gemma":[0.952886,0.04236646,0.0016428998,0.00076935464,0.0019745494,0.00036067714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027055524,0.000920493,0.00079780875,0.0006273127,0.00088258914,0.002467624,0.00089039723,0.0011392469,0.0044241296],"category_scores_gemma":[0.028128743,0.0004113047,0.00034724516,0.0010489923,0.0014834307,0.0030152402,0.0010805911,0.0011946372,0.0003822719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000158509,0.000046517816,0.0013418356,0.00014819934,0.000039226878,0.00065277517,0.00009118819,0.9156012,0.0034011567,0.061807532,0.0011684527,0.015543403],"study_design_scores_gemma":[0.00003817715,0.00019679531,0.0019824055,0.00012836845,0.000075057105,0.0004817452,0.0002710215,0.9395132,0.0046967748,0.04927855,0.0032761234,0.000061684965],"about_ca_topic_score_codex":0.0034046345,"about_ca_topic_score_gemma":0.0030518887,"teacher_disagreement_score":0.0044241296,"about_ca_system_score_codex":0.0014205776,"about_ca_system_score_gemma":0.0009981057,"threshold_uncertainty_score":0.014800191},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13979548,0.0031342863,0.8380534,0.00061479775,0.00006945413,0.00005374436,0.00026426744,0.00015674435,0.017857818],"genre_scores_gemma":[0.9743388,0.0014173076,0.021616597,0.00010978001,0.00009295476,0.000072763476,0.00010415016,0.000035415378,0.002212233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889284,0.00038571606,0.000034541423,0.000103609986,0.0003771876,0.00020608175],"domain_scores_gemma":[0.993555,0.004774144,0.0004979931,0.0002688668,0.00075427466,0.0001496649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018342598,0.0008291739,0.00081540365,0.0011011264,0.00066950964,0.0012553193,0.00089597417,0.0006056605,0.0016068147],"category_scores_gemma":[0.006841027,0.00040978653,0.0004596756,0.0010931357,0.0011150892,0.0019837618,0.0010006421,0.00084054447,0.00028934647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010381907,0.000024660954,0.0010637167,0.00009131235,0.000047405938,0.00018667144,0.00012221588,0.866891,0.004088858,0.11824178,0.00063514244,0.008503434],"study_design_scores_gemma":[0.0000063143702,0.00003453006,0.00028795682,0.000010350052,0.000007904888,0.00008354128,0.00002671105,0.96147835,0.0008401239,0.03674159,0.0004711655,0.000011578228],"about_ca_topic_score_codex":0.0014749891,"about_ca_topic_score_gemma":0.0008986485,"teacher_disagreement_score":0.0019102987,"about_ca_system_score_codex":0.0019102987,"about_ca_system_score_gemma":0.0008078334,"threshold_uncertainty_score":0.013860226},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010359242,0.000738362,0.9830662,0.00042658337,0.000064609034,0.000048893147,0.00003588881,0.00004944906,0.0052108197],"genre_scores_gemma":[0.58551687,0.0026830812,0.40363994,0.00049926824,0.00047095472,0.00062648096,0.00019066964,0.00014805996,0.0062246206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955864,0.0024068246,0.00016131658,0.00036582822,0.0011184772,0.00036117886],"domain_scores_gemma":[0.9834663,0.013347201,0.00085809105,0.0010502908,0.0010908067,0.00018736202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054024425,0.00096152106,0.0008415315,0.001047015,0.0007553509,0.0014279092,0.0010878791,0.0013148793,0.0018793769],"category_scores_gemma":[0.021735515,0.0005686268,0.0005400875,0.0018379198,0.0030824787,0.0027887246,0.0021238895,0.0017432094,0.0003418861],"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.00009683741,0.0000381498,0.00043738147,0.00013427692,0.00002718068,0.00008824785,0.00021621362,0.33367148,0.0016152501,0.6261543,0.0015609312,0.035959758],"study_design_scores_gemma":[0.00003184744,0.000074078875,0.00009545266,0.000046372716,0.000011452739,0.0000736555,0.000048783237,0.6989237,0.0015394682,0.29565358,0.0034820414,0.00001955962],"about_ca_topic_score_codex":0.0022679511,"about_ca_topic_score_gemma":0.0017625777,"teacher_disagreement_score":0.0054024425,"about_ca_system_score_codex":0.0019789736,"about_ca_system_score_gemma":0.0023368406,"threshold_uncertainty_score":0.028571188},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25579044,0.004316437,0.6947989,0.00077497057,0.00006593711,0.000087773275,0.00020102675,0.00065133907,0.043313194],"genre_scores_gemma":[0.97188157,0.0010011393,0.024941485,0.00010426904,0.00006826904,0.000049064976,0.00010163436,0.00004651137,0.0018061363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99612904,0.001548602,0.000114916664,0.000230292,0.0015352104,0.00044194036],"domain_scores_gemma":[0.9866436,0.009874685,0.00087258464,0.0008075455,0.0016520151,0.00014950376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004399499,0.0014171313,0.0009547649,0.0012033988,0.0005275853,0.0013111208,0.0008278787,0.0011280559,0.0019196777],"category_scores_gemma":[0.012766493,0.00046683403,0.0005469931,0.001690986,0.001673432,0.0015900264,0.0013740982,0.0006692615,0.00065050245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071953394,0.0000989773,0.0037139063,0.0002391689,0.00015729883,0.00037172937,0.00035989255,0.85556906,0.020441156,0.0624977,0.0009783203,0.054853365],"study_design_scores_gemma":[0.000020722606,0.00024718794,0.0014254289,0.000034587894,0.00006123012,0.00033539196,0.000053747477,0.97540444,0.008426127,0.013179196,0.0007703462,0.00004156992],"about_ca_topic_score_codex":0.0012142406,"about_ca_topic_score_gemma":0.0010162828,"teacher_disagreement_score":0.004399499,"about_ca_system_score_codex":0.0015808247,"about_ca_system_score_gemma":0.00084966735,"threshold_uncertainty_score":0.02326703},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1353487,0.0016317392,0.8439888,0.0004074748,0.000029250725,0.000048347498,0.000068455265,0.00021202174,0.018265234],"genre_scores_gemma":[0.9822709,0.0005355883,0.015340211,0.000034947803,0.000027360456,0.000043551263,0.00002826402,0.000018914478,0.0017002808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903905,0.00043028017,0.00002724833,0.00008804455,0.00029654425,0.00011877804],"domain_scores_gemma":[0.99795026,0.0013742198,0.00018013004,0.00011894996,0.00034805216,0.000028394958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014561116,0.000748428,0.00045738177,0.00048248144,0.00039920147,0.0009264863,0.000447939,0.0006165765,0.0015626417],"category_scores_gemma":[0.005535041,0.00025301112,0.00022162867,0.00074165536,0.00073065865,0.0007486013,0.00067092123,0.00041829154,0.00040294416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014065132,0.00003138864,0.0012418209,0.000091855676,0.000026544856,0.000115217554,0.00016723799,0.9081585,0.011663886,0.043272123,0.0005845898,0.034506295],"study_design_scores_gemma":[0.0000070593846,0.00007842945,0.00039584553,0.000009555675,0.0000081288135,0.00008459366,0.000029400642,0.99152184,0.001826177,0.005619844,0.0004116474,0.0000075119888],"about_ca_topic_score_codex":0.0014880302,"about_ca_topic_score_gemma":0.0011059669,"teacher_disagreement_score":0.0015626417,"about_ca_system_score_codex":0.0010349745,"about_ca_system_score_gemma":0.00054495735,"threshold_uncertainty_score":0.0077007413},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056620784,0.00019810279,0.91831374,0.00018470547,0.000076937606,0.00011918136,0.00013808164,0.008064414,0.016284088],"genre_scores_gemma":[0.39675418,0.00015477264,0.592838,0.00008633755,0.000036297697,0.00022561442,0.00041106273,0.00034644472,0.00914725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968004,0.000049190643,0.000015903175,0.000038739345,0.00015879812,0.000057359503],"domain_scores_gemma":[0.9993818,0.00016076703,0.00003742734,0.0001690757,0.00022424453,0.000026769421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036982913,0.00056288077,0.00027987294,0.0005034829,0.0002727895,0.00060663285,0.0010887639,0.00026273358,0.004749296],"category_scores_gemma":[0.0012164981,0.0001645111,0.0002976101,0.0006647336,0.00040682472,0.0007415267,0.0006729275,0.0006135684,0.0011491933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006342803,0.00021488358,0.0014757714,0.00025356782,0.000050585655,0.00033292198,0.00035436827,0.40190655,0.08083324,0.065155044,0.011707174,0.4370816],"study_design_scores_gemma":[0.000058015197,0.000075250646,0.00017669381,0.000011318399,0.00000980652,0.00007788178,0.000022197026,0.9582549,0.02632016,0.0075905607,0.0073914835,0.000011793508],"about_ca_topic_score_codex":0.005331166,"about_ca_topic_score_gemma":0.006210273,"teacher_disagreement_score":0.005331166,"about_ca_system_score_codex":0.0006774602,"about_ca_system_score_gemma":0.0013225166,"threshold_uncertainty_score":0.015887976},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006060433,0.00034845824,0.9905372,0.000101250305,0.00007084215,0.000043292966,0.00009888428,0.00016582393,0.0025738804],"genre_scores_gemma":[0.4802098,0.0013626819,0.50696266,0.00039017445,0.00023831367,0.00036313932,0.00074063573,0.00010718834,0.009625431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871325,0.00030738302,0.00006477897,0.00021135053,0.00056798285,0.00013528524],"domain_scores_gemma":[0.99765104,0.0008032815,0.0002641265,0.000560444,0.0006563164,0.00006473427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008070863,0.0006154634,0.00063487166,0.000572808,0.00036351502,0.0008955896,0.0012016508,0.00066805264,0.0016752341],"category_scores_gemma":[0.003152464,0.00020100224,0.0004609746,0.00097422895,0.00077405956,0.0012015558,0.00065008353,0.0010526818,0.00078593625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004350799,0.00008157343,0.0008990187,0.00027356375,0.00007561395,0.0002842426,0.00016022226,0.43347386,0.039045446,0.28222144,0.0044831457,0.23856682],"study_design_scores_gemma":[0.000046451398,0.00014326033,0.00016462106,0.000030046012,0.000018201386,0.00034947295,0.000021358994,0.94312423,0.015767891,0.027209504,0.013090735,0.000034293735],"about_ca_topic_score_codex":0.0020144265,"about_ca_topic_score_gemma":0.0024666358,"teacher_disagreement_score":0.0020144265,"about_ca_system_score_codex":0.0010636122,"about_ca_system_score_gemma":0.0013845052,"threshold_uncertainty_score":0.0077171326},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1881689,0.00067741994,0.8075967,0.00018653137,0.000027045317,0.00005161076,0.00003197317,0.0002684797,0.002991345],"genre_scores_gemma":[0.9647066,0.00031137303,0.034371566,0.000027525402,0.000009954106,0.000032439653,0.000012205357,0.000014334186,0.00051393994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865794,0.000579624,0.000048395945,0.000080908634,0.00045096152,0.00018212815],"domain_scores_gemma":[0.9944195,0.004178168,0.0005021199,0.0003298991,0.00050855277,0.000061679806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023241132,0.00092391274,0.00066463195,0.000606425,0.00035254582,0.00069231336,0.00063736254,0.0007330749,0.00046995835],"category_scores_gemma":[0.007838625,0.00026362084,0.00027426163,0.0007411887,0.0014572268,0.0011639849,0.0012293726,0.00054475426,0.00013903633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023876234,0.000038370847,0.00080436456,0.00010642297,0.00003494598,0.00021613149,0.00020838632,0.941311,0.016499791,0.017703466,0.00022768916,0.022610648],"study_design_scores_gemma":[0.000016365311,0.00007737393,0.00015382183,0.0000121246785,0.000015192982,0.000078840196,0.000021257587,0.9881396,0.0063294927,0.0049518747,0.00018768426,0.00001633182],"about_ca_topic_score_codex":0.002012876,"about_ca_topic_score_gemma":0.0017431936,"teacher_disagreement_score":0.0023241132,"about_ca_system_score_codex":0.0006385774,"about_ca_system_score_gemma":0.00061380875,"threshold_uncertainty_score":0.012291253},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031022066,0.00037811336,0.96110225,0.00057150965,0.00007720021,0.00012609253,0.000088193156,0.00021473829,0.006419855],"genre_scores_gemma":[0.8757119,0.00041822478,0.11909458,0.00027300083,0.00008613707,0.00022123742,0.00011881985,0.000030593554,0.004045539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967199,0.001381174,0.00013205725,0.00034526075,0.000963655,0.00045809417],"domain_scores_gemma":[0.9945229,0.003106082,0.00052400393,0.0010587124,0.00065312115,0.00013509148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020496557,0.0006791011,0.0009352312,0.00093342725,0.0010431206,0.0011987169,0.0017980156,0.0012980143,0.0012924518],"category_scores_gemma":[0.006155763,0.00027911458,0.0006282188,0.001667745,0.0021172715,0.00274226,0.0028134729,0.0015186772,0.00033827923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064670393,0.000124559,0.0006861423,0.00020247001,0.00007969169,0.00085051614,0.00066889916,0.36445707,0.029718196,0.5191561,0.003941358,0.07946822],"study_design_scores_gemma":[0.000056520457,0.000101324054,0.00014589439,0.000031102427,0.000028228376,0.00038361657,0.000046351674,0.90535563,0.0068728053,0.08406302,0.0028663888,0.000049207832],"about_ca_topic_score_codex":0.0014017799,"about_ca_topic_score_gemma":0.00092074514,"teacher_disagreement_score":0.0020496557,"about_ca_system_score_codex":0.0015527183,"about_ca_system_score_gemma":0.0015905799,"threshold_uncertainty_score":0.011265814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038639557,0.0013171958,0.9511836,0.0004978358,0.00004625276,0.000040642502,0.00011570708,0.00015120307,0.008008083],"genre_scores_gemma":[0.8844783,0.0014512315,0.10625919,0.00014980134,0.00007957802,0.00016405988,0.00016202393,0.00010661824,0.0071491003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920756,0.00045783512,0.000023582721,0.00011326779,0.00012270643,0.00007508352],"domain_scores_gemma":[0.99830997,0.0012953713,0.00012791807,0.000069203015,0.00015774771,0.000039769064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013020557,0.0011596765,0.0011435346,0.00042461173,0.00029680677,0.0011715904,0.0007750261,0.0010610891,0.0020263367],"category_scores_gemma":[0.0034501464,0.00058380264,0.00037783812,0.00083354674,0.000761766,0.0014222425,0.0009387629,0.00086826313,0.00040581299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043398097,0.00001305769,0.00011734877,0.0000494877,0.000017963763,0.000059003232,0.000025156782,0.9810947,0.00085802993,0.009874221,0.0003918028,0.0074558062],"study_design_scores_gemma":[0.0000093994495,0.000019535286,0.000043789627,0.0000045237234,0.0000046528785,0.00001317023,0.000012520289,0.9940177,0.00044527472,0.0051539405,0.00027166752,0.0000037470813],"about_ca_topic_score_codex":0.001463257,"about_ca_topic_score_gemma":0.001287395,"teacher_disagreement_score":0.0020263367,"about_ca_system_score_codex":0.00096786895,"about_ca_system_score_gemma":0.00058523164,"threshold_uncertainty_score":0.0070224404},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09683239,0.0018373281,0.8962458,0.0002912611,0.000061487895,0.00006493091,0.00003003298,0.0004279122,0.0042088954],"genre_scores_gemma":[0.92968845,0.0019335767,0.06595741,0.00011077995,0.0000789534,0.00014866708,0.000056869416,0.000085822845,0.0019394651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802184,0.00067982136,0.0000627846,0.0001454297,0.00077352906,0.0003164929],"domain_scores_gemma":[0.98808366,0.0087364875,0.0010368124,0.0007381376,0.001104218,0.00030068142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024074225,0.00083225314,0.00081087317,0.000630175,0.0010445591,0.0007415999,0.0011091685,0.00058556814,0.00088358705],"category_scores_gemma":[0.010083773,0.00044242444,0.000309587,0.0009157896,0.0014034483,0.0016398982,0.0011735539,0.0009208127,0.0003693438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003866878,0.00023381977,0.0029168427,0.0002740524,0.00009001043,0.00026924044,0.00063307513,0.82595783,0.023590066,0.06352215,0.0014136003,0.08071262],"study_design_scores_gemma":[0.000039401544,0.00023190063,0.00040689931,0.000020976035,0.00005179947,0.00018398796,0.00007294565,0.96704423,0.005792376,0.024024565,0.002109887,0.000020948686],"about_ca_topic_score_codex":0.003141014,"about_ca_topic_score_gemma":0.0024871188,"teacher_disagreement_score":0.003141014,"about_ca_system_score_codex":0.0009789924,"about_ca_system_score_gemma":0.0016493088,"threshold_uncertainty_score":0.012731791},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04678491,0.0004225833,0.95183873,0.000103796534,0.000015260019,0.000016039377,0.000029769755,0.00012353291,0.00066540577],"genre_scores_gemma":[0.8757008,0.0005956394,0.1220101,0.000037294125,0.000045998768,0.00004508675,0.000060154405,0.000016109156,0.0014887833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950814,0.00018138078,0.000018437728,0.000078993726,0.00016655964,0.0000464966],"domain_scores_gemma":[0.9984806,0.0011335374,0.0001463051,0.00009081667,0.00012626767,0.000022484017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008741474,0.0005194338,0.000606158,0.0002979667,0.00029064703,0.0004991873,0.000624403,0.0007649132,0.00047675666],"category_scores_gemma":[0.0030383002,0.0004548177,0.00035114808,0.00040686893,0.00061305484,0.001069376,0.0005561806,0.0006400537,0.00017494973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012994613,0.000024476534,0.0005595878,0.0000695641,0.000030395811,0.00018306178,0.00012355526,0.9402694,0.00654319,0.009127915,0.0004035612,0.042535286],"study_design_scores_gemma":[0.0000054157663,0.000021077494,0.00010847121,0.0000025197087,0.00000512104,0.000030864743,0.0000065135937,0.99665606,0.0014996075,0.0015256268,0.00013281693,0.0000059165654],"about_ca_topic_score_codex":0.003251808,"about_ca_topic_score_gemma":0.0025676016,"teacher_disagreement_score":0.003251808,"about_ca_system_score_codex":0.00041974013,"about_ca_system_score_gemma":0.00052507385,"threshold_uncertainty_score":0.0064657927},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034570828,0.00027728683,0.9597768,0.00013314075,0.00007250096,0.00009956484,0.000030100273,0.00032895667,0.0047107367],"genre_scores_gemma":[0.94811773,0.000111318215,0.049457524,0.000067544446,0.000030572162,0.00012479955,0.000040510884,0.000016770065,0.0020333382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905473,0.00028295492,0.000036116508,0.0002212242,0.0002560779,0.00014890653],"domain_scores_gemma":[0.999218,0.0002309982,0.00011292771,0.000120238095,0.00023094707,0.000086831926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009125668,0.0005180597,0.00058056106,0.0006221721,0.0008475747,0.00066479534,0.0018131005,0.00057168934,0.0010027139],"category_scores_gemma":[0.0015904625,0.00021502895,0.0003138659,0.00080572575,0.00060699455,0.0006256197,0.001208823,0.0005156332,0.00020405016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043762312,0.00014081392,0.0008993207,0.00009549006,0.00011859192,0.00023425285,0.0002986376,0.7927458,0.017835235,0.067329295,0.005503974,0.11436097],"study_design_scores_gemma":[0.00003140138,0.00006627398,0.0001626832,0.0000035005044,0.000015232726,0.000060003647,0.000017292294,0.990715,0.0016539849,0.0058051143,0.0014545368,0.0000150437345],"about_ca_topic_score_codex":0.004150948,"about_ca_topic_score_gemma":0.0028629561,"teacher_disagreement_score":0.004150948,"about_ca_system_score_codex":0.0010017777,"about_ca_system_score_gemma":0.0010637064,"threshold_uncertainty_score":0.008253574},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01646227,0.00089361035,0.9664533,0.0011680124,0.00007680739,0.00012580797,0.00013709685,0.00011983097,0.014563193],"genre_scores_gemma":[0.8104938,0.0027423368,0.16970076,0.0003314437,0.00033495048,0.00044405521,0.00019869077,0.0000999545,0.015653938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694854,0.0014886104,0.000095243675,0.0005523329,0.0003916817,0.00052356854],"domain_scores_gemma":[0.99776006,0.0013951455,0.0002560328,0.000103299506,0.0002495869,0.00023586398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029587988,0.0020424528,0.0018708557,0.0012511088,0.0015699742,0.0032878204,0.0036313273,0.0029771393,0.006479355],"category_scores_gemma":[0.0051786564,0.0013445939,0.001636709,0.0017901942,0.003067793,0.005450197,0.0024368553,0.002724963,0.0010048427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055439872,0.0000869151,0.0003895502,0.00015874908,0.00004680551,0.00040196607,0.0003225699,0.41146338,0.0017049183,0.57477194,0.0024291899,0.0081685865],"study_design_scores_gemma":[0.000022922713,0.000047204667,0.00013237588,0.000017796981,0.000026462782,0.00006703847,0.00007728607,0.8885552,0.0001770608,0.10952975,0.0013212666,0.000025594263],"about_ca_topic_score_codex":0.011089974,"about_ca_topic_score_gemma":0.010725045,"teacher_disagreement_score":0.011089974,"about_ca_system_score_codex":0.0049193418,"about_ca_system_score_gemma":0.0031796906,"threshold_uncertainty_score":0.035692453},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044617593,0.0005779205,0.95220274,0.00018680986,0.00004219438,0.00005056251,0.000041443745,0.0000973013,0.0021834194],"genre_scores_gemma":[0.8415587,0.0004932924,0.15575227,0.000091404174,0.00007155795,0.00012793817,0.000064601,0.000046227204,0.0017941165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929464,0.00031354558,0.0000253417,0.00012576801,0.0001383757,0.0001021746],"domain_scores_gemma":[0.99896,0.0006807797,0.00013408148,0.00008600902,0.00009293905,0.00004617291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000953639,0.00065924786,0.0009800466,0.00026622927,0.00063399225,0.0011485475,0.00089879404,0.00079317676,0.00090041914],"category_scores_gemma":[0.0020648264,0.00042657167,0.00036898357,0.0006471827,0.0007225643,0.0011807105,0.00076324615,0.000703123,0.00032599262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007885037,0.00007114901,0.00025816885,0.000050166007,0.00002451644,0.000115064635,0.000075001415,0.9607074,0.0037977959,0.008089318,0.0005336878,0.026198884],"study_design_scores_gemma":[0.000009253947,0.000019481762,0.000054928227,0.0000017667261,0.0000044419767,0.000019213758,0.000015581456,0.9962186,0.0006902838,0.0027461573,0.00021613893,0.000003996123],"about_ca_topic_score_codex":0.0031772025,"about_ca_topic_score_gemma":0.004660285,"teacher_disagreement_score":0.0031772025,"about_ca_system_score_codex":0.0009062531,"about_ca_system_score_gemma":0.0011977906,"threshold_uncertainty_score":0.0065754056},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040022846,0.00014234477,0.955964,0.00014377772,0.000013678141,0.000042729505,0.00003401385,0.000071171875,0.0035655529],"genre_scores_gemma":[0.8510228,0.00025457947,0.14573006,0.000057817706,0.00002612219,0.00020171473,0.00003861648,0.000042650972,0.002625684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988105,0.0006355716,0.000040562012,0.00012102837,0.0002357179,0.00015654096],"domain_scores_gemma":[0.99836534,0.0012235335,0.00013745614,0.00009275891,0.00013755263,0.000043322256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020202047,0.0008860636,0.0008563016,0.00037791271,0.00039990444,0.0010552618,0.00082058244,0.0007521327,0.0015839692],"category_scores_gemma":[0.00515266,0.00052470836,0.00043208082,0.00063025125,0.0011295091,0.0013600898,0.0015285201,0.0007796038,0.0003674769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016967706,0.00006863954,0.00029796042,0.00006843326,0.000030727373,0.00017116353,0.00016909844,0.90463305,0.0050489414,0.057497878,0.0006555508,0.031188807],"study_design_scores_gemma":[0.000016589478,0.0000368152,0.000059209713,0.000004910107,0.0000068980485,0.000033873115,0.00002524954,0.97844213,0.0015528806,0.019560663,0.0002532948,0.0000074881327],"about_ca_topic_score_codex":0.00096973346,"about_ca_topic_score_gemma":0.0009739673,"teacher_disagreement_score":0.0020202047,"about_ca_system_score_codex":0.00079180533,"about_ca_system_score_gemma":0.0010126912,"threshold_uncertainty_score":0.010684013},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16173108,0.0033922188,0.7576637,0.0044613695,0.00018597799,0.00009866739,0.00016438159,0.00038947933,0.07191317],"genre_scores_gemma":[0.9589443,0.001138789,0.033775568,0.00022183495,0.0001569241,0.00015929456,0.00008716161,0.000043414642,0.0054725613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966633,0.00012339474,0.0000132229725,0.000050091792,0.00009601353,0.000050904408],"domain_scores_gemma":[0.99938786,0.00029281952,0.000075682015,0.00009736224,0.00007393837,0.00007230132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046698318,0.00017352612,0.00033892918,0.00042689056,0.00060521415,0.0009724091,0.00061607227,0.0005993342,0.0011202823],"category_scores_gemma":[0.0017308654,0.00020276857,0.00024335046,0.00024051007,0.0016379771,0.0013102575,0.0009288882,0.0007465546,0.00019538442],"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.000013035642,0.0000110938345,0.00028267206,0.000048527512,0.00001381514,0.00007571932,0.00013745691,0.069672205,0.0014561752,0.91995484,0.0013730502,0.006961475],"study_design_scores_gemma":[0.000007608886,0.000011953039,0.00016744867,0.000008317512,0.000003225162,0.000046993166,0.000031914828,0.13579606,0.00019745504,0.8604885,0.0032334407,0.0000070428227],"about_ca_topic_score_codex":0.0007202712,"about_ca_topic_score_gemma":0.0008715297,"teacher_disagreement_score":0.0011202823,"about_ca_system_score_codex":0.0007515398,"about_ca_system_score_gemma":0.00041763714,"threshold_uncertainty_score":0.0054528117},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051922746,0.00037989978,0.94520825,0.00013224957,0.000023448321,0.000037822476,0.000007615519,0.000057866146,0.0022300712],"genre_scores_gemma":[0.9007932,0.00021293311,0.09746432,0.000054827626,0.000020319312,0.000082081824,0.00001741218,0.0000121961175,0.0013427552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996877,0.00015149676,0.000010310683,0.000029795996,0.00008820335,0.000032510052],"domain_scores_gemma":[0.9996213,0.0002305288,0.000039293165,0.000039782586,0.0000493268,0.000019740874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010235645,0.000251993,0.0002449317,0.00026187178,0.00036230413,0.0002943944,0.0006978459,0.0003140961,0.0005248009],"category_scores_gemma":[0.0016051816,0.000121511875,0.00019027629,0.00037906246,0.0005754132,0.00046914147,0.00064358534,0.00031729002,0.00010834484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013737241,0.00007122302,0.00062816014,0.00007058342,0.000031375403,0.00013392119,0.00018856453,0.8011274,0.019278396,0.094887584,0.0008598706,0.08258556],"study_design_scores_gemma":[0.000009265619,0.000030628038,0.00007417286,0.0000027599326,0.0000046383598,0.000021201224,0.000011862349,0.9864223,0.001055495,0.011752366,0.00061113265,0.0000041899616],"about_ca_topic_score_codex":0.00090153614,"about_ca_topic_score_gemma":0.0014075267,"teacher_disagreement_score":0.0010235645,"about_ca_system_score_codex":0.0006642067,"about_ca_system_score_gemma":0.00059605547,"threshold_uncertainty_score":0.0054131746},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052230824,0.00020886102,0.94586426,0.00018896679,0.000020184178,0.000045972345,0.000057732123,0.00011205184,0.0012711349],"genre_scores_gemma":[0.81006205,0.00027233886,0.18549693,0.00008121024,0.000041523963,0.0001777349,0.00013806792,0.00009435964,0.0036357464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992902,0.00025476888,0.00002438239,0.00012880498,0.00019607847,0.00010571107],"domain_scores_gemma":[0.99776626,0.0015050998,0.00025719835,0.00012711299,0.00024331038,0.00010096641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017638518,0.0008302207,0.0007858816,0.00040486822,0.00037731658,0.0007170157,0.0011702413,0.0008105696,0.0010659244],"category_scores_gemma":[0.0044261883,0.00032019996,0.00029528321,0.0005178331,0.001152924,0.0012957606,0.0009799774,0.000968326,0.00014306957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099155106,0.000027849783,0.00012375078,0.00006450528,0.000012888538,0.000031228104,0.00006434044,0.9655239,0.0027973242,0.019411223,0.00040865343,0.011435072],"study_design_scores_gemma":[0.000019633719,0.000046414127,0.000050506605,0.0000052041196,0.0000034576046,0.000012493693,0.000013354958,0.9905828,0.0013473837,0.007717322,0.00019405619,0.000007265821],"about_ca_topic_score_codex":0.004051189,"about_ca_topic_score_gemma":0.0031559048,"teacher_disagreement_score":0.004051189,"about_ca_system_score_codex":0.0019862566,"about_ca_system_score_gemma":0.0029493088,"threshold_uncertainty_score":0.01441133},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020550305,0.0002897466,0.9758765,0.00013772248,0.000014240813,0.000024082317,0.000017720982,0.0000862018,0.0030034306],"genre_scores_gemma":[0.9191425,0.0006351867,0.077653766,0.00006464877,0.000035110334,0.00013333085,0.00003055085,0.000038047117,0.0022668827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950445,0.00025953568,0.000012008283,0.00005750085,0.00010395529,0.000062531515],"domain_scores_gemma":[0.9994635,0.00036230285,0.00007447709,0.000027376702,0.00005560316,0.000016675698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006945216,0.00063515065,0.00047728664,0.00030268295,0.00031934056,0.0005535766,0.0008154837,0.00057428237,0.0010935299],"category_scores_gemma":[0.0019215168,0.00028777693,0.00025000982,0.0005994022,0.0007115507,0.0007363559,0.00073546,0.0004994927,0.00022382275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000589912,0.00003218747,0.00027085558,0.00006126502,0.00001943458,0.00014400185,0.00009660261,0.90861136,0.0037066122,0.0432597,0.0008118185,0.042927194],"study_design_scores_gemma":[0.0000058794003,0.000024666786,0.000048641992,0.0000026942716,0.0000037810862,0.000029105267,0.000015852973,0.98395133,0.0003960229,0.0150527805,0.00046523174,0.0000039759634],"about_ca_topic_score_codex":0.0011271772,"about_ca_topic_score_gemma":0.0010066556,"teacher_disagreement_score":0.0011271772,"about_ca_system_score_codex":0.000530662,"about_ca_system_score_gemma":0.00043151836,"threshold_uncertainty_score":0.0038502216},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033656057,0.0025310693,0.9323211,0.00041551536,0.00011580888,0.000039075716,0.00005914132,0.00017911309,0.03068317],"genre_scores_gemma":[0.92863715,0.0029621313,0.057171144,0.00010402621,0.00014298053,0.000047348243,0.000043995664,0.000040146777,0.010850997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959284,0.00012849168,0.000013061617,0.00007140477,0.00014272083,0.000051370283],"domain_scores_gemma":[0.9990977,0.0004728744,0.00010371211,0.00018745642,0.0001206563,0.000017655007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003813375,0.0006313893,0.00042612295,0.0003142761,0.0003212077,0.0010018918,0.00077924685,0.0009989705,0.0024445807],"category_scores_gemma":[0.0019435274,0.00023873101,0.00046622707,0.00055854087,0.00096268434,0.0013151604,0.00043103943,0.0006481644,0.0007797832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010883038,0.000035568675,0.0012579099,0.00026960578,0.00007189128,0.0008962202,0.0002549044,0.41866913,0.046320707,0.46343258,0.001618989,0.06706362],"study_design_scores_gemma":[0.000025372901,0.00041466326,0.0016693345,0.00005032058,0.00010640672,0.003026709,0.00014175614,0.77549404,0.027762773,0.16884565,0.022384675,0.00007835165],"about_ca_topic_score_codex":0.0007913935,"about_ca_topic_score_gemma":0.0006528787,"teacher_disagreement_score":0.0024445807,"about_ca_system_score_codex":0.0005782576,"about_ca_system_score_gemma":0.00029211325,"threshold_uncertainty_score":0.008177996},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030728586,0.0005923413,0.9644207,0.00021362411,0.000020534246,0.000022249274,0.000029449484,0.00008122714,0.0038913828],"genre_scores_gemma":[0.8571229,0.00069795817,0.13907956,0.00008768465,0.0000492655,0.00010056796,0.00004144328,0.000027101,0.0027935065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946254,0.00025724006,0.000019861041,0.000040333583,0.00017804484,0.000042004016],"domain_scores_gemma":[0.99940515,0.00037330278,0.00008965728,0.000041114105,0.0000759707,0.000014730346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072090945,0.00059716805,0.000508127,0.00024311947,0.00026384662,0.0006310167,0.0003246543,0.0006595442,0.0011492026],"category_scores_gemma":[0.00207994,0.00030219654,0.00015683932,0.00054803665,0.0005586604,0.0006943167,0.00054081925,0.0003705634,0.00027791012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014190917,0.00003632294,0.0005324495,0.00014292971,0.000022114376,0.00010588251,0.00009223327,0.8645416,0.016902305,0.060398668,0.0007303148,0.056353413],"study_design_scores_gemma":[0.000009860083,0.000034643013,0.00016327854,0.000006297227,0.0000034087625,0.000034227196,0.0000132984305,0.9869423,0.0026929043,0.009717846,0.00037296818,0.000009052384],"about_ca_topic_score_codex":0.00057650876,"about_ca_topic_score_gemma":0.00070808793,"teacher_disagreement_score":0.0011492026,"about_ca_system_score_codex":0.0005397854,"about_ca_system_score_gemma":0.0004940689,"threshold_uncertainty_score":0.003916383},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26736113,0.00093915564,0.7223038,0.0004276466,0.00004868594,0.00010797535,0.00014923864,0.0002700227,0.008392368],"genre_scores_gemma":[0.97124815,0.00032396024,0.026268726,0.00006054773,0.00003520399,0.00011638803,0.00006865342,0.000048956415,0.0018294384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992077,0.00022451874,0.000020593969,0.00006606575,0.00028557683,0.00019562151],"domain_scores_gemma":[0.98899055,0.008323898,0.0007891324,0.0004650849,0.0011801852,0.00025123495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012592719,0.00058847474,0.0005985008,0.0008270217,0.0005579657,0.00091964036,0.0008509467,0.00067453564,0.0020852974],"category_scores_gemma":[0.011395653,0.00037542084,0.0002500327,0.0007510408,0.0013420283,0.001625364,0.0011345478,0.0009259988,0.00019499805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017483697,0.000024074487,0.00055725034,0.000073611816,0.000020632868,0.0001399838,0.00015203375,0.9298284,0.003668464,0.0567147,0.00081463804,0.007831309],"study_design_scores_gemma":[0.000006898146,0.000026332315,0.00009141728,0.0000074543786,0.0000033780339,0.000025118063,0.000025310068,0.9889818,0.000685239,0.009904984,0.00023563685,0.0000064800415],"about_ca_topic_score_codex":0.004529294,"about_ca_topic_score_gemma":0.002169669,"teacher_disagreement_score":0.004529294,"about_ca_system_score_codex":0.0023798053,"about_ca_system_score_gemma":0.0013054743,"threshold_uncertainty_score":0.01726675},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07397431,0.0063932817,0.9039659,0.0008657715,0.00012318508,0.00012401384,0.00007410419,0.00016929682,0.014310183],"genre_scores_gemma":[0.8267693,0.0065019173,0.16373302,0.00018459813,0.0001666168,0.00026759386,0.00012297038,0.00006909878,0.0021848604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977915,0.00069502153,0.00006698477,0.0001321299,0.0010392168,0.0002751406],"domain_scores_gemma":[0.98910403,0.008475573,0.000712822,0.0007143934,0.00090741814,0.00008585626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039119967,0.00072987884,0.00078145694,0.0015348361,0.00063799456,0.0015088416,0.001303078,0.001605167,0.0007634574],"category_scores_gemma":[0.013129183,0.00030779708,0.0003728397,0.0013463674,0.0018456753,0.0033699293,0.001139446,0.0010661259,0.00017646494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031995558,0.000119432516,0.00074849726,0.0004199957,0.000063536805,0.0001287485,0.00029714764,0.4894084,0.017710425,0.39824304,0.0014451776,0.09109568],"study_design_scores_gemma":[0.00004541834,0.00028141422,0.00039823426,0.00009673752,0.00005543113,0.0002690364,0.00014400468,0.87629104,0.012731611,0.106389165,0.0032487393,0.000049074242],"about_ca_topic_score_codex":0.0021108426,"about_ca_topic_score_gemma":0.0019150102,"teacher_disagreement_score":0.0039119967,"about_ca_system_score_codex":0.0020666076,"about_ca_system_score_gemma":0.0012808882,"threshold_uncertainty_score":0.020688891},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86456627,0.0025046687,0.12326016,0.00039644662,0.000041289215,0.00008999295,0.00013552785,0.00037821964,0.008627291],"genre_scores_gemma":[0.9940685,0.0001783425,0.0053322488,0.000012238606,0.0000070163874,0.0000127907815,0.00003427577,0.000007460932,0.00034724033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792176,0.0010011038,0.00007683138,0.00015335597,0.00061904505,0.00022782128],"domain_scores_gemma":[0.98714334,0.009151239,0.00075557403,0.00056039426,0.0021700112,0.00021944736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002975652,0.0008349864,0.001018287,0.00077027996,0.00054975157,0.0007995668,0.0007084264,0.0009855776,0.0007004411],"category_scores_gemma":[0.0115487175,0.00018122705,0.0002183199,0.0008803659,0.0009718261,0.00090866536,0.0007585526,0.00036285134,0.00014001127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006569611,0.000063740714,0.0014775178,0.00011417029,0.000053391206,0.00015584957,0.00007171416,0.97722965,0.0058288216,0.0028274646,0.00021096363,0.011309799],"study_design_scores_gemma":[0.000040787396,0.00036514702,0.0006581798,0.000011294797,0.000024801595,0.00011109147,0.00003188642,0.9940538,0.003702281,0.0008942874,0.00009351039,0.000012821233],"about_ca_topic_score_codex":0.008369927,"about_ca_topic_score_gemma":0.0053093163,"teacher_disagreement_score":0.008369927,"about_ca_system_score_codex":0.0015268815,"about_ca_system_score_gemma":0.0011650599,"threshold_uncertainty_score":0.016642392},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027675766,0.00043786457,0.95028245,0.00082381687,0.00006404192,0.0001042863,0.00011765885,0.00004481775,0.020449243],"genre_scores_gemma":[0.92451805,0.0010259977,0.064625554,0.0002549705,0.0001497234,0.0003538676,0.00009582032,0.000047753903,0.008928244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727947,0.0012677158,0.00006726604,0.00022926084,0.0007522566,0.00040393972],"domain_scores_gemma":[0.9935569,0.004644718,0.00045930294,0.0004438448,0.0007125393,0.00018263292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003394579,0.001038046,0.000797412,0.0010223258,0.00090735295,0.0018050615,0.0021254153,0.001713797,0.0037160164],"category_scores_gemma":[0.011861004,0.0005620037,0.0008376169,0.0014428406,0.003279314,0.0037805948,0.0015564939,0.0024202587,0.0004091062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037079313,0.000035162848,0.00024208883,0.000046028243,0.000021283458,0.00008560498,0.00013332351,0.24612832,0.0010940527,0.7456752,0.00088519615,0.005616629],"study_design_scores_gemma":[0.000011103341,0.000031832165,0.0001687991,0.000020312582,0.000011611415,0.000068513065,0.000034862544,0.73009324,0.00035083824,0.2678105,0.0013826274,0.00001575111],"about_ca_topic_score_codex":0.0041880906,"about_ca_topic_score_gemma":0.0020697361,"teacher_disagreement_score":0.0041880906,"about_ca_system_score_codex":0.00393394,"about_ca_system_score_gemma":0.0024327058,"threshold_uncertainty_score":0.028542817},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025804952,0.00055738504,0.9699925,0.00023985481,0.00004505019,0.000030999625,0.0000174403,0.00010095467,0.0032107278],"genre_scores_gemma":[0.9050543,0.0004887448,0.09292351,0.00010624452,0.00008256911,0.0000976637,0.000024948256,0.000020302587,0.0012018427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992493,0.00035551158,0.000020703706,0.00007598639,0.00018229977,0.00011625445],"domain_scores_gemma":[0.9987821,0.00080047885,0.00013481337,0.00008290227,0.00016025631,0.000039483286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014598867,0.00044079425,0.0004701416,0.00057655567,0.0005270279,0.0005487438,0.00095723424,0.0007310462,0.0003682221],"category_scores_gemma":[0.003146338,0.00022974226,0.0003750358,0.00078811264,0.0009980177,0.0007299689,0.0008661122,0.00062078226,0.00007554219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008753657,0.00004943124,0.0003489858,0.00005938711,0.000025115,0.00010197314,0.00011445593,0.8282062,0.0050515044,0.12649529,0.0009874329,0.038472705],"study_design_scores_gemma":[0.0000068604804,0.000022377822,0.000049471786,0.0000044250255,0.0000052064715,0.00001713236,0.000008062825,0.9826292,0.00061523437,0.016270444,0.00036579493,0.0000058249802],"about_ca_topic_score_codex":0.004065884,"about_ca_topic_score_gemma":0.0032871799,"teacher_disagreement_score":0.004065884,"about_ca_system_score_codex":0.0012779363,"about_ca_system_score_gemma":0.0015225897,"threshold_uncertainty_score":0.009272158},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14668772,0.00038418546,0.8481975,0.00030521172,0.000096473705,0.00015582418,0.00008016567,0.0013773583,0.0027155222],"genre_scores_gemma":[0.85619986,0.00025217552,0.14074744,0.00009274976,0.000036003872,0.00006268202,0.0000765183,0.000025946743,0.002506571],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969125,0.00006434197,0.000021259655,0.000041244257,0.00013990408,0.00004209444],"domain_scores_gemma":[0.99914753,0.00019540016,0.00015058384,0.00020258037,0.0002639738,0.00004002419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005276569,0.0004467581,0.00032487104,0.00045091307,0.00032624134,0.0002881885,0.0008623292,0.00048301357,0.00047501433],"category_scores_gemma":[0.0019527986,0.00014387057,0.00025819195,0.00034255607,0.00052556756,0.0005670235,0.00046576856,0.00049184985,0.0002732143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012162329,0.00019807403,0.0027121692,0.00024559267,0.000111487,0.0011994229,0.00034771496,0.25038752,0.4737024,0.029679155,0.0025925573,0.23760767],"study_design_scores_gemma":[0.000079429636,0.00038180547,0.00078061054,0.000020571546,0.00006053959,0.0008342477,0.000019546023,0.8650026,0.12736244,0.0021176268,0.0032793551,0.00006129306],"about_ca_topic_score_codex":0.001118117,"about_ca_topic_score_gemma":0.0009692694,"teacher_disagreement_score":0.001118117,"about_ca_system_score_codex":0.00032952445,"about_ca_system_score_gemma":0.00046752472,"threshold_uncertainty_score":0.0027905107},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011968587,0.0014659625,0.9844726,0.00015589551,0.00004832938,0.000022201755,0.000022860118,0.000090796304,0.0017527487],"genre_scores_gemma":[0.7767073,0.0074548884,0.21062621,0.0002148678,0.00028297576,0.00020417677,0.00006584326,0.000056183486,0.0043876236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991737,0.00041135665,0.000035801902,0.00009813721,0.00022412388,0.00005672806],"domain_scores_gemma":[0.99885035,0.0008278587,0.00010032837,0.0000739471,0.00013103781,0.00001653737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009923276,0.00082668214,0.00067336473,0.00034983674,0.00028982325,0.0007818271,0.0006230892,0.00064020377,0.0009223225],"category_scores_gemma":[0.002653562,0.00034907885,0.00024333932,0.00086679455,0.001082822,0.0015895814,0.00063668954,0.0005892141,0.0002995315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109907116,0.00004856992,0.00036112606,0.0002635929,0.000031857973,0.00012987254,0.00013722193,0.8105792,0.01660223,0.09263104,0.0012582751,0.07784709],"study_design_scores_gemma":[0.000020272999,0.00014305925,0.00010718373,0.000025545485,0.000013094153,0.00007017399,0.000027201173,0.95972675,0.002556713,0.0358913,0.0013973963,0.000021281856],"about_ca_topic_score_codex":0.000769774,"about_ca_topic_score_gemma":0.000767276,"teacher_disagreement_score":0.0009923276,"about_ca_system_score_codex":0.00065507984,"about_ca_system_score_gemma":0.000366523,"threshold_uncertainty_score":0.00524801},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32027423,0.0011474199,0.6436021,0.0005139845,0.00036055056,0.00011622581,0.0001863008,0.0069739316,0.026825268],"genre_scores_gemma":[0.7500474,0.00034067378,0.2437349,0.00008544807,0.000050518607,0.0000732692,0.00017474596,0.00016334176,0.005329675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973494,0.000060566468,0.000012903723,0.000034395063,0.000112777176,0.00004447454],"domain_scores_gemma":[0.99945563,0.00018853223,0.000028289396,0.00018007535,0.00011923294,0.00002829625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039046665,0.00037778917,0.00046358487,0.0005754144,0.00037724068,0.0006207899,0.0006841065,0.0004304502,0.004253189],"category_scores_gemma":[0.0016201447,0.00024896962,0.00025648676,0.00063049066,0.0003835676,0.0013322276,0.00089538185,0.0004923717,0.0011249364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008419749,0.00015495838,0.0043277116,0.00035814536,0.00009615622,0.00047942653,0.0005872763,0.1593129,0.15078111,0.0734537,0.016434006,0.59317255],"study_design_scores_gemma":[0.0000773744,0.000120603625,0.00078716484,0.000016714088,0.000017211987,0.00020551693,0.000072493924,0.9218527,0.047205914,0.011704867,0.017917687,0.00002176978],"about_ca_topic_score_codex":0.0019858775,"about_ca_topic_score_gemma":0.0025693048,"teacher_disagreement_score":0.004253189,"about_ca_system_score_codex":0.00040679544,"about_ca_system_score_gemma":0.0004885768,"threshold_uncertainty_score":0.014228284},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037285984,0.00237703,0.94738895,0.0006284085,0.00007840628,0.00005645357,0.00021228325,0.0003434297,0.011629035],"genre_scores_gemma":[0.9485618,0.0045248014,0.036960714,0.0003774559,0.0002533068,0.00029329816,0.0003442151,0.0002271797,0.008457249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991234,0.00019009961,0.000030462992,0.00010775562,0.00038938524,0.00015887385],"domain_scores_gemma":[0.9951851,0.002863518,0.00060658983,0.00037373407,0.0008671647,0.0001039741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015262252,0.0009652513,0.0009197987,0.0013618616,0.0006514762,0.0015775304,0.00071166223,0.0011247328,0.0021219007],"category_scores_gemma":[0.007342513,0.0005495596,0.0007609588,0.0012183703,0.0019834596,0.0021171474,0.0008744252,0.0018497301,0.00092365127],"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.00006291682,0.00005555144,0.002380252,0.0002704356,0.000073780626,0.0005915544,0.00097315,0.41771582,0.011689579,0.5473393,0.0026120674,0.016235653],"study_design_scores_gemma":[0.000010897318,0.0000338568,0.00083927705,0.000030343657,0.000015433538,0.0002750359,0.0000844098,0.88407093,0.0010250291,0.111586146,0.0019906063,0.000037946105],"about_ca_topic_score_codex":0.004446176,"about_ca_topic_score_gemma":0.0023816389,"teacher_disagreement_score":0.004446176,"about_ca_system_score_codex":0.0018977869,"about_ca_system_score_gemma":0.0011304832,"threshold_uncertainty_score":0.013769448},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04094944,0.00073207606,0.9466269,0.0005244495,0.000064290696,0.000048725844,0.00013687281,0.000087080014,0.010830253],"genre_scores_gemma":[0.8904915,0.0021237675,0.1006404,0.00027267722,0.000111350586,0.00023996098,0.0002256036,0.000065200205,0.00582946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919385,0.00033361197,0.000029623161,0.00009527238,0.00025036614,0.000097223834],"domain_scores_gemma":[0.99669266,0.0024440903,0.00023082171,0.0002606643,0.00030882293,0.0000629701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015857999,0.0007748156,0.00066441373,0.00071168225,0.0005131963,0.0010484238,0.0009805056,0.0008713553,0.0017309397],"category_scores_gemma":[0.00636709,0.00031740256,0.00036017105,0.0009491918,0.0021982025,0.0022210132,0.0016754064,0.0014869735,0.00033335693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009392935,0.000019330437,0.00014935032,0.000079282385,0.000014278676,0.000110116256,0.00014138116,0.51131576,0.0026456348,0.4711625,0.0012428776,0.013025465],"study_design_scores_gemma":[0.000011810157,0.00002909309,0.000060215574,0.000025147256,0.0000080737145,0.000047861984,0.000020481048,0.87825483,0.0011888515,0.11949373,0.0008439172,0.00001589479],"about_ca_topic_score_codex":0.0026458951,"about_ca_topic_score_gemma":0.0023364017,"teacher_disagreement_score":0.0026458951,"about_ca_system_score_codex":0.0018108712,"about_ca_system_score_gemma":0.0010778824,"threshold_uncertainty_score":0.01313889},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05922133,0.0005678347,0.9334185,0.0002789097,0.00007359383,0.00013862234,0.0000717255,0.0008256224,0.005403788],"genre_scores_gemma":[0.81911594,0.00035939756,0.17517595,0.00021141264,0.00005473676,0.00016894328,0.000107991174,0.000026480735,0.0047790725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990584,0.00029253884,0.000040523857,0.0001760303,0.0003323319,0.00010026069],"domain_scores_gemma":[0.99912924,0.0003402854,0.00012594691,0.00013054832,0.00023460452,0.000039471026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007419187,0.00079114584,0.0007219906,0.0004840373,0.0005895214,0.0006087068,0.0011887465,0.0007709089,0.00095157593],"category_scores_gemma":[0.0013441778,0.0002542136,0.0003017523,0.00093904475,0.0005892459,0.00090903917,0.000931679,0.00050324685,0.00043220836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011309298,0.00037933936,0.0038278264,0.00059958326,0.00023410727,0.0009788326,0.0006417902,0.11787222,0.19253635,0.035553716,0.006004992,0.6402403],"study_design_scores_gemma":[0.00008711173,0.0008078893,0.000538759,0.000023375924,0.000118213844,0.001085012,0.000056809047,0.92911977,0.059099413,0.0027885141,0.006213243,0.00006189743],"about_ca_topic_score_codex":0.0015442536,"about_ca_topic_score_gemma":0.003009711,"teacher_disagreement_score":0.0015442536,"about_ca_system_score_codex":0.0005313919,"about_ca_system_score_gemma":0.0006575443,"threshold_uncertainty_score":0.0039236546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010185418,0.00079805026,0.98635024,0.00015787342,0.000045311364,0.000036440702,0.000049908143,0.00015711912,0.002219637],"genre_scores_gemma":[0.8657007,0.0021356547,0.12792738,0.0001817138,0.00015458235,0.00026005975,0.0001055205,0.000049231574,0.0034851104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990753,0.0004214048,0.000040784813,0.00013399277,0.00021500072,0.00011361617],"domain_scores_gemma":[0.997931,0.0013901956,0.000204867,0.000108713284,0.00032476938,0.00004040839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011415314,0.0008183472,0.00069811527,0.0004233315,0.00038648502,0.0008133949,0.00072594703,0.0008659418,0.0013510063],"category_scores_gemma":[0.0038042231,0.00044115304,0.00024380308,0.00062772684,0.0009443968,0.0010006164,0.00073537306,0.00072292803,0.00035357356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116430856,0.00003071483,0.00032462325,0.00018434208,0.000027667202,0.00012083754,0.00016921955,0.91296,0.0067924852,0.03193343,0.0011986933,0.04614159],"study_design_scores_gemma":[0.000018080282,0.0000934535,0.00009122494,0.000018607943,0.000013558111,0.00007335054,0.000021008585,0.9885053,0.0027210452,0.007300394,0.0011305503,0.0000134407255],"about_ca_topic_score_codex":0.0020967915,"about_ca_topic_score_gemma":0.0017607757,"teacher_disagreement_score":0.0020967915,"about_ca_system_score_codex":0.0008390521,"about_ca_system_score_gemma":0.0007824621,"threshold_uncertainty_score":0.00608778},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11179413,0.012477669,0.83010364,0.0018439848,0.00013935917,0.000052881303,0.0001536569,0.0002468866,0.043187726],"genre_scores_gemma":[0.9619094,0.0056150146,0.027210517,0.00021845722,0.00017134726,0.00017403314,0.00010238748,0.000109472385,0.004489386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831045,0.0005661387,0.00006291641,0.00018985855,0.0006722641,0.00019834466],"domain_scores_gemma":[0.99344134,0.005336803,0.0003294819,0.00031621876,0.00049793336,0.00007813628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018069769,0.0005435417,0.00075347413,0.0008202689,0.0006342391,0.0016917968,0.00092574075,0.0011724315,0.001241121],"category_scores_gemma":[0.011731436,0.0004216123,0.00029045477,0.0012264778,0.0019460642,0.0035265472,0.001114194,0.0013088787,0.00034083804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016056943,0.000054175674,0.00083318976,0.00035157552,0.00004066054,0.00024196303,0.00033744166,0.35441494,0.01584691,0.5767423,0.0018981677,0.04907816],"study_design_scores_gemma":[0.000016464666,0.000080346705,0.00053567695,0.000080581754,0.000018467532,0.0003183188,0.00014595005,0.6139863,0.0059014247,0.3731308,0.0057573207,0.000028376287],"about_ca_topic_score_codex":0.0008359959,"about_ca_topic_score_gemma":0.0004504463,"teacher_disagreement_score":0.0018069769,"about_ca_system_score_codex":0.0014699076,"about_ca_system_score_gemma":0.00050833623,"threshold_uncertainty_score":0.0106649995},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06537004,0.0009594949,0.930948,0.00023062571,0.000029336177,0.000026447431,0.00003817823,0.00024304561,0.0021548003],"genre_scores_gemma":[0.8938679,0.0010064181,0.10317498,0.00006426682,0.000048831873,0.00009287762,0.00005284871,0.00004219579,0.0016496374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996006,0.00012818143,0.000012032136,0.000043798555,0.00015514305,0.000060274677],"domain_scores_gemma":[0.9986481,0.00081247475,0.00018990375,0.00014347256,0.00017085446,0.000035242752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087854284,0.00035942657,0.0003975336,0.00046698068,0.0003353089,0.0005230742,0.0005918392,0.00036882266,0.00039295474],"category_scores_gemma":[0.0029453656,0.00022771761,0.00016685679,0.00079067063,0.00097301754,0.0011215728,0.00073783274,0.0005594317,0.000080417536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006383206,0.000011940893,0.00031500024,0.00003484029,0.000012915138,0.0000598527,0.00006688433,0.914627,0.005935312,0.048273336,0.0004736809,0.030125374],"study_design_scores_gemma":[0.000008388365,0.000037110698,0.00011761889,0.0000069859993,0.000008293595,0.000044826756,0.000015598007,0.96982557,0.0026550759,0.026210476,0.0010601906,0.00000984195],"about_ca_topic_score_codex":0.0022761011,"about_ca_topic_score_gemma":0.0022923911,"teacher_disagreement_score":0.0022761011,"about_ca_system_score_codex":0.0010419402,"about_ca_system_score_gemma":0.0007800277,"threshold_uncertainty_score":0.0075597763},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09102301,0.00033160587,0.9026247,0.0003317704,0.000045067034,0.00013604888,0.00007091494,0.0004510511,0.004985855],"genre_scores_gemma":[0.80253184,0.00021037651,0.193668,0.00011710602,0.00005866499,0.00020028812,0.00012714235,0.0000622413,0.0030243385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989095,0.0004226114,0.000040605508,0.00013704138,0.0003170128,0.00017329486],"domain_scores_gemma":[0.99878865,0.0005013232,0.00015595565,0.00030076527,0.00015181213,0.000101446865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015312692,0.0004505094,0.0006782147,0.0007118651,0.0010181789,0.0011003269,0.0013956452,0.0009870275,0.0011100216],"category_scores_gemma":[0.0031282294,0.00028572953,0.00045019903,0.000932163,0.00058964954,0.002310827,0.0020326618,0.0005542138,0.00028735033],"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.000793903,0.0002356632,0.0015838413,0.00017421931,0.0000750455,0.00039693314,0.0007963295,0.7003288,0.022216849,0.16193642,0.0035707636,0.10789114],"study_design_scores_gemma":[0.0000553908,0.00013169719,0.00016004124,0.000009750789,0.000013588152,0.00007459172,0.00006355827,0.94068784,0.003179554,0.052270956,0.0033427794,0.000010278143],"about_ca_topic_score_codex":0.00072650757,"about_ca_topic_score_gemma":0.00080373767,"teacher_disagreement_score":0.0015312692,"about_ca_system_score_codex":0.0008499653,"about_ca_system_score_gemma":0.000717094,"threshold_uncertainty_score":0.008098245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013261178,0.00027382342,0.98540825,0.0001022464,0.000011566267,0.000021577041,0.000019378056,0.00013073735,0.0007712338],"genre_scores_gemma":[0.88503903,0.0004001137,0.11269738,0.000074526746,0.00004735383,0.000115951145,0.000057233643,0.000036005593,0.001532402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896634,0.00041733176,0.000044847282,0.00022362648,0.00020668306,0.00014109474],"domain_scores_gemma":[0.9987564,0.000812064,0.0001774891,0.00010324176,0.000117335956,0.000033416323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001225237,0.0013439308,0.0015221961,0.0004225824,0.0004974607,0.00094121776,0.0012082171,0.0009360255,0.0007206313],"category_scores_gemma":[0.0032826085,0.00047845,0.00054524885,0.0006097712,0.000910249,0.0013548635,0.0010135575,0.0008345366,0.00022935249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006157133,0.000020855321,0.0002246756,0.00003913066,0.000027928934,0.000079926715,0.000055846234,0.9617248,0.0013215311,0.0073007713,0.0003977809,0.028745227],"study_design_scores_gemma":[0.000009678436,0.000028202505,0.000051369716,0.0000024853507,0.000010441826,0.000027540973,0.000009684447,0.9952917,0.0006422121,0.0037338848,0.00018721235,0.000005533525],"about_ca_topic_score_codex":0.0025506031,"about_ca_topic_score_gemma":0.0022419922,"teacher_disagreement_score":0.0025506031,"about_ca_system_score_codex":0.00085235754,"about_ca_system_score_gemma":0.00067183335,"threshold_uncertainty_score":0.00647974},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013868699,0.00017310474,0.9969632,0.00005191736,0.00001790942,0.000012248402,0.000011719115,0.00007037957,0.0013125618],"genre_scores_gemma":[0.2796125,0.0013592184,0.7103895,0.00024316675,0.00012091807,0.0002986248,0.00014189893,0.000081127226,0.007753014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959964,0.00017128282,0.000016544915,0.00006189572,0.00012283574,0.000027735117],"domain_scores_gemma":[0.9996055,0.00023047197,0.000034927987,0.000032787626,0.000084140614,0.000012228261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005886298,0.0007459348,0.00057252555,0.00023598793,0.00026778187,0.0005019856,0.00055485737,0.0006699686,0.0022264717],"category_scores_gemma":[0.000975865,0.00026673716,0.00037858897,0.00039866887,0.00037386565,0.000768428,0.00054282177,0.0006440716,0.0011870442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041972093,0.000037785136,0.00022246326,0.00012846927,0.00003567691,0.0001175586,0.00008649566,0.7959514,0.014007381,0.07309223,0.0020863174,0.11419219],"study_design_scores_gemma":[0.000008920442,0.000040780647,0.00005596836,0.000010053558,0.0000063597586,0.00004946016,0.000010247918,0.9824835,0.0020050993,0.012699241,0.0026217075,0.00000870292],"about_ca_topic_score_codex":0.0006864429,"about_ca_topic_score_gemma":0.0010562631,"teacher_disagreement_score":0.0022264717,"about_ca_system_score_codex":0.0004375381,"about_ca_system_score_gemma":0.00038566615,"threshold_uncertainty_score":0.0074483156},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.519349,0.0009197974,0.47347456,0.00019349316,0.000021724863,0.00002835919,0.000034031673,0.00043483634,0.0055441423],"genre_scores_gemma":[0.9947648,0.00017584437,0.004786325,0.000012546151,0.000011735335,0.000009157032,0.000005804909,0.000008518288,0.00022520994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999353,0.0002941609,0.00001828851,0.000055906665,0.00013605501,0.00014253426],"domain_scores_gemma":[0.99709296,0.00202258,0.00033897613,0.0002470814,0.00023440096,0.00006396003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014388963,0.00051759277,0.00043804746,0.0005609572,0.00032386693,0.00081133965,0.00061650254,0.00044829553,0.00048711273],"category_scores_gemma":[0.0042373096,0.0003893317,0.00034420434,0.000560128,0.0011133257,0.0012746626,0.0007095017,0.00037708535,0.00015237277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019112832,0.00005171838,0.0016702533,0.000056644818,0.000064361004,0.00040888114,0.00015859018,0.92190266,0.034314726,0.022332238,0.0001941761,0.01865476],"study_design_scores_gemma":[0.000014993236,0.00012579352,0.0004358174,0.000006294387,0.00004048409,0.00015836669,0.000046908794,0.98354465,0.007891689,0.0074486113,0.000268858,0.000017614011],"about_ca_topic_score_codex":0.0012556543,"about_ca_topic_score_gemma":0.00105647,"teacher_disagreement_score":0.0014388963,"about_ca_system_score_codex":0.0007450173,"about_ca_system_score_gemma":0.00040529223,"threshold_uncertainty_score":0.007609725},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059657432,0.0008937408,0.93642527,0.00024919162,0.000028138202,0.000024705452,0.000035293273,0.00022723111,0.0024591119],"genre_scores_gemma":[0.8800203,0.0011125007,0.11666482,0.000073166244,0.00005370592,0.00009755884,0.000051113446,0.000044817847,0.0018820012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962604,0.000116864976,0.000010604122,0.000042632117,0.00014928111,0.000054580425],"domain_scores_gemma":[0.99867636,0.00080046046,0.00018503741,0.00014217949,0.00015947572,0.0000364476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008235917,0.00036429823,0.00040256177,0.00045950076,0.00036754945,0.00052373024,0.0005585691,0.0003953782,0.00040271395],"category_scores_gemma":[0.002875678,0.00022368494,0.00016469663,0.00080882583,0.0010774005,0.0011143177,0.00075232086,0.00060626375,0.00008234924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005195581,0.000011284222,0.00027620417,0.000029623716,0.000011113896,0.000057784775,0.000063337604,0.90515304,0.005296736,0.060947828,0.00046793913,0.027633136],"study_design_scores_gemma":[0.00000799531,0.0000338436,0.00010681234,0.000006820643,0.0000075658086,0.000045200544,0.000015099982,0.9636275,0.002517438,0.032478686,0.0011429158,0.000010052006],"about_ca_topic_score_codex":0.002278513,"about_ca_topic_score_gemma":0.0022038973,"teacher_disagreement_score":0.002278513,"about_ca_system_score_codex":0.0010467521,"about_ca_system_score_gemma":0.0008185975,"threshold_uncertainty_score":0.0075947046},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041113296,0.00017850263,0.9945464,0.00005466268,0.00006173317,0.000036903926,0.000023656065,0.00033416905,0.00065250095],"genre_scores_gemma":[0.10585927,0.00034606297,0.88903385,0.00017876305,0.0001355361,0.00013531577,0.00015427041,0.00008119562,0.004075659],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987149,0.00024307324,0.00008451476,0.0002462267,0.0006240345,0.00008713745],"domain_scores_gemma":[0.9975848,0.0011102798,0.00023143782,0.00028555517,0.0007255178,0.0000624013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010557154,0.00062906276,0.00078607036,0.00096609734,0.00045139648,0.00091623294,0.0009183979,0.0010641458,0.0015207133],"category_scores_gemma":[0.0031483758,0.0003696277,0.0004953733,0.0006860227,0.00083814113,0.0018566771,0.0007838316,0.0012479584,0.0010189072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073893636,0.0001557102,0.0018997592,0.00038641816,0.00024172085,0.0004084676,0.00027118114,0.10517005,0.13860562,0.058406718,0.0055569876,0.6881585],"study_design_scores_gemma":[0.00008415319,0.0006232098,0.0007350735,0.00004913839,0.00007553594,0.0012195744,0.000048351758,0.86951464,0.09186723,0.016111514,0.019552344,0.00011926],"about_ca_topic_score_codex":0.0007751487,"about_ca_topic_score_gemma":0.0010771301,"teacher_disagreement_score":0.0015207133,"about_ca_system_score_codex":0.00047837157,"about_ca_system_score_gemma":0.0006345486,"threshold_uncertainty_score":0.0055832267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010816941,0.00060299924,0.9757268,0.0002865589,0.00014266172,0.00006353104,0.0000937129,0.00039454698,0.011872203],"genre_scores_gemma":[0.35299683,0.0005298325,0.635767,0.0004073934,0.00024388885,0.00013999475,0.00019596897,0.000064127096,0.009654895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986682,0.00024072317,0.000093477334,0.00032638063,0.0004991274,0.00017206513],"domain_scores_gemma":[0.99956566,0.000069228634,0.00007301305,0.0001208787,0.00012924352,0.00004184362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006824905,0.0006029161,0.0009521123,0.0005170706,0.00042160947,0.00086084526,0.0009595814,0.0009212821,0.0026602168],"category_scores_gemma":[0.001181945,0.0003327892,0.00043031728,0.0005755841,0.0005253682,0.0012022989,0.0010925797,0.00080626644,0.00091165816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046161975,0.00016514544,0.00058240123,0.00020319493,0.00011028653,0.00020077785,0.00021658659,0.13629384,0.11308556,0.20859618,0.009170185,0.5309142],"study_design_scores_gemma":[0.00019407974,0.00035202707,0.0004879048,0.00003750628,0.000092036025,0.0009024508,0.000040160616,0.8784679,0.032947406,0.047128897,0.039240412,0.000109222645],"about_ca_topic_score_codex":0.0005035148,"about_ca_topic_score_gemma":0.0007960576,"teacher_disagreement_score":0.0026602168,"about_ca_system_score_codex":0.00060334924,"about_ca_system_score_gemma":0.0008720883,"threshold_uncertainty_score":0.008899331},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6873324,0.0019097509,0.29930925,0.00046333845,0.000051444502,0.00002999229,0.00014504466,0.0004616769,0.010297082],"genre_scores_gemma":[0.993826,0.0002395866,0.005734165,0.000015967786,0.000011448572,0.00000645717,0.000019070047,0.000008981718,0.00013841409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971644,0.0010159897,0.00013236233,0.000252659,0.0009113537,0.00052318914],"domain_scores_gemma":[0.97962725,0.016840506,0.0015043089,0.0008972908,0.00097016565,0.00016042449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024310052,0.0010968554,0.0010342756,0.00046917144,0.000552372,0.0013048943,0.0005084683,0.001181879,0.00040205265],"category_scores_gemma":[0.019436408,0.00042288384,0.00025433433,0.0007731005,0.0015990082,0.0015384663,0.0011952644,0.00072038616,0.00014364302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006995957,0.000060214636,0.003983351,0.000117487114,0.000077511664,0.00043809655,0.00020724097,0.93673384,0.022641825,0.0077733756,0.0003325979,0.026934896],"study_design_scores_gemma":[0.000022363194,0.00028606033,0.0025120897,0.000028484903,0.00008956375,0.0004035413,0.0000831166,0.96404105,0.02865706,0.0035819283,0.00024711873,0.00004755039],"about_ca_topic_score_codex":0.002086547,"about_ca_topic_score_gemma":0.0021798965,"teacher_disagreement_score":0.0024310052,"about_ca_system_score_codex":0.0008162938,"about_ca_system_score_gemma":0.00082812685,"threshold_uncertainty_score":0.012856543},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017320246,0.0008519838,0.9669275,0.0007602079,0.00008119508,0.000049552826,0.00008149942,0.00011978325,0.013807917],"genre_scores_gemma":[0.8223648,0.0013490431,0.15995748,0.0005620384,0.0001295355,0.00043060546,0.0001397232,0.00014512325,0.014921721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918383,0.0004137794,0.000017636537,0.00010435446,0.00014817536,0.00013220556],"domain_scores_gemma":[0.9986217,0.0010795027,0.00011439549,0.000043378783,0.00008770948,0.0000532396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016816901,0.0012985824,0.0011848898,0.0005297624,0.00047566247,0.001828003,0.0007734995,0.0013450576,0.0025545475],"category_scores_gemma":[0.0034268834,0.0006421932,0.000555857,0.0010676531,0.001512736,0.001166942,0.0011051528,0.0013594099,0.0003074331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035790254,0.000029379398,0.00007750716,0.00004898372,0.000019416579,0.00007159673,0.00004488453,0.9247087,0.00041428255,0.06871829,0.0010164104,0.0048147324],"study_design_scores_gemma":[0.000008044623,0.000012618342,0.000016028436,0.0000061103215,0.0000036150707,0.00000884485,0.00001149779,0.97799486,0.00008639288,0.021376,0.00047261512,0.0000033621563],"about_ca_topic_score_codex":0.003340074,"about_ca_topic_score_gemma":0.0025767768,"teacher_disagreement_score":0.003340074,"about_ca_system_score_codex":0.0019306191,"about_ca_system_score_gemma":0.0015886115,"threshold_uncertainty_score":0.014007747},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16514656,0.0074134846,0.76614594,0.0017268178,0.00017999594,0.0001328078,0.00040762927,0.00046340775,0.058383353],"genre_scores_gemma":[0.96025455,0.003636049,0.03191247,0.00022425705,0.00021333511,0.0002323132,0.00016340708,0.00013474202,0.0032288719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972799,0.0009083163,0.000078754805,0.00019354114,0.0009486407,0.0005909569],"domain_scores_gemma":[0.98125124,0.014100272,0.001436104,0.001373505,0.0015465427,0.0002923449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004150004,0.0014815221,0.0010605559,0.0016351965,0.001054923,0.0029732636,0.0014254093,0.0011563181,0.0025083108],"category_scores_gemma":[0.024482414,0.00085150835,0.0006192892,0.0018497258,0.0022876444,0.0031613025,0.0024472615,0.002663807,0.0006828031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017941893,0.000088943496,0.00081580266,0.0001922785,0.000041363077,0.00031709168,0.0003367218,0.5943733,0.00765023,0.36849844,0.0017531401,0.02575334],"study_design_scores_gemma":[0.00001556215,0.000076406155,0.00042085376,0.00008197052,0.000025809997,0.00033825112,0.00011750136,0.9030063,0.0035186778,0.09077272,0.0015793105,0.000046674802],"about_ca_topic_score_codex":0.0024551912,"about_ca_topic_score_gemma":0.0019690504,"teacher_disagreement_score":0.004150004,"about_ca_system_score_codex":0.0034814253,"about_ca_system_score_gemma":0.0013756899,"threshold_uncertainty_score":0.025259674},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15933909,0.0032793693,0.7966449,0.0017403575,0.00014622402,0.00004962436,0.00021166305,0.00024449342,0.0383443],"genre_scores_gemma":[0.96425205,0.0029658321,0.02205242,0.00019036261,0.0002894573,0.000099026576,0.00017275434,0.00012188448,0.00985628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919266,0.00031629688,0.000018743822,0.00008025873,0.00025952174,0.00013255923],"domain_scores_gemma":[0.994027,0.004148467,0.0005228097,0.00030753438,0.0008795867,0.00011454269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012679796,0.00077955954,0.0004630635,0.0013555114,0.0003066717,0.0012565288,0.00065333094,0.0008110111,0.0036111132],"category_scores_gemma":[0.010967094,0.000337588,0.0002683444,0.0015700466,0.002247011,0.00264207,0.00083435496,0.0009983425,0.000536306],"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.00002254969,0.000024446477,0.0003784368,0.00007044873,0.00001162203,0.00012885379,0.00015716038,0.27458838,0.001756134,0.7129454,0.0012458063,0.008670807],"study_design_scores_gemma":[0.0000059110557,0.00001993785,0.000570255,0.000024527111,0.000004389453,0.00010616674,0.000048588234,0.7011181,0.00042958063,0.29657778,0.0010746196,0.000020120688],"about_ca_topic_score_codex":0.0018401273,"about_ca_topic_score_gemma":0.0010678158,"teacher_disagreement_score":0.0036111132,"about_ca_system_score_codex":0.00095044065,"about_ca_system_score_gemma":0.0005736798,"threshold_uncertainty_score":0.012080371},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013011447,0.00028162502,0.98093,0.0007264844,0.00012946026,0.000092747054,0.0000254407,0.00036909772,0.0044336612],"genre_scores_gemma":[0.8297869,0.00047845152,0.1625248,0.00025746602,0.00021045352,0.0004231107,0.000057276447,0.000061399514,0.006200028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663156,0.0017504074,0.00020037004,0.00039916192,0.0007862822,0.00023222415],"domain_scores_gemma":[0.99478596,0.0023460516,0.0005597765,0.0016032093,0.00055529556,0.00014971635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038921912,0.00059699785,0.00068931485,0.00086147344,0.0010926016,0.0016812219,0.0016078982,0.0020773516,0.0033158357],"category_scores_gemma":[0.013962904,0.00043855113,0.0006613021,0.000484401,0.0029539033,0.0049936483,0.003692353,0.0017220688,0.0011673282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020971471,0.00003656086,0.00044228538,0.000118905155,0.000033538836,0.00032926843,0.0003197708,0.09240569,0.005720002,0.87387025,0.0019485042,0.024565496],"study_design_scores_gemma":[0.000064491505,0.00008240994,0.000084287276,0.00003098358,0.000021333732,0.00018829279,0.000039956867,0.6885452,0.0023935,0.3029258,0.005595908,0.000027757935],"about_ca_topic_score_codex":0.00032010474,"about_ca_topic_score_gemma":0.00031164216,"teacher_disagreement_score":0.0038921912,"about_ca_system_score_codex":0.0012397068,"about_ca_system_score_gemma":0.00093455374,"threshold_uncertainty_score":0.020584166},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045605205,0.00047562012,0.9488287,0.00042789325,0.000029655614,0.00006050246,0.00007580674,0.00008309836,0.0044135214],"genre_scores_gemma":[0.94781816,0.0004141573,0.049593464,0.000061683815,0.00005442274,0.00012144102,0.000034050972,0.000027026646,0.0018755641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989017,0.0005098264,0.000047482154,0.00013160364,0.0002601548,0.00014909772],"domain_scores_gemma":[0.99817324,0.0012444691,0.0002629961,0.00007210025,0.00019161696,0.00005568761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013889604,0.0009824716,0.0009559067,0.00043187517,0.00042874107,0.0011557076,0.0008327065,0.0009793671,0.0019558456],"category_scores_gemma":[0.0043791337,0.00048765694,0.00030731736,0.0008454299,0.0010450548,0.001226413,0.00096199755,0.0007633836,0.00029504826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081600745,0.000030216157,0.0002796168,0.00005612532,0.000019306057,0.00011275529,0.0000683022,0.9570861,0.002522686,0.027369106,0.00039465172,0.011979478],"study_design_scores_gemma":[0.000021394677,0.000038750288,0.00007494959,0.0000039052443,0.0000047615126,0.00003189278,0.000012265162,0.9887066,0.0003912728,0.010465403,0.00024316828,0.0000056489484],"about_ca_topic_score_codex":0.0020075724,"about_ca_topic_score_gemma":0.0016791926,"teacher_disagreement_score":0.0020075724,"about_ca_system_score_codex":0.0011448876,"about_ca_system_score_gemma":0.0009715937,"threshold_uncertainty_score":0.008306742},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38470986,0.005201488,0.5898363,0.00085084734,0.00007706454,0.00012173983,0.00020859383,0.0004639047,0.018530246],"genre_scores_gemma":[0.9865194,0.0009074527,0.011252471,0.00004969157,0.000027231174,0.00003315891,0.000051544175,0.000024016672,0.0011349603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980585,0.00083177834,0.00007787576,0.00016975375,0.0005703387,0.00029163266],"domain_scores_gemma":[0.9888325,0.008184591,0.0007563813,0.00063659076,0.0014755938,0.00011428572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003254073,0.001257664,0.0010311297,0.001354205,0.0006685548,0.0011558166,0.0007668154,0.0011214804,0.0014086826],"category_scores_gemma":[0.012802216,0.00039389104,0.0005406358,0.0010414574,0.00091778557,0.0014110941,0.000969873,0.00067200017,0.00042288948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049477414,0.00012847738,0.003133755,0.00023843735,0.00015528945,0.00024101963,0.00053534994,0.85640085,0.023090186,0.06782827,0.0011470098,0.04660655],"study_design_scores_gemma":[0.00001835174,0.00022906544,0.0006758552,0.000017681257,0.000046130546,0.00018937328,0.00006597122,0.98615533,0.0054584676,0.0066155884,0.00050043897,0.000027795151],"about_ca_topic_score_codex":0.0026014352,"about_ca_topic_score_gemma":0.0018202083,"teacher_disagreement_score":0.003254073,"about_ca_system_score_codex":0.0015313515,"about_ca_system_score_gemma":0.0009125059,"threshold_uncertainty_score":0.017209351},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010684879,0.016819138,0.8981591,0.0062881727,0.0013906945,0.00014954897,0.00014858511,0.0004295455,0.06593035],"genre_scores_gemma":[0.4258351,0.033607863,0.4879717,0.0043905824,0.003579054,0.00068463315,0.00025402938,0.00015416574,0.043522965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991234,0.00031186725,0.00004667031,0.0001321464,0.00030850328,0.0000774121],"domain_scores_gemma":[0.99870336,0.00048021626,0.00016633476,0.0002452253,0.00033051238,0.00007433164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016255984,0.0008407836,0.00052031636,0.00085142965,0.00096628047,0.0030512153,0.0014176833,0.0023746116,0.0027040513],"category_scores_gemma":[0.002334647,0.00027727705,0.00041539717,0.0012661134,0.0022933325,0.0035046057,0.0017643941,0.0021454347,0.0013438847],"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.000057291127,0.000023288756,0.0002900712,0.00017773431,0.000015231959,0.00017583092,0.00026161177,0.004838838,0.005455402,0.90434086,0.005947792,0.078416094],"study_design_scores_gemma":[0.000037961814,0.00035531516,0.00048220067,0.0002887714,0.000057750418,0.0017230449,0.00025938716,0.06836463,0.008379894,0.45490116,0.46506563,0.00008429421],"about_ca_topic_score_codex":0.0015302977,"about_ca_topic_score_gemma":0.0010919174,"teacher_disagreement_score":0.0030512153,"about_ca_system_score_codex":0.0012488026,"about_ca_system_score_gemma":0.0009660908,"threshold_uncertainty_score":0.0090607405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0101969745,0.00051439786,0.9871609,0.000092756396,0.000043954216,0.000041507366,0.000018919767,0.00016423888,0.0017663154],"genre_scores_gemma":[0.68088406,0.000724253,0.31600243,0.00014789386,0.00009595183,0.00014438032,0.00006427952,0.000016313932,0.0019204463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941516,0.00021103006,0.000022978718,0.00009746895,0.0001968482,0.000056509987],"domain_scores_gemma":[0.99975103,0.00010729526,0.000037744936,0.000050404662,0.000042015985,0.0000114750555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045205507,0.00066068704,0.000521384,0.0003512671,0.0003789264,0.00044741287,0.000845593,0.0004924195,0.00068203406],"category_scores_gemma":[0.0010172825,0.00015522625,0.0003492649,0.0004763204,0.0003242936,0.00052369083,0.00050089153,0.00040736742,0.0002802866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003154374,0.0001413197,0.00055649027,0.0003309184,0.00016158714,0.00041200282,0.00017512406,0.28987613,0.08700972,0.07658701,0.0034529187,0.5409814],"study_design_scores_gemma":[0.000085424705,0.00030817647,0.00036175325,0.000017565018,0.000068996196,0.00052007136,0.000025597928,0.9576116,0.013185706,0.02065027,0.007126174,0.000038690112],"about_ca_topic_score_codex":0.00049097807,"about_ca_topic_score_gemma":0.00077357766,"teacher_disagreement_score":0.000845593,"about_ca_system_score_codex":0.00027334952,"about_ca_system_score_gemma":0.00042573927,"threshold_uncertainty_score":0.0023907423},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05740369,0.00030026853,0.939035,0.00017405975,0.000023897217,0.00005175655,0.000026746236,0.00016049639,0.0028241575],"genre_scores_gemma":[0.7289288,0.00041939068,0.26709616,0.00010262126,0.000034020457,0.00020250218,0.00007941369,0.0000583917,0.0030786851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958414,0.00016228779,0.000016638867,0.000037154972,0.00015763214,0.000042109805],"domain_scores_gemma":[0.9990164,0.0005362227,0.00012848926,0.00013681393,0.00014478681,0.000037270816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006904122,0.000321546,0.0003314998,0.00054676825,0.00043144496,0.00049118756,0.00065323286,0.0006353974,0.00059043994],"category_scores_gemma":[0.0028545083,0.00016082576,0.00028301723,0.00065466017,0.0008975617,0.0011313721,0.00082562055,0.00059181836,0.0001333844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002839415,0.000074679934,0.0008241539,0.00011577712,0.000029611801,0.00025201603,0.00032963356,0.5680473,0.017365918,0.31217432,0.0012761629,0.09922646],"study_design_scores_gemma":[0.000025788122,0.00006964792,0.00008459286,0.000013064921,0.0000099688,0.0000807337,0.000019040282,0.957451,0.005207869,0.035648692,0.0013758651,0.000013738118],"about_ca_topic_score_codex":0.0020742638,"about_ca_topic_score_gemma":0.0018525575,"teacher_disagreement_score":0.0020742638,"about_ca_system_score_codex":0.00068439014,"about_ca_system_score_gemma":0.00082063134,"threshold_uncertainty_score":0.004965663},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1142987,0.0004498135,0.8814935,0.0003965175,0.00001558964,0.000043924258,0.00004259413,0.000101196994,0.0031582036],"genre_scores_gemma":[0.9512262,0.00025994546,0.047260154,0.000051044248,0.00002510298,0.00009385931,0.000023611095,0.000027782491,0.0010323689],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877185,0.00077045284,0.000027794993,0.000107788204,0.00018077261,0.0001414535],"domain_scores_gemma":[0.9983529,0.0013230585,0.00013519348,0.000055307428,0.00008471544,0.000048814774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001795891,0.0008101761,0.00088889815,0.0006729109,0.0004389232,0.00090603385,0.0009719292,0.0011810771,0.0005676002],"category_scores_gemma":[0.0049481057,0.0005461429,0.000396305,0.0009766727,0.0011365463,0.0013421292,0.0010544268,0.0004817519,0.00011340381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069402944,0.00003955,0.00029124724,0.000037330807,0.000022144995,0.00008340595,0.000081281454,0.9640528,0.0022362522,0.020736221,0.00030627567,0.012044052],"study_design_scores_gemma":[0.000010743196,0.000022857806,0.000036569232,0.0000022940017,0.000004770375,0.000010093512,0.000013023366,0.9883012,0.00051851635,0.010969489,0.00010753627,0.000002912595],"about_ca_topic_score_codex":0.0015966889,"about_ca_topic_score_gemma":0.0013341975,"teacher_disagreement_score":0.001795891,"about_ca_system_score_codex":0.0009097079,"about_ca_system_score_gemma":0.0005829275,"threshold_uncertainty_score":0.009497702},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10565079,0.0036998368,0.86513895,0.0014607352,0.00019073092,0.00018116119,0.00035606528,0.0003807845,0.022941006],"genre_scores_gemma":[0.87170416,0.0033935823,0.116423234,0.00032506092,0.0003957872,0.0003563286,0.00016916369,0.00015283628,0.007079861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977077,0.0010865569,0.00008410702,0.0003952173,0.00031443025,0.00041187654],"domain_scores_gemma":[0.9890842,0.008756496,0.00074437837,0.00032243252,0.0006433297,0.0004492189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028935075,0.0018162221,0.002221529,0.0014085424,0.0012569256,0.0023385778,0.0020067932,0.001566606,0.0031295817],"category_scores_gemma":[0.01681799,0.0013471716,0.00046267387,0.0014155209,0.0024931496,0.0031815264,0.0018390198,0.0013623306,0.0008291565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015681756,0.00019201223,0.0012870173,0.00058928976,0.00013521219,0.00024297263,0.0003682218,0.77387995,0.015001602,0.13598734,0.0068115396,0.063936606],"study_design_scores_gemma":[0.00014708156,0.00014929223,0.000292936,0.00006287551,0.000045026383,0.000104966304,0.000113153794,0.94769955,0.0022490276,0.047573026,0.0015321064,0.00003090887],"about_ca_topic_score_codex":0.0019261102,"about_ca_topic_score_gemma":0.00250635,"teacher_disagreement_score":0.0031295817,"about_ca_system_score_codex":0.0019670387,"about_ca_system_score_gemma":0.0019426155,"threshold_uncertainty_score":0.015302539},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08267403,0.0004816516,0.90209854,0.0015122043,0.00016412983,0.00018604271,0.00009759126,0.0031770659,0.009608696],"genre_scores_gemma":[0.7388748,0.0002271267,0.25760826,0.00037603822,0.000045368015,0.0001918159,0.00012025096,0.0002554531,0.0023009535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961506,0.0016781375,0.00012814192,0.00034810705,0.0014397352,0.00025530017],"domain_scores_gemma":[0.9897552,0.005892308,0.00051107915,0.0019056916,0.0015691264,0.00036649764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005366795,0.00045222856,0.0005069255,0.00054618693,0.0010429566,0.0014129531,0.0018254832,0.0013583661,0.0020091666],"category_scores_gemma":[0.021586258,0.00030151475,0.0003764304,0.0003538435,0.002668166,0.0027431468,0.0025273112,0.0020709194,0.0004348095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095215294,0.00040887584,0.002523245,0.00031527798,0.000064589956,0.00048319003,0.0009662653,0.44180736,0.05783149,0.3527752,0.005593792,0.13627855],"study_design_scores_gemma":[0.000059420443,0.00026202982,0.00017304189,0.000036957288,0.0000106327625,0.00010113418,0.000082150655,0.92655444,0.027043914,0.04065181,0.0049922615,0.00003222805],"about_ca_topic_score_codex":0.002716556,"about_ca_topic_score_gemma":0.0016695847,"teacher_disagreement_score":0.005366795,"about_ca_system_score_codex":0.0011698579,"about_ca_system_score_gemma":0.0017268971,"threshold_uncertainty_score":0.028382719},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3980714,0.0026447305,0.5856724,0.0006562244,0.00007299118,0.000065420754,0.00016180679,0.0003555388,0.012299555],"genre_scores_gemma":[0.9885958,0.00059871183,0.0094230585,0.00004156302,0.00001973672,0.000037449998,0.000046977028,0.0000443884,0.0011924063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981267,0.0006590806,0.00005846992,0.00013240364,0.0007355377,0.00028782376],"domain_scores_gemma":[0.9863695,0.010199313,0.00089156395,0.00047967344,0.0019365151,0.00012345854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037644568,0.0011548701,0.00087441725,0.000951542,0.00047855196,0.0010638396,0.0008534372,0.0010361588,0.0012190174],"category_scores_gemma":[0.018265441,0.0003231212,0.00031149067,0.00080009125,0.0015987775,0.0014868128,0.0014941591,0.000761701,0.0002655296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001768498,0.000031937278,0.0010448333,0.00008076368,0.000029966466,0.00011350004,0.00011089821,0.96422577,0.00431221,0.021669991,0.0002502638,0.00795292],"study_design_scores_gemma":[0.0000038949,0.000033191096,0.00016302707,0.000009477737,0.0000074078343,0.000030112491,0.000017985345,0.9959928,0.001043317,0.0026157396,0.00007393729,0.000009006821],"about_ca_topic_score_codex":0.0044056205,"about_ca_topic_score_gemma":0.0022843252,"teacher_disagreement_score":0.0044056205,"about_ca_system_score_codex":0.0018858784,"about_ca_system_score_gemma":0.001157166,"threshold_uncertainty_score":0.019908547},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033673596,0.0001817715,0.96542645,0.00014906199,0.000011520875,0.000027600716,0.000019314048,0.00012680623,0.00038381375],"genre_scores_gemma":[0.8763761,0.0003708586,0.122221276,0.000104499566,0.000040459014,0.00015103562,0.0000957762,0.000043174903,0.00059680775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719834,0.0015068721,0.000096448995,0.0002852508,0.0007888528,0.00012426723],"domain_scores_gemma":[0.96910614,0.02651934,0.0017331514,0.0013817854,0.001087342,0.00017230192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075268997,0.000759768,0.0009092179,0.0013615446,0.0005813609,0.001113488,0.0019252442,0.0009938685,0.0002750079],"category_scores_gemma":[0.038838204,0.0007366587,0.00046775703,0.0010408891,0.0029959437,0.0036783656,0.0016833962,0.0015937748,0.00009616356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001138929,0.000034990717,0.0014945,0.000047459063,0.000033130786,0.000060211572,0.00009669008,0.9450938,0.0013549058,0.031142252,0.00022778656,0.020300416],"study_design_scores_gemma":[0.000008821728,0.000011293745,0.00012918364,0.000004642734,0.0000042560587,0.000017501907,0.0000045126476,0.9804354,0.00062540395,0.018703561,0.00004983462,0.000005650344],"about_ca_topic_score_codex":0.0025977388,"about_ca_topic_score_gemma":0.0013576366,"teacher_disagreement_score":0.0075268997,"about_ca_system_score_codex":0.0013269223,"about_ca_system_score_gemma":0.0008774528,"threshold_uncertainty_score":0.039806545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116544485,0.0019866484,0.869837,0.0004366698,0.00010265244,0.00014026003,0.00015807833,0.00015141864,0.010642854],"genre_scores_gemma":[0.95939386,0.001538738,0.03583747,0.000076245844,0.000042008043,0.00013267717,0.000055811917,0.000031721615,0.002891585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937624,0.00024308322,0.000024399773,0.000086289736,0.00010577361,0.0001642014],"domain_scores_gemma":[0.998486,0.0009799749,0.00019831523,0.000121091325,0.00015063865,0.0000639975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001050659,0.0009610737,0.00074640487,0.0004917078,0.00052463583,0.0013989793,0.0012386062,0.0009747034,0.002184701],"category_scores_gemma":[0.003400595,0.00040830226,0.00048609386,0.0007027971,0.0009293093,0.0016178387,0.0011436163,0.00070904376,0.00022300072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003247425,0.000093658105,0.00062126934,0.0003211517,0.00008123092,0.0006196581,0.00022611754,0.82250255,0.011826619,0.13551141,0.0016073161,0.026264336],"study_design_scores_gemma":[0.000017726572,0.00007727829,0.00011502928,0.000017511447,0.000030635285,0.00011939579,0.00006454558,0.9842779,0.002195228,0.011994326,0.0010695038,0.00002081538],"about_ca_topic_score_codex":0.0028265023,"about_ca_topic_score_gemma":0.0025610682,"teacher_disagreement_score":0.0028265023,"about_ca_system_score_codex":0.0011676991,"about_ca_system_score_gemma":0.0010575816,"threshold_uncertainty_score":0.008472323},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018729048,0.015361535,0.90887547,0.0053703226,0.0014208851,0.000089852045,0.00009435363,0.00062264106,0.049435835],"genre_scores_gemma":[0.5592788,0.021670448,0.39174348,0.0029782474,0.004188091,0.0002968538,0.00015474022,0.0003238893,0.019365365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940014,0.00014516104,0.000029339715,0.000080222446,0.0002841625,0.000061005],"domain_scores_gemma":[0.9991392,0.0003300917,0.00008951766,0.0001818921,0.0002145407,0.000044720535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007790189,0.00071479124,0.0005944264,0.0006961308,0.0005878326,0.0017125518,0.0009932677,0.00102008,0.0029656643],"category_scores_gemma":[0.002427071,0.0002055326,0.00027649617,0.0008790323,0.0011759172,0.0037143396,0.0014101175,0.0015072433,0.0007705659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021572772,0.00015335789,0.001250059,0.0006910836,0.00010019688,0.0002608243,0.0005269866,0.029213425,0.086537234,0.4516194,0.010624242,0.41880745],"study_design_scores_gemma":[0.0001413542,0.00091385364,0.0016836048,0.00051268464,0.00018877286,0.0018869617,0.00022069163,0.19244216,0.054332945,0.29330477,0.45421067,0.00016149954],"about_ca_topic_score_codex":0.0003909732,"about_ca_topic_score_gemma":0.00042404115,"teacher_disagreement_score":0.0029656643,"about_ca_system_score_codex":0.0006107608,"about_ca_system_score_gemma":0.0004986138,"threshold_uncertainty_score":0.0099211335},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50125664,0.0019949868,0.48979205,0.00023917717,0.000031963667,0.000046010126,0.000039128026,0.00048747257,0.0061125793],"genre_scores_gemma":[0.9790757,0.0002605299,0.01993461,0.000020702719,0.0000038137198,0.000016349499,0.000011809988,0.000014287061,0.0006621623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912876,0.00035935867,0.000027225398,0.000087732435,0.0002998222,0.00009713391],"domain_scores_gemma":[0.99702686,0.0020984113,0.0002843121,0.00015714536,0.00040678956,0.000026471538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015547008,0.00067044987,0.0005632022,0.00052136165,0.0003320318,0.00069071393,0.00057804736,0.00078391744,0.0004780778],"category_scores_gemma":[0.006040618,0.00022331883,0.00018988879,0.0004219605,0.0007488596,0.000945797,0.0004241562,0.0002849091,0.0001817488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025933527,0.00005448855,0.0016436075,0.00010505438,0.000044261848,0.00017318921,0.00019485096,0.9328382,0.025092503,0.012404702,0.00029156706,0.026898319],"study_design_scores_gemma":[0.000016376058,0.00012732403,0.00038916033,0.000010817073,0.000017151604,0.0001252203,0.000041822517,0.98767173,0.009021594,0.0022723738,0.00029420137,0.000012262142],"about_ca_topic_score_codex":0.0016007205,"about_ca_topic_score_gemma":0.0017212164,"teacher_disagreement_score":0.0016007205,"about_ca_system_score_codex":0.00103368,"about_ca_system_score_gemma":0.0004393633,"threshold_uncertainty_score":0.008222103},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03178421,0.000404744,0.96624506,0.00008971357,0.000023369683,0.000017157883,0.000020610205,0.00011587808,0.0012991822],"genre_scores_gemma":[0.8945375,0.00060173345,0.1026418,0.00005615195,0.000062281055,0.000076664,0.00006382808,0.00001935416,0.00194064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994729,0.00014296702,0.000015432252,0.000103160266,0.00017674656,0.00008880233],"domain_scores_gemma":[0.99870217,0.00081883516,0.0001377687,0.00010657703,0.0002032324,0.000031467956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007487658,0.00064131676,0.00072471425,0.0002626289,0.00034202987,0.0005842377,0.0006306514,0.00067449996,0.0003617214],"category_scores_gemma":[0.0028773288,0.0003837585,0.00036398284,0.0004597111,0.00071273226,0.0008854855,0.00089393056,0.0006804279,0.00017329576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094929615,0.000026218542,0.0012691512,0.000074570315,0.000048179794,0.00032842968,0.00019437858,0.928768,0.008200049,0.011588968,0.0006359827,0.048771232],"study_design_scores_gemma":[0.0000049622186,0.000028272994,0.00016084206,0.0000032668245,0.0000074295413,0.00004561492,0.000014425815,0.9969908,0.001184822,0.0012481718,0.00030492875,0.0000063897364],"about_ca_topic_score_codex":0.00564724,"about_ca_topic_score_gemma":0.004171884,"teacher_disagreement_score":0.00564724,"about_ca_system_score_codex":0.00059810386,"about_ca_system_score_gemma":0.0010969662,"threshold_uncertainty_score":0.01122874},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058856256,0.00047794406,0.93752134,0.00022093534,0.00002533407,0.00003398736,0.000023267967,0.00006101753,0.0027799977],"genre_scores_gemma":[0.92401963,0.00039941535,0.073324144,0.00008448284,0.000036578258,0.00011548668,0.000036075824,0.000026127671,0.0019580277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947697,0.00019511633,0.000012127225,0.00004255216,0.00021997707,0.00005328784],"domain_scores_gemma":[0.9992805,0.0005127885,0.00006731628,0.000043885655,0.00008051135,0.000014966586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070976344,0.0005673779,0.00057524187,0.00031507623,0.0003204742,0.0004625385,0.00070789154,0.0007161143,0.0007054742],"category_scores_gemma":[0.0022099214,0.000202384,0.00025281485,0.0005767019,0.0005785878,0.00089151703,0.0007284686,0.0003974974,0.000104680345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007717282,0.000040284034,0.00023862459,0.000103255246,0.000025527697,0.00011545043,0.00007376766,0.92737496,0.0072375573,0.032924708,0.00064590847,0.031142855],"study_design_scores_gemma":[0.000011019727,0.000046133016,0.00006873446,0.0000053203526,0.000006735524,0.000034518114,0.000011595102,0.9878319,0.0011066578,0.010522085,0.0003507564,0.000004544502],"about_ca_topic_score_codex":0.0010307025,"about_ca_topic_score_gemma":0.0014510114,"teacher_disagreement_score":0.0010307025,"about_ca_system_score_codex":0.0005880976,"about_ca_system_score_gemma":0.00058194157,"threshold_uncertainty_score":0.004267037},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09922909,0.0011844354,0.8884877,0.00051919755,0.00017857623,0.00013961829,0.0003026189,0.0010702696,0.00888852],"genre_scores_gemma":[0.7345977,0.00076580705,0.2573929,0.00018858066,0.000112464564,0.000309396,0.00035773218,0.00016807296,0.006107343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930096,0.00017579686,0.000040981155,0.000104245824,0.00029833123,0.00007966011],"domain_scores_gemma":[0.9968059,0.0011127215,0.00047445766,0.00069582317,0.00074769696,0.00016340123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000910662,0.00070156244,0.0005141998,0.0007444705,0.00068913685,0.00058682804,0.00067759445,0.00066383235,0.0011625517],"category_scores_gemma":[0.0053239013,0.000253166,0.00039860787,0.00094885856,0.0008401125,0.0009831978,0.001049567,0.0010378294,0.00054163695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059298764,0.00011644692,0.0027692881,0.00018935472,0.00012185216,0.0006786533,0.00040129255,0.51643807,0.09111626,0.17906529,0.0072200224,0.20129052],"study_design_scores_gemma":[0.000044247256,0.00019761921,0.00074536697,0.00004319301,0.000041937306,0.0008516706,0.000019261739,0.9266354,0.028250843,0.02879743,0.014298373,0.00007461802],"about_ca_topic_score_codex":0.0014141303,"about_ca_topic_score_gemma":0.002075896,"teacher_disagreement_score":0.0014141303,"about_ca_system_score_codex":0.0008619307,"about_ca_system_score_gemma":0.0013167177,"threshold_uncertainty_score":0.006253779},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5430412,0.001724377,0.44893122,0.00031929617,0.000027482425,0.00012241566,0.00004052014,0.00021587081,0.0055775405],"genre_scores_gemma":[0.9853302,0.0003358138,0.01375322,0.000022313132,0.000009564286,0.000037567206,0.0000085778365,0.0000064961428,0.0004962389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992555,0.00044758452,0.000022136288,0.00006457956,0.00011183575,0.00009827074],"domain_scores_gemma":[0.99672735,0.0025819417,0.00028167345,0.00012935688,0.00020808632,0.00007161391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010839315,0.00070921576,0.00053394213,0.00055151293,0.0004228371,0.00054361887,0.00074525946,0.0010300536,0.0004009943],"category_scores_gemma":[0.004707119,0.0002420756,0.0002576829,0.0005193892,0.0010034259,0.0010088413,0.0004437433,0.0002838785,0.00013149403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013172996,0.000071242466,0.001260417,0.00007690001,0.000045649907,0.0005009406,0.00027015447,0.9456222,0.013593986,0.015002142,0.00026888776,0.023155628],"study_design_scores_gemma":[0.000048506085,0.00034950636,0.000479011,0.0000086000155,0.00004768544,0.00022298121,0.0001071263,0.9818865,0.004499201,0.011693027,0.0006367628,0.000020988547],"about_ca_topic_score_codex":0.0017418658,"about_ca_topic_score_gemma":0.001514692,"teacher_disagreement_score":0.0017418658,"about_ca_system_score_codex":0.0005143966,"about_ca_system_score_gemma":0.00024147671,"threshold_uncertainty_score":0.005732417},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088149786,0.00048223662,0.9086842,0.00013502808,0.000038944534,0.00007768674,0.00006289235,0.00019621398,0.0021729402],"genre_scores_gemma":[0.8328517,0.00041106823,0.1648404,0.000056375593,0.000037706977,0.00013543239,0.00010220498,0.000025490323,0.0015396101],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993882,0.00015553283,0.000033628636,0.000113759874,0.00024673433,0.00006212903],"domain_scores_gemma":[0.99853456,0.00051473407,0.00030126364,0.00014254323,0.00044344127,0.0000635051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005289317,0.0005884466,0.0004184182,0.00043848614,0.0003933539,0.00051629345,0.0007601011,0.00065366045,0.0007118267],"category_scores_gemma":[0.0020720016,0.00022141788,0.00029842614,0.00043880474,0.0005244241,0.0006180789,0.00043790197,0.0005031888,0.00022122815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037204256,0.000066196524,0.0018440704,0.0003208538,0.00011407264,0.0006267441,0.0004068165,0.6818278,0.1787969,0.05038851,0.0011017813,0.08413424],"study_design_scores_gemma":[0.00004293891,0.00026985776,0.00034621308,0.000019461377,0.000031112573,0.00037441755,0.00003332176,0.9625501,0.029431023,0.0052568656,0.0016113569,0.000033325992],"about_ca_topic_score_codex":0.0016547801,"about_ca_topic_score_gemma":0.002446889,"teacher_disagreement_score":0.0016547801,"about_ca_system_score_codex":0.00069550454,"about_ca_system_score_gemma":0.0010740156,"threshold_uncertainty_score":0.005046308},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028544132,0.0009297042,0.96681887,0.00022392381,0.00004678896,0.00001984153,0.000047358688,0.00011450507,0.0032548502],"genre_scores_gemma":[0.8974139,0.0023603318,0.091913246,0.00016632391,0.00010056837,0.000097844415,0.00014563324,0.00012328276,0.007678794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990644,0.00026837888,0.000036172285,0.00011713162,0.00041999522,0.00009400487],"domain_scores_gemma":[0.9945286,0.00396739,0.00046860447,0.00022614334,0.00074742944,0.0000618014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002565817,0.0009100296,0.0009582051,0.00073134305,0.00040445948,0.0016467096,0.000977451,0.0010486515,0.0016189327],"category_scores_gemma":[0.010381278,0.0003082728,0.00049897446,0.00084429036,0.001403308,0.0021010123,0.0011302615,0.0012368053,0.00033436526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004136035,0.000022262286,0.0006338226,0.00013626227,0.000034279972,0.00017822222,0.00018929441,0.87640244,0.0016985338,0.106014,0.00056000217,0.0140894735],"study_design_scores_gemma":[0.0000035905473,0.000013270067,0.00012530849,0.000014441534,0.000008284253,0.00007424418,0.00003330747,0.9773372,0.0006224965,0.021472655,0.00028515907,0.000010041334],"about_ca_topic_score_codex":0.0019418631,"about_ca_topic_score_gemma":0.0013586669,"teacher_disagreement_score":0.002565817,"about_ca_system_score_codex":0.0012064984,"about_ca_system_score_gemma":0.001063789,"threshold_uncertainty_score":0.013569474},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46351832,0.0018779245,0.5184237,0.0004486871,0.000024174344,0.00006563608,0.000116578245,0.00023998403,0.015285189],"genre_scores_gemma":[0.994713,0.0002369269,0.0042063654,0.000015832278,0.000007006669,0.000016140848,0.000021247806,0.000011921918,0.0007715536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918693,0.00033692303,0.00001641868,0.00009317887,0.00022868057,0.00013782833],"domain_scores_gemma":[0.9976138,0.0016128091,0.00022444423,0.00008269892,0.0004257136,0.000040499268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011349006,0.00078324653,0.00065347756,0.0003471849,0.00029370727,0.0008084687,0.0005431828,0.0008472819,0.00088098604],"category_scores_gemma":[0.003867583,0.00023996033,0.0002561981,0.00064109184,0.0006708564,0.0006426491,0.0006498877,0.0003329774,0.00021156478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007184452,0.000018393503,0.00041074186,0.0000380421,0.000021162878,0.00007129467,0.000056904093,0.98311156,0.0057254187,0.0043688403,0.00017232024,0.005933414],"study_design_scores_gemma":[0.0000048593006,0.000090190886,0.00027528594,0.000003983938,0.00000852659,0.000040610095,0.000033275956,0.99526227,0.0025067267,0.0016140322,0.00015357108,0.000006743608],"about_ca_topic_score_codex":0.0024010031,"about_ca_topic_score_gemma":0.0014299415,"teacher_disagreement_score":0.0024010031,"about_ca_system_score_codex":0.0008862954,"about_ca_system_score_gemma":0.00066502544,"threshold_uncertainty_score":0.0064305067},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41341838,0.0032749423,0.5561743,0.00080150476,0.00008662569,0.00007859134,0.00027604934,0.00026033708,0.025629135],"genre_scores_gemma":[0.99084574,0.0007635969,0.0071706213,0.00006690759,0.000043552922,0.000033371696,0.000029388442,0.000020309813,0.001026483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864036,0.0005623239,0.0000509983,0.00013097916,0.00035430942,0.00026110566],"domain_scores_gemma":[0.99283713,0.0056936513,0.000499652,0.0003247706,0.00047963412,0.00016521272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024925002,0.0011304801,0.00079694483,0.000922355,0.00073078397,0.0017335314,0.0006691489,0.000954623,0.0015894943],"category_scores_gemma":[0.009425363,0.0004799403,0.00044187505,0.0013206563,0.0014335554,0.0018531748,0.0013343246,0.00069919653,0.0003475737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047748451,0.00006937463,0.0020088148,0.0002440111,0.000095827694,0.0007452426,0.00039799788,0.7419724,0.026874358,0.1898584,0.0012905491,0.035965577],"study_design_scores_gemma":[0.000032078588,0.00020200759,0.00076341233,0.00004917218,0.000039864237,0.0009398244,0.00011788101,0.91914296,0.008625095,0.06941705,0.00061481,0.000055813995],"about_ca_topic_score_codex":0.0005566014,"about_ca_topic_score_gemma":0.00069555617,"teacher_disagreement_score":0.0024925002,"about_ca_system_score_codex":0.0015873702,"about_ca_system_score_gemma":0.0005307951,"threshold_uncertainty_score":0.013181746},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010729986,0.0014769245,0.97377807,0.00060486683,0.0000891194,0.000033019114,0.00014495224,0.000119167606,0.013023829],"genre_scores_gemma":[0.69972444,0.008123081,0.27090958,0.0014147934,0.0006367072,0.00047372386,0.00064241944,0.00038151824,0.017693803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811816,0.0005081087,0.00011176941,0.00028853037,0.00081656955,0.00015685149],"domain_scores_gemma":[0.9910176,0.006436465,0.0005735571,0.00062777684,0.0011266627,0.0002178884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042466912,0.0010953685,0.0011523997,0.002194733,0.0010412034,0.0022911036,0.0017029892,0.0011549784,0.002739424],"category_scores_gemma":[0.012391975,0.00052847987,0.0014043621,0.002818699,0.0041941423,0.0032977785,0.0030993815,0.004281177,0.00064471795],"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.00007936951,0.000035852303,0.00042737633,0.00014214305,0.000034414174,0.00038543207,0.00033544723,0.07906358,0.0038441122,0.87887067,0.0020995857,0.03468199],"study_design_scores_gemma":[0.000013586314,0.000060449966,0.00032041766,0.000082172126,0.0000122977035,0.0003936104,0.000055072396,0.34651646,0.002602934,0.6447896,0.005117463,0.000035979367],"about_ca_topic_score_codex":0.0018250393,"about_ca_topic_score_gemma":0.0010097221,"teacher_disagreement_score":0.0042466912,"about_ca_system_score_codex":0.0020330835,"about_ca_system_score_gemma":0.0016150859,"threshold_uncertainty_score":0.02245897},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0439063,0.001145598,0.948473,0.00027008346,0.00004236375,0.000078322875,0.000030141868,0.0002024887,0.005851703],"genre_scores_gemma":[0.8783672,0.0011255441,0.1179618,0.000101178324,0.000049782364,0.00018032307,0.000036889418,0.000014973242,0.0021623578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999215,0.00033750208,0.000026800306,0.00006170149,0.00024256282,0.00011641889],"domain_scores_gemma":[0.9984865,0.0009963984,0.00014824957,0.00015145043,0.00019306257,0.000024359015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001392831,0.0005095867,0.00037259274,0.0006305186,0.0005575207,0.00073308434,0.0008613758,0.0007733116,0.00054746337],"category_scores_gemma":[0.0036013557,0.00022593295,0.00027670452,0.0010175048,0.0011242909,0.0011534194,0.00081818766,0.0004609008,0.000119958124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001700668,0.000054516615,0.00095609453,0.00015359449,0.00005106244,0.0004615435,0.0003052036,0.7327302,0.015989644,0.15622585,0.001149596,0.09175267],"study_design_scores_gemma":[0.000019240719,0.00008335412,0.00021136503,0.000023796578,0.000025925809,0.0001644501,0.000035115234,0.96306247,0.0039255354,0.029971786,0.0024543817,0.000022560764],"about_ca_topic_score_codex":0.0056762616,"about_ca_topic_score_gemma":0.0058697443,"teacher_disagreement_score":0.0056762616,"about_ca_system_score_codex":0.0010454326,"about_ca_system_score_gemma":0.00093870657,"threshold_uncertainty_score":0.0112864375},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17704336,0.004110723,0.7948603,0.0017457814,0.00044391362,0.00011418969,0.00022796147,0.00075228687,0.020701548],"genre_scores_gemma":[0.95481235,0.001506172,0.041790627,0.00021427577,0.0002185418,0.00011943327,0.00008067599,0.00019067153,0.0010671517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99565,0.0024203027,0.0001672601,0.00021384735,0.0010247967,0.0005238349],"domain_scores_gemma":[0.9486873,0.043835655,0.0021346183,0.0029119207,0.0017468941,0.00068357674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005475996,0.0012769136,0.0007939848,0.0010628175,0.0012831473,0.0010610037,0.0018077915,0.0008941597,0.0015522446],"category_scores_gemma":[0.03420199,0.0007408913,0.0004838615,0.001394026,0.0020016883,0.004108187,0.0018494767,0.0017926643,0.00026789168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028032795,0.000084254774,0.0006455391,0.00016478893,0.00006222626,0.00021207539,0.00016525666,0.907626,0.0060750106,0.05890534,0.0010444463,0.024734754],"study_design_scores_gemma":[0.000048292633,0.0001881152,0.00046064256,0.00004531259,0.000066034394,0.00016907803,0.000055910965,0.94604087,0.00840725,0.04242086,0.0020528215,0.000044805405],"about_ca_topic_score_codex":0.0020212424,"about_ca_topic_score_gemma":0.0019365094,"teacher_disagreement_score":0.005475996,"about_ca_system_score_codex":0.0015269077,"about_ca_system_score_gemma":0.0016818006,"threshold_uncertainty_score":0.028960168},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045492105,0.0002025388,0.95128685,0.00015010065,0.000019664974,0.00003367017,0.00001905515,0.00009126892,0.0027048565],"genre_scores_gemma":[0.8304845,0.00027023547,0.16708635,0.000048804613,0.000021454432,0.00008683868,0.000032677275,0.000036518613,0.0019325174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995912,0.00017812279,0.000010373587,0.00004775296,0.00010589518,0.000066710294],"domain_scores_gemma":[0.9988967,0.00080131314,0.000101183614,0.00007470651,0.00009112959,0.000034920868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095079385,0.0003405501,0.00039349435,0.0003179935,0.00038698074,0.0005823622,0.0005992996,0.00041814704,0.0006589724],"category_scores_gemma":[0.0029720003,0.0002376235,0.00013935806,0.0005285333,0.0009076448,0.0008423048,0.00045621998,0.00048326945,0.0001049274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038326038,0.000028393462,0.00020549883,0.00002122708,0.0000043120945,0.000042454503,0.000035427984,0.9541313,0.0019288883,0.023444934,0.00038064955,0.01973859],"study_design_scores_gemma":[0.0000041854605,0.000007780929,0.000027629207,0.0000022275692,0.0000015086407,0.000010026878,0.0000051194993,0.9942405,0.0006648138,0.0048081353,0.0002263149,0.0000017636789],"about_ca_topic_score_codex":0.0030024385,"about_ca_topic_score_gemma":0.0031341042,"teacher_disagreement_score":0.0030024385,"about_ca_system_score_codex":0.00094301166,"about_ca_system_score_gemma":0.0013087515,"threshold_uncertainty_score":0.006842017},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77160245,0.00029910853,0.21850853,0.00030429725,0.00004761326,0.000068321526,0.000027148035,0.00022907412,0.0089134],"genre_scores_gemma":[0.9956955,0.000043446962,0.0038124975,0.00001877358,0.000009973894,0.0000111843965,0.000006320239,0.000011799094,0.0003905369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982686,0.00072849874,0.000064306674,0.0001533139,0.00047678483,0.0003085499],"domain_scores_gemma":[0.98712486,0.00878064,0.0010599298,0.0012325868,0.0012810973,0.000520895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020527323,0.0005256765,0.0006559795,0.0004432763,0.0010463728,0.001396546,0.00089967484,0.0008344805,0.00104573],"category_scores_gemma":[0.011852881,0.00025993478,0.0003141749,0.00038709474,0.001574439,0.0014901969,0.0010617378,0.0007885747,0.00018509351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012366314,0.00027206048,0.008931578,0.000094688185,0.00016338198,0.0010320581,0.00074202707,0.8412785,0.045686156,0.070844345,0.0006481238,0.029070504],"study_design_scores_gemma":[0.00005290662,0.0002999929,0.0010875118,0.00000549429,0.000046906163,0.00016938969,0.00010481218,0.985277,0.004617259,0.007906622,0.00041441785,0.000017701988],"about_ca_topic_score_codex":0.0025187992,"about_ca_topic_score_gemma":0.0011581266,"teacher_disagreement_score":0.0025187992,"about_ca_system_score_codex":0.0010861969,"about_ca_system_score_gemma":0.0007230813,"threshold_uncertainty_score":0.010856032},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033375088,0.00059581845,0.96221197,0.00017260648,0.00003599118,0.00003999846,0.000047410547,0.000078845915,0.003442392],"genre_scores_gemma":[0.87044984,0.00046999735,0.12565963,0.00008195917,0.0000625045,0.00016230998,0.000057860932,0.00003985399,0.0030160085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994289,0.00023343184,0.000020888596,0.00012181544,0.00011494877,0.00007995414],"domain_scores_gemma":[0.9990508,0.000696555,0.000098118406,0.000052338044,0.000068505644,0.000033696084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008641363,0.000671147,0.0009079614,0.00029844264,0.00040012828,0.0012873306,0.00083697314,0.00079856516,0.0011884092],"category_scores_gemma":[0.0018668106,0.00043123955,0.0003352146,0.0006824047,0.00075155235,0.001274852,0.00077146775,0.00056205486,0.0002956407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045008106,0.00004155838,0.00015879143,0.000043813474,0.000025096506,0.00009788867,0.000045442986,0.96324104,0.00206688,0.015737183,0.0004348311,0.018062524],"study_design_scores_gemma":[0.0000084560725,0.00001641931,0.00005760267,0.0000021546512,0.000005001941,0.000020089828,0.000012654242,0.9949055,0.00031167903,0.0043372787,0.00031895348,0.000004208379],"about_ca_topic_score_codex":0.0023033821,"about_ca_topic_score_gemma":0.0022821461,"teacher_disagreement_score":0.0023033821,"about_ca_system_score_codex":0.00083471474,"about_ca_system_score_gemma":0.000827041,"threshold_uncertainty_score":0.0060563087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017259333,0.0022891215,0.9691269,0.00041315387,0.000083224266,0.00007557729,0.000049229904,0.0000865615,0.010616986],"genre_scores_gemma":[0.84325075,0.00885123,0.13844973,0.00028322352,0.00039554673,0.00032717647,0.00007717563,0.000105777006,0.008259417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915314,0.0004468482,0.000025601827,0.00007008939,0.00024998403,0.00005435435],"domain_scores_gemma":[0.99858487,0.0011152528,0.000073572046,0.000052409116,0.0001541089,0.000019814912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012169611,0.0010687826,0.00078616623,0.0005277885,0.0005519421,0.0009547886,0.0008151124,0.0007978167,0.0017919],"category_scores_gemma":[0.004523252,0.00041724453,0.0003228339,0.0009123738,0.0012019468,0.0011425801,0.00082040805,0.00069277006,0.00040892785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023927065,0.000053904198,0.00041936076,0.00032564602,0.000043345055,0.00023997997,0.00027255426,0.7864347,0.00883542,0.13537377,0.0039268606,0.063835174],"study_design_scores_gemma":[0.000017476199,0.00007271147,0.00012573747,0.000024252173,0.000017131282,0.00009244258,0.00003586656,0.9703462,0.0013296531,0.026453916,0.0014694299,0.000015169112],"about_ca_topic_score_codex":0.001519938,"about_ca_topic_score_gemma":0.0015671729,"teacher_disagreement_score":0.0017919,"about_ca_system_score_codex":0.00097094453,"about_ca_system_score_gemma":0.00064478494,"threshold_uncertainty_score":0.0070447326},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015260115,0.0005921971,0.9809184,0.00014225977,0.00002786354,0.000026638336,0.000029812956,0.00017055926,0.002832228],"genre_scores_gemma":[0.5520085,0.0009211861,0.44200167,0.00021523127,0.000054132073,0.00011881167,0.000105997686,0.000043467357,0.0045309216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992422,0.0002416355,0.00004581561,0.000077795594,0.00033052516,0.000061956416],"domain_scores_gemma":[0.9989864,0.00045559416,0.00011198811,0.00016034795,0.000265749,0.000019903386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068547635,0.00063106086,0.00048198475,0.0006626229,0.00043547028,0.000629505,0.0007200745,0.00080076203,0.0010445835],"category_scores_gemma":[0.002917937,0.00029286396,0.00027236695,0.00066254585,0.00055938645,0.00097443,0.0010553127,0.0006861855,0.0005368773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031395716,0.00008505575,0.0015215286,0.000374477,0.00009162262,0.0004447731,0.0009418679,0.34833202,0.061447207,0.17595266,0.0024620453,0.40803275],"study_design_scores_gemma":[0.000023312246,0.00012205057,0.0002286269,0.000034179968,0.000022876004,0.0005037382,0.000057176352,0.9460237,0.016435843,0.030311393,0.0062032985,0.00003382228],"about_ca_topic_score_codex":0.0009781888,"about_ca_topic_score_gemma":0.001609584,"teacher_disagreement_score":0.0010445835,"about_ca_system_score_codex":0.00051028904,"about_ca_system_score_gemma":0.0007796134,"threshold_uncertainty_score":0.0037024617},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018019026,0.0015554309,0.9665249,0.00033266091,0.000036650134,0.000073048104,0.000098460405,0.00019303495,0.013166804],"genre_scores_gemma":[0.9398969,0.0028696863,0.049647223,0.00016196418,0.00014804513,0.00027761114,0.00012000683,0.00007741694,0.006801259],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988073,0.0004106084,0.000039258623,0.00014138545,0.00037953473,0.00022183101],"domain_scores_gemma":[0.9978423,0.0012916861,0.00026304708,0.00008023378,0.00046985658,0.00005290329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025246462,0.0021004595,0.0010474933,0.0011310041,0.00054385496,0.0019852114,0.0015085657,0.0011584979,0.0036085956],"category_scores_gemma":[0.0055768355,0.00056532363,0.00077210803,0.0011260594,0.0012567024,0.0014067274,0.0011216535,0.0010218039,0.00071927725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030720443,0.000019509529,0.00025769864,0.000059789174,0.000027484653,0.00012745065,0.00010314184,0.9379914,0.0015991346,0.050698478,0.0007882973,0.008296822],"study_design_scores_gemma":[0.0000034090256,0.000029746147,0.00009098285,0.000008348383,0.000008930962,0.000033914293,0.000022104025,0.9927335,0.00019009931,0.006530004,0.0003417934,0.0000071914865],"about_ca_topic_score_codex":0.007463055,"about_ca_topic_score_gemma":0.00355285,"teacher_disagreement_score":0.007463055,"about_ca_system_score_codex":0.0024852008,"about_ca_system_score_gemma":0.0014078163,"threshold_uncertainty_score":0.018031478},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22823389,0.0049583465,0.6469948,0.005603525,0.0005075003,0.00010190679,0.0006094472,0.00035060325,0.11263992],"genre_scores_gemma":[0.9487666,0.0030054855,0.041333236,0.00050671503,0.00042450946,0.00015862593,0.0001920643,0.00013942653,0.0054733623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793017,0.0007706307,0.000052888277,0.0002661116,0.0006565962,0.00032358844],"domain_scores_gemma":[0.9863687,0.011015653,0.0005642863,0.0012224753,0.0005345073,0.00029441348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022519801,0.00075298577,0.0007203542,0.0011236485,0.00080625876,0.002501649,0.0014904127,0.0014387099,0.0043288497],"category_scores_gemma":[0.016292188,0.00034959536,0.00062764675,0.0016763854,0.0028402468,0.005558026,0.0019536158,0.0025839624,0.00049047364],"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.00011619199,0.000021954324,0.00039070018,0.00011463292,0.000021680698,0.00008572086,0.000049084712,0.058306728,0.0022901827,0.91928774,0.0018845825,0.017430902],"study_design_scores_gemma":[0.000020790654,0.00006249125,0.0004667383,0.00004644159,0.000026766085,0.00024989896,0.00004331463,0.16551958,0.0020088507,0.8271889,0.0043414836,0.000024738607],"about_ca_topic_score_codex":0.0006513564,"about_ca_topic_score_gemma":0.00059813494,"teacher_disagreement_score":0.0043288497,"about_ca_system_score_codex":0.0020202363,"about_ca_system_score_gemma":0.00071492884,"threshold_uncertainty_score":0.014657915},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09222291,0.0003451263,0.90369916,0.00013458836,0.000020555915,0.00003609403,0.000059728573,0.00019033799,0.003291598],"genre_scores_gemma":[0.84569186,0.0003497261,0.15212806,0.000051209725,0.00002087586,0.00007449039,0.00015392622,0.000037452828,0.0014924847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999764,0.0000982231,0.000011948951,0.00004536126,0.00004979404,0.000030671046],"domain_scores_gemma":[0.9994875,0.00021456803,0.00009904408,0.00011451749,0.00006113159,0.000023270191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044787905,0.00051740144,0.00044182155,0.0002843387,0.0001842009,0.00031778286,0.0004660135,0.00029273581,0.0009616132],"category_scores_gemma":[0.0022007413,0.00017076837,0.0002169247,0.0005896877,0.00044032073,0.0007801073,0.0006612467,0.0003609894,0.0002716926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002377716,0.000034754277,0.000575107,0.00006296392,0.000017945298,0.00014868614,0.000092879534,0.85422057,0.030435324,0.030670837,0.0009326521,0.08257059],"study_design_scores_gemma":[0.00002478403,0.00016523752,0.00022919416,0.0000086506625,0.00001113547,0.00009875519,0.000025030757,0.9767377,0.00719449,0.0138925025,0.0015997533,0.0000127348485],"about_ca_topic_score_codex":0.00033808546,"about_ca_topic_score_gemma":0.0004841651,"teacher_disagreement_score":0.0009616132,"about_ca_system_score_codex":0.0003940304,"about_ca_system_score_gemma":0.00036853887,"threshold_uncertainty_score":0.0032168627},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020238675,0.0005212258,0.97004706,0.00048656593,0.000060394294,0.00007028983,0.000031687003,0.00006198591,0.008482063],"genre_scores_gemma":[0.92187023,0.0009320472,0.07216257,0.00013189358,0.0001206142,0.00014631108,0.000028563867,0.000041221305,0.0045664525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971033,0.0017912588,0.00007776029,0.0002483379,0.00050614093,0.00027327074],"domain_scores_gemma":[0.9977095,0.0017239915,0.00016972351,0.00011521013,0.00019693567,0.00008455522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028107706,0.0010979996,0.0014238002,0.0007264394,0.0008487801,0.0032010907,0.0020586543,0.0021114845,0.0019649297],"category_scores_gemma":[0.0070492285,0.00071546965,0.001101044,0.0012050592,0.002125489,0.00494731,0.0013397175,0.001461501,0.0002773553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046348567,0.00004689678,0.0003203973,0.000059230082,0.000038642374,0.0002442231,0.00012680549,0.69848835,0.0008844956,0.29028186,0.00077166915,0.008691102],"study_design_scores_gemma":[0.000011476449,0.000016822649,0.000051325092,0.00000579408,0.000009856795,0.000049958697,0.000030469868,0.9362899,0.00017866786,0.06278033,0.00056448317,0.00001094585],"about_ca_topic_score_codex":0.0038506985,"about_ca_topic_score_gemma":0.0028725155,"teacher_disagreement_score":0.0038506985,"about_ca_system_score_codex":0.0028450666,"about_ca_system_score_gemma":0.001496406,"threshold_uncertainty_score":0.02064246},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47246325,0.0012620542,0.5195923,0.00022945715,0.000029374463,0.00006859121,0.000064873566,0.00018938277,0.0061006923],"genre_scores_gemma":[0.98566854,0.00027769024,0.013346901,0.00001765385,0.000011207406,0.000029384317,0.000015168537,0.0000056091108,0.00062786875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993137,0.00033909973,0.000021873806,0.0000654092,0.00018881439,0.00007102532],"domain_scores_gemma":[0.99769175,0.0017014315,0.00018809472,0.00009343119,0.00029119846,0.000034134817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016444111,0.00081440626,0.00062885834,0.0004993546,0.00043746803,0.0007200996,0.0007336211,0.0007331155,0.0003670809],"category_scores_gemma":[0.0032629936,0.00031125822,0.00026486465,0.0007379917,0.00094569294,0.0007776068,0.00072370796,0.00026492955,0.00013291031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011661526,0.000031336982,0.00054137164,0.000056731496,0.000027593092,0.00019107845,0.000111671274,0.97354907,0.005406083,0.009365694,0.00017176631,0.010431048],"study_design_scores_gemma":[0.000007570402,0.000109735025,0.0001223536,0.0000037569428,0.000013974426,0.000052847332,0.000026305855,0.9950079,0.0014012447,0.00314652,0.000100860365,0.000006962067],"about_ca_topic_score_codex":0.0019048007,"about_ca_topic_score_gemma":0.0028764135,"teacher_disagreement_score":0.0019048007,"about_ca_system_score_codex":0.000864098,"about_ca_system_score_gemma":0.0004523299,"threshold_uncertainty_score":0.008696616},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10363296,0.0037649935,0.8624562,0.0008586943,0.000105707215,0.00015401767,0.0001899644,0.00048631342,0.028351128],"genre_scores_gemma":[0.94923383,0.0032302935,0.0440453,0.0001350343,0.0001369877,0.00049116893,0.00016416608,0.00010374907,0.002459406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952246,0.0022540546,0.00017443161,0.00032785,0.0012849563,0.0007341415],"domain_scores_gemma":[0.9800703,0.016149443,0.0011494786,0.0010256453,0.00132347,0.00028163168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052114786,0.0024400325,0.0014161377,0.0017166465,0.001183906,0.0032147877,0.0018409351,0.0015581932,0.0016075836],"category_scores_gemma":[0.022475716,0.0008899842,0.00078920537,0.0018549486,0.002440391,0.0034644934,0.0031091915,0.0019979873,0.0007682241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002644889,0.00011932078,0.00065264996,0.00052307564,0.000098644196,0.00042686384,0.0005759286,0.61609757,0.009275938,0.33641824,0.0020479532,0.033499327],"study_design_scores_gemma":[0.00007218257,0.00019816228,0.00024245752,0.0001287347,0.00006357563,0.00029959873,0.00016060745,0.76836056,0.0063343896,0.22206368,0.0020140097,0.000062010935],"about_ca_topic_score_codex":0.0006937115,"about_ca_topic_score_gemma":0.00047846074,"teacher_disagreement_score":0.0052114786,"about_ca_system_score_codex":0.0017925688,"about_ca_system_score_gemma":0.0009551812,"threshold_uncertainty_score":0.027561247},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03487434,0.0005254607,0.9563148,0.0004835119,0.00010217167,0.000052407515,0.00004004887,0.00022767631,0.007379689],"genre_scores_gemma":[0.8956817,0.00024987067,0.09966877,0.00015057602,0.000044328288,0.0000841325,0.000050165807,0.000033980028,0.0040365104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963975,0.0001305327,0.000013800584,0.000051189007,0.00010923134,0.0000554101],"domain_scores_gemma":[0.9997272,0.0001136476,0.00004018334,0.000036020352,0.00006523606,0.000017821676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004848421,0.00034702642,0.00045443006,0.0002246236,0.00034215054,0.0005124496,0.0005322293,0.0004581884,0.0014854268],"category_scores_gemma":[0.0010804567,0.000117485746,0.00013017797,0.00028954571,0.00047951977,0.0007933159,0.0006664075,0.00036991164,0.00023324213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033371392,0.000082502134,0.0007574841,0.00018211371,0.00006082131,0.00019156636,0.00017660968,0.7182363,0.016668903,0.1367991,0.0062877913,0.12022311],"study_design_scores_gemma":[0.000015433336,0.000042352905,0.000089680594,0.0000065454637,0.000004605309,0.000047155663,0.000017574097,0.98610026,0.001825898,0.010333842,0.0015105334,0.000006172242],"about_ca_topic_score_codex":0.0014873764,"about_ca_topic_score_gemma":0.0010492741,"teacher_disagreement_score":0.0014873764,"about_ca_system_score_codex":0.00055759994,"about_ca_system_score_gemma":0.0004265806,"threshold_uncertainty_score":0.004969299},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70061994,0.0033554416,0.28141478,0.00038359524,0.00006074054,0.000044989752,0.00021548895,0.0002720352,0.013633012],"genre_scores_gemma":[0.99215865,0.00048939185,0.0059446595,0.000019261604,0.000026860942,0.000019341105,0.000042595602,0.0000196803,0.0012795052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995277,0.00012184956,0.000014821723,0.000054030515,0.00017801841,0.00010360506],"domain_scores_gemma":[0.99627614,0.0030338662,0.00025902325,0.0001192277,0.00027194896,0.000039808056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009532796,0.00055540894,0.0003233394,0.00088778464,0.00028403878,0.00062890386,0.00044158346,0.00043929295,0.00074213615],"category_scores_gemma":[0.005913042,0.00019227662,0.00022577123,0.0008723347,0.0007130373,0.00078800344,0.0002794165,0.00036203364,0.00013728118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018394481,0.000035067067,0.0023449408,0.000077224424,0.00004048924,0.00024955088,0.000118948694,0.9359124,0.01491576,0.034805823,0.00025841634,0.011057454],"study_design_scores_gemma":[0.0000055923374,0.000052645915,0.0009355161,0.000007981311,0.000017397211,0.00008511116,0.000025331821,0.98814917,0.004798817,0.0054537733,0.0004608279,0.000007748347],"about_ca_topic_score_codex":0.0032303957,"about_ca_topic_score_gemma":0.0015788722,"teacher_disagreement_score":0.0032303957,"about_ca_system_score_codex":0.0021408745,"about_ca_system_score_gemma":0.00053054164,"threshold_uncertainty_score":0.015533268},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04673557,0.0007403217,0.94830173,0.00027618906,0.000027349945,0.00006841553,0.00003474906,0.00010769383,0.0037079917],"genre_scores_gemma":[0.9130142,0.00041748458,0.08349674,0.00012367965,0.000032005733,0.00023035404,0.000048848404,0.000032716544,0.0026040198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995788,0.00020035633,0.0000126526365,0.000047819314,0.00009039332,0.00006999671],"domain_scores_gemma":[0.99950814,0.0003084973,0.000054141903,0.000015990769,0.00008691158,0.000026428463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010730104,0.0009064595,0.0009644975,0.0006502077,0.00044305692,0.00085904385,0.00093775237,0.00094683707,0.0009185409],"category_scores_gemma":[0.0014237718,0.00040048794,0.00047942292,0.0008608777,0.00052586396,0.00066213054,0.00073860097,0.00049459166,0.00012390086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018523378,0.000016908907,0.00013768354,0.00001716742,0.000018840703,0.000022960567,0.000017168762,0.99196905,0.00042104695,0.0018743578,0.00020918608,0.0052771447],"study_design_scores_gemma":[0.000003238124,0.000008080844,0.000023670487,0.00000114851,0.0000029905623,0.000002776614,0.000003667211,0.999223,0.00006291138,0.0006105174,0.0000565216,0.000001475753],"about_ca_topic_score_codex":0.006876528,"about_ca_topic_score_gemma":0.006596043,"teacher_disagreement_score":0.006876528,"about_ca_system_score_codex":0.0013318,"about_ca_system_score_gemma":0.0010817477,"threshold_uncertainty_score":0.0136730075},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68190885,0.0025159298,0.28131035,0.00064191397,0.00011122044,0.00015651513,0.00041394046,0.0005267983,0.03241452],"genre_scores_gemma":[0.99298894,0.00037941308,0.0054814336,0.00004064699,0.00001575399,0.00002989288,0.00006436979,0.00003112491,0.00096844585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981501,0.00075431954,0.000036419187,0.00012329199,0.00057129754,0.0003645771],"domain_scores_gemma":[0.9877187,0.008730629,0.0007944936,0.0007405339,0.0018247727,0.00019076685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034667165,0.0010571575,0.00096435513,0.00089116197,0.000542162,0.00096494646,0.0009232523,0.0011637615,0.0014174702],"category_scores_gemma":[0.015122714,0.00024139545,0.00042762308,0.0011903334,0.0015282335,0.0009996821,0.0011357139,0.00068335125,0.00036842874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003492771,0.000053586573,0.0011802157,0.00009328986,0.00004407012,0.00019282845,0.00008582462,0.9683051,0.004126343,0.012033971,0.0010556468,0.012479873],"study_design_scores_gemma":[0.000013612195,0.00016097998,0.0003629773,0.000013236556,0.000012307496,0.00008025181,0.00003111337,0.9941214,0.0019621837,0.003018771,0.00020867692,0.000014452098],"about_ca_topic_score_codex":0.005887858,"about_ca_topic_score_gemma":0.0031069356,"teacher_disagreement_score":0.005887858,"about_ca_system_score_codex":0.0014064595,"about_ca_system_score_gemma":0.00097440067,"threshold_uncertainty_score":0.018333912},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03301143,0.0013668315,0.96019983,0.0001909228,0.00021908204,0.00013192339,0.00007259374,0.00058650697,0.0042210245],"genre_scores_gemma":[0.8143206,0.0009344773,0.18004712,0.00023399449,0.00012591193,0.00021329796,0.00010502714,0.000023000528,0.0039965995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962986,0.0000841905,0.000016622753,0.00006202959,0.00015375829,0.00005357755],"domain_scores_gemma":[0.99955815,0.000107322856,0.00005709743,0.000079573314,0.00015175446,0.00004605407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040252993,0.0005610941,0.00048087325,0.00039753036,0.00076074526,0.00040189514,0.0012548713,0.0005005799,0.0007200533],"category_scores_gemma":[0.0007187537,0.00017573519,0.00030193734,0.0006521325,0.00035268802,0.0007138624,0.0007901784,0.00047308704,0.00027746454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037927955,0.00028878843,0.0016433559,0.0005758238,0.00026426543,0.0008063761,0.00054830953,0.30300814,0.2248947,0.062320683,0.00819603,0.39707416],"study_design_scores_gemma":[0.00006434969,0.00055511505,0.0007509958,0.000018602743,0.00009017348,0.0007474229,0.000086412794,0.9530653,0.02522096,0.0076749832,0.011650457,0.00007523506],"about_ca_topic_score_codex":0.0013046588,"about_ca_topic_score_gemma":0.0030569285,"teacher_disagreement_score":0.0013046588,"about_ca_system_score_codex":0.00045955775,"about_ca_system_score_gemma":0.00053038716,"threshold_uncertainty_score":0.0033342838},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37734857,0.00390347,0.60147387,0.0005436125,0.0000641204,0.00007334851,0.00012437784,0.0001052193,0.016363418],"genre_scores_gemma":[0.98614836,0.0011835534,0.010788988,0.000032541553,0.000028667855,0.000035661255,0.00003595861,0.000029656701,0.0017166145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994437,0.00020504961,0.000027005814,0.00006206289,0.00018939102,0.00007263289],"domain_scores_gemma":[0.9956572,0.0031446076,0.0005053765,0.00017895269,0.0003996294,0.00011428085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011250741,0.00077319256,0.0004954252,0.0005744159,0.00025178742,0.0009039169,0.00048945897,0.0004283336,0.0008327708],"category_scores_gemma":[0.0058023175,0.0002693623,0.0002478477,0.00037880955,0.001173118,0.0014696283,0.00081261474,0.00073758356,0.00024450215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026981806,0.000054369528,0.002458322,0.00021250224,0.000063159314,0.00064289226,0.0007475076,0.69947153,0.02920839,0.2468564,0.0008312114,0.01918394],"study_design_scores_gemma":[0.000018892459,0.00007690995,0.00070088945,0.000022455428,0.000014072445,0.00038609648,0.00011447566,0.93650365,0.00530252,0.055729985,0.0010984525,0.00003155141],"about_ca_topic_score_codex":0.0006405431,"about_ca_topic_score_gemma":0.00024616194,"teacher_disagreement_score":0.0011831637,"about_ca_system_score_codex":0.0011831637,"about_ca_system_score_gemma":0.00031106806,"threshold_uncertainty_score":0.008584499},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48719454,0.0019023038,0.49585423,0.00034524247,0.00003060234,0.000091345675,0.00011436377,0.00048805328,0.013979401],"genre_scores_gemma":[0.9876052,0.00030522636,0.01155826,0.000019962017,0.000008806062,0.000019104229,0.00002742611,0.00000830068,0.0004476308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912614,0.0003234366,0.000025307916,0.00007129721,0.00031498898,0.00013888962],"domain_scores_gemma":[0.9956808,0.003029332,0.00031628605,0.00027204526,0.000638066,0.00006338341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001410351,0.00078650867,0.0004938667,0.00052468135,0.00033461337,0.00059180113,0.0007702954,0.00063146127,0.0009876993],"category_scores_gemma":[0.005042741,0.00017801057,0.00027000767,0.0005522146,0.000716613,0.00070248736,0.0005781934,0.00034885545,0.00018491005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005783072,0.00008231274,0.0043749586,0.00017717601,0.00014051242,0.0005995171,0.00029760698,0.8535591,0.046583243,0.03994904,0.00066224695,0.052995928],"study_design_scores_gemma":[0.000009172923,0.00023899124,0.00053300377,0.0000075973126,0.000037606795,0.00025570567,0.000028019207,0.98913425,0.007322843,0.002205002,0.00021339372,0.0000144796695],"about_ca_topic_score_codex":0.0021362444,"about_ca_topic_score_gemma":0.0020715324,"teacher_disagreement_score":0.0021362444,"about_ca_system_score_codex":0.00071934,"about_ca_system_score_gemma":0.00078334176,"threshold_uncertainty_score":0.0074587464},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41402748,0.0026467722,0.5688305,0.0003636789,0.00006273584,0.000036337504,0.00013799338,0.00043344527,0.013461076],"genre_scores_gemma":[0.9882265,0.0005000854,0.010689632,0.000049275666,0.000018367618,0.000012169128,0.000034874967,0.000009474652,0.00045965318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985965,0.00050686963,0.000046430403,0.00015700089,0.00047274336,0.00022049205],"domain_scores_gemma":[0.99668926,0.0022126879,0.00032801353,0.00020664644,0.00051127636,0.00005213233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016280597,0.0012403917,0.0007357012,0.0005784304,0.000512202,0.0010118734,0.00070569536,0.0010503117,0.0005982906],"category_scores_gemma":[0.0054541896,0.00029212996,0.00035930186,0.0009958849,0.0011870351,0.0012659421,0.0011823468,0.00046222386,0.00021353076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002861618,0.000044382366,0.002815346,0.00022186614,0.00014462502,0.00039824832,0.00029009278,0.9148429,0.019366039,0.022904772,0.0004992576,0.038186323],"study_design_scores_gemma":[0.00002069204,0.00022361412,0.0010038194,0.000029034554,0.0000868947,0.00041277622,0.000076075725,0.9754159,0.011793018,0.010354896,0.00054574374,0.000037580747],"about_ca_topic_score_codex":0.0019649477,"about_ca_topic_score_gemma":0.0018125863,"teacher_disagreement_score":0.0019649477,"about_ca_system_score_codex":0.0010805082,"about_ca_system_score_gemma":0.00077879406,"threshold_uncertainty_score":0.00861007},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11703212,0.0077247224,0.8149249,0.003727615,0.00028864283,0.0002416567,0.00031652304,0.00035420532,0.05538966],"genre_scores_gemma":[0.9518455,0.008995563,0.029951395,0.00039559288,0.0006086244,0.00026743373,0.00018398813,0.00014175868,0.007610145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839586,0.00068982196,0.00004971243,0.00018136199,0.00047864937,0.00020449306],"domain_scores_gemma":[0.98978895,0.007891084,0.0006985375,0.00048418014,0.00082294183,0.0003142436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020232373,0.0011495984,0.0010779795,0.0014730407,0.0012123447,0.0016820568,0.0012594903,0.0014139472,0.003350032],"category_scores_gemma":[0.016510235,0.00053455605,0.0005920906,0.0011416625,0.0041649207,0.0038657605,0.0027360353,0.0018323463,0.0004466371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077237724,0.000035857167,0.00058062666,0.00026063804,0.00002789099,0.0003128274,0.00025990087,0.5949302,0.0034658276,0.38859487,0.0018634344,0.009590666],"study_design_scores_gemma":[0.000013282138,0.00004421915,0.00024063177,0.000055783963,0.000013454862,0.000109761204,0.00006101643,0.8874488,0.00052950124,0.10972976,0.0017299748,0.000023728244],"about_ca_topic_score_codex":0.004155638,"about_ca_topic_score_gemma":0.0015780966,"teacher_disagreement_score":0.004155638,"about_ca_system_score_codex":0.0019590643,"about_ca_system_score_gemma":0.0012249185,"threshold_uncertainty_score":0.014214098},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19677877,0.0013004958,0.7805946,0.00088327465,0.000042702613,0.000084697094,0.00037515658,0.0004056984,0.01953459],"genre_scores_gemma":[0.98466045,0.00055689603,0.012584332,0.00006649024,0.00003925211,0.00008701039,0.00008213754,0.000034200075,0.00188934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989254,0.00042273258,0.000028216959,0.00011143433,0.00028663786,0.00022552793],"domain_scores_gemma":[0.9924354,0.0057736067,0.0003939599,0.00028149594,0.0010100245,0.00010549537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018698206,0.0008312901,0.000810109,0.0011528274,0.00053511607,0.0010590446,0.0009314509,0.00081779406,0.0019441553],"category_scores_gemma":[0.008985816,0.00033778726,0.0004325847,0.0009836967,0.001843154,0.001679439,0.0012141365,0.0007854664,0.00025385586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000688758,0.000016000691,0.0003153167,0.000043622418,0.000018303257,0.00013191548,0.000086062246,0.95606726,0.0022223757,0.035661828,0.0004953839,0.004873081],"study_design_scores_gemma":[0.0000033672475,0.000015767911,0.0000877007,0.0000060291354,0.000007267791,0.000040215884,0.000025556703,0.9924629,0.00060461764,0.006572318,0.00016586595,0.00000840868],"about_ca_topic_score_codex":0.0071751997,"about_ca_topic_score_gemma":0.003074592,"teacher_disagreement_score":0.0071751997,"about_ca_system_score_codex":0.002490854,"about_ca_system_score_gemma":0.0013102338,"threshold_uncertainty_score":0.018072426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04054595,0.00061534054,0.9539116,0.00030820488,0.000049747297,0.000033777047,0.000035677676,0.00012368076,0.0043760403],"genre_scores_gemma":[0.8503981,0.0010119902,0.14636743,0.00008740885,0.00006464738,0.000108488166,0.00007274644,0.000028444694,0.0018606763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995529,0.00019183168,0.000017328523,0.000031935986,0.0001749448,0.000031055784],"domain_scores_gemma":[0.9983511,0.00095801434,0.000116559866,0.00020114305,0.00033972022,0.00003360572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008284671,0.00030394347,0.00029325206,0.00056523125,0.0002584407,0.00044433505,0.0004743831,0.00032559098,0.00067916163],"category_scores_gemma":[0.0034118076,0.00012141551,0.00023831916,0.0008940115,0.0006981096,0.0007755417,0.00073791575,0.00039493767,0.00008097235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007721493,0.000015730324,0.00052935624,0.00009077289,0.00002164946,0.00010189358,0.00008758498,0.6388329,0.009364895,0.25135624,0.0009857888,0.09853586],"study_design_scores_gemma":[0.0000036832553,0.000028335313,0.00008692239,0.000006142451,0.000004546635,0.000037548605,0.000010959882,0.9592811,0.0011917143,0.038285732,0.0010581542,0.000005204914],"about_ca_topic_score_codex":0.0019586754,"about_ca_topic_score_gemma":0.0015324105,"teacher_disagreement_score":0.0019586754,"about_ca_system_score_codex":0.00065480644,"about_ca_system_score_gemma":0.00046034384,"threshold_uncertainty_score":0.004750967},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122795224,0.0008735211,0.86388916,0.00030973912,0.0000603464,0.00011424017,0.000052343075,0.00015368033,0.011751888],"genre_scores_gemma":[0.9215401,0.00033355918,0.07589726,0.000089447676,0.00004254228,0.00010377082,0.000028918033,0.000017202377,0.0019471621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817073,0.0007744026,0.00008705699,0.0001799988,0.0006096119,0.00017820636],"domain_scores_gemma":[0.9959073,0.0026211508,0.00032284134,0.00057220715,0.00047439625,0.00010211454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002608125,0.00057137205,0.00054052734,0.0006077448,0.00059782265,0.0011939246,0.0009777993,0.00060002663,0.0013285897],"category_scores_gemma":[0.0045753494,0.0002907712,0.00031148826,0.00047403385,0.0012211319,0.0019381709,0.0013945245,0.0006513691,0.0002460186],"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.0008654535,0.00015354712,0.0021495067,0.00029059823,0.00014501215,0.0006056426,0.0005875752,0.23559122,0.13212189,0.4462383,0.0014592938,0.17979197],"study_design_scores_gemma":[0.00005592955,0.00040896915,0.0003538167,0.000026572652,0.000070439775,0.0010641664,0.0000706583,0.85312825,0.048552476,0.092211924,0.003994813,0.00006204041],"about_ca_topic_score_codex":0.0003692218,"about_ca_topic_score_gemma":0.00041995427,"teacher_disagreement_score":0.002608125,"about_ca_system_score_codex":0.0005875242,"about_ca_system_score_gemma":0.0006421072,"threshold_uncertainty_score":0.01379323},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052249238,0.0002867466,0.9426639,0.00012053404,0.000039680413,0.0000487674,0.00002788582,0.00010388305,0.004459266],"genre_scores_gemma":[0.9334038,0.00017426605,0.06453495,0.000030490735,0.000012950753,0.00006603174,0.000024293016,0.000005714808,0.0017476525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972075,0.00008911249,0.000008696245,0.00002579088,0.000125678,0.000029929184],"domain_scores_gemma":[0.9995536,0.00021224978,0.000050943443,0.000048644983,0.00011873636,0.000015819893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044251405,0.0003889648,0.00028705626,0.00027197978,0.00026554608,0.0003715487,0.00072353415,0.00047687278,0.0007436788],"category_scores_gemma":[0.0013724419,0.00010883048,0.0002104215,0.00039213206,0.00048823556,0.00047472573,0.0004907409,0.0003781457,0.00014506973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014243413,0.00005653074,0.0004129278,0.000106008374,0.000029314677,0.00026329793,0.00014409992,0.77798384,0.027981516,0.12265796,0.0008941251,0.06932786],"study_design_scores_gemma":[0.0000092031905,0.000036788373,0.000043789845,0.000003125193,0.000005504724,0.00004054076,0.000006447826,0.9932835,0.0012456629,0.004834584,0.00048511775,0.0000056173544],"about_ca_topic_score_codex":0.0018695422,"about_ca_topic_score_gemma":0.002789279,"teacher_disagreement_score":0.0018695422,"about_ca_system_score_codex":0.00061286584,"about_ca_system_score_gemma":0.00054712145,"threshold_uncertainty_score":0.0044466853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036002595,0.00047159154,0.95855486,0.00027540806,0.00002008006,0.000023800314,0.000056223304,0.00013113301,0.0044643176],"genre_scores_gemma":[0.81183827,0.0007023974,0.1818518,0.00012779585,0.000052659867,0.00013827436,0.00009801008,0.00007862618,0.0051122434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994351,0.0002503755,0.000016806152,0.000051997566,0.00019251298,0.000053118532],"domain_scores_gemma":[0.99903274,0.00068161666,0.00011183321,0.000056622885,0.0000980604,0.000019142919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009939702,0.00079104403,0.0006051055,0.00031222563,0.00029354266,0.0006887062,0.00037835463,0.0006315771,0.0014304345],"category_scores_gemma":[0.0026222216,0.0003398024,0.0002668315,0.00057848444,0.0006882272,0.0007156514,0.0006380037,0.0004989114,0.0003322658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090443944,0.00002835834,0.00027156185,0.00008405231,0.000020157131,0.0000582795,0.00007171284,0.93533874,0.00646843,0.03349791,0.0005899078,0.023480486],"study_design_scores_gemma":[0.000006295933,0.000026143694,0.00006147347,0.0000040976074,0.0000028666377,0.00001704488,0.000007800537,0.99113256,0.0013374367,0.0071769427,0.00022251892,0.000004735255],"about_ca_topic_score_codex":0.0007568287,"about_ca_topic_score_gemma":0.00070991355,"teacher_disagreement_score":0.0014304345,"about_ca_system_score_codex":0.00081325736,"about_ca_system_score_gemma":0.00059747655,"threshold_uncertainty_score":0.0059006214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027693728,0.002710191,0.9593026,0.00052469096,0.00037803518,0.00018308233,0.0000668951,0.00038862773,0.008752113],"genre_scores_gemma":[0.7051589,0.002468711,0.27744475,0.00052960013,0.00024608398,0.00043343278,0.00015608655,0.00003885276,0.013523749],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959403,0.000118933145,0.000020397187,0.00007120743,0.0001503486,0.000045084365],"domain_scores_gemma":[0.99960905,0.00011676229,0.000048157697,0.00009150193,0.00010398977,0.00003059172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005044747,0.00043293822,0.00036573518,0.0003637624,0.0005507371,0.0004462709,0.0009257871,0.0007356261,0.000882902],"category_scores_gemma":[0.0010002146,0.00014295352,0.00031678434,0.00059563096,0.00048131513,0.0009447887,0.00094562443,0.0006519659,0.0004042662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003258806,0.00017429313,0.0006463201,0.00064280466,0.00014318638,0.0010112341,0.00061072287,0.08696872,0.20430975,0.29315645,0.013071597,0.39893913],"study_design_scores_gemma":[0.00011907945,0.0009247316,0.0007509019,0.000070967726,0.000115960334,0.0031578399,0.0001346691,0.8112929,0.038141638,0.062903255,0.082286336,0.00010176105],"about_ca_topic_score_codex":0.00029158013,"about_ca_topic_score_gemma":0.0005131261,"teacher_disagreement_score":0.0009257871,"about_ca_system_score_codex":0.00031911963,"about_ca_system_score_gemma":0.000489462,"threshold_uncertainty_score":0.002953589},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83317965,0.0022377113,0.16055983,0.00028113092,0.00009766072,0.000023715693,0.000091844166,0.00027944997,0.0032489542],"genre_scores_gemma":[0.99692315,0.0003233649,0.0024918239,0.000019465833,0.0000130066355,0.0000038714147,0.000008977297,0.0000087441,0.00020762348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932957,0.00023128079,0.000033525925,0.00009104535,0.00020197463,0.0001126805],"domain_scores_gemma":[0.9888832,0.009418879,0.0007158244,0.00030819318,0.0005863658,0.00008757709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012958408,0.00085613393,0.0005764279,0.00034833516,0.000452279,0.0007163918,0.0004344159,0.00063976523,0.00058968744],"category_scores_gemma":[0.009421201,0.0002171627,0.00018309263,0.00035077718,0.0007295475,0.001107654,0.000524112,0.0003921414,0.00010389958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008870092,0.000056701952,0.0038714197,0.00020208095,0.00006902506,0.0007403246,0.0002668998,0.9122648,0.051508464,0.0060502077,0.00021552002,0.023867521],"study_design_scores_gemma":[0.000047235215,0.0007865599,0.0027035342,0.00003296911,0.00013076772,0.00084267295,0.00014942576,0.9445528,0.046421703,0.0037055626,0.00056698563,0.000059766],"about_ca_topic_score_codex":0.0014047995,"about_ca_topic_score_gemma":0.0014486167,"teacher_disagreement_score":0.0014047995,"about_ca_system_score_codex":0.00077544124,"about_ca_system_score_gemma":0.00043374705,"threshold_uncertainty_score":0.0068531036},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07022333,0.0015649303,0.91879064,0.0007326798,0.000038163278,0.00007103086,0.00015983758,0.00046730167,0.007952159],"genre_scores_gemma":[0.94605297,0.0012465474,0.04931806,0.00017886703,0.00009463316,0.00020914011,0.00016831022,0.00011845378,0.002613112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99560297,0.0020741695,0.00013850458,0.00031504696,0.0013128497,0.0005564169],"domain_scores_gemma":[0.9727045,0.022690017,0.0014547737,0.00074620027,0.0021922186,0.00021224309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071460903,0.0016616067,0.0016620591,0.0014411721,0.0007277823,0.002315863,0.0012407268,0.0014943143,0.002059447],"category_scores_gemma":[0.0337737,0.0006807736,0.0005709926,0.0011741208,0.0027514268,0.0031303877,0.00259784,0.0013034894,0.00056758884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002275884,0.000030794017,0.0006581028,0.0001119114,0.00004736368,0.00015652741,0.00029415468,0.92175305,0.0032762825,0.059833493,0.00051936123,0.0130913155],"study_design_scores_gemma":[0.000011590346,0.00005887388,0.00012930957,0.000016278116,0.000013386669,0.000053692,0.000026583095,0.986541,0.0013148357,0.011641676,0.00017657928,0.000016196509],"about_ca_topic_score_codex":0.0022288011,"about_ca_topic_score_gemma":0.0009641286,"teacher_disagreement_score":0.0071460903,"about_ca_system_score_codex":0.0024848212,"about_ca_system_score_gemma":0.0016438398,"threshold_uncertainty_score":0.037792563},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07849862,0.00039907315,0.9184358,0.00016456541,0.000013072805,0.000023968012,0.000051167317,0.0001319622,0.0022818174],"genre_scores_gemma":[0.9172376,0.00040180597,0.07997839,0.000050785067,0.000026215486,0.000092914495,0.000063311985,0.000030032164,0.0021189363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882656,0.00065208727,0.00005226007,0.00013837105,0.00019345885,0.00013722826],"domain_scores_gemma":[0.998312,0.0011128421,0.00014125658,0.00017318511,0.0002142431,0.00004653441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020243302,0.0011459946,0.0011276309,0.00035616435,0.0002877248,0.0010560775,0.0006953358,0.001074896,0.00066928385],"category_scores_gemma":[0.0045657605,0.00056426774,0.0003969538,0.0007221671,0.0009330293,0.0011849756,0.0010513654,0.00050868886,0.00030502363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006922474,0.000019000692,0.0003177067,0.00003547844,0.000032847725,0.000059244838,0.00007392642,0.9756615,0.0023190337,0.007763458,0.00021793929,0.013430674],"study_design_scores_gemma":[0.000017604902,0.00005517076,0.0001003132,0.000005514364,0.000018892886,0.000029519095,0.000018502922,0.99028873,0.002048291,0.0072027235,0.00020721943,0.0000075131225],"about_ca_topic_score_codex":0.0018047815,"about_ca_topic_score_gemma":0.001958941,"teacher_disagreement_score":0.0020243302,"about_ca_system_score_codex":0.0005466033,"about_ca_system_score_gemma":0.0011414982,"threshold_uncertainty_score":0.010705829},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01014063,0.0010793936,0.9844774,0.00017776055,0.000026546824,0.000022562808,0.000021525417,0.00012827457,0.003926003],"genre_scores_gemma":[0.6814944,0.0026623285,0.31141743,0.00018645867,0.00018219932,0.00015899513,0.00007488034,0.00003948258,0.0037838921],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923,0.00036969126,0.000030882984,0.00008867287,0.0002282601,0.000052489457],"domain_scores_gemma":[0.99925524,0.00044393886,0.00012448091,0.00007523986,0.00008295752,0.000018177285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007961251,0.0006670719,0.00057640264,0.00026457792,0.00022430107,0.0007241201,0.00058564794,0.0006786938,0.0012879046],"category_scores_gemma":[0.0024052833,0.00036571533,0.00037174445,0.00053692213,0.00050142803,0.0009797805,0.00060125487,0.00061407586,0.0006967278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021607634,0.00007330603,0.00031195956,0.0003773088,0.00010415401,0.00037598156,0.00026668294,0.6818053,0.033230547,0.11047286,0.0024437513,0.17032205],"study_design_scores_gemma":[0.000031072148,0.00016327816,0.000118394375,0.000020964799,0.000027869526,0.0001840159,0.000023295679,0.9533002,0.0052745254,0.037876267,0.0029627148,0.000017409611],"about_ca_topic_score_codex":0.00029725846,"about_ca_topic_score_gemma":0.00038321177,"teacher_disagreement_score":0.0012879046,"about_ca_system_score_codex":0.000425551,"about_ca_system_score_gemma":0.00029115623,"threshold_uncertainty_score":0.004308462},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6516461,0.00092061935,0.33562407,0.00034523013,0.000046622095,0.00009048942,0.00011274292,0.00014705697,0.011067147],"genre_scores_gemma":[0.9894371,0.00016627696,0.009403869,0.00003471833,0.0000100294965,0.000027803522,0.000018870018,0.000004605073,0.00089669385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890745,0.0005212401,0.000028908513,0.0000969048,0.0002908693,0.00015454301],"domain_scores_gemma":[0.9940568,0.0043209656,0.0005501329,0.00032558164,0.00064028346,0.000106261934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016342688,0.001063526,0.000875695,0.00042691967,0.00045009327,0.0010316927,0.0009431626,0.0012053509,0.0007225926],"category_scores_gemma":[0.005224364,0.0002602383,0.00047220537,0.0011073204,0.0011348975,0.001503172,0.0011700357,0.00042989803,0.00019537659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013084372,0.00005135606,0.0011454028,0.000061809034,0.000054997112,0.00036977456,0.00011159343,0.9746841,0.0044349325,0.013303054,0.00014867968,0.005503431],"study_design_scores_gemma":[0.0000221522,0.00014866676,0.00019892103,0.0000062547538,0.000014837745,0.00012741997,0.000035160436,0.9934635,0.0018138958,0.0040009986,0.00015600183,0.000012241613],"about_ca_topic_score_codex":0.0024125597,"about_ca_topic_score_gemma":0.0021528392,"teacher_disagreement_score":0.0024125597,"about_ca_system_score_codex":0.00083785166,"about_ca_system_score_gemma":0.00080978946,"threshold_uncertainty_score":0.0086429715},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106175,0.00071372685,0.88843817,0.00019526009,0.000029111969,0.00007034667,0.00001622182,0.00019517165,0.0041670087],"genre_scores_gemma":[0.8972541,0.00028607686,0.10136894,0.000039841,0.0000166531,0.00007164141,0.000017340413,0.000012815183,0.0009324574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917406,0.00037867497,0.000041357118,0.000080589496,0.0002449437,0.000080392376],"domain_scores_gemma":[0.9977921,0.001419052,0.00029917818,0.00024098105,0.00018666896,0.00006203259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017320779,0.0005898797,0.0006142254,0.0006738055,0.00046448747,0.00086817297,0.0009121821,0.0005222482,0.00038645134],"category_scores_gemma":[0.0032379325,0.00031245314,0.00034567757,0.0005773558,0.0011388253,0.0010101147,0.0014004457,0.0005554781,0.000117921896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043748418,0.00013707676,0.0013942415,0.00019776606,0.00007494729,0.00042313815,0.0005332147,0.7107036,0.044068497,0.11245017,0.0009513366,0.12862852],"study_design_scores_gemma":[0.00004039683,0.0002247883,0.0001894074,0.000015084789,0.000025182575,0.00019730143,0.000037527654,0.9765371,0.007678594,0.014031407,0.0009955988,0.000027689],"about_ca_topic_score_codex":0.0005751788,"about_ca_topic_score_gemma":0.0006059019,"teacher_disagreement_score":0.0017320779,"about_ca_system_score_codex":0.00071836857,"about_ca_system_score_gemma":0.00066294253,"threshold_uncertainty_score":0.009160221},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10572754,0.0008869182,0.87344575,0.0009721347,0.00006434238,0.00010404234,0.00026145592,0.00025430173,0.018283483],"genre_scores_gemma":[0.914155,0.0010266153,0.078600384,0.000233516,0.00009260206,0.00025789608,0.00013870162,0.00007600671,0.0054192883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862826,0.0006121458,0.000048133435,0.00017366193,0.00032042398,0.00021744106],"domain_scores_gemma":[0.9954672,0.0030770663,0.00038239383,0.00059374265,0.00034185144,0.00013772928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023208184,0.0008297185,0.00072948105,0.0006215216,0.00078892644,0.0013642476,0.00078432885,0.0009942325,0.0033665344],"category_scores_gemma":[0.0076042716,0.0004128113,0.00062752346,0.0005655158,0.0027887512,0.0026904063,0.0014023327,0.0014501316,0.00051666563],"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.00010500123,0.000028239818,0.00019541266,0.000087272594,0.000018901024,0.00008841383,0.00019141512,0.08632521,0.0028873316,0.90090185,0.0012730717,0.007897874],"study_design_scores_gemma":[0.000032548724,0.000056790293,0.000098512166,0.000023182618,0.000015044601,0.000075986565,0.000037073954,0.49407205,0.0038320532,0.500088,0.0016447791,0.000023948824],"about_ca_topic_score_codex":0.001161167,"about_ca_topic_score_gemma":0.0008564036,"teacher_disagreement_score":0.0033665344,"about_ca_system_score_codex":0.001373403,"about_ca_system_score_gemma":0.0013005493,"threshold_uncertainty_score":0.012273788},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022752149,0.0010831162,0.96845925,0.0004620903,0.0000990384,0.00006064012,0.000044446017,0.00024070613,0.0067986683],"genre_scores_gemma":[0.79597425,0.0017592196,0.19725393,0.00022928217,0.00012357197,0.0003060621,0.00011212409,0.000056393084,0.004185183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885833,0.0005657848,0.000032926786,0.00009650863,0.00034794983,0.000098416975],"domain_scores_gemma":[0.9980925,0.001218227,0.00015829908,0.00019920016,0.0002986803,0.000033198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016262471,0.00033641307,0.00040983074,0.00046275792,0.00031919326,0.00054581976,0.000742872,0.000703142,0.0006850123],"category_scores_gemma":[0.0054323277,0.0002322947,0.0002332477,0.00072736386,0.0010871994,0.00093470165,0.0005635827,0.0007515398,0.00020956535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008840467,0.000026589478,0.00039100126,0.000060892187,0.000015547726,0.00013346378,0.00007463614,0.76281595,0.0044717626,0.20029147,0.0012727658,0.0303574],"study_design_scores_gemma":[0.000018760737,0.000026330998,0.00011885748,0.00001608963,0.000008414713,0.000047387977,0.000009159014,0.95894945,0.0013472693,0.037870727,0.0015701395,0.000017376511],"about_ca_topic_score_codex":0.004119494,"about_ca_topic_score_gemma":0.0027336786,"teacher_disagreement_score":0.004119494,"about_ca_system_score_codex":0.0008578733,"about_ca_system_score_gemma":0.0008824718,"threshold_uncertainty_score":0.008600533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0136587825,0.0002020671,0.9833429,0.00008337025,0.000022353535,0.00004921435,0.000020756059,0.00024129481,0.0023792842],"genre_scores_gemma":[0.4419215,0.00040764167,0.55371034,0.00012592168,0.000039756025,0.0004174814,0.00017454855,0.000108344844,0.0030944075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996057,0.00016339967,0.000011238068,0.000067727895,0.000091632515,0.000060386315],"domain_scores_gemma":[0.9994049,0.00039034503,0.000057629237,0.000052104704,0.00006712924,0.000027928922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009923049,0.0007652095,0.00074684917,0.00067950797,0.0005685049,0.0005648187,0.0011998644,0.0008201223,0.0020055233],"category_scores_gemma":[0.0017940062,0.00029225924,0.0006119387,0.00091017096,0.0006998629,0.00090824213,0.00084138947,0.0007260179,0.00029094148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004918195,0.000041249205,0.00031372963,0.000051612922,0.000035144796,0.000055398727,0.00009281957,0.91921943,0.0008980608,0.017163314,0.0012103629,0.060869616],"study_design_scores_gemma":[0.000018651363,0.000027975793,0.000050982915,0.000003970415,0.000007343189,0.000018218003,0.000018833536,0.9935284,0.00036574702,0.005060277,0.00089652056,0.000003068895],"about_ca_topic_score_codex":0.0047096666,"about_ca_topic_score_gemma":0.0042211064,"teacher_disagreement_score":0.0047096666,"about_ca_system_score_codex":0.0007938596,"about_ca_system_score_gemma":0.0012618173,"threshold_uncertainty_score":0.009364486},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71095866,0.0027128758,0.2711434,0.000733032,0.000043717504,0.000032043885,0.00022567318,0.00035564133,0.013794959],"genre_scores_gemma":[0.9965745,0.0003389534,0.0023627537,0.00002291264,0.000016986633,0.000008767917,0.000030475998,0.00001230973,0.00063235394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992725,0.0002781069,0.000024847868,0.00005177427,0.00022703469,0.00014559904],"domain_scores_gemma":[0.9934024,0.005139288,0.0004926163,0.00021766021,0.0006529823,0.00009504982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012618263,0.0006191293,0.0007585905,0.00070530747,0.000489112,0.00075547147,0.00052950095,0.0006936663,0.00092493446],"category_scores_gemma":[0.0074555045,0.0002646569,0.00025927095,0.0009244274,0.001103806,0.00071975146,0.0007187955,0.0005016972,0.0002016576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011321002,0.000018918265,0.002310695,0.00006722098,0.000028073444,0.00030248155,0.0002091306,0.97210824,0.00369003,0.0141861625,0.0004341079,0.0065316833],"study_design_scores_gemma":[0.0000037725022,0.00002837678,0.0005931969,0.0000060650937,0.000009759554,0.000097011995,0.000040992578,0.9961964,0.0005961408,0.002315268,0.000104640894,0.000008423553],"about_ca_topic_score_codex":0.0077047343,"about_ca_topic_score_gemma":0.003591184,"teacher_disagreement_score":0.0077047343,"about_ca_system_score_codex":0.0016635807,"about_ca_system_score_gemma":0.00076651294,"threshold_uncertainty_score":0.015319765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062281534,0.0014665559,0.92798656,0.0003066954,0.000041000298,0.000041010153,0.00006690897,0.000284687,0.0075249923],"genre_scores_gemma":[0.9621966,0.0015197685,0.033167906,0.0000971346,0.00009673617,0.00012865533,0.00006678804,0.00008723114,0.0026391791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999064,0.00023415626,0.000031091553,0.000147276,0.0004015092,0.00012194633],"domain_scores_gemma":[0.99588203,0.0026864975,0.00047772887,0.00024668628,0.0006213308,0.000085686464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018485122,0.0006411985,0.0007571746,0.0010707745,0.00047988034,0.0007984609,0.0009966295,0.00065952283,0.001193763],"category_scores_gemma":[0.01050051,0.00034350183,0.0003962266,0.0008606108,0.0013572541,0.001997566,0.0007917333,0.0008470382,0.00032372554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056870405,0.000034049608,0.00071331405,0.0001654355,0.00003059423,0.00018399971,0.00013114637,0.87499493,0.007903502,0.10485468,0.0005513933,0.010380089],"study_design_scores_gemma":[0.0000028116765,0.000020281752,0.00024217235,0.000009029676,0.000006946911,0.000053780543,0.000017120501,0.9803376,0.0007068099,0.01826086,0.00033699983,0.00000562681],"about_ca_topic_score_codex":0.001902044,"about_ca_topic_score_gemma":0.00084000605,"teacher_disagreement_score":0.0023544442,"about_ca_system_score_codex":0.0023544442,"about_ca_system_score_gemma":0.00082851877,"threshold_uncertainty_score":0.01708275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4896412,0.002306826,0.49623913,0.0004149826,0.00002544633,0.000041320098,0.00014958506,0.00029907472,0.010882439],"genre_scores_gemma":[0.9908565,0.0005151729,0.0076960386,0.00002783698,0.00001333711,0.000022886856,0.000039907736,0.000015180066,0.0008131649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990829,0.00035902535,0.000025210613,0.000085877145,0.00031059794,0.00013633943],"domain_scores_gemma":[0.9943351,0.00415438,0.0004699278,0.00021332352,0.00075918017,0.00006807626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015074722,0.0009076561,0.00073664996,0.00084077084,0.0004960946,0.0009989139,0.0005251694,0.0008089449,0.0010341766],"category_scores_gemma":[0.0075573376,0.0002639586,0.0003313137,0.0007401032,0.0009403322,0.0010484882,0.0007697256,0.00042578595,0.00023112578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106706335,0.000016910388,0.0013218027,0.00006142392,0.000032240336,0.00014783448,0.00012609008,0.97162163,0.005099317,0.010702443,0.00016674759,0.01059696],"study_design_scores_gemma":[0.00000492827,0.000067272194,0.0006889976,0.000010379963,0.00001788557,0.0000985968,0.000035905374,0.9930078,0.0019957144,0.0039053755,0.00015387117,0.000013236856],"about_ca_topic_score_codex":0.0033131184,"about_ca_topic_score_gemma":0.0023040562,"teacher_disagreement_score":0.0033131184,"about_ca_system_score_codex":0.0016107683,"about_ca_system_score_gemma":0.0006740639,"threshold_uncertainty_score":0.01168704},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18767974,0.0004651772,0.80902714,0.00018430628,0.000034949397,0.000070761635,0.000037506532,0.00021817994,0.00228233],"genre_scores_gemma":[0.9502644,0.00013572293,0.04852798,0.000032686898,0.000029219507,0.00005334384,0.000026112884,0.000024730185,0.0009057537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911517,0.00034315587,0.0000395419,0.00014033016,0.00021301325,0.00014886314],"domain_scores_gemma":[0.9973833,0.0017379572,0.00026113412,0.00016319864,0.00032465925,0.00012967292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017301851,0.0005346605,0.00074850186,0.00054311,0.0005969398,0.0006012892,0.0008788564,0.0005944864,0.00052751764],"category_scores_gemma":[0.004744659,0.00039520333,0.00021816342,0.0006090919,0.0009629623,0.0008945087,0.00074778387,0.00047363213,0.00014090915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030195917,0.00008173095,0.0006447769,0.000036230344,0.00002334402,0.00012352121,0.00023811539,0.9372611,0.011632064,0.015422565,0.0004907324,0.033743795],"study_design_scores_gemma":[0.000015457947,0.000032118987,0.00007431761,0.0000014642695,0.0000033130543,0.000017761538,0.000019922187,0.9945528,0.0010101096,0.004134113,0.00013323518,0.000005432448],"about_ca_topic_score_codex":0.0047292197,"about_ca_topic_score_gemma":0.0033361046,"teacher_disagreement_score":0.0047292197,"about_ca_system_score_codex":0.0011633559,"about_ca_system_score_gemma":0.0010966909,"threshold_uncertainty_score":0.009403348},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050822254,0.0019756919,0.94420946,0.00022938609,0.000072362585,0.00006705344,0.00003817942,0.0003092871,0.002276379],"genre_scores_gemma":[0.8955953,0.0008741177,0.10171935,0.00013825342,0.00014057785,0.000072024195,0.000045864348,0.000022744658,0.0013918177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992575,0.00030418643,0.000042534335,0.000097798795,0.00023093552,0.000067011824],"domain_scores_gemma":[0.99873155,0.0006347336,0.0001942961,0.00022147344,0.00017787729,0.000040068775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011097054,0.00070182857,0.0006511019,0.00036962715,0.0004993356,0.00056153414,0.0009604901,0.0004268552,0.00103972],"category_scores_gemma":[0.002033067,0.00025325824,0.00027492738,0.00043464213,0.00067237107,0.0009935398,0.00060794665,0.0004814081,0.00024767005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048822176,0.00017485909,0.0015155765,0.000445522,0.000114358736,0.00041994988,0.00057044456,0.43956688,0.06403392,0.107404746,0.0031195604,0.38214597],"study_design_scores_gemma":[0.00009036952,0.00042234495,0.00060776476,0.000032462205,0.000052211955,0.00041616266,0.00004468874,0.9606017,0.009991896,0.022437224,0.005244834,0.000058317957],"about_ca_topic_score_codex":0.0005611414,"about_ca_topic_score_gemma":0.0011907836,"teacher_disagreement_score":0.0011097054,"about_ca_system_score_codex":0.0005530479,"about_ca_system_score_gemma":0.00038071076,"threshold_uncertainty_score":0.005868733},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19990925,0.003654357,0.77206755,0.0006541334,0.000057989084,0.00008706903,0.00020468433,0.00038777787,0.02297719],"genre_scores_gemma":[0.9781933,0.0014251132,0.01695205,0.00005095152,0.000050046576,0.00006198023,0.0000728577,0.000041853058,0.003151832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989969,0.00033591487,0.000037476348,0.00012716968,0.0003416368,0.0001608227],"domain_scores_gemma":[0.9949203,0.0036964251,0.0004293878,0.0002625381,0.0006231133,0.00006817663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016712548,0.0008376018,0.0005734327,0.0009948366,0.00035507217,0.0010617145,0.0005885468,0.0005452878,0.0013601047],"category_scores_gemma":[0.0070352675,0.0003050396,0.00046612392,0.00063742296,0.0010006393,0.0010584777,0.00064148795,0.0007562105,0.00033126507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086729575,0.000024523955,0.00095441524,0.00008773241,0.00004551233,0.00014611775,0.0001739859,0.89494544,0.0071244366,0.0816213,0.00059862586,0.014191171],"study_design_scores_gemma":[0.0000032185628,0.00003838446,0.00031615433,0.000008390356,0.000010619439,0.000059327936,0.000013944034,0.9916157,0.0013730603,0.0062668053,0.00028387958,0.000010563441],"about_ca_topic_score_codex":0.0037168919,"about_ca_topic_score_gemma":0.0014312678,"teacher_disagreement_score":0.0037168919,"about_ca_system_score_codex":0.0020207604,"about_ca_system_score_gemma":0.0010578759,"threshold_uncertainty_score":0.014661729},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21534291,0.0033381828,0.75929654,0.00031408636,0.00004789256,0.00005087102,0.0003739427,0.00053156004,0.020704025],"genre_scores_gemma":[0.98931956,0.0011836616,0.007895346,0.000027635246,0.000047064266,0.00004343801,0.00014457495,0.000037344336,0.0013013327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918073,0.00024603185,0.00003490043,0.000052474905,0.00029562812,0.00019019467],"domain_scores_gemma":[0.9952583,0.0033731996,0.0003294879,0.00026622653,0.00070505985,0.00006767409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012346697,0.00071326125,0.0005380938,0.001210751,0.0003521328,0.000908771,0.0006181897,0.00037524378,0.0015953705],"category_scores_gemma":[0.0069844318,0.0002336949,0.00036261306,0.0011091976,0.0012060433,0.0011314136,0.00063170417,0.000495518,0.0003434586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043125176,0.000009771535,0.0005377172,0.00005620771,0.000030943396,0.00014218903,0.00013114966,0.9074309,0.0026478337,0.07758695,0.0005889054,0.010794166],"study_design_scores_gemma":[0.0000019376932,0.000013059681,0.00036620372,0.0000151453205,0.00001058577,0.00008098921,0.00002853291,0.97891325,0.0013336224,0.01871437,0.0005072607,0.00001511365],"about_ca_topic_score_codex":0.0032956959,"about_ca_topic_score_gemma":0.0016088133,"teacher_disagreement_score":0.0032956959,"about_ca_system_score_codex":0.0015549044,"about_ca_system_score_gemma":0.00079855265,"threshold_uncertainty_score":0.011281669},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100715846,0.004703379,0.8827293,0.00063766504,0.00007150304,0.000051162842,0.00011324266,0.00024867253,0.0107293185],"genre_scores_gemma":[0.9518265,0.0031276864,0.041369,0.00013681616,0.00007359592,0.00014602752,0.00008421832,0.000097087344,0.0031390523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982224,0.00079035456,0.000069375885,0.00020744586,0.0005615932,0.00014887885],"domain_scores_gemma":[0.9945187,0.0042696497,0.00040775214,0.0003244194,0.00043471498,0.00004483741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028426882,0.00093660987,0.00094755855,0.0008334979,0.000335638,0.0010547377,0.001123481,0.0010331091,0.0008932746],"category_scores_gemma":[0.011926165,0.0004019446,0.00029893697,0.0015222774,0.0011739766,0.002312296,0.0009801699,0.0005624295,0.00030005912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008226936,0.00003519672,0.0006956936,0.00013382282,0.00003401313,0.00008842719,0.000072279894,0.9353127,0.0034750379,0.03805105,0.00047003452,0.021549532],"study_design_scores_gemma":[0.000009734288,0.000081245074,0.00042229038,0.000018160204,0.0000147151395,0.00008554357,0.000036532405,0.9735178,0.0019172195,0.023251742,0.00063304754,0.00001200946],"about_ca_topic_score_codex":0.000771165,"about_ca_topic_score_gemma":0.00068931654,"teacher_disagreement_score":0.0028426882,"about_ca_system_score_codex":0.000989205,"about_ca_system_score_gemma":0.0005536468,"threshold_uncertainty_score":0.0150337815},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7186753,0.009616932,0.24080074,0.00075422385,0.00039946052,0.00053973787,0.00022764166,0.0012295645,0.027756404],"genre_scores_gemma":[0.9725165,0.0012013096,0.024426982,0.00006267872,0.00004079326,0.00016298422,0.00015048584,0.000036701207,0.001401676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968532,0.0010848397,0.00015643622,0.0002522191,0.0012644264,0.00038901766],"domain_scores_gemma":[0.9898398,0.0066119647,0.0006691065,0.0008464984,0.0017063713,0.00032638037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037341642,0.00085048995,0.0008537003,0.0016518122,0.00075186364,0.0011812121,0.0011708111,0.00082634855,0.0009724689],"category_scores_gemma":[0.0103546325,0.0002373097,0.0003632736,0.0013967295,0.00074430165,0.0016575435,0.0009492655,0.0007123608,0.00018844531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002683464,0.0009390726,0.005818714,0.0006111787,0.00039152158,0.00021255581,0.00041204426,0.66228503,0.0319402,0.031244487,0.003675617,0.2597862],"study_design_scores_gemma":[0.00008927818,0.0011772622,0.0012176957,0.000021021431,0.000086708904,0.00018385638,0.00015299142,0.978378,0.013380864,0.0032275387,0.002037228,0.000047593552],"about_ca_topic_score_codex":0.0025477526,"about_ca_topic_score_gemma":0.0017072983,"teacher_disagreement_score":0.0037341642,"about_ca_system_score_codex":0.0017947997,"about_ca_system_score_gemma":0.0013327034,"threshold_uncertainty_score":0.01974845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014979775,0.004162529,0.97120947,0.00041540203,0.00012660954,0.00010555153,0.00045917978,0.0002759074,0.008265599],"genre_scores_gemma":[0.6605684,0.015609408,0.305181,0.00053891726,0.0005410121,0.0009951543,0.001548947,0.00027128533,0.014745965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982268,0.00059215433,0.00010585689,0.00017740396,0.00069520803,0.00020257964],"domain_scores_gemma":[0.983286,0.012932767,0.0012093186,0.00053156563,0.0019227427,0.00011759348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004822293,0.002017263,0.0015270741,0.0017210877,0.00066276407,0.0026275932,0.0018607766,0.0019750043,0.004502336],"category_scores_gemma":[0.025880551,0.00073687045,0.0006823306,0.0017691356,0.0021390275,0.0028223833,0.0012559114,0.0018823881,0.0010062337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009621547,0.00008381841,0.0008905834,0.00055793615,0.000077595396,0.00030059612,0.00036540546,0.6691912,0.0028260767,0.27216005,0.005304519,0.04814607],"study_design_scores_gemma":[0.000029454859,0.00007365447,0.00048972614,0.0001261974,0.000055984005,0.00039979548,0.00009843619,0.88282263,0.0016244244,0.11110039,0.0031185986,0.000060716306],"about_ca_topic_score_codex":0.0019191122,"about_ca_topic_score_gemma":0.0026986392,"teacher_disagreement_score":0.004822293,"about_ca_system_score_codex":0.002168088,"about_ca_system_score_gemma":0.0013972617,"threshold_uncertainty_score":0.02550304},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049290727,0.001592722,0.98850006,0.00027279044,0.00008789133,0.00004847349,0.00001268963,0.00008066931,0.0044755745],"genre_scores_gemma":[0.38493168,0.0066425456,0.5999201,0.00035825418,0.00036431063,0.00049525365,0.00007380212,0.00007293673,0.007141072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894875,0.00041834987,0.000037067664,0.000096952426,0.0004350501,0.00006392594],"domain_scores_gemma":[0.99871576,0.0007512236,0.00011157118,0.00021000051,0.00018395329,0.000027576196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013367363,0.0007276942,0.000496567,0.00085790356,0.0005542427,0.0007688064,0.0012204441,0.00091204,0.0011580284],"category_scores_gemma":[0.0031427448,0.00033369684,0.0005092829,0.001049463,0.0017004439,0.0019667551,0.0017494246,0.0013095358,0.00037803792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009590322,0.000074342366,0.0003507487,0.0005701959,0.00009147616,0.00035871964,0.0005543457,0.25394833,0.028129213,0.5515796,0.0027353773,0.16151173],"study_design_scores_gemma":[0.000058222235,0.00021818426,0.00022124089,0.00016009794,0.00006768805,0.0008939004,0.0001278204,0.7415677,0.014208222,0.2098169,0.032584593,0.000075456126],"about_ca_topic_score_codex":0.00081053714,"about_ca_topic_score_gemma":0.0010247022,"teacher_disagreement_score":0.0013367363,"about_ca_system_score_codex":0.0007098422,"about_ca_system_score_gemma":0.0006424007,"threshold_uncertainty_score":0.007069409},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16059501,0.0016776264,0.83151925,0.00019749491,0.00007634254,0.00005603186,0.000035246463,0.0006568489,0.005186097],"genre_scores_gemma":[0.972475,0.00028481893,0.026493223,0.000042002055,0.000033766955,0.000019886096,0.000012043181,0.0000136804365,0.0006256889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996791,0.00010231133,0.000010513522,0.000061642604,0.000091636444,0.000054877335],"domain_scores_gemma":[0.9996642,0.00015070714,0.000051248582,0.00005019541,0.000060379774,0.000023277653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004472675,0.00042869223,0.000376509,0.0003851793,0.0004639989,0.00037923286,0.00062986003,0.0003526167,0.0005416886],"category_scores_gemma":[0.000871739,0.00012272465,0.0002886846,0.0004284743,0.0005881747,0.00053483684,0.00049507443,0.00026506017,0.00014362534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055750995,0.00019524133,0.0020183674,0.00015442887,0.00013132232,0.0006259776,0.00055687205,0.72744334,0.0814963,0.02282903,0.002178134,0.1618135],"study_design_scores_gemma":[0.00002080808,0.00013791189,0.0004026559,0.000004945983,0.000031914504,0.00017202905,0.000035350302,0.9861893,0.008637379,0.0029764092,0.0013703088,0.000021084224],"about_ca_topic_score_codex":0.0030683677,"about_ca_topic_score_gemma":0.0035918052,"teacher_disagreement_score":0.0030683677,"about_ca_system_score_codex":0.00055870035,"about_ca_system_score_gemma":0.00033249363,"threshold_uncertainty_score":0.006101012},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.402493,0.0025560171,0.58062416,0.00044606128,0.000032208354,0.000099118115,0.00015714676,0.0005945023,0.0129977735],"genre_scores_gemma":[0.9928433,0.00045898595,0.0058387727,0.00002735977,0.000016065276,0.000034397577,0.00003053263,0.000015036292,0.0007356329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880886,0.00047016324,0.000040269246,0.000117285505,0.00038834344,0.0001750967],"domain_scores_gemma":[0.99460286,0.0037946915,0.00043477208,0.00020623096,0.0008916365,0.00006976992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018762882,0.0011088954,0.00085646973,0.00089100405,0.0005442138,0.0010186946,0.0005291059,0.0008284296,0.0011786282],"category_scores_gemma":[0.0072178375,0.00028643652,0.00040559002,0.0007310939,0.0009937013,0.00088765775,0.00083453703,0.0004428312,0.0002893211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012425063,0.000028159286,0.0015842152,0.000087505905,0.000055873177,0.00024790392,0.00018980555,0.96511316,0.010758802,0.00969255,0.00030418352,0.01181359],"study_design_scores_gemma":[0.0000052380865,0.00012186392,0.00047131002,0.000010173671,0.000024520783,0.00014536543,0.000048018195,0.9947811,0.002217254,0.0020022718,0.00016099375,0.000011864669],"about_ca_topic_score_codex":0.0037772162,"about_ca_topic_score_gemma":0.0021920258,"teacher_disagreement_score":0.0037772162,"about_ca_system_score_codex":0.0013172908,"about_ca_system_score_gemma":0.0007175711,"threshold_uncertainty_score":0.009922922},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032273702,0.0023331016,0.9516437,0.00057758915,0.00010581195,0.000063765656,0.00009204454,0.00009285027,0.0128174685],"genre_scores_gemma":[0.8504692,0.008971052,0.13329796,0.00045612306,0.00046796634,0.00028820563,0.000166987,0.000109130335,0.005773358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897826,0.00050161185,0.00003271631,0.00006469341,0.00027183566,0.00015085643],"domain_scores_gemma":[0.9933281,0.0052509597,0.00038355487,0.0004427623,0.00052303384,0.000071580296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015996676,0.0011231968,0.0007000547,0.0005840712,0.0004172674,0.0009789015,0.0009640588,0.0008563668,0.0014634507],"category_scores_gemma":[0.00784386,0.00034782945,0.00034043338,0.001120205,0.0019096414,0.0023991754,0.0012557745,0.0015768943,0.00038798788],"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.000118675394,0.00003146187,0.00028253102,0.00015666064,0.000025488293,0.0003364476,0.00021452666,0.4456355,0.0071430807,0.51714396,0.0014471066,0.027464565],"study_design_scores_gemma":[0.00002550214,0.00009447601,0.0001165462,0.00006905055,0.000018061884,0.00021030118,0.000040118273,0.7996664,0.0028882434,0.19382772,0.0030071181,0.000036400274],"about_ca_topic_score_codex":0.0019971612,"about_ca_topic_score_gemma":0.0012924143,"teacher_disagreement_score":0.0019971612,"about_ca_system_score_codex":0.00087305566,"about_ca_system_score_gemma":0.0007604264,"threshold_uncertainty_score":0.008459985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03604416,0.0023202647,0.94379336,0.0008970289,0.00009305675,0.00006761801,0.00020243015,0.0002198027,0.01636222],"genre_scores_gemma":[0.91746646,0.004517696,0.07084933,0.00028289502,0.00046710193,0.000354043,0.00029589888,0.00017162118,0.0055949613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667007,0.0011363223,0.0001564209,0.00042997688,0.001193257,0.0004139182],"domain_scores_gemma":[0.9872164,0.009937789,0.001195004,0.00053859246,0.00091814913,0.00019399688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031744267,0.001374574,0.0016790167,0.0011997557,0.0010134451,0.002246981,0.0011928692,0.0012068892,0.003032808],"category_scores_gemma":[0.017041625,0.00073453475,0.0006976281,0.002201514,0.002579639,0.0027739727,0.001962713,0.0019156985,0.0006008696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021769643,0.000062639076,0.0012541844,0.0003167747,0.000085548985,0.00044897496,0.0004661389,0.6059285,0.0049106586,0.3579464,0.0037601248,0.024602411],"study_design_scores_gemma":[0.000027950302,0.00005323383,0.00053948915,0.000043197895,0.000041854906,0.00026499675,0.000057800706,0.87105936,0.0012834725,0.12520981,0.0013788778,0.000039954608],"about_ca_topic_score_codex":0.0014749342,"about_ca_topic_score_gemma":0.0010099255,"teacher_disagreement_score":0.0031744267,"about_ca_system_score_codex":0.0025694475,"about_ca_system_score_gemma":0.0013767299,"threshold_uncertainty_score":0.018642783},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8103258,0.0012022945,0.1846885,0.0001459183,0.0000403888,0.00006252164,0.0000940082,0.00041335062,0.003027244],"genre_scores_gemma":[0.9937902,0.00013599648,0.0057353806,0.0000124252365,0.000008518738,0.0000102864815,0.0000140789525,0.0000039851693,0.00028918637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988418,0.00041807242,0.0000612329,0.00015079067,0.0003253471,0.000202876],"domain_scores_gemma":[0.98879147,0.008835276,0.00094655075,0.000611026,0.0006850169,0.0001308017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016627358,0.0011961596,0.0007106138,0.00039628305,0.00041221004,0.0007464414,0.0006780434,0.00045966398,0.0007024271],"category_scores_gemma":[0.007879353,0.00025001078,0.00030860893,0.0005456463,0.0008156671,0.0010872107,0.0006303095,0.00031129236,0.00013150231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018419111,0.00008087284,0.0045600175,0.0001672043,0.0001458461,0.0005399243,0.00016345255,0.9028741,0.026877752,0.0070233797,0.00020859258,0.055516977],"study_design_scores_gemma":[0.00012037799,0.0023569465,0.0017577421,0.000018817844,0.00017271034,0.0009116915,0.000100169695,0.94894326,0.039817393,0.005057703,0.00070510147,0.000038197773],"about_ca_topic_score_codex":0.0018127477,"about_ca_topic_score_gemma":0.0016947436,"teacher_disagreement_score":0.0018127477,"about_ca_system_score_codex":0.0007479118,"about_ca_system_score_gemma":0.000691885,"threshold_uncertainty_score":0.008793473},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054752976,0.00027094997,0.94089335,0.00019526294,0.000010532343,0.000039556657,0.00014471792,0.00014090494,0.0035518827],"genre_scores_gemma":[0.90157014,0.0007242318,0.09280473,0.00006010013,0.000023163222,0.00011469342,0.00012570173,0.00006319571,0.004514006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991603,0.0003146524,0.00004562098,0.00016561782,0.00020095469,0.00011287769],"domain_scores_gemma":[0.99850583,0.0010147131,0.00017891152,0.00010327258,0.00014880087,0.000048488302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002108328,0.00072615524,0.0009817722,0.00031269153,0.00029888796,0.0012686845,0.0005693853,0.00069288927,0.0010239274],"category_scores_gemma":[0.004639401,0.00056919403,0.0003468607,0.00073577894,0.0013930087,0.0013218084,0.0009111692,0.0005811182,0.00029537504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011526405,0.00003337833,0.0003468439,0.00008466146,0.00002632972,0.00010750001,0.0001003284,0.91963774,0.0068099676,0.048252415,0.0004873529,0.023998315],"study_design_scores_gemma":[0.000023520523,0.00004529849,0.0002612447,0.000009597397,0.000012942773,0.000053134034,0.000026482892,0.9656751,0.0036379881,0.029928828,0.00030956988,0.000016291848],"about_ca_topic_score_codex":0.0026996122,"about_ca_topic_score_gemma":0.0033023893,"teacher_disagreement_score":0.0026996122,"about_ca_system_score_codex":0.0009644544,"about_ca_system_score_gemma":0.0019184859,"threshold_uncertainty_score":0.0111500025},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19803731,0.00211934,0.76016736,0.0013876488,0.00008520617,0.00007619839,0.00023738615,0.0005519478,0.03733757],"genre_scores_gemma":[0.9520761,0.00085992756,0.04448906,0.0001795335,0.000058672365,0.00012335944,0.00009254081,0.00009128795,0.0020295917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974389,0.0010527043,0.000086412714,0.00021608775,0.0008064451,0.00039942164],"domain_scores_gemma":[0.9904282,0.0075340467,0.0005399921,0.00050329947,0.00081908563,0.00017542124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030913476,0.0011447961,0.0010285827,0.0007256617,0.0008332342,0.0022848893,0.00092412496,0.0014996314,0.002284722],"category_scores_gemma":[0.017778367,0.00053269544,0.00041138765,0.00083119463,0.0022680233,0.002933356,0.0015351423,0.0013833928,0.0006397643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004226477,0.00006939941,0.001262462,0.0002808109,0.00005328781,0.00041625666,0.00026397663,0.5497338,0.025892643,0.4014706,0.0010896324,0.019044429],"study_design_scores_gemma":[0.00002777872,0.000113185575,0.00020463132,0.000069373025,0.000012723848,0.00035669722,0.000094196716,0.87560695,0.01524725,0.10739955,0.00082621025,0.000041475043],"about_ca_topic_score_codex":0.0009492388,"about_ca_topic_score_gemma":0.0007750789,"teacher_disagreement_score":0.0030913476,"about_ca_system_score_codex":0.001597253,"about_ca_system_score_gemma":0.0012519999,"threshold_uncertainty_score":0.016348839},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033370208,0.00061104924,0.9645541,0.00012216988,0.000019288373,0.000015191092,0.000017822284,0.00009727997,0.00119291],"genre_scores_gemma":[0.8828773,0.0008385976,0.11498697,0.00005162936,0.000063747604,0.000058857182,0.00003409158,0.000021039961,0.0010677542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995315,0.00023506994,0.000018546336,0.000042613043,0.00013217617,0.00004012922],"domain_scores_gemma":[0.99829286,0.001149002,0.00013939003,0.00019595958,0.00018911413,0.00003367055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009119018,0.00036741578,0.0003972968,0.0002590767,0.00017004629,0.0004201913,0.00047992353,0.0004203189,0.00072969386],"category_scores_gemma":[0.004680116,0.00024983825,0.0001763709,0.00042827072,0.0006892315,0.0007342817,0.0007164341,0.0005340343,0.00020138476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041513954,0.00006483726,0.00076847576,0.000269871,0.000049799863,0.00043657832,0.00023362071,0.7488519,0.038020004,0.08485868,0.0012804685,0.12475065],"study_design_scores_gemma":[0.00001110695,0.000071679824,0.00020260505,0.000008669575,0.000007979083,0.00007803058,0.000010320059,0.9871406,0.0030599276,0.008835767,0.00056288415,0.000010364552],"about_ca_topic_score_codex":0.0006832744,"about_ca_topic_score_gemma":0.0006408866,"teacher_disagreement_score":0.0009119018,"about_ca_system_score_codex":0.00025571615,"about_ca_system_score_gemma":0.00052222284,"threshold_uncertainty_score":0.0048226714},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027486227,0.006591233,0.9387994,0.002921495,0.00019964881,0.000046719804,0.000046136545,0.0000820303,0.02382717],"genre_scores_gemma":[0.8058493,0.013888832,0.17496502,0.00055480754,0.00055347,0.00013367139,0.0000687752,0.00008516059,0.0039010076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880385,0.0005673508,0.000024749817,0.00006302789,0.00041237037,0.00012871159],"domain_scores_gemma":[0.9936466,0.0053411005,0.00017096255,0.00041027126,0.00035978516,0.00007135186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020626513,0.00072443177,0.0004265387,0.00053613045,0.00073489774,0.0012869757,0.0009058102,0.0012189053,0.0011979475],"category_scores_gemma":[0.009027051,0.0003486267,0.00033072795,0.0010256276,0.0028991038,0.0035649643,0.0015702411,0.0020622823,0.00028499332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051922212,0.00002847806,0.00029152524,0.00009607168,0.000013730974,0.000070131595,0.00009441541,0.32092518,0.0013062906,0.6405427,0.0012611612,0.0353184],"study_design_scores_gemma":[0.000015878779,0.00004563854,0.00015588007,0.00006626489,0.000012287605,0.000080228325,0.000047306236,0.5247142,0.0009763954,0.47033074,0.003536248,0.000018921708],"about_ca_topic_score_codex":0.0017553712,"about_ca_topic_score_gemma":0.0018339125,"teacher_disagreement_score":0.0020626513,"about_ca_system_score_codex":0.0011286556,"about_ca_system_score_gemma":0.0010951745,"threshold_uncertainty_score":0.010908484},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047280412,0.0009343865,0.9426155,0.00048268092,0.00025919735,0.00024581372,0.000112832204,0.00049649813,0.0075726104],"genre_scores_gemma":[0.8889395,0.00074993493,0.104996935,0.00028482598,0.0000845723,0.00026766417,0.00016297011,0.000057922443,0.004455712],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989416,0.00026954422,0.000045567343,0.00015307237,0.00039974693,0.00019047584],"domain_scores_gemma":[0.9976927,0.0011092573,0.00017186085,0.00022820405,0.000702033,0.000095940384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010412382,0.00065320614,0.0006198029,0.0008796473,0.00077685906,0.00078550016,0.0011794751,0.00049310183,0.0010292684],"category_scores_gemma":[0.004978224,0.00019444253,0.00020224722,0.0011909594,0.0007268604,0.00092779467,0.0010825766,0.0006416796,0.00022296331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010786696,0.00018863218,0.0035360528,0.0002422598,0.000081716884,0.00074115803,0.00057557796,0.36006382,0.08161024,0.1479167,0.009282977,0.3946822],"study_design_scores_gemma":[0.000058964793,0.00016182267,0.0005277196,0.000027254759,0.000041845567,0.00039477853,0.00009103914,0.9384543,0.029232258,0.021712296,0.009257511,0.000040266517],"about_ca_topic_score_codex":0.0025854916,"about_ca_topic_score_gemma":0.0031849863,"teacher_disagreement_score":0.0025854916,"about_ca_system_score_codex":0.0012686176,"about_ca_system_score_gemma":0.0017312774,"threshold_uncertainty_score":0.009204447},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08151203,0.00043536522,0.91252613,0.00026095496,0.000052071668,0.000037875147,0.00008224321,0.00018649467,0.004906812],"genre_scores_gemma":[0.9083992,0.00020351181,0.08852295,0.000055912406,0.000049696282,0.000076587574,0.000054314678,0.00003377087,0.002604032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924785,0.0003153132,0.000023935469,0.00008918007,0.00015889305,0.00016478075],"domain_scores_gemma":[0.9986821,0.0008661003,0.00010151259,0.00014063902,0.00015605909,0.000053497915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094399654,0.00040919223,0.00068820495,0.0005075173,0.00049352547,0.00085261214,0.0009914162,0.00067288615,0.0013349367],"category_scores_gemma":[0.004386808,0.00039660846,0.00017739752,0.001298773,0.00054483686,0.00079882285,0.0009136848,0.00047708536,0.00031393234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018630413,0.00007284156,0.0006552479,0.000038262337,0.000023807386,0.00006552063,0.00012513546,0.9132575,0.0050937547,0.01680332,0.0014958868,0.062182464],"study_design_scores_gemma":[0.000013315554,0.000015494441,0.000116820556,0.0000018532809,0.000005713033,0.000014547034,0.000017025899,0.9939446,0.0006040962,0.0049861413,0.00027676657,0.0000037425164],"about_ca_topic_score_codex":0.0036985944,"about_ca_topic_score_gemma":0.0073202243,"teacher_disagreement_score":0.0036985944,"about_ca_system_score_codex":0.00070237153,"about_ca_system_score_gemma":0.0012459708,"threshold_uncertainty_score":0.0073541403},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018620696,0.0014211206,0.9643542,0.00044329645,0.00008736541,0.00004205007,0.000046259272,0.000049845672,0.014935176],"genre_scores_gemma":[0.86839706,0.0042560464,0.115972124,0.00036675468,0.00036002803,0.00019148261,0.000095607684,0.00006085093,0.010300001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992843,0.0003301856,0.000024259896,0.00009940763,0.00016842951,0.000093390256],"domain_scores_gemma":[0.99908864,0.0006085111,0.00007639273,0.0000683378,0.00013601902,0.00002218574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009484934,0.00087350584,0.0005779546,0.00044697057,0.00041038802,0.0011397739,0.00054823386,0.0008974707,0.0019350097],"category_scores_gemma":[0.0018011883,0.00033215462,0.0005960697,0.00072017784,0.0012294697,0.0014503443,0.0009773802,0.0011773703,0.0005289594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007939673,0.00006581122,0.00026598747,0.00020206487,0.000040577524,0.00045899072,0.0002050808,0.6308359,0.0083989,0.33969548,0.0012654111,0.018486371],"study_design_scores_gemma":[0.0000070333,0.00007104221,0.00007434978,0.000016963051,0.0000123802665,0.00009441095,0.000030149062,0.9350783,0.001345,0.062051956,0.0012017094,0.000016674172],"about_ca_topic_score_codex":0.0008874362,"about_ca_topic_score_gemma":0.0007657172,"teacher_disagreement_score":0.0019350097,"about_ca_system_score_codex":0.00097181177,"about_ca_system_score_gemma":0.00062443013,"threshold_uncertainty_score":0.007050991},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61215025,0.003559224,0.35018036,0.0007411472,0.00010024695,0.0001111149,0.0003631516,0.0005140447,0.032280453],"genre_scores_gemma":[0.98822093,0.0008239808,0.008834086,0.000030415355,0.000030722505,0.000026186613,0.00007208483,0.00002004723,0.0019415567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913234,0.0002843902,0.00002507274,0.000056097997,0.00037046438,0.00013168938],"domain_scores_gemma":[0.9958371,0.0027478782,0.0003368587,0.00021606027,0.00079287635,0.00006919373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088375504,0.000722067,0.000713542,0.0005356156,0.0004839192,0.0010775534,0.0004938949,0.0007745085,0.0015755832],"category_scores_gemma":[0.004193157,0.00023757298,0.0002759605,0.00090942206,0.00085740915,0.0006599947,0.00073802826,0.0004912323,0.0003929171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002180172,0.00003840581,0.0017284609,0.00015591823,0.000047362064,0.0003553073,0.00018410981,0.94579405,0.017041411,0.021462247,0.0005362893,0.012438381],"study_design_scores_gemma":[0.000004873292,0.00006875816,0.00046010106,0.000007119028,0.000009677225,0.00010926925,0.000022042692,0.9959694,0.0019319082,0.0012278539,0.00017665791,0.0000123509935],"about_ca_topic_score_codex":0.006080608,"about_ca_topic_score_gemma":0.0037461251,"teacher_disagreement_score":0.006080608,"about_ca_system_score_codex":0.0011939792,"about_ca_system_score_gemma":0.0008990973,"threshold_uncertainty_score":0.012090385},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1309145,0.004431174,0.8452458,0.0012430925,0.000050099206,0.00009071041,0.000111146765,0.00032649818,0.017587017],"genre_scores_gemma":[0.9620024,0.0017438742,0.03278824,0.00009271155,0.00012947957,0.000111614,0.000080007296,0.00006956387,0.0029820942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874264,0.0006555296,0.000025102574,0.00008062879,0.00034250002,0.00015357598],"domain_scores_gemma":[0.99720037,0.0019484733,0.00029749217,0.00013897906,0.00035997684,0.000054731714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024902653,0.0012480565,0.0009852279,0.0010180174,0.00047193354,0.0009042748,0.0009584448,0.0013079272,0.001328262],"category_scores_gemma":[0.007166323,0.0004014776,0.00051641033,0.0014225068,0.0008249749,0.001104122,0.0009691632,0.0005911294,0.00038546784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008021419,0.000068828806,0.000506825,0.000069164125,0.000030129242,0.000059689988,0.00005754324,0.9605567,0.0021320342,0.014854792,0.0009647263,0.020619303],"study_design_scores_gemma":[0.000004768428,0.000034164113,0.00013503821,0.00000500629,0.000006335536,0.00003235889,0.000013883078,0.9949825,0.00042814677,0.0041449866,0.0002088804,0.000003858977],"about_ca_topic_score_codex":0.0019743585,"about_ca_topic_score_gemma":0.001154671,"teacher_disagreement_score":0.0024902653,"about_ca_system_score_codex":0.0014741822,"about_ca_system_score_gemma":0.0006085905,"threshold_uncertainty_score":0.013169944},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006090241,0.0002790996,0.99192375,0.00009264385,0.00005070397,0.000051349223,0.000015276988,0.00024723832,0.0012497467],"genre_scores_gemma":[0.17993706,0.0004071557,0.81608254,0.00008901816,0.00005428463,0.00015761648,0.00007660427,0.000052846946,0.0031428442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977833,0.0000456684,0.000017975739,0.000045419223,0.00009141466,0.000021175549],"domain_scores_gemma":[0.9994937,0.000225217,0.000054812033,0.00008074269,0.00012752617,0.00001804101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005468753,0.00040497805,0.00034414727,0.0004614611,0.0005964703,0.0004359357,0.0008101402,0.0006105772,0.0009197671],"category_scores_gemma":[0.0013784335,0.0001742997,0.0002795167,0.00040849147,0.00033397946,0.0007171763,0.0004493221,0.0005534329,0.00044175985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012289015,0.00006818233,0.00055235776,0.00016310978,0.000061085375,0.00016804368,0.0002376547,0.13997686,0.060926087,0.05202784,0.0026373686,0.7430586],"study_design_scores_gemma":[0.000095883195,0.00033816675,0.00037958106,0.000028682642,0.00005569318,0.00082569936,0.000052409592,0.9183753,0.029884482,0.025421765,0.024487201,0.000055175624],"about_ca_topic_score_codex":0.0010178656,"about_ca_topic_score_gemma":0.0016292692,"teacher_disagreement_score":0.0010178656,"about_ca_system_score_codex":0.0005821316,"about_ca_system_score_gemma":0.00052490697,"threshold_uncertainty_score":0.0042236447},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18650675,0.0027503185,0.7979873,0.00035195414,0.000042938864,0.000053873122,0.00005383609,0.0002659668,0.0119871665],"genre_scores_gemma":[0.98067653,0.0010514552,0.017402353,0.000051783536,0.00002652847,0.000050653725,0.000014267306,0.000012741872,0.000713661],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898964,0.00055963965,0.000022220065,0.00007765697,0.00026341813,0.00008733174],"domain_scores_gemma":[0.9961365,0.0031150437,0.0003239474,0.00017785981,0.00019141535,0.000055162014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001599877,0.0005710465,0.00077156705,0.00059287297,0.00066074845,0.00089860527,0.0006637495,0.0008166715,0.00053018326],"category_scores_gemma":[0.005733084,0.00040834784,0.00034393882,0.00088000734,0.0019044128,0.0011814175,0.0009363859,0.0005080141,0.00016993088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067342444,0.000025098267,0.0005764572,0.00009536503,0.000034866167,0.00028000222,0.00012456083,0.9502262,0.0057538454,0.034269,0.00023150345,0.008315678],"study_design_scores_gemma":[0.00001806633,0.00012208709,0.0003475807,0.000018398745,0.000023187762,0.00018081456,0.00004727706,0.96051985,0.0018841607,0.03619162,0.00063113944,0.000015850124],"about_ca_topic_score_codex":0.0010323579,"about_ca_topic_score_gemma":0.00080574537,"teacher_disagreement_score":0.001599877,"about_ca_system_score_codex":0.0007216801,"about_ca_system_score_gemma":0.00046042172,"threshold_uncertainty_score":0.008461058},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02532108,0.00039989394,0.9728209,0.00008185591,0.000013097308,0.000021540434,0.000006708686,0.000044463093,0.0012905688],"genre_scores_gemma":[0.8798621,0.00036996932,0.11870763,0.000046679943,0.00003942551,0.00007467562,0.000011757678,0.000021232374,0.00086652045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992274,0.00039876133,0.000033389388,0.00009461791,0.00017851075,0.00006730128],"domain_scores_gemma":[0.99871933,0.00087008916,0.00017301188,0.00013128479,0.000073154166,0.000033255368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013279326,0.000539972,0.0005594864,0.00039063682,0.00046638795,0.0008514686,0.000604769,0.0005674752,0.000904187],"category_scores_gemma":[0.0034928021,0.00020198822,0.0004537407,0.00078892836,0.0007699119,0.0011182821,0.00087198947,0.00037378902,0.00019963126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034305197,0.000075984986,0.000498167,0.00010177033,0.00007287154,0.00015065014,0.00019879182,0.7681107,0.016833512,0.10632147,0.0005447948,0.10674822],"study_design_scores_gemma":[0.000037318678,0.00012193001,0.00012956168,0.000008922679,0.000016222319,0.00013595117,0.000026060612,0.961374,0.0033914263,0.0334081,0.001337311,0.00001329285],"about_ca_topic_score_codex":0.00039167158,"about_ca_topic_score_gemma":0.00046094193,"teacher_disagreement_score":0.0013279326,"about_ca_system_score_codex":0.00053832465,"about_ca_system_score_gemma":0.0005030663,"threshold_uncertainty_score":0.0070228577},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040270723,0.0017931561,0.95143175,0.00025973373,0.00009734146,0.000049871443,0.00006536194,0.00021957753,0.005812461],"genre_scores_gemma":[0.87171876,0.0016306571,0.12344078,0.0000961084,0.00008530801,0.00012677978,0.00007941964,0.00004487642,0.0027772996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927765,0.00028629138,0.000022288434,0.00009857572,0.00018019375,0.00013503084],"domain_scores_gemma":[0.9989532,0.0007048082,0.00010408599,0.00006823334,0.00011254025,0.000057045134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005818468,0.00044604953,0.0004959168,0.00072172127,0.00063697837,0.00095136516,0.0005485221,0.0006681083,0.0009167901],"category_scores_gemma":[0.0031690416,0.00032462305,0.00017811006,0.0010506095,0.0010107361,0.00083483174,0.0007153784,0.00048716145,0.00020514945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039785144,0.000018214236,0.0003916337,0.000060216884,0.000012524444,0.00005119599,0.00004902616,0.92705846,0.001135248,0.03731952,0.0009671742,0.032896925],"study_design_scores_gemma":[0.000015538459,0.000017293569,0.00010116599,0.0000105315985,0.0000075134562,0.00003437879,0.00003009019,0.9597609,0.0006624698,0.0379501,0.0014006402,0.000009406691],"about_ca_topic_score_codex":0.0030589215,"about_ca_topic_score_gemma":0.0025618002,"teacher_disagreement_score":0.0030589215,"about_ca_system_score_codex":0.00087537133,"about_ca_system_score_gemma":0.00095832424,"threshold_uncertainty_score":0.006351292},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15860999,0.0034815283,0.81533504,0.00077031355,0.000080531965,0.000067408364,0.00033132746,0.00039130176,0.020932473],"genre_scores_gemma":[0.98066163,0.0015732845,0.013675745,0.000059238624,0.00006981827,0.000081766455,0.0001338922,0.000055553086,0.0036891375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986426,0.0005242767,0.00004588175,0.00012626864,0.00043932514,0.00022168807],"domain_scores_gemma":[0.9923598,0.0054533994,0.00085523946,0.00031470606,0.00091901276,0.00009774424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024394696,0.0013224083,0.0009824062,0.0011512921,0.00056680193,0.001250737,0.0011285922,0.0012042715,0.0022966834],"category_scores_gemma":[0.0072945897,0.0005302024,0.00051122205,0.0010411559,0.0014105969,0.0013971865,0.0012472585,0.0010490968,0.0004441449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014260584,0.00002515823,0.0010966276,0.00010413764,0.00004663728,0.0003354949,0.00018650394,0.9171502,0.0033678357,0.071195014,0.0005728786,0.0057769036],"study_design_scores_gemma":[0.0000064800256,0.000026837477,0.00022299384,0.000011722592,0.000012585683,0.00005765936,0.000021244023,0.99176276,0.00050906703,0.0071905865,0.00016497714,0.000013063123],"about_ca_topic_score_codex":0.0055931704,"about_ca_topic_score_gemma":0.0025505668,"teacher_disagreement_score":0.0055931704,"about_ca_system_score_codex":0.0016328278,"about_ca_system_score_gemma":0.0009739571,"threshold_uncertainty_score":0.012901306},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045063227,0.0007026024,0.9496543,0.00017793996,0.000086549735,0.00009312844,0.000041820476,0.0001395362,0.004040994],"genre_scores_gemma":[0.80972826,0.00073244463,0.184983,0.0001330344,0.000095137795,0.00018267492,0.00007621723,0.000017944885,0.004051196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920136,0.00030416006,0.000036315894,0.00008514648,0.00029208747,0.00008090327],"domain_scores_gemma":[0.9988954,0.00048086798,0.00015519574,0.00015941839,0.00025467962,0.000054360287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012146437,0.00069288764,0.0005488958,0.00053114805,0.00041755592,0.0008877022,0.0013858904,0.0007541573,0.00060894183],"category_scores_gemma":[0.0019040476,0.00028606533,0.00030661616,0.000542262,0.00083682925,0.0009294204,0.0010026252,0.0006600325,0.00024677083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043438358,0.00015653655,0.0015446626,0.0003463799,0.00012781295,0.0017677466,0.00065486896,0.48847616,0.085627876,0.2899309,0.0029708704,0.1279618],"study_design_scores_gemma":[0.000045413744,0.00022496971,0.00015498539,0.000017116645,0.000027494227,0.00039768277,0.000020261627,0.9811335,0.0041348147,0.010967778,0.0028418289,0.00003428274],"about_ca_topic_score_codex":0.0007824875,"about_ca_topic_score_gemma":0.001089168,"teacher_disagreement_score":0.0013858904,"about_ca_system_score_codex":0.0006291449,"about_ca_system_score_gemma":0.000635926,"threshold_uncertainty_score":0.006423712},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05973767,0.000437308,0.9365962,0.00019183736,0.000047444555,0.00006138816,0.000024567946,0.00016662398,0.0027369326],"genre_scores_gemma":[0.8355212,0.00027553889,0.16134457,0.00009258311,0.000050927636,0.0000814684,0.000025640453,0.000018318744,0.0025897187],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958533,0.00010579242,0.000023900911,0.00006737124,0.00018570246,0.000031852065],"domain_scores_gemma":[0.9993881,0.00020239121,0.00013569876,0.00014269826,0.0001122557,0.000018839126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058428256,0.00056946836,0.0005385538,0.0003233748,0.00041629781,0.0005481045,0.0007906751,0.000654458,0.0009276258],"category_scores_gemma":[0.0012502522,0.0001957428,0.00038366046,0.00026962796,0.0007243946,0.0010408558,0.0008090521,0.00067378837,0.00032465244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042811403,0.0001136361,0.0010097163,0.0004402903,0.00018863723,0.0007639611,0.00060330075,0.16365562,0.48447627,0.1581952,0.0010033483,0.18912196],"study_design_scores_gemma":[0.000064738866,0.0009823786,0.0005516397,0.00004463637,0.00011820723,0.001550268,0.00008234232,0.7908483,0.17253739,0.024862336,0.008248981,0.00010874691],"about_ca_topic_score_codex":0.00023416596,"about_ca_topic_score_gemma":0.00028399273,"teacher_disagreement_score":0.0009276258,"about_ca_system_score_codex":0.00027653968,"about_ca_system_score_gemma":0.0002847288,"threshold_uncertainty_score":0.0031031966},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72311246,0.0031546692,0.26328447,0.0002780631,0.0000619701,0.000042968728,0.00090430473,0.00039792273,0.008763113],"genre_scores_gemma":[0.9958014,0.00047580697,0.002853526,0.000024019575,0.000025328993,0.000021819387,0.00020976346,0.00003418154,0.0005542823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994752,0.000100891375,0.00004668577,0.00008390041,0.00017785227,0.00011551401],"domain_scores_gemma":[0.99100983,0.0068011917,0.00086080254,0.0005383108,0.00056970475,0.00022028423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016090147,0.00047085108,0.0006834567,0.0006821878,0.00042878665,0.00062057906,0.00068250124,0.0004887655,0.0013366452],"category_scores_gemma":[0.009010754,0.00023734545,0.00038933632,0.00062771764,0.0008812077,0.001325896,0.0006301077,0.00060953497,0.00017059944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005045945,0.00005346252,0.010871753,0.0003899171,0.0001380849,0.0009963972,0.0005909407,0.8885953,0.018158788,0.05027726,0.00108814,0.028335378],"study_design_scores_gemma":[0.000030473688,0.00021565631,0.013749894,0.00007134748,0.00012213108,0.0019297876,0.00022671156,0.9434159,0.009685474,0.028608244,0.0018707399,0.000073653304],"about_ca_topic_score_codex":0.0015472414,"about_ca_topic_score_gemma":0.0017407483,"teacher_disagreement_score":0.0016090147,"about_ca_system_score_codex":0.0010726195,"about_ca_system_score_gemma":0.000592094,"threshold_uncertainty_score":0.0085093975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004054316,0.00036174495,0.9923381,0.00025040572,0.000045130815,0.000040307234,0.000045805642,0.000038167727,0.00282611],"genre_scores_gemma":[0.5744014,0.0034054925,0.40866143,0.00052452675,0.00060274225,0.0007838439,0.00027623348,0.00018229331,0.011162002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989473,0.00045599707,0.000035657195,0.00012740152,0.00027920835,0.00015441171],"domain_scores_gemma":[0.99897707,0.0005547128,0.000119906486,0.00008943693,0.00017666529,0.000082252154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028690966,0.0014609339,0.0019394867,0.0010971695,0.000814284,0.002891641,0.0021900223,0.0017373088,0.0025912232],"category_scores_gemma":[0.00311853,0.001051114,0.0013828941,0.0014590229,0.0016369208,0.00363456,0.0018368808,0.001463342,0.00036728653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019463943,0.000045159704,0.00020838148,0.000043157535,0.000028239581,0.00006562563,0.00004267373,0.86161083,0.0006993135,0.12878717,0.0008309662,0.007619098],"study_design_scores_gemma":[0.0000048169436,0.00001209162,0.000051301264,0.000007067954,0.0000084719,0.000008791255,0.000009897828,0.9830246,0.00009006324,0.016254615,0.0005229903,0.000005371516],"about_ca_topic_score_codex":0.0063842176,"about_ca_topic_score_gemma":0.004687552,"teacher_disagreement_score":0.0063842176,"about_ca_system_score_codex":0.0025251147,"about_ca_system_score_gemma":0.002197366,"threshold_uncertainty_score":0.018321097},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19258761,0.0016635103,0.7995793,0.00065422326,0.00009809147,0.00031238908,0.00006231056,0.00055727945,0.0044852244],"genre_scores_gemma":[0.9577416,0.0004664795,0.04046619,0.00012305751,0.0000998965,0.00009233737,0.000052750656,0.000031731015,0.0009259548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952101,0.0013926282,0.00028831782,0.00066128635,0.0020237858,0.0004239227],"domain_scores_gemma":[0.988948,0.006646701,0.0010547981,0.0012776259,0.0014832299,0.0005897412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003486307,0.0009734088,0.002002283,0.0007472421,0.0019212499,0.0015922133,0.0027231807,0.0014932213,0.0006771891],"category_scores_gemma":[0.01220835,0.000716101,0.00037194774,0.0011297594,0.0012235047,0.004430672,0.0038447147,0.0016632417,0.00026813315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018104266,0.0009928525,0.009588453,0.0010907523,0.00030735822,0.00396464,0.0039865016,0.4728101,0.105627544,0.09152599,0.004635353,0.3036601],"study_design_scores_gemma":[0.00007208766,0.0002477939,0.0007441709,0.000018670044,0.000058435966,0.00063537835,0.00034134503,0.96088445,0.010047995,0.023523642,0.0033667816,0.00005922665],"about_ca_topic_score_codex":0.0019107653,"about_ca_topic_score_gemma":0.0015036016,"teacher_disagreement_score":0.003486307,"about_ca_system_score_codex":0.0009177838,"about_ca_system_score_gemma":0.0011506294,"threshold_uncertainty_score":0.018437564},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5885023,0.0018769683,0.39330631,0.0006888658,0.00009195575,0.00019257268,0.00028719488,0.0008454529,0.014208394],"genre_scores_gemma":[0.9869292,0.00038728447,0.011794637,0.0000365908,0.0000114326185,0.000035487552,0.00006304201,0.000024026785,0.0007182311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911505,0.00022042044,0.00003351333,0.000070076225,0.0003534459,0.00020744216],"domain_scores_gemma":[0.9968346,0.001681891,0.00042585802,0.00017198901,0.0008147172,0.00007099285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013051598,0.0008259117,0.0005460857,0.00070342456,0.0004232888,0.00066976267,0.00095740013,0.0006943948,0.0009015395],"category_scores_gemma":[0.004977041,0.00021363971,0.00035587195,0.0007313075,0.0005911593,0.0012990797,0.0006568387,0.0007077388,0.00015327099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067254376,0.000054392625,0.0013296932,0.00003826393,0.000018731322,0.000085296386,0.000040235675,0.97998947,0.002764197,0.0060871528,0.00029143065,0.00923388],"study_design_scores_gemma":[0.0000014686917,0.000019577852,0.00008057582,0.000002366566,0.000002394088,0.000009595531,0.000004349976,0.999175,0.0004584323,0.00018993509,0.000053575906,0.0000026601065],"about_ca_topic_score_codex":0.025390837,"about_ca_topic_score_gemma":0.01472963,"teacher_disagreement_score":0.025390837,"about_ca_system_score_codex":0.002091361,"about_ca_system_score_gemma":0.0011578486,"threshold_uncertainty_score":0.050486088},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011134909,0.00028287093,0.9860497,0.00011795537,0.00003819431,0.0001119559,0.000035773843,0.00014187933,0.0020868636],"genre_scores_gemma":[0.6497969,0.0010032383,0.3427683,0.00020034303,0.00006733511,0.0004772519,0.00012817197,0.000031766085,0.0055267103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883586,0.00040356762,0.000059436854,0.00013402224,0.0005119206,0.000055292403],"domain_scores_gemma":[0.998467,0.0007663074,0.00019669165,0.0002575958,0.000278869,0.000033389984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014393198,0.0007938634,0.00070968294,0.0005455277,0.00060248043,0.00061460986,0.0013255223,0.0008597543,0.00090380927],"category_scores_gemma":[0.0032610684,0.00024925295,0.00043603213,0.0006291248,0.00092736864,0.0011794964,0.0010373559,0.0008527592,0.00031368225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003867937,0.00016621519,0.00036119504,0.0004970306,0.00015533659,0.0008366984,0.0005652871,0.33981198,0.15165173,0.36327443,0.0032969008,0.13899645],"study_design_scores_gemma":[0.00010211879,0.00043726095,0.00014884022,0.00003637465,0.000098162775,0.0008721287,0.000040875166,0.88796264,0.042957503,0.05792528,0.009357896,0.000060866594],"about_ca_topic_score_codex":0.000535803,"about_ca_topic_score_gemma":0.0008353676,"teacher_disagreement_score":0.0014393198,"about_ca_system_score_codex":0.00059427205,"about_ca_system_score_gemma":0.0009232197,"threshold_uncertainty_score":0.0076119304},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029533884,0.0011084145,0.9597476,0.00023563324,0.000028397906,0.000058171725,0.000042827698,0.00007182701,0.00917325],"genre_scores_gemma":[0.89278865,0.0011310789,0.10206093,0.00010269848,0.00004464438,0.00023048156,0.000076988435,0.00003115257,0.0035334034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936587,0.00027028614,0.00001744136,0.000061825434,0.00022732478,0.000057371995],"domain_scores_gemma":[0.9994466,0.00026644688,0.00008330746,0.000040191717,0.0001391738,0.000024389112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008418394,0.00058101164,0.00064766797,0.00043597704,0.00037734426,0.00083925924,0.0007944483,0.000774699,0.0012631622],"category_scores_gemma":[0.002839874,0.00047884262,0.00030566758,0.00045366117,0.0005265147,0.0006415286,0.00085739157,0.00049418333,0.00030206027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004119844,0.000021584863,0.00047597947,0.000096106945,0.000031910404,0.00012997715,0.0001501717,0.9182475,0.0042972523,0.057967152,0.00068827876,0.017852817],"study_design_scores_gemma":[0.000006282009,0.000020285383,0.00008489776,0.0000082313245,0.0000059487816,0.00003557616,0.000018854287,0.9905301,0.0004626602,0.008030431,0.0007907468,0.0000060532293],"about_ca_topic_score_codex":0.001604248,"about_ca_topic_score_gemma":0.0015993485,"teacher_disagreement_score":0.001604248,"about_ca_system_score_codex":0.00089158415,"about_ca_system_score_gemma":0.00067585317,"threshold_uncertainty_score":0.006468892},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37218755,0.0010496773,0.6127925,0.00038041142,0.00010198952,0.00012662189,0.00020243402,0.00031223884,0.012846682],"genre_scores_gemma":[0.9756825,0.00017142907,0.022735748,0.00003485601,0.00003317522,0.00009004536,0.00004671421,0.000029196839,0.0011763864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99536717,0.001740434,0.00021224027,0.000422189,0.0014891818,0.00076879555],"domain_scores_gemma":[0.9735197,0.019145036,0.0017764742,0.0023186072,0.0028690726,0.00037117937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008345382,0.0010172476,0.0010755402,0.0014129747,0.0011740475,0.002804492,0.0020772398,0.0013695726,0.0013045873],"category_scores_gemma":[0.031567354,0.00050295,0.00052531715,0.0012720688,0.0022979698,0.0024849866,0.0014877731,0.0009489585,0.00028661924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006417893,0.00010822791,0.0017519551,0.000103115126,0.000049577717,0.00025071832,0.00042984495,0.65703064,0.008198358,0.30392697,0.00063108985,0.026877636],"study_design_scores_gemma":[0.000053863136,0.000121827085,0.00058644626,0.000024846406,0.000028967583,0.00012599073,0.00007952943,0.8953418,0.0066988957,0.09621395,0.00068314077,0.00004071689],"about_ca_topic_score_codex":0.00195805,"about_ca_topic_score_gemma":0.0014192538,"teacher_disagreement_score":0.008345382,"about_ca_system_score_codex":0.0030786626,"about_ca_system_score_gemma":0.0020734407,"threshold_uncertainty_score":0.044135094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20304702,0.0012033714,0.79169416,0.00046746293,0.00009487471,0.00005969731,0.00003725416,0.00020298759,0.0031930855],"genre_scores_gemma":[0.9794997,0.00018131062,0.01918486,0.000021115311,0.00002798597,0.000023229326,0.000016856058,0.000008529405,0.001036351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998118,0.000047720885,0.000011331765,0.000042367887,0.000049156235,0.000037694856],"domain_scores_gemma":[0.99986744,0.0000577445,0.000023642357,0.000016383487,0.000019647738,0.000015201951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005513403,0.00033632552,0.00032667082,0.00026204338,0.00046898882,0.0005146725,0.00058530556,0.0005168149,0.00090818154],"category_scores_gemma":[0.00072532747,0.0001638539,0.00031584164,0.00028622575,0.0003268428,0.0008723688,0.00075865956,0.00031722288,0.00010380293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003065094,0.00010387592,0.001615292,0.00008006573,0.000072567585,0.000190649,0.00009402621,0.84855175,0.016716467,0.0108236205,0.0009934107,0.12045163],"study_design_scores_gemma":[0.00001371677,0.000055543118,0.00030737033,0.0000023463404,0.000013450706,0.00002369087,0.000022272501,0.99526054,0.00072511286,0.0031766123,0.00039386196,0.000005529406],"about_ca_topic_score_codex":0.001599491,"about_ca_topic_score_gemma":0.0023472167,"teacher_disagreement_score":0.001599491,"about_ca_system_score_codex":0.00044568657,"about_ca_system_score_gemma":0.0003261577,"threshold_uncertainty_score":0.0032337308},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08739037,0.0012414968,0.9069946,0.00016399288,0.000033282748,0.0000626058,0.000024065572,0.00019089495,0.003898653],"genre_scores_gemma":[0.9139524,0.0006998816,0.08314995,0.00005661215,0.00002339134,0.0000841099,0.000027411821,0.0000123788395,0.0019937847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996933,0.000108791275,0.000012656946,0.000055773155,0.00010460191,0.00002491824],"domain_scores_gemma":[0.99958354,0.00017261173,0.00006783589,0.000057373818,0.00009862312,0.00001999735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005574785,0.0004905433,0.00039349342,0.0003158832,0.00033286912,0.00053744466,0.0008895806,0.00063433097,0.0006632977],"category_scores_gemma":[0.0010667294,0.00017954697,0.00022728724,0.00049850764,0.00039782588,0.0006835014,0.00059895584,0.00037200237,0.00021763801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006915617,0.00012649935,0.0010134111,0.00042774918,0.00012695594,0.00094800896,0.0010755953,0.49699038,0.20378704,0.12592204,0.0022337728,0.166657],"study_design_scores_gemma":[0.000038681712,0.00037633404,0.00026117516,0.000013748959,0.00003805663,0.00046277166,0.000083748186,0.96774465,0.02119583,0.0064062565,0.0033446015,0.00003416114],"about_ca_topic_score_codex":0.0006588415,"about_ca_topic_score_gemma":0.00085992174,"teacher_disagreement_score":0.0008895806,"about_ca_system_score_codex":0.00036261237,"about_ca_system_score_gemma":0.0003838185,"threshold_uncertainty_score":0.0029482841},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02430765,0.00032573807,0.97111994,0.00019667229,0.000051005438,0.000065272296,0.000027265494,0.00005106731,0.0038552661],"genre_scores_gemma":[0.93278146,0.0002922191,0.064530864,0.00008554329,0.000035545596,0.000095240415,0.000021210695,0.000012938207,0.002144996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916935,0.00039244007,0.000032180495,0.000119398006,0.00019090467,0.000095718555],"domain_scores_gemma":[0.99948764,0.00026151695,0.000055855147,0.0000374014,0.00011389885,0.000043678447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082090346,0.0006722846,0.00065236556,0.00034538473,0.0005633324,0.00102039,0.0011890194,0.0009741487,0.000683391],"category_scores_gemma":[0.0020017247,0.00024717939,0.00035282085,0.00051817455,0.0009262481,0.0011182587,0.0007349846,0.0006068566,0.00013338553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112358,0.00008320636,0.0004837952,0.00008428968,0.000050457966,0.0002739419,0.00015726869,0.8584992,0.009525602,0.09378214,0.0012874225,0.035660237],"study_design_scores_gemma":[0.000009237323,0.000039155177,0.00005688554,0.000003849929,0.000007150218,0.00006204535,0.000015582133,0.9910529,0.00059333246,0.007489489,0.00066178234,0.0000086088185],"about_ca_topic_score_codex":0.0037828295,"about_ca_topic_score_gemma":0.003145302,"teacher_disagreement_score":0.0037828295,"about_ca_system_score_codex":0.0013347702,"about_ca_system_score_gemma":0.0010524146,"threshold_uncertainty_score":0.009684503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033638137,0.00013613653,0.99561834,0.00008276586,0.00001846439,0.000022164855,0.000018018714,0.000076745026,0.00066348526],"genre_scores_gemma":[0.5102854,0.00077897124,0.48283517,0.00014878208,0.00007859054,0.00041417909,0.0001628341,0.000070497445,0.0052256696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988123,0.0004999321,0.00006580085,0.00028345743,0.00027291983,0.000065520435],"domain_scores_gemma":[0.99862707,0.00069624465,0.00020727342,0.00011854385,0.00030688845,0.00004406432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016825179,0.0015965764,0.0014317817,0.00032710558,0.0002703848,0.0011683718,0.0013016609,0.0014351316,0.0015881608],"category_scores_gemma":[0.0037259897,0.00063272216,0.0006292063,0.0005156256,0.00084622257,0.0013059169,0.0008824953,0.0009657996,0.00066998485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027624104,0.000060851333,0.000384011,0.00024306963,0.00009319255,0.00016594035,0.00018872548,0.8532663,0.024437739,0.025833456,0.0014802767,0.0935702],"study_design_scores_gemma":[0.000038602662,0.00016208107,0.000082503975,0.000009918523,0.000016955435,0.00008130858,0.00001500563,0.9914464,0.0036091495,0.0037089707,0.0008148246,0.000014306283],"about_ca_topic_score_codex":0.00073511066,"about_ca_topic_score_gemma":0.00078591827,"teacher_disagreement_score":0.0016825179,"about_ca_system_score_codex":0.0005514483,"about_ca_system_score_gemma":0.0010371672,"threshold_uncertainty_score":0.008898139},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073910676,0.0015750026,0.90517586,0.00030220213,0.00016495396,0.00025344695,0.00021173318,0.00042954777,0.017976603],"genre_scores_gemma":[0.8991048,0.00072551676,0.09420261,0.00016267039,0.00005314637,0.0001948758,0.00010270163,0.000011165706,0.005442627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993611,0.00012326792,0.000038757946,0.000110901405,0.000246907,0.000119019445],"domain_scores_gemma":[0.9984793,0.00052570034,0.00017401781,0.00019618486,0.0005739566,0.000050895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005402546,0.00076678034,0.00043778718,0.0006920897,0.0004997177,0.0008939851,0.001478383,0.000941072,0.0016958968],"category_scores_gemma":[0.0023337079,0.00015533833,0.00027963132,0.0010080991,0.00057331956,0.0007874674,0.0009176303,0.0005529449,0.00038497685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005754053,0.00012529096,0.0015566947,0.0004265439,0.00012036777,0.00086283137,0.00048204456,0.43767875,0.06361802,0.11193488,0.005819912,0.37679923],"study_design_scores_gemma":[0.0000736949,0.00026378248,0.0005267639,0.000041768344,0.00006537548,0.00070663856,0.00006609617,0.9563808,0.012943174,0.02215375,0.006698332,0.000079721336],"about_ca_topic_score_codex":0.002770996,"about_ca_topic_score_gemma":0.0041315756,"teacher_disagreement_score":0.002770996,"about_ca_system_score_codex":0.0006791959,"about_ca_system_score_gemma":0.0009526645,"threshold_uncertainty_score":0.005673349},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13284993,0.002590319,0.8580385,0.00019269588,0.00003408012,0.000035053796,0.00003467426,0.00017306852,0.0060516377],"genre_scores_gemma":[0.9554885,0.0006238819,0.042989638,0.000031694854,0.000020963447,0.00003688024,0.000016651058,0.000009352055,0.00078254746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914813,0.00034026455,0.000040724353,0.00011073279,0.00025965276,0.00010043765],"domain_scores_gemma":[0.999154,0.00041925168,0.00018876529,0.000087466964,0.00012185965,0.000028702778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001169405,0.0005391645,0.0005806759,0.00061356253,0.00036259127,0.0007510104,0.000784691,0.00063644745,0.0003429356],"category_scores_gemma":[0.0023171029,0.00030098547,0.0002448306,0.00062386825,0.0008187294,0.00079884985,0.0004880369,0.000285491,0.00013437914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014696186,0.000039252798,0.00052257464,0.0000924719,0.000041675263,0.00023140399,0.00021148991,0.87661606,0.011585155,0.06835089,0.00054574345,0.04161625],"study_design_scores_gemma":[0.000022753471,0.00009919995,0.00019995682,0.00001236284,0.000023217293,0.0001052694,0.0000555456,0.96555704,0.0025172029,0.030592702,0.00079750875,0.000017239123],"about_ca_topic_score_codex":0.00091609376,"about_ca_topic_score_gemma":0.00083350233,"teacher_disagreement_score":0.001169405,"about_ca_system_score_codex":0.00081066805,"about_ca_system_score_gemma":0.00052716024,"threshold_uncertainty_score":0.0061844587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024748417,0.0015162897,0.96896803,0.00019545111,0.00007642816,0.000038286285,0.000013412695,0.0001418969,0.0043017827],"genre_scores_gemma":[0.7284995,0.0017984714,0.26571023,0.00018399798,0.00014570243,0.00006213999,0.00003250667,0.00002266967,0.0035447623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997415,0.000078651006,0.000010580132,0.00004663492,0.000105228806,0.000017427958],"domain_scores_gemma":[0.99966407,0.00018560182,0.000039239123,0.000050010916,0.00004947369,0.000011654814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027002618,0.00037605473,0.00028251932,0.00018790597,0.00021922478,0.0003764257,0.00044873057,0.00043266654,0.0013172759],"category_scores_gemma":[0.00064480375,0.0001745142,0.00022812963,0.00028887595,0.00041745525,0.00052562164,0.0004709721,0.00038841882,0.00037956925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030953783,0.00014971997,0.0013654258,0.00045078245,0.00008285332,0.0004565313,0.00019446343,0.23010081,0.23783344,0.10127396,0.0010589309,0.42672354],"study_design_scores_gemma":[0.00008380295,0.00089356955,0.0007531154,0.0000391691,0.000060344773,0.0008707283,0.00004685925,0.870976,0.080993496,0.033636298,0.0116006415,0.000045950543],"about_ca_topic_score_codex":0.00016164596,"about_ca_topic_score_gemma":0.00024596817,"teacher_disagreement_score":0.0013172759,"about_ca_system_score_codex":0.00018831418,"about_ca_system_score_gemma":0.00023080493,"threshold_uncertainty_score":0.0044066906},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15786953,0.0019196351,0.8335446,0.00029412008,0.000014203558,0.00006836426,0.00003361541,0.00022449793,0.0060314713],"genre_scores_gemma":[0.95115924,0.0007404184,0.046703495,0.00003662515,0.000027075424,0.00006190366,0.00001725311,0.000014344503,0.0012396494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990208,0.00054722105,0.000027453529,0.000079099606,0.00025922855,0.00006607293],"domain_scores_gemma":[0.9968354,0.0024701066,0.0002500805,0.00017949453,0.00022875545,0.00003623364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019912384,0.00086582714,0.00069658377,0.00052761566,0.00032884782,0.0006543005,0.00064957904,0.0007182083,0.00070306903],"category_scores_gemma":[0.004841383,0.00024667275,0.00041033188,0.00063026,0.0006689484,0.00087962125,0.00062638783,0.00036678844,0.00020752821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015419301,0.00007656058,0.0018937769,0.000113741655,0.0000855484,0.00028025938,0.00022036317,0.91893744,0.009714093,0.028446509,0.0003243192,0.039753236],"study_design_scores_gemma":[0.0000085786805,0.00007220712,0.0002635638,0.000004830522,0.000017912887,0.00011751957,0.000021156438,0.99513173,0.0020171911,0.0021520737,0.0001849338,0.000008170657],"about_ca_topic_score_codex":0.0012043471,"about_ca_topic_score_gemma":0.00084904867,"teacher_disagreement_score":0.0019912384,"about_ca_system_score_codex":0.0007213245,"about_ca_system_score_gemma":0.00042704158,"threshold_uncertainty_score":0.010530829},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92854345,0.0005050571,0.06856723,0.00010091302,0.00000896006,0.000014773966,0.00004743367,0.00016742287,0.0020448097],"genre_scores_gemma":[0.99797267,0.00007788526,0.0017268456,0.000010469044,0.000004091273,0.000004785788,0.00001576981,0.0000043791347,0.00018308633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989876,0.0003731881,0.000042828047,0.00011726042,0.00029346446,0.00018562115],"domain_scores_gemma":[0.9940606,0.004524398,0.0004710848,0.0002215648,0.00061978225,0.00010261455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016268634,0.0008260958,0.0005778587,0.00049032754,0.00046569045,0.0007769572,0.00038991266,0.00075136154,0.00036183384],"category_scores_gemma":[0.0060425284,0.00022107613,0.0002444483,0.00035169703,0.0010031974,0.00092680764,0.000801044,0.00030641627,0.000121235156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007042988,0.00006233092,0.00648097,0.00007032088,0.00010603514,0.0003648305,0.00029515618,0.9363587,0.030297175,0.003262355,0.00017346656,0.021824481],"study_design_scores_gemma":[0.000025127278,0.00070250133,0.0034507255,0.000011233243,0.00007194086,0.00036355588,0.000100906735,0.9685145,0.02416425,0.0024154854,0.00014774912,0.000032056425],"about_ca_topic_score_codex":0.0014334852,"about_ca_topic_score_gemma":0.0012093005,"teacher_disagreement_score":0.0016268634,"about_ca_system_score_codex":0.0006566275,"about_ca_system_score_gemma":0.00037793955,"threshold_uncertainty_score":0.008603811},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3310974,0.0031265174,0.6354215,0.0007116966,0.000054501823,0.00005489619,0.00014886583,0.00033371456,0.02905095],"genre_scores_gemma":[0.98872817,0.00067157944,0.00935627,0.00005714678,0.000029401495,0.000033629254,0.00004295422,0.000021276092,0.0010596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890125,0.0003750349,0.000038405655,0.00008748889,0.00039184082,0.0002058195],"domain_scores_gemma":[0.9880548,0.009146948,0.0007188446,0.00047124593,0.001466587,0.00014162167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028696805,0.00092877104,0.0008693327,0.00084638747,0.0006522739,0.0011964679,0.00059854897,0.0010722358,0.0010643146],"category_scores_gemma":[0.019871058,0.0003855235,0.00034754837,0.0008368204,0.0017949229,0.001687917,0.0014769026,0.0007859171,0.00025937628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016305235,0.00003983548,0.0015395912,0.00013782622,0.000040854386,0.00026478854,0.00027039007,0.9422565,0.0063017826,0.037833314,0.0004287732,0.010723334],"study_design_scores_gemma":[0.0000085746115,0.000060254348,0.0005234979,0.000025722498,0.000011150123,0.00012488801,0.000058104142,0.98934305,0.0014514369,0.008206764,0.00016907665,0.0000175002],"about_ca_topic_score_codex":0.0045614718,"about_ca_topic_score_gemma":0.0024112482,"teacher_disagreement_score":0.0045614718,"about_ca_system_score_codex":0.001316966,"about_ca_system_score_gemma":0.0010359994,"threshold_uncertainty_score":0.015176475},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35066134,0.0027690053,0.6270014,0.0005111914,0.00005292655,0.000058419817,0.0002824714,0.0005507998,0.018112518],"genre_scores_gemma":[0.98878086,0.0008054281,0.008841119,0.00004417944,0.0000459617,0.000032797263,0.000055909866,0.000026898704,0.0013668754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989166,0.00029670505,0.000040014715,0.00011000684,0.00043368715,0.00020303094],"domain_scores_gemma":[0.9924344,0.0056425803,0.00059958274,0.0003103897,0.00092249777,0.00009070112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013773469,0.0008949178,0.00074047636,0.0010237293,0.0006121478,0.001062683,0.00085402286,0.00081324996,0.0011407975],"category_scores_gemma":[0.009407825,0.00033332358,0.00037078196,0.001456651,0.0012538866,0.0010194723,0.0008252403,0.0007392953,0.00030811856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008387056,0.000026425445,0.0015942033,0.000073700096,0.000027013151,0.00024959372,0.00017423739,0.96361613,0.003387451,0.021355312,0.0004364788,0.008975621],"study_design_scores_gemma":[0.000004175936,0.000030410712,0.00053959416,0.000007603613,0.00000954129,0.00009547164,0.000030579096,0.9941836,0.0007678667,0.0041404488,0.00017936238,0.00001133737],"about_ca_topic_score_codex":0.0098086735,"about_ca_topic_score_gemma":0.0038782398,"teacher_disagreement_score":0.0098086735,"about_ca_system_score_codex":0.0018945129,"about_ca_system_score_gemma":0.0010965947,"threshold_uncertainty_score":0.019503117},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05902531,0.0018351555,0.90795743,0.0014002663,0.000115345836,0.000117754615,0.00016418201,0.00022057313,0.02916397],"genre_scores_gemma":[0.8835706,0.0019521443,0.10083333,0.00080824865,0.00041944324,0.0003953473,0.00018216326,0.00015003244,0.011688619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9902441,0.006081906,0.0002975386,0.0009833687,0.0014889108,0.00090413773],"domain_scores_gemma":[0.96929973,0.024414398,0.0016856628,0.0019370522,0.0015881811,0.0010749032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067449287,0.002227353,0.0023095126,0.001314165,0.0021129951,0.0031460375,0.0024567964,0.004172146,0.0038582361],"category_scores_gemma":[0.019832423,0.0015900211,0.0009770511,0.0014029793,0.0058451677,0.005828502,0.0047454634,0.0035889256,0.0013039421],"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.00037962213,0.00006747615,0.00065579306,0.000107581494,0.000064992615,0.0005613108,0.0005485029,0.18546902,0.0027912422,0.7986885,0.0013303015,0.009335739],"study_design_scores_gemma":[0.00009032353,0.00011993903,0.00018652073,0.000042976008,0.000032627362,0.00021476205,0.0000701812,0.52331024,0.0013390258,0.47258767,0.0019533238,0.000052402826],"about_ca_topic_score_codex":0.0017950253,"about_ca_topic_score_gemma":0.0014983794,"teacher_disagreement_score":0.0067449287,"about_ca_system_score_codex":0.0018546529,"about_ca_system_score_gemma":0.001295396,"threshold_uncertainty_score":0.035671055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032888502,0.0008855004,0.96374756,0.00027174942,0.00001954289,0.000035010165,0.000024744235,0.000073150826,0.002054299],"genre_scores_gemma":[0.9253447,0.0009649872,0.07086245,0.00009667572,0.00007476843,0.00015124177,0.00004270863,0.00003167764,0.0024306488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980567,0.0012190852,0.00004426484,0.00021442602,0.00028094364,0.00018458995],"domain_scores_gemma":[0.997503,0.0019980452,0.00018579676,0.000112510694,0.0001471118,0.000053596545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025788024,0.0010248169,0.0010667924,0.000489271,0.0004710033,0.0010511331,0.0010806698,0.0012851139,0.00068916875],"category_scores_gemma":[0.004828498,0.0005635518,0.00042879218,0.0012234948,0.001461789,0.0017110215,0.0011918554,0.0006526358,0.00020817546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007966534,0.00003784643,0.0003435309,0.00007202836,0.000036267902,0.00018375463,0.00015421909,0.9483964,0.0012977388,0.028388629,0.00061569264,0.020394277],"study_design_scores_gemma":[0.00002726824,0.00005452865,0.00009526087,0.000005807116,0.000011358359,0.000049254963,0.000037839498,0.97266734,0.0005145034,0.025863728,0.0006652548,0.00000783113],"about_ca_topic_score_codex":0.0015003156,"about_ca_topic_score_gemma":0.0012500104,"teacher_disagreement_score":0.0025788024,"about_ca_system_score_codex":0.00084247376,"about_ca_system_score_gemma":0.00066656474,"threshold_uncertainty_score":0.013638198},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07020132,0.00033237963,0.9257849,0.00017706823,0.00003252501,0.000041696163,0.000032073327,0.00031646754,0.003081651],"genre_scores_gemma":[0.8417146,0.0002680024,0.15527989,0.00006160605,0.000023424243,0.000044514658,0.000053510583,0.000023504108,0.0025310153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996755,0.00012788211,0.000011096809,0.000026582771,0.00013107117,0.000027877666],"domain_scores_gemma":[0.9991154,0.00040117063,0.00008560698,0.00020255704,0.00017456397,0.000020642345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063404086,0.00028589382,0.00024422817,0.00032339795,0.00022580763,0.0003262911,0.00038651895,0.00029900396,0.0009040065],"category_scores_gemma":[0.0020791364,0.00011102044,0.00014621111,0.00029377,0.000345363,0.00050253497,0.00037857256,0.0003254197,0.0002221885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048763634,0.00010937035,0.001732214,0.0001753565,0.00007251739,0.0002845002,0.00021410386,0.5112255,0.10481668,0.18959248,0.0025904295,0.18869917],"study_design_scores_gemma":[0.0000144960395,0.00010170298,0.0002012711,0.000010468204,0.000013220613,0.00013021402,0.000011133785,0.9626292,0.023802977,0.010942259,0.0021313417,0.000011728194],"about_ca_topic_score_codex":0.0008157973,"about_ca_topic_score_gemma":0.0013204651,"teacher_disagreement_score":0.0009040065,"about_ca_system_score_codex":0.00038639057,"about_ca_system_score_gemma":0.0007061592,"threshold_uncertainty_score":0.0033531785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44145942,0.009924125,0.532591,0.00055592536,0.00010844667,0.0002368667,0.00008710346,0.00025586886,0.0147812115],"genre_scores_gemma":[0.96581316,0.0011535409,0.032200783,0.000055817858,0.000019829586,0.000076026896,0.000030847634,0.000012051823,0.00063793344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989562,0.0005402875,0.00007365896,0.0000789742,0.0002740126,0.000076838805],"domain_scores_gemma":[0.99593663,0.0033109228,0.00014570415,0.00020839272,0.0003484976,0.000049956237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017629209,0.00062675664,0.0005917487,0.0008376741,0.00035287603,0.0007035764,0.0006964268,0.00070749904,0.0008523815],"category_scores_gemma":[0.0070847226,0.00016193074,0.00028405339,0.00053653406,0.00037706608,0.0010194528,0.00044096136,0.0002779459,0.00015694913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00097433757,0.00028030443,0.0026907546,0.00055654655,0.0003927944,0.00032648843,0.0005225841,0.5632961,0.026704084,0.05964587,0.0009563569,0.3436538],"study_design_scores_gemma":[0.00023482046,0.0017576274,0.002212555,0.00007259553,0.00025261965,0.0004927357,0.00027206706,0.9558225,0.011524878,0.02452081,0.0027746984,0.00006211699],"about_ca_topic_score_codex":0.0004593628,"about_ca_topic_score_gemma":0.00075924105,"teacher_disagreement_score":0.0017629209,"about_ca_system_score_codex":0.0005039707,"about_ca_system_score_gemma":0.00038968597,"threshold_uncertainty_score":0.009323359},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024417665,0.002142519,0.9609086,0.00079871534,0.00012321775,0.000084555824,0.00011312705,0.00040433073,0.011007223],"genre_scores_gemma":[0.7935756,0.0046901708,0.19160293,0.00045544328,0.00033384783,0.0004605703,0.0003681812,0.00012848659,0.008384793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848574,0.00063694536,0.000043850254,0.00013396313,0.0005660524,0.00013353085],"domain_scores_gemma":[0.99524873,0.003106442,0.0004954678,0.00042012404,0.00063057744,0.00009864078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011801977,0.00076261576,0.00053919613,0.0009492171,0.00041984514,0.0009319498,0.0007688727,0.0010879319,0.001671448],"category_scores_gemma":[0.008572929,0.0003216913,0.00028026334,0.0016039868,0.0017391507,0.0015061235,0.0010560689,0.0012932855,0.0006652862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085258864,0.00002759037,0.00041682334,0.00015533052,0.000017731916,0.0001286093,0.00014689661,0.5223265,0.0037508912,0.42710298,0.0025835503,0.04325783],"study_design_scores_gemma":[0.000031006817,0.00006782743,0.0001586127,0.00003785382,0.000007638806,0.00014234368,0.00003861268,0.7145583,0.0016246432,0.2788967,0.0044055367,0.000030910243],"about_ca_topic_score_codex":0.0018038101,"about_ca_topic_score_gemma":0.00091152824,"teacher_disagreement_score":0.0018038101,"about_ca_system_score_codex":0.0009923124,"about_ca_system_score_gemma":0.0008805852,"threshold_uncertainty_score":0.0071997643},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01374557,0.002520617,0.97037977,0.00054773194,0.00012894363,0.00008974244,0.0004347028,0.00027665988,0.011876234],"genre_scores_gemma":[0.73488885,0.009915953,0.23553325,0.00069386396,0.00049146375,0.000510508,0.0012759654,0.00022531579,0.016464816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988304,0.0002822169,0.00006484096,0.00017179204,0.00051247486,0.0001382522],"domain_scores_gemma":[0.9932607,0.004908661,0.0005820988,0.00025082144,0.00092436094,0.000073359224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025042086,0.0015692888,0.0012197891,0.00102914,0.00057861017,0.0020329799,0.001253135,0.0015897275,0.005458894],"category_scores_gemma":[0.0124281915,0.0004493253,0.00050554716,0.0013702621,0.0016890889,0.0021146887,0.0011511698,0.0014840001,0.0016349405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013414689,0.00009627734,0.001192718,0.0007454417,0.000094799165,0.0007170135,0.0005534137,0.638403,0.010803008,0.27743313,0.0077138725,0.062113155],"study_design_scores_gemma":[0.000029478228,0.000110679066,0.00089560874,0.00015130099,0.00006374497,0.0009880464,0.00016382973,0.90479696,0.0033874142,0.08343144,0.0059110774,0.000070508264],"about_ca_topic_score_codex":0.0018085436,"about_ca_topic_score_gemma":0.002493023,"teacher_disagreement_score":0.005458894,"about_ca_system_score_codex":0.0015940373,"about_ca_system_score_gemma":0.0012379846,"threshold_uncertainty_score":0.01826179},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019587544,0.00011851352,0.9972429,0.000047087728,0.000016226684,0.000008422083,0.000006865466,0.000075168224,0.00052602694],"genre_scores_gemma":[0.27965537,0.0009619782,0.7125528,0.00026115833,0.0001293926,0.0001876415,0.00008491585,0.000042109223,0.006124677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994553,0.00017680446,0.000024944211,0.0000909721,0.00022230562,0.000029731285],"domain_scores_gemma":[0.9995116,0.00021236861,0.00005250685,0.00006438227,0.00013972454,0.00001928731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084371935,0.00061844045,0.00048718887,0.00027567387,0.00024082648,0.00042991995,0.0007329778,0.00072730845,0.0010185868],"category_scores_gemma":[0.0010312869,0.00035304326,0.00041749742,0.00056843826,0.00059362414,0.0007537916,0.0006706339,0.0006923048,0.0007253288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022278525,0.0001024666,0.0007630581,0.00028158908,0.0001207977,0.00018450973,0.00031842897,0.48887658,0.14127892,0.047571212,0.0029510919,0.31732854],"study_design_scores_gemma":[0.00002852046,0.00017342232,0.0001517144,0.000013067795,0.000036617574,0.0001523788,0.000028856044,0.9732669,0.014882583,0.0066393185,0.0046049384,0.00002157548],"about_ca_topic_score_codex":0.00056371966,"about_ca_topic_score_gemma":0.0009549483,"teacher_disagreement_score":0.0010185868,"about_ca_system_score_codex":0.00029757264,"about_ca_system_score_gemma":0.00046195186,"threshold_uncertainty_score":0.0044620633},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26956847,0.0035790207,0.7060838,0.0010063073,0.00006080938,0.00009101821,0.00034628503,0.00043404018,0.018830262],"genre_scores_gemma":[0.9895335,0.0010789072,0.007522737,0.000057440666,0.000037465506,0.000054564,0.00008985827,0.000029376348,0.0015960407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983735,0.0006046331,0.000051391853,0.00016116732,0.00050221116,0.0003069639],"domain_scores_gemma":[0.9918887,0.0056288815,0.0008046033,0.00029615316,0.0012536738,0.00012786948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002895397,0.0013096469,0.0012998836,0.0012301813,0.0007183966,0.001484953,0.0012267944,0.0011481834,0.0014236288],"category_scores_gemma":[0.01005551,0.0005097089,0.00057020236,0.0014000789,0.0017661394,0.0016812035,0.0013117378,0.00074851216,0.0002861218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098127275,0.000026821006,0.000852137,0.00007759021,0.000040207033,0.00017684231,0.00013554678,0.96266246,0.0028352549,0.026860727,0.00047738274,0.0057569346],"study_design_scores_gemma":[0.0000044792764,0.000035447905,0.00024735334,0.000007682387,0.000012748936,0.00006233095,0.000025298252,0.9951336,0.00044879466,0.0039027578,0.00011004654,0.000009537581],"about_ca_topic_score_codex":0.0074073,"about_ca_topic_score_gemma":0.0041003632,"teacher_disagreement_score":0.0074073,"about_ca_system_score_codex":0.00299907,"about_ca_system_score_gemma":0.0014005756,"threshold_uncertainty_score":0.021759868},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053912267,0.0010114547,0.9390992,0.00030777985,0.000033446882,0.000037511996,0.00007174399,0.0001034389,0.0054231538],"genre_scores_gemma":[0.90976685,0.0013510514,0.08501254,0.00007696594,0.000057387788,0.00011247497,0.0000707069,0.0000389097,0.003513114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999383,0.00033533236,0.000021155025,0.00008691123,0.000113591675,0.00006003572],"domain_scores_gemma":[0.9993175,0.00045820943,0.000078244935,0.000032835844,0.0000906823,0.000022497607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001049635,0.0013110883,0.001030198,0.00042863723,0.0003572554,0.0009632843,0.0008135375,0.00096352305,0.0011517061],"category_scores_gemma":[0.0017817622,0.00042542059,0.0006684061,0.000824745,0.0007332276,0.0009892244,0.0008963144,0.0005866281,0.0003622905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010841976,0.000038173093,0.0003852872,0.00018215271,0.000058614045,0.00040231226,0.00013934389,0.9504333,0.00838125,0.023643142,0.0008697091,0.01535839],"study_design_scores_gemma":[0.000012289441,0.000053152773,0.000115410694,0.0000057390107,0.000016071035,0.00008373869,0.000025515581,0.9919023,0.0016899104,0.0058106356,0.00027591173,0.000009274514],"about_ca_topic_score_codex":0.0013988761,"about_ca_topic_score_gemma":0.0012628526,"teacher_disagreement_score":0.0013988761,"about_ca_system_score_codex":0.00077657565,"about_ca_system_score_gemma":0.0005381174,"threshold_uncertainty_score":0.0056344867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17758946,0.0045305346,0.8052322,0.00038336642,0.00006154523,0.00006168049,0.00018422771,0.00041298065,0.011544035],"genre_scores_gemma":[0.97195566,0.002320306,0.023610897,0.000099621524,0.000044832384,0.00006945729,0.00012562142,0.00005040078,0.001723156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882084,0.0003900053,0.00004102863,0.00013376652,0.00036798316,0.0002462617],"domain_scores_gemma":[0.99453086,0.00399887,0.00043122214,0.0003277011,0.0006264395,0.00008496212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002216259,0.0018676638,0.0013323107,0.0014819968,0.00048026425,0.0016039326,0.0009908467,0.0008725571,0.001689204],"category_scores_gemma":[0.0071371202,0.00034544943,0.00058423856,0.0012544147,0.0012609469,0.0014003182,0.0015041478,0.0007846704,0.00048479735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011181068,0.000020949963,0.00061054213,0.00017084672,0.000051136107,0.00020966322,0.00015661682,0.93888104,0.00615764,0.037407734,0.00041357905,0.015808458],"study_design_scores_gemma":[0.000008618941,0.00007028108,0.00034896994,0.000028164233,0.000030020954,0.00019898021,0.000054395565,0.98285794,0.0021942854,0.013723541,0.00045811143,0.000026754948],"about_ca_topic_score_codex":0.0021425255,"about_ca_topic_score_gemma":0.0014924457,"teacher_disagreement_score":0.002216259,"about_ca_system_score_codex":0.0016823794,"about_ca_system_score_gemma":0.0011074007,"threshold_uncertainty_score":0.012206614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022476813,0.00031097856,0.97408706,0.00011457732,0.000012147675,0.00002357686,0.000030170568,0.000064924316,0.0028797265],"genre_scores_gemma":[0.7183042,0.001160337,0.2759486,0.00009187144,0.00005390372,0.0001887994,0.0001097688,0.00004931119,0.004093238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942696,0.0002393815,0.00002114799,0.000061663515,0.00017128966,0.00007947877],"domain_scores_gemma":[0.9994178,0.00034425757,0.00008301946,0.000035642468,0.000095151794,0.000024065528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009151873,0.0006514774,0.00055160833,0.00026439712,0.00037483493,0.00065777777,0.00042576485,0.00071884313,0.0011055334],"category_scores_gemma":[0.0024401648,0.0004398077,0.00021059712,0.00062406185,0.00068332715,0.0010314318,0.00069393346,0.0005049796,0.0005304949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050832843,0.00005044484,0.0010598765,0.00022117737,0.00003766901,0.00034326885,0.00045956118,0.7524494,0.027242605,0.09421198,0.0019072403,0.121508464],"study_design_scores_gemma":[0.000041207353,0.00010953399,0.0001939411,0.0000180383,0.000021828362,0.00013188679,0.0000815225,0.96576536,0.007196141,0.024919743,0.0014978849,0.000022976285],"about_ca_topic_score_codex":0.0013592351,"about_ca_topic_score_gemma":0.0014519907,"teacher_disagreement_score":0.0013592351,"about_ca_system_score_codex":0.000544849,"about_ca_system_score_gemma":0.00064402586,"threshold_uncertainty_score":0.0048400164},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38362384,0.006493163,0.57683057,0.00091757,0.00004900303,0.00007853255,0.00022835788,0.000513457,0.031265482],"genre_scores_gemma":[0.9841659,0.0011781906,0.013745225,0.00005321768,0.000041795498,0.000064415435,0.00006332184,0.000030160894,0.00065781426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965306,0.0013838654,0.00012802123,0.0002795537,0.0011588918,0.000519049],"domain_scores_gemma":[0.9739458,0.022681002,0.0010253736,0.0009459247,0.0010569524,0.00034478892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035493274,0.001054687,0.001351543,0.0010942594,0.00082733977,0.0020423245,0.00089849567,0.0010496345,0.00093597913],"category_scores_gemma":[0.021859601,0.0007765738,0.000559183,0.0009473888,0.0018228196,0.0027372623,0.0020102093,0.0012574219,0.0003201276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072432164,0.00009371528,0.0033885138,0.00031352587,0.0001358557,0.0009793591,0.0006529055,0.8063785,0.022593813,0.14036125,0.0006249464,0.02375328],"study_design_scores_gemma":[0.00006582908,0.0003878919,0.0013707568,0.00011749447,0.000053564625,0.0012386661,0.00022566652,0.8593991,0.015188394,0.12002333,0.0018364369,0.000092980976],"about_ca_topic_score_codex":0.00066690025,"about_ca_topic_score_gemma":0.00040352502,"teacher_disagreement_score":0.0035493274,"about_ca_system_score_codex":0.0012442115,"about_ca_system_score_gemma":0.0007702704,"threshold_uncertainty_score":0.018770814},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74283105,0.0020265826,0.23713875,0.0006332784,0.00007169711,0.00007028067,0.0004659102,0.0005207947,0.016241694],"genre_scores_gemma":[0.9978225,0.0002012372,0.0014659535,0.0000116723295,0.000014255375,0.000021340076,0.000049076727,0.000007869879,0.00040612073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989176,0.00031785393,0.000051402014,0.00012554109,0.00026070556,0.00032689082],"domain_scores_gemma":[0.99250984,0.0053318115,0.0005866447,0.0004474106,0.0009914534,0.00013280574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015961712,0.00060750474,0.00092436175,0.000797233,0.00067522546,0.0012389447,0.00076626433,0.0008746306,0.0011546193],"category_scores_gemma":[0.006843373,0.00026486465,0.00039056403,0.0009042318,0.0017620601,0.0014828432,0.00109902,0.00052644673,0.00019102507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017575541,0.000015065441,0.0006097807,0.0000930111,0.00003294567,0.00028845237,0.00015640957,0.96321285,0.0064658686,0.020971168,0.0004851698,0.0074935425],"study_design_scores_gemma":[0.00001181852,0.000054426408,0.00058445055,0.000016875185,0.000028324266,0.0001131076,0.000070153794,0.9864152,0.003044299,0.0093538705,0.0002780085,0.00002950875],"about_ca_topic_score_codex":0.0054246993,"about_ca_topic_score_gemma":0.002242596,"teacher_disagreement_score":0.0054246993,"about_ca_system_score_codex":0.0017441225,"about_ca_system_score_gemma":0.0012083753,"threshold_uncertainty_score":0.012654543},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40896535,0.0022809452,0.5836114,0.00064876914,0.00007787263,0.0000772762,0.00007967502,0.00013453093,0.0041241636],"genre_scores_gemma":[0.992226,0.00054809265,0.0058630724,0.000030568168,0.000013939423,0.000016864482,0.00001859252,0.0000067187857,0.001275974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992009,0.0003000455,0.000031206597,0.000118497206,0.00012910114,0.00022027083],"domain_scores_gemma":[0.9978089,0.0014837717,0.00037356553,0.00006147743,0.00015296676,0.00011926591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015593999,0.00063969026,0.001001802,0.00060069753,0.00082957296,0.0011255913,0.00094079506,0.0011494501,0.0010188887],"category_scores_gemma":[0.0024200536,0.00043204852,0.0006882698,0.00066713424,0.0011651341,0.0011379507,0.0009755591,0.0007842428,0.00012746471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009106252,0.00003379844,0.0009570879,0.000039119477,0.000024137084,0.0004075018,0.00011491298,0.9718114,0.0021783258,0.019711185,0.00022717603,0.004404288],"study_design_scores_gemma":[0.0000067367064,0.00003286672,0.0001861554,0.0000028046557,0.000009519278,0.000045207256,0.000034316283,0.9951325,0.00022391224,0.004218348,0.00009851665,0.000009155683],"about_ca_topic_score_codex":0.010974225,"about_ca_topic_score_gemma":0.007715752,"teacher_disagreement_score":0.010974225,"about_ca_system_score_codex":0.0014548317,"about_ca_system_score_gemma":0.0007859452,"threshold_uncertainty_score":0.021820724},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07841538,0.0007851483,0.9176326,0.00014011051,0.00002593455,0.000033831613,0.000019716348,0.0001008824,0.002846382],"genre_scores_gemma":[0.9471289,0.0003340825,0.051592194,0.000033128337,0.00002568651,0.00005668339,0.000011444721,0.000012215231,0.0008056339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945825,0.00027494284,0.000017924867,0.00006307796,0.00011872254,0.000067197005],"domain_scores_gemma":[0.99899405,0.00068534893,0.000105563384,0.00008021034,0.00011213302,0.00002266527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074206217,0.00038576065,0.0003716445,0.0002790478,0.0002905171,0.0005026028,0.00060865574,0.00037298442,0.0004036393],"category_scores_gemma":[0.0025973418,0.00017601221,0.0001686489,0.0004846652,0.00078274024,0.0008422025,0.0005722591,0.00038508658,0.000111664805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014181057,0.000043510874,0.00047138473,0.00006256435,0.000040527404,0.00018927011,0.00013479959,0.8787269,0.014118459,0.05410672,0.00048831536,0.05147579],"study_design_scores_gemma":[0.000013085007,0.000041117786,0.00011181109,0.000004568464,0.0000114069935,0.00005956097,0.000013372091,0.9884598,0.0021819829,0.008514678,0.0005810755,0.000007422941],"about_ca_topic_score_codex":0.0016835252,"about_ca_topic_score_gemma":0.001580852,"teacher_disagreement_score":0.0016835252,"about_ca_system_score_codex":0.0005662053,"about_ca_system_score_gemma":0.0004298894,"threshold_uncertainty_score":0.0041080713},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02147735,0.0019922724,0.9353999,0.0050789937,0.00025802793,0.00008727802,0.00017321754,0.00017060884,0.035362452],"genre_scores_gemma":[0.7254539,0.006055728,0.2556677,0.0013447296,0.002123152,0.00057182676,0.00049749017,0.00014853891,0.008136855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814105,0.0008187241,0.000054265543,0.00027495786,0.00053582847,0.00017517249],"domain_scores_gemma":[0.9966595,0.0018160896,0.00050529646,0.0005369395,0.00031607924,0.00016606356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019330857,0.0014854798,0.0008872434,0.0033425635,0.0020689634,0.003091086,0.0026341984,0.0023166267,0.004395645],"category_scores_gemma":[0.0072275917,0.00048847345,0.00082208624,0.0030391451,0.009274469,0.009326243,0.004358116,0.0040398827,0.0007043392],"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.000006080598,0.00000771554,0.00006547896,0.000016913778,0.000002437116,0.000028859295,0.000049258077,0.004557219,0.00016180689,0.99229455,0.00064264383,0.002167029],"study_design_scores_gemma":[0.0000060162174,0.00001752905,0.000049278322,0.000011798746,0.00000307855,0.00006413451,0.0000667305,0.018113893,0.0002449521,0.9779869,0.0034261092,0.000009682659],"about_ca_topic_score_codex":0.0005403831,"about_ca_topic_score_gemma":0.00039662587,"teacher_disagreement_score":0.004395645,"about_ca_system_score_codex":0.0019505306,"about_ca_system_score_gemma":0.00067020295,"threshold_uncertainty_score":0.014704883},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045984765,0.00027720383,0.9924142,0.00021139055,0.0001277168,0.0000660944,0.000031804026,0.00019924642,0.0020738435],"genre_scores_gemma":[0.70896286,0.0008643897,0.28041258,0.0003783434,0.0002177144,0.00030826876,0.00011275696,0.00007317271,0.008669841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803215,0.0005245987,0.00009736414,0.00028865848,0.0008477505,0.00020955259],"domain_scores_gemma":[0.997825,0.0007730284,0.00029399613,0.0005776942,0.0004418568,0.00008831559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018018151,0.0006512934,0.00050109904,0.0006991193,0.0008248314,0.0010674609,0.0018049893,0.00121883,0.0016971277],"category_scores_gemma":[0.004982827,0.00022842543,0.00036103014,0.00076701783,0.0014246723,0.0025715185,0.002755018,0.0018152758,0.0004836701],"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.000318265,0.00010539327,0.00021979255,0.0002163103,0.00005461946,0.00024583226,0.0002831809,0.12022799,0.03949587,0.73274857,0.0034477497,0.10263641],"study_design_scores_gemma":[0.00008873665,0.00018937238,0.00012838932,0.00006236078,0.000042041855,0.00030096332,0.000029239647,0.84264785,0.024830129,0.11809732,0.013506352,0.00007721774],"about_ca_topic_score_codex":0.0008852919,"about_ca_topic_score_gemma":0.0006137959,"teacher_disagreement_score":0.0018049893,"about_ca_system_score_codex":0.0009687075,"about_ca_system_score_gemma":0.0009966847,"threshold_uncertainty_score":0.009529054},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08706999,0.0016971966,0.90075713,0.00047699778,0.00006798116,0.00009148467,0.00016282192,0.00029768256,0.009378713],"genre_scores_gemma":[0.96616435,0.00081690116,0.029494107,0.00007333029,0.0000735789,0.00011423369,0.000093918046,0.000057731482,0.0031118076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988055,0.00050206255,0.000037287937,0.00014426908,0.00030227308,0.00020861806],"domain_scores_gemma":[0.99790084,0.0014142178,0.00020285872,0.00012662317,0.00028381572,0.00007170184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022066475,0.0011712098,0.0007956412,0.0008096024,0.00058090064,0.0011365132,0.0009678233,0.0006043369,0.0015972857],"category_scores_gemma":[0.004692496,0.00049650733,0.00033320254,0.0013620608,0.001105437,0.0013543493,0.0010948386,0.0006451569,0.00034091895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097791744,0.000033587265,0.00026853252,0.0000788785,0.000028591667,0.00006798662,0.000108776156,0.9532039,0.002880855,0.030013574,0.0011040309,0.012113594],"study_design_scores_gemma":[0.0000071275695,0.000028351446,0.00012330501,0.00000433202,0.0000071042455,0.00001286193,0.000017374397,0.9871612,0.00045170382,0.011930237,0.00025102578,0.0000053741105],"about_ca_topic_score_codex":0.0034725235,"about_ca_topic_score_gemma":0.0027633654,"teacher_disagreement_score":0.0034725235,"about_ca_system_score_codex":0.002743524,"about_ca_system_score_gemma":0.001070178,"threshold_uncertainty_score":0.019905806},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06901205,0.00057386165,0.9241226,0.00032278456,0.00009876656,0.00018679538,0.00012335216,0.0010169201,0.004542809],"genre_scores_gemma":[0.8434294,0.00040150897,0.15270339,0.00016783834,0.000054049986,0.00029422855,0.0002015628,0.00008478244,0.0026632324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995735,0.00013890478,0.000018519719,0.000040488685,0.00014628364,0.00008223481],"domain_scores_gemma":[0.9989229,0.00050320494,0.00014478267,0.00016576538,0.00019798391,0.00006530672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079346437,0.00038557642,0.00037571572,0.00066014007,0.0006086674,0.00054270175,0.0009916268,0.0004139703,0.00078168814],"category_scores_gemma":[0.002762995,0.0001833185,0.00022175888,0.0006059914,0.00071746646,0.0010630095,0.0012732483,0.00042236975,0.0001554763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078748155,0.00015558202,0.0016648932,0.00026607886,0.00011227547,0.00054862886,0.00040775904,0.52472925,0.07069879,0.11175454,0.009365882,0.27950883],"study_design_scores_gemma":[0.000038715574,0.00014358471,0.00022830964,0.00001716953,0.00001822702,0.00016729794,0.000043399643,0.968228,0.008492636,0.017502988,0.0051001855,0.00001952982],"about_ca_topic_score_codex":0.0027448705,"about_ca_topic_score_gemma":0.0039804853,"teacher_disagreement_score":0.0027448705,"about_ca_system_score_codex":0.00066807965,"about_ca_system_score_gemma":0.0010825245,"threshold_uncertainty_score":0.005457759},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027961366,0.00021675875,0.969531,0.00015522607,0.000027370588,0.000050208495,0.000040039096,0.00019196088,0.0018260969],"genre_scores_gemma":[0.83217096,0.00016969598,0.16552378,0.00009495861,0.000042061503,0.00014517331,0.000075580065,0.000026428266,0.001751299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990627,0.00040844106,0.000031932836,0.00010463517,0.00024779938,0.00014441264],"domain_scores_gemma":[0.99931467,0.0003555808,0.00007890796,0.000088625835,0.00013166606,0.000030692452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083197287,0.0006274475,0.0007037038,0.00055067224,0.0006135108,0.0005216577,0.0012474867,0.00060209265,0.0011023155],"category_scores_gemma":[0.0017171482,0.00018822282,0.0002475572,0.0006941179,0.00042782188,0.0010763675,0.0010729429,0.0005409229,0.00017384923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031386266,0.00013721063,0.0004962978,0.0001380574,0.000057346904,0.0001600176,0.0001727112,0.7840727,0.017646443,0.05630191,0.0035069522,0.13699648],"study_design_scores_gemma":[0.000016568776,0.00003375507,0.000046695906,0.0000036784033,0.000006617149,0.000034435176,0.000009809562,0.9925466,0.0015700106,0.0052687884,0.00045690022,0.000006170874],"about_ca_topic_score_codex":0.0016410009,"about_ca_topic_score_gemma":0.0023340199,"teacher_disagreement_score":0.0016410009,"about_ca_system_score_codex":0.0009112061,"about_ca_system_score_gemma":0.0009573291,"threshold_uncertainty_score":0.0066112876},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2651949,0.0047612907,0.70204043,0.00060601125,0.00011126556,0.00006318389,0.0006540126,0.00046301534,0.026105862],"genre_scores_gemma":[0.97987545,0.0020890655,0.015935972,0.000060410344,0.00007075467,0.0001128277,0.0002771336,0.000067719644,0.0015105793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986198,0.00045965248,0.000053312357,0.0001290007,0.00047773143,0.00026045644],"domain_scores_gemma":[0.9878548,0.009930328,0.00047951622,0.0005365397,0.0010749061,0.00012386063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026524388,0.0010153247,0.0009676974,0.0015265181,0.0004927198,0.0015456914,0.0012843577,0.00080964784,0.0021289587],"category_scores_gemma":[0.015672598,0.00053431606,0.0006103218,0.0015951989,0.0019787834,0.0028490194,0.0009853936,0.0009696716,0.00040804583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007376687,0.000013292105,0.00028843628,0.00008262451,0.000022680995,0.00008446797,0.000067559944,0.9328548,0.0018104729,0.05733745,0.00045958793,0.0069048135],"study_design_scores_gemma":[0.0000045630395,0.000014710523,0.000195109,0.000022288874,0.0000076558845,0.00005595839,0.000016385,0.9785936,0.0010918889,0.019743469,0.00023922905,0.0000151976765],"about_ca_topic_score_codex":0.00366264,"about_ca_topic_score_gemma":0.0023245898,"teacher_disagreement_score":0.00366264,"about_ca_system_score_codex":0.002453057,"about_ca_system_score_gemma":0.0013049844,"threshold_uncertainty_score":0.017798245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045890067,0.00092687877,0.941192,0.00026121462,0.00017118087,0.000088870576,0.000087489934,0.0006134649,0.010768745],"genre_scores_gemma":[0.7239834,0.0012594202,0.2581705,0.00029848324,0.00022629538,0.0001652549,0.00014770243,0.00003312807,0.015715819],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995148,0.000065641354,0.000019301153,0.00008979026,0.0002477399,0.00006278146],"domain_scores_gemma":[0.99932504,0.00020919966,0.000082777755,0.00015488507,0.00019893574,0.000029174013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000414786,0.00050161924,0.00054891646,0.00054115703,0.0004753153,0.0005578386,0.0009751334,0.0006410818,0.0014820273],"category_scores_gemma":[0.00094599207,0.00024650816,0.00033985975,0.0006621772,0.00047889422,0.0010012644,0.0009336949,0.00048632605,0.0007369221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005630014,0.00017942929,0.0013947751,0.0003167833,0.00014094946,0.00083289767,0.0004579496,0.07938545,0.34217784,0.07484243,0.0048206556,0.49488783],"study_design_scores_gemma":[0.00012256262,0.00074259023,0.0007912593,0.000042310887,0.00017087035,0.0020071403,0.00009860306,0.7428981,0.19210355,0.024420794,0.036484327,0.00011786294],"about_ca_topic_score_codex":0.00047322374,"about_ca_topic_score_gemma":0.0008534323,"teacher_disagreement_score":0.0014820273,"about_ca_system_score_codex":0.00027758733,"about_ca_system_score_gemma":0.00032800462,"threshold_uncertainty_score":0.0049579144},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025995357,0.0007466882,0.96655333,0.0006833733,0.000037358095,0.000021496202,0.00006694938,0.00005745784,0.0058379183],"genre_scores_gemma":[0.9078771,0.0019417142,0.0847603,0.00021284963,0.0002881957,0.000116281124,0.00009634483,0.000041506057,0.0046657217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891496,0.00040915175,0.000026659822,0.00009787069,0.00043811093,0.00011331165],"domain_scores_gemma":[0.9964025,0.0027086677,0.00035997364,0.0002066254,0.00027202285,0.000050195802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015060698,0.0005612361,0.0007418706,0.00043846,0.00039199245,0.0010965848,0.0008005796,0.0008686905,0.0013430397],"category_scores_gemma":[0.0055819997,0.00050333294,0.0004321589,0.0007818673,0.0014412565,0.0019023609,0.00093963457,0.001009073,0.0003314075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007973618,0.000026461235,0.0003653836,0.000140555,0.000037590886,0.000100297824,0.000095474395,0.66446763,0.004181327,0.316795,0.0005831924,0.0131273735],"study_design_scores_gemma":[0.000016779264,0.000052406733,0.00018480643,0.000011517908,0.000011427293,0.00007165138,0.000022409773,0.92054355,0.0010418561,0.07740705,0.0006230648,0.000013461665],"about_ca_topic_score_codex":0.0010044996,"about_ca_topic_score_gemma":0.0010494501,"teacher_disagreement_score":0.0015060698,"about_ca_system_score_codex":0.0010153382,"about_ca_system_score_gemma":0.0009447828,"threshold_uncertainty_score":0.007964969},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03316945,0.0019778667,0.9610399,0.00026466366,0.00003933251,0.000027981883,0.0001079039,0.00020612143,0.0031667075],"genre_scores_gemma":[0.87094617,0.0034808,0.12100955,0.000096124924,0.00015175233,0.00015201754,0.00019876807,0.00017639222,0.0037882193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893564,0.0005550623,0.000041660332,0.00015985886,0.00017253771,0.00013520058],"domain_scores_gemma":[0.9978282,0.0016224283,0.00019463105,0.00008147111,0.00021615083,0.000057135592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020382293,0.0016538193,0.0017303878,0.0007039966,0.0004423886,0.0014761954,0.0009941999,0.0009903192,0.0013572223],"category_scores_gemma":[0.0039837286,0.0006616136,0.000571739,0.0016275893,0.0010541581,0.0018934528,0.00090457994,0.00089020806,0.0005098503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007300758,0.000012726865,0.00013530847,0.00011356797,0.00003436408,0.00008868349,0.00005928861,0.9659058,0.0023988197,0.017875776,0.0006807223,0.012621895],"study_design_scores_gemma":[0.000016089834,0.0000366455,0.00007357599,0.000008141072,0.000011740094,0.00003379353,0.000019215735,0.9820473,0.00095794274,0.016328733,0.00045804802,0.000008753542],"about_ca_topic_score_codex":0.0026552055,"about_ca_topic_score_gemma":0.0014069465,"teacher_disagreement_score":0.0026552055,"about_ca_system_score_codex":0.0012296014,"about_ca_system_score_gemma":0.0009307528,"threshold_uncertainty_score":0.010779321},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8207008,0.0024086393,0.16347411,0.00035789292,0.00009302196,0.00008103119,0.0002353084,0.00075322535,0.01189583],"genre_scores_gemma":[0.9780491,0.00048251936,0.02013492,0.00006477888,0.000026432932,0.000023967523,0.00011158713,0.000016615346,0.0010899666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867165,0.0003909321,0.000073963,0.00013087713,0.0005043754,0.00022820958],"domain_scores_gemma":[0.9941916,0.0036729225,0.0004002102,0.00056399754,0.0010372924,0.00013400245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011495387,0.00070248864,0.0006734879,0.00077753235,0.0004908822,0.00070650224,0.0005255628,0.0010570523,0.0016954698],"category_scores_gemma":[0.006487052,0.00020685336,0.00030700167,0.00079938135,0.0005569766,0.00071880413,0.0008093116,0.0003548791,0.00034673756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0057146144,0.00031528476,0.02601363,0.0010512349,0.0007263353,0.00070549716,0.00079995696,0.33594784,0.26390505,0.012461872,0.0012813546,0.35107732],"study_design_scores_gemma":[0.00026754756,0.0038451583,0.015691487,0.00011823573,0.0006028536,0.002574919,0.00027442226,0.737122,0.23144124,0.004096936,0.0037867525,0.00017853641],"about_ca_topic_score_codex":0.0012109072,"about_ca_topic_score_gemma":0.0015175965,"teacher_disagreement_score":0.0016954698,"about_ca_system_score_codex":0.00056911184,"about_ca_system_score_gemma":0.00048890663,"threshold_uncertainty_score":0.0060793757},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013161558,0.0002723029,0.98444843,0.0001076544,0.00002196911,0.00003444492,0.000027304572,0.00009164007,0.0018347136],"genre_scores_gemma":[0.49002248,0.00063443586,0.5068022,0.00012711973,0.000041464416,0.00014827045,0.000109411536,0.00004467755,0.0020699021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999463,0.00026151296,0.000025333742,0.000056692665,0.0001535896,0.000039805465],"domain_scores_gemma":[0.9990871,0.0004403957,0.00013814657,0.0001282645,0.00018301132,0.000023073138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008709689,0.00042603665,0.00031580552,0.0004794222,0.00025868823,0.0004618096,0.0003440713,0.00047603375,0.0012592407],"category_scores_gemma":[0.003751628,0.00018230351,0.00017238932,0.0006128329,0.0006435375,0.00056075247,0.0005798261,0.0004479258,0.00047027718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043718153,0.000054810404,0.0010385917,0.00025754186,0.0000404418,0.0002981521,0.00045470006,0.45386204,0.056183398,0.22612816,0.0024969897,0.25874794],"study_design_scores_gemma":[0.000054669992,0.00020291709,0.00032569363,0.000059813265,0.000013351719,0.00034642476,0.000037926337,0.9146113,0.023735704,0.054668814,0.005911301,0.00003211934],"about_ca_topic_score_codex":0.00043730525,"about_ca_topic_score_gemma":0.0006121779,"teacher_disagreement_score":0.0012592407,"about_ca_system_score_codex":0.0004342203,"about_ca_system_score_gemma":0.00067288807,"threshold_uncertainty_score":0.0046061873},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34438998,0.005554811,0.6203747,0.0009711521,0.00012271953,0.00006420187,0.00039257688,0.00036099183,0.027768984],"genre_scores_gemma":[0.9900838,0.0014922268,0.006606695,0.00005185755,0.00007283458,0.000032479307,0.00004875424,0.000024372179,0.0015869923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982488,0.00070829276,0.000058948423,0.00017817084,0.0004582706,0.00034755116],"domain_scores_gemma":[0.98530143,0.011779907,0.0012621565,0.0005333477,0.0009054658,0.00021759963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002280682,0.0013891555,0.0011120976,0.00092354923,0.00079380855,0.0020081955,0.0009548126,0.001209046,0.0019934818],"category_scores_gemma":[0.012509252,0.0006951973,0.00044431852,0.0019841837,0.0020039445,0.0023333414,0.001370488,0.0010121197,0.00037867852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001888794,0.000053643827,0.0021411937,0.00020093957,0.000061702,0.0007004002,0.00032102884,0.8107993,0.005718768,0.16406874,0.0011889329,0.014556555],"study_design_scores_gemma":[0.000012988413,0.0000712239,0.00061211636,0.000026620519,0.0000236099,0.00038038625,0.00008079497,0.93448484,0.0017644031,0.062120643,0.00039210301,0.000030191793],"about_ca_topic_score_codex":0.0012251543,"about_ca_topic_score_gemma":0.0012028825,"teacher_disagreement_score":0.002280682,"about_ca_system_score_codex":0.0020213232,"about_ca_system_score_gemma":0.0006528209,"threshold_uncertainty_score":0.014665842},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05381068,0.00040071347,0.9438698,0.00023257654,0.000022732207,0.00001794447,0.000025161347,0.00021657582,0.0014037827],"genre_scores_gemma":[0.8750262,0.00043823378,0.12329488,0.00006741241,0.000047558962,0.000056972483,0.000050557308,0.000025482783,0.0009926225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929583,0.00032103228,0.00001766978,0.00006295246,0.00023383298,0.000068682086],"domain_scores_gemma":[0.9980641,0.0014725431,0.000119780336,0.00015825534,0.00015344162,0.000031787644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001064387,0.00050120056,0.000630036,0.00037217562,0.00025398005,0.00058416225,0.00054595794,0.0007133319,0.0004362142],"category_scores_gemma":[0.0051753363,0.0003484785,0.00030883556,0.00051670946,0.0010681638,0.00080492685,0.0007671509,0.0008796699,0.00013063232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009019289,0.000015627233,0.00025399018,0.000031057785,0.000021922202,0.000043463457,0.0000441677,0.96777815,0.00249933,0.015710363,0.0002014291,0.013310401],"study_design_scores_gemma":[0.0000049613955,0.000010352504,0.000035408073,0.0000016525048,0.000003076411,0.0000051628153,0.0000014868212,0.99728847,0.00038092234,0.0021880458,0.00007802435,0.0000024909189],"about_ca_topic_score_codex":0.0035122745,"about_ca_topic_score_gemma":0.0026030156,"teacher_disagreement_score":0.0035122745,"about_ca_system_score_codex":0.0008942837,"about_ca_system_score_gemma":0.00073195004,"threshold_uncertainty_score":0.006983638},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025536064,0.00031407198,0.96799,0.0003434117,0.00004019228,0.000061209736,0.00007466589,0.00016034298,0.005479984],"genre_scores_gemma":[0.82531327,0.0005303327,0.16927134,0.00020721475,0.000087662636,0.000319381,0.00015787552,0.000047908707,0.004064967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998166,0.0009771532,0.000047959526,0.00012525704,0.00047105184,0.00021261066],"domain_scores_gemma":[0.99582857,0.0030878892,0.00030830633,0.00032748724,0.0003449923,0.00010275707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024977636,0.00062227587,0.00087068055,0.00079010276,0.00059678504,0.00092564855,0.0012096968,0.0012017832,0.0014516106],"category_scores_gemma":[0.00938694,0.00036470252,0.00066940277,0.001257279,0.0011325976,0.0014002869,0.0019091134,0.0009910908,0.00023939363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069115515,0.000017516271,0.0002680539,0.000030080204,0.000013788937,0.000054910597,0.000042875494,0.8906703,0.0005647229,0.09457227,0.0007349431,0.012961449],"study_design_scores_gemma":[0.000011403694,0.000012559445,0.000037682883,0.0000036553067,0.0000023799648,0.000016938144,0.0000048440324,0.9699374,0.00012565777,0.029536242,0.00030753776,0.0000036428341],"about_ca_topic_score_codex":0.0048362995,"about_ca_topic_score_gemma":0.003823875,"teacher_disagreement_score":0.0048362995,"about_ca_system_score_codex":0.0019537376,"about_ca_system_score_gemma":0.0014114247,"threshold_uncertainty_score":0.014175415},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03541718,0.00050356117,0.95972073,0.00024117343,0.000016852127,0.00002223047,0.000051906325,0.00013116324,0.0038951416],"genre_scores_gemma":[0.92890394,0.00094666705,0.06638929,0.00017729308,0.000095908705,0.00016619018,0.00011401285,0.00009320236,0.0031135157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979533,0.0007107568,0.00007091031,0.00024441333,0.0007958163,0.00022481458],"domain_scores_gemma":[0.9887179,0.007214496,0.0011771215,0.000747638,0.0018660361,0.0002768504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025077916,0.00081601617,0.00086155307,0.0009531811,0.00046958798,0.001178323,0.0014631178,0.00097342866,0.0016947628],"category_scores_gemma":[0.013038157,0.00055516686,0.00059033924,0.0009845964,0.002164186,0.0030949544,0.0017586523,0.0013919298,0.0005120148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022880654,0.000044252083,0.00079706684,0.00015912265,0.000065850145,0.00041488014,0.0005464244,0.43258244,0.01454298,0.5275277,0.0013511558,0.02173939],"study_design_scores_gemma":[0.00001066853,0.00004810562,0.00014915627,0.000012981316,0.000011048391,0.00018917402,0.00003351936,0.90456915,0.0023785012,0.09182616,0.0007419644,0.00002955902],"about_ca_topic_score_codex":0.00073349074,"about_ca_topic_score_gemma":0.0003728939,"teacher_disagreement_score":0.0025077916,"about_ca_system_score_codex":0.0013633163,"about_ca_system_score_gemma":0.00076164544,"threshold_uncertainty_score":0.0132626295},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054806434,0.00029314155,0.9410086,0.00020173262,0.00001947058,0.000036852667,0.000020149964,0.00009515778,0.003518499],"genre_scores_gemma":[0.93182755,0.00015331093,0.06703961,0.000051507726,0.0000168967,0.0000835624,0.000012335662,0.000014715919,0.0008005075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989723,0.000527572,0.000026610602,0.00010774385,0.00017940097,0.00018651174],"domain_scores_gemma":[0.99874437,0.0008490564,0.00013276449,0.000118175776,0.00008952054,0.00006613268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019437947,0.0005239305,0.00060504087,0.00043181467,0.00060552603,0.00077770685,0.0009631407,0.0006602999,0.0005342695],"category_scores_gemma":[0.0035288974,0.00034270078,0.00025950736,0.0007362727,0.0014325032,0.0009883115,0.0011089742,0.00057186786,0.00013238199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044335884,0.000028371798,0.0001765127,0.000018700357,0.000016328686,0.0000654611,0.00006408248,0.9567187,0.0017855735,0.02660474,0.00044124684,0.014036001],"study_design_scores_gemma":[0.000015766567,0.000022947199,0.00005914654,0.0000028023558,0.000005793606,0.000019737117,0.000019473939,0.97945845,0.0005495604,0.019542849,0.00029684688,0.000006624442],"about_ca_topic_score_codex":0.0022786972,"about_ca_topic_score_gemma":0.0027676905,"teacher_disagreement_score":0.0022786972,"about_ca_system_score_codex":0.0009091131,"about_ca_system_score_gemma":0.0013082399,"threshold_uncertainty_score":0.010279894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01943369,0.0002678852,0.97788435,0.00015733852,0.000012217148,0.000019440604,0.000022690945,0.00008025382,0.0021220434],"genre_scores_gemma":[0.860241,0.00053382706,0.13504164,0.00011645719,0.000036591522,0.00013909883,0.00005721625,0.00004656642,0.0037876216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999511,0.00024407264,0.000014622476,0.00006441926,0.00011695857,0.00004885733],"domain_scores_gemma":[0.99937516,0.00043564837,0.00005607718,0.000039437728,0.00007971208,0.000013955758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009611777,0.0007375628,0.00073824485,0.00030548143,0.0003052063,0.00072932435,0.00056102936,0.0006958147,0.0007012319],"category_scores_gemma":[0.0017903484,0.0003317252,0.00027858713,0.00047787116,0.0008281999,0.0010628636,0.000750062,0.0005439939,0.0002452993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001003606,0.00004803091,0.00027636928,0.00009254933,0.000030408084,0.00012564186,0.00015799062,0.9100821,0.0047299406,0.040815644,0.00089317927,0.042647768],"study_design_scores_gemma":[0.000014936125,0.000040656352,0.00004743491,0.0000071416653,0.0000074012974,0.00003555039,0.000021824959,0.97612077,0.0017089065,0.02138375,0.0006067632,0.0000048484762],"about_ca_topic_score_codex":0.0006422272,"about_ca_topic_score_gemma":0.0006467313,"teacher_disagreement_score":0.0009611777,"about_ca_system_score_codex":0.00054577994,"about_ca_system_score_gemma":0.00055497297,"threshold_uncertainty_score":0.005083263},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12058934,0.0018021499,0.85782,0.00045663054,0.00005874007,0.000059383976,0.00015438886,0.0002983004,0.018761035],"genre_scores_gemma":[0.9798029,0.001026473,0.01724697,0.000054722514,0.000045134864,0.000043420387,0.00005005822,0.000028573744,0.0017018116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989511,0.00035178062,0.0000320862,0.000120305864,0.00035989526,0.00018484665],"domain_scores_gemma":[0.9946408,0.0040729716,0.0003687501,0.00025498206,0.0005827751,0.00007962051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019025819,0.0011890325,0.0007985686,0.0005675356,0.0005330009,0.0015489868,0.0008822293,0.0011467197,0.0023257225],"category_scores_gemma":[0.0069919564,0.000416052,0.00045819103,0.00071790116,0.0012270923,0.001004624,0.0009651497,0.0007757154,0.00044344706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018045635,0.000035346013,0.0009030866,0.00018662357,0.000041355604,0.0002281528,0.00020450294,0.91675,0.013308004,0.048013832,0.000572946,0.019575702],"study_design_scores_gemma":[0.000007471611,0.00007900069,0.00034711938,0.00002400454,0.0000150292235,0.000128694,0.00003317394,0.99023527,0.0017070294,0.007131845,0.00027376827,0.000017595929],"about_ca_topic_score_codex":0.0022153356,"about_ca_topic_score_gemma":0.0017615895,"teacher_disagreement_score":0.0023257225,"about_ca_system_score_codex":0.00142182,"about_ca_system_score_gemma":0.0009441867,"threshold_uncertainty_score":0.0103161335},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22310142,0.014592269,0.53308904,0.0068460032,0.001067074,0.0001933319,0.0026296836,0.0007445074,0.21773663],"genre_scores_gemma":[0.97576004,0.004836949,0.010131672,0.00042224865,0.00044687878,0.00029562472,0.0005615549,0.00012237534,0.0074225846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968587,0.0011269068,0.00007161584,0.0003762164,0.0007042567,0.0008622892],"domain_scores_gemma":[0.9800726,0.015872791,0.00077323616,0.0008515257,0.0018723876,0.00055750017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026420096,0.0012546589,0.0015104718,0.0019044201,0.0013605672,0.0033493934,0.002330415,0.0015739384,0.012836902],"category_scores_gemma":[0.01595633,0.0008362214,0.0004923452,0.0021731548,0.0034466067,0.005510646,0.003714345,0.002736571,0.0016961885],"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.00058140955,0.000081717146,0.0005443273,0.00046033825,0.00006469915,0.00033750187,0.00046847487,0.11352521,0.0048075924,0.85112303,0.010367677,0.017638162],"study_design_scores_gemma":[0.00008716783,0.00008376806,0.00040327662,0.00028632,0.00003542271,0.00030646476,0.0002757332,0.423687,0.0023595432,0.5660998,0.0062672887,0.000108175074],"about_ca_topic_score_codex":0.0031666593,"about_ca_topic_score_gemma":0.0010439646,"teacher_disagreement_score":0.012836902,"about_ca_system_score_codex":0.0030375521,"about_ca_system_score_gemma":0.001972714,"threshold_uncertainty_score":0.042943716},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056792375,0.0005425268,0.9405782,0.00015184439,0.000012029803,0.000020129995,0.000026765038,0.0001056619,0.0017703185],"genre_scores_gemma":[0.77692425,0.00058607204,0.22115733,0.000077349236,0.000039793496,0.000059282298,0.000044360648,0.000027958173,0.0010835867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844295,0.00065948145,0.00007061173,0.00016687269,0.00050834235,0.00015173151],"domain_scores_gemma":[0.99441755,0.004208091,0.00057085336,0.0003004361,0.0004199758,0.00008304524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022816816,0.0006395552,0.00096493866,0.00071067887,0.00034521485,0.0010642501,0.00060354656,0.0010614075,0.00063577114],"category_scores_gemma":[0.008178413,0.00065588293,0.00047516762,0.0007032992,0.0010985956,0.0017106013,0.001210065,0.0009022373,0.0002873906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041266266,0.00010336819,0.0020859523,0.00020359812,0.00009392413,0.00029550525,0.00030942098,0.82401794,0.023891842,0.06723937,0.00080196833,0.080544494],"study_design_scores_gemma":[0.000012538564,0.000045161498,0.00016949596,0.000009089816,0.000011318836,0.000112856,0.000018719518,0.9825424,0.0046008555,0.01217,0.00029601413,0.000011644138],"about_ca_topic_score_codex":0.00034754205,"about_ca_topic_score_gemma":0.00050733495,"teacher_disagreement_score":0.0022816816,"about_ca_system_score_codex":0.00058354094,"about_ca_system_score_gemma":0.00054108945,"threshold_uncertainty_score":0.012066841},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16370519,0.002337049,0.8304502,0.0005452471,0.000101250545,0.00007943147,0.00005593325,0.00057039177,0.0021553314],"genre_scores_gemma":[0.9318995,0.0012951621,0.065524064,0.0000589403,0.00008334886,0.00009818087,0.000033644526,0.00004846355,0.00095870066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893504,0.00047946494,0.000036495898,0.000081681435,0.0003367456,0.0001305877],"domain_scores_gemma":[0.99426454,0.0042284834,0.00062687194,0.0003619726,0.00041073468,0.000107395754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026413552,0.00079748273,0.0007657676,0.00091169804,0.0007431963,0.0007865693,0.0010079248,0.0008561923,0.000518218],"category_scores_gemma":[0.010974991,0.00053002813,0.0002677219,0.0012214438,0.0012890932,0.0016154927,0.0010691951,0.00060875237,0.00016879433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009611304,0.000017516912,0.00049188925,0.00006470132,0.00002474305,0.000102100385,0.00010710707,0.96984005,0.0020154144,0.011204171,0.00040743928,0.015628764],"study_design_scores_gemma":[0.000028484164,0.00007363189,0.00012458932,0.000006919084,0.000010565769,0.00003957279,0.000023156334,0.986766,0.0007394669,0.011688714,0.0004895947,0.000009375298],"about_ca_topic_score_codex":0.0016091327,"about_ca_topic_score_gemma":0.0009862201,"teacher_disagreement_score":0.0026413552,"about_ca_system_score_codex":0.0008090841,"about_ca_system_score_gemma":0.0006189588,"threshold_uncertainty_score":0.013968945},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022752162,0.0003619751,0.975726,0.000068867535,0.000015008859,0.000019151039,0.000020807673,0.000104080835,0.00093187334],"genre_scores_gemma":[0.7991006,0.00072033465,0.19842261,0.0000365993,0.000035579,0.0001018938,0.00007043151,0.000041767908,0.0014702705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994056,0.00024188415,0.000036795816,0.00006783307,0.00020466844,0.000043217777],"domain_scores_gemma":[0.99909997,0.00058317254,0.00012080776,0.00006451251,0.000111648485,0.000020012929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001060314,0.000509415,0.0006161154,0.0005352196,0.0003258186,0.0006450219,0.00049496046,0.0004632644,0.00035722647],"category_scores_gemma":[0.002923055,0.000318714,0.00018141446,0.0005853483,0.0007122977,0.00088600954,0.000705486,0.00038782958,0.00009991611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003812614,0.000016892964,0.00020478622,0.000059097176,0.000014194093,0.000046995254,0.000083198385,0.9261558,0.0033941574,0.031928252,0.0005887705,0.037469763],"study_design_scores_gemma":[0.0000052528394,0.00002215598,0.00006202419,0.000003041978,0.000003814418,0.000017783485,0.000009572907,0.9851092,0.00085166557,0.013583463,0.00032838533,0.0000035675137],"about_ca_topic_score_codex":0.0010190391,"about_ca_topic_score_gemma":0.001196673,"teacher_disagreement_score":0.001060314,"about_ca_system_score_codex":0.0006189142,"about_ca_system_score_gemma":0.00062848144,"threshold_uncertainty_score":0.005607486},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015590314,0.0005322102,0.9786088,0.00050023943,0.00010567507,0.000046658646,0.00009337646,0.0001314147,0.004391285],"genre_scores_gemma":[0.7684468,0.0013036256,0.22028622,0.00040866752,0.00017695954,0.00027167026,0.00035709157,0.000082679995,0.00866631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993043,0.00022007062,0.00002372752,0.00008250775,0.00029067698,0.000078797355],"domain_scores_gemma":[0.9982293,0.0011465745,0.00015822871,0.00016062881,0.00026410675,0.00004119219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010040111,0.00048177165,0.00047718384,0.00066531927,0.00033595975,0.000823357,0.0008660912,0.0006971984,0.0025820117],"category_scores_gemma":[0.0053478703,0.0002046495,0.0002785542,0.0008797542,0.0011484666,0.0020608334,0.0009805994,0.0012103382,0.00032437433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013641492,0.0000231351,0.00021661914,0.00013107053,0.000017370341,0.000095175856,0.00014779752,0.5857814,0.004793636,0.36773422,0.0024130112,0.038510107],"study_design_scores_gemma":[0.000011663176,0.00001730444,0.00003833907,0.000010213465,0.0000035703392,0.000018309842,0.00001520553,0.95190233,0.0007275734,0.04601817,0.0012308429,0.000006498095],"about_ca_topic_score_codex":0.003736533,"about_ca_topic_score_gemma":0.0026714457,"teacher_disagreement_score":0.003736533,"about_ca_system_score_codex":0.0015106846,"about_ca_system_score_gemma":0.0010427863,"threshold_uncertainty_score":0.010960817},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021549447,0.0011763473,0.97377044,0.00020313625,0.00004629894,0.00003904347,0.000026346854,0.00008321985,0.0031057345],"genre_scores_gemma":[0.8535767,0.0025683886,0.13977551,0.00012860834,0.00018425581,0.00012210931,0.000046411427,0.000037488895,0.003560623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912006,0.00048563012,0.000029954563,0.00009357405,0.00021302913,0.00005775639],"domain_scores_gemma":[0.998703,0.0009743048,0.00007594485,0.00009649933,0.00013287753,0.000017401622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011825423,0.00074303383,0.0006397811,0.00037824374,0.00035752493,0.0006862408,0.00055459223,0.0006882351,0.00092112774],"category_scores_gemma":[0.003300505,0.00023048562,0.00038333944,0.0004866952,0.0006461802,0.0010160233,0.00053557707,0.0005284557,0.00032296474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026215366,0.00005725872,0.0008382951,0.00024281995,0.00007475633,0.00072234444,0.0002757287,0.74276245,0.016462864,0.1578869,0.0020072425,0.07840729],"study_design_scores_gemma":[0.000013166908,0.00007924344,0.000093835515,0.00001203181,0.000018902914,0.00018142984,0.000015568969,0.9807103,0.0026590999,0.014925492,0.0012791922,0.000011724825],"about_ca_topic_score_codex":0.0005962083,"about_ca_topic_score_gemma":0.000600873,"teacher_disagreement_score":0.0011825423,"about_ca_system_score_codex":0.00050095364,"about_ca_system_score_gemma":0.000351054,"threshold_uncertainty_score":0.0062539577},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080080286,0.000369595,0.916174,0.0001245641,0.00007224427,0.00011499792,0.000058611524,0.00042930478,0.0025763593],"genre_scores_gemma":[0.86511374,0.00016004602,0.1321778,0.00007231921,0.000071254115,0.00013391233,0.000083129744,0.000017925715,0.0021699965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999549,0.0001854147,0.000022452332,0.00006563308,0.00012024375,0.000057351215],"domain_scores_gemma":[0.9991135,0.0002898755,0.00017741969,0.00019946539,0.00013530887,0.000084322215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059741276,0.00033837743,0.00038328522,0.0004898695,0.0007246024,0.00036746624,0.0008336131,0.00033978123,0.00076506916],"category_scores_gemma":[0.0017548751,0.00015656618,0.00017347929,0.0005134842,0.0006036251,0.00057815044,0.0007065349,0.00041448345,0.0003414384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006525394,0.00030342778,0.002204955,0.00013278108,0.00006874495,0.00032649087,0.00056080526,0.2176624,0.11564206,0.07578211,0.004881223,0.58178246],"study_design_scores_gemma":[0.000083587736,0.00047804532,0.000733902,0.0000084081385,0.000034221404,0.00042808734,0.0000357859,0.96407485,0.016405767,0.010381547,0.007283817,0.00005202817],"about_ca_topic_score_codex":0.0015677754,"about_ca_topic_score_gemma":0.002602429,"teacher_disagreement_score":0.0015677754,"about_ca_system_score_codex":0.00039566835,"about_ca_system_score_gemma":0.00063762075,"threshold_uncertainty_score":0.0031594634},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065641664,0.0024645792,0.91551685,0.0004507199,0.00011602102,0.000051985182,0.00015518162,0.00017101852,0.015431969],"genre_scores_gemma":[0.9514136,0.0032715662,0.040594198,0.00017345464,0.00018694327,0.000108424196,0.000099234945,0.000040410778,0.004112225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875116,0.00037144852,0.000031311378,0.00010886386,0.0005664132,0.00017079551],"domain_scores_gemma":[0.9953584,0.0032577487,0.00037771088,0.00033526865,0.0006001044,0.00007069046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011502359,0.00077206676,0.00061433256,0.0008044845,0.0005659857,0.0015451161,0.0007877992,0.0009536848,0.0015853823],"category_scores_gemma":[0.0057506333,0.00038834996,0.00056756445,0.0006602492,0.0014295003,0.0020573903,0.0007668688,0.001038822,0.0004291604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004933207,0.000023045266,0.00042466132,0.00011322147,0.000020852149,0.00023525275,0.00015649719,0.67013675,0.0037094606,0.31141433,0.00075810344,0.012958519],"study_design_scores_gemma":[0.000011575417,0.00006565649,0.00023537914,0.000028470597,0.000016755046,0.00030939735,0.00005211067,0.89881325,0.001446588,0.09582879,0.0031597093,0.00003224314],"about_ca_topic_score_codex":0.0014712827,"about_ca_topic_score_gemma":0.0011629697,"teacher_disagreement_score":0.0015853823,"about_ca_system_score_codex":0.0014218985,"about_ca_system_score_gemma":0.0007850411,"threshold_uncertainty_score":0.01031667},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010171052,0.00093501556,0.9870259,0.0001755206,0.000049314658,0.000035808232,0.000020351903,0.00016215548,0.001424866],"genre_scores_gemma":[0.5806233,0.0019452579,0.41230157,0.00026839477,0.00018615929,0.00030263353,0.00012282572,0.00005576758,0.0041940785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848014,0.00060491805,0.000050213905,0.000149174,0.00064420403,0.00007132154],"domain_scores_gemma":[0.9956826,0.00324947,0.00029983823,0.0002535056,0.00046805825,0.000046539448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017655048,0.00075045665,0.0006602565,0.0006019254,0.00035083704,0.0008758774,0.0006300936,0.0011522066,0.00091680634],"category_scores_gemma":[0.009220537,0.00037951188,0.0002688253,0.0006590205,0.0008842318,0.0012537964,0.0008836817,0.0012440183,0.00039282476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029859963,0.00008563047,0.0007837212,0.00037074,0.000093301984,0.00013959374,0.00021913354,0.66020346,0.03933431,0.15469778,0.0019028322,0.14187096],"study_design_scores_gemma":[0.000024139063,0.00011776366,0.00016261244,0.00002031862,0.000013099584,0.000071249575,0.000016395106,0.96300066,0.0062688743,0.028149744,0.002133048,0.000022138662],"about_ca_topic_score_codex":0.00061390235,"about_ca_topic_score_gemma":0.0006869448,"teacher_disagreement_score":0.0017655048,"about_ca_system_score_codex":0.0008142258,"about_ca_system_score_gemma":0.00084005244,"threshold_uncertainty_score":0.009337008},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2552628,0.009130202,0.69450617,0.0011989516,0.00015600656,0.00007110368,0.0003342335,0.0004590492,0.03888153],"genre_scores_gemma":[0.9865715,0.0029410254,0.008075161,0.00008025772,0.00014120691,0.000040680585,0.000064097825,0.00004398372,0.0020422102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979715,0.00081616535,0.00005406382,0.00016864866,0.0006236892,0.00036599298],"domain_scores_gemma":[0.983487,0.014043539,0.0009919829,0.000449336,0.00086611084,0.00016211446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027532685,0.0014460505,0.0013044663,0.001247943,0.0007158117,0.0017452709,0.000990606,0.001078528,0.002136447],"category_scores_gemma":[0.015046035,0.0006359884,0.0005918237,0.0017550915,0.0021846395,0.0022598892,0.0014656034,0.0012954028,0.00037114494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013373503,0.00004739535,0.0014272807,0.00020680975,0.000039296734,0.0006207862,0.00021000244,0.8647399,0.003928413,0.11422166,0.0010406529,0.013384075],"study_design_scores_gemma":[0.000007844025,0.00007485681,0.0005947932,0.000052207466,0.000018803223,0.0003393321,0.000072663184,0.9543531,0.001256837,0.042769004,0.00043330638,0.000027369357],"about_ca_topic_score_codex":0.0016963241,"about_ca_topic_score_gemma":0.0012055362,"teacher_disagreement_score":0.0027532685,"about_ca_system_score_codex":0.0023147804,"about_ca_system_score_gemma":0.0007510104,"threshold_uncertainty_score":0.01679498},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07821446,0.0006250764,0.9178199,0.00014012735,0.00007021742,0.0000894792,0.00008056419,0.00030268548,0.0026574451],"genre_scores_gemma":[0.89677304,0.00036764352,0.10085089,0.000099345154,0.00005491658,0.00009900202,0.000113835056,0.000017890357,0.0016233263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988636,0.00038567244,0.0000852393,0.00019187423,0.00035691244,0.00011680079],"domain_scores_gemma":[0.9979242,0.0008414634,0.00031354825,0.00057549257,0.000259026,0.00008622273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010353043,0.0007178204,0.0009589201,0.00046780094,0.00056508067,0.0006570309,0.0016410828,0.00040720764,0.0005813905],"category_scores_gemma":[0.00306019,0.0002285762,0.00043893862,0.0006384109,0.0006270073,0.0014603804,0.0009942552,0.00043345007,0.00022646718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00156263,0.00022571409,0.009050884,0.00043053032,0.0003067082,0.0016550008,0.000755328,0.42568463,0.06712459,0.07683625,0.002427604,0.4139402],"study_design_scores_gemma":[0.00012509627,0.00057117274,0.0015644045,0.000033158944,0.00013679755,0.0018230543,0.00014153545,0.9521609,0.014887107,0.022275498,0.006208545,0.00007274358],"about_ca_topic_score_codex":0.0014181256,"about_ca_topic_score_gemma":0.0030381773,"teacher_disagreement_score":0.0016410828,"about_ca_system_score_codex":0.00053412793,"about_ca_system_score_gemma":0.001081008,"threshold_uncertainty_score":0.0054752827},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03100367,0.0059054736,0.9312006,0.00078641187,0.00011357057,0.00006841847,0.00019900441,0.00023207758,0.030490777],"genre_scores_gemma":[0.8433983,0.0078455405,0.1412574,0.00037247513,0.00039165982,0.00046977578,0.00026220948,0.00021188756,0.0057907226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99739635,0.0010241284,0.00007922762,0.00020540127,0.00093642744,0.00035843378],"domain_scores_gemma":[0.9860925,0.011869507,0.00042781295,0.00054699037,0.0008672173,0.00019610189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003880801,0.0020278126,0.0010489813,0.00166234,0.0008886166,0.0028759993,0.0013741369,0.0012872772,0.004606217],"category_scores_gemma":[0.022012249,0.00061365054,0.00058885285,0.0018694005,0.0016455334,0.0039439434,0.0022467277,0.0019899227,0.0008771251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018050599,0.000051458923,0.00034044933,0.00027765185,0.000054444008,0.00012680588,0.00019140875,0.58415365,0.004883665,0.35278443,0.0029909802,0.053964507],"study_design_scores_gemma":[0.000016599992,0.000054990156,0.00016930392,0.00008937334,0.000022859518,0.00013901072,0.000048518086,0.7711095,0.0022449254,0.22336924,0.0027098136,0.000025784773],"about_ca_topic_score_codex":0.0008330942,"about_ca_topic_score_gemma":0.00073335966,"teacher_disagreement_score":0.004606217,"about_ca_system_score_codex":0.0025927764,"about_ca_system_score_gemma":0.0008479757,"threshold_uncertainty_score":0.020523846},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016003689,0.0003372253,0.97737396,0.00018732972,0.000069182686,0.00012488062,0.000027631264,0.00013937023,0.005736817],"genre_scores_gemma":[0.8473017,0.0007771877,0.14593369,0.00022466386,0.00006641084,0.00056822563,0.00008352925,0.000042461725,0.005002177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992685,0.00024659114,0.00003374784,0.00007141938,0.00029930382,0.00008041117],"domain_scores_gemma":[0.99846435,0.0008583752,0.00017795966,0.00021550192,0.00021528911,0.0000685951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011070732,0.00036835604,0.00035031987,0.0004275283,0.000773787,0.00060414337,0.0010728943,0.00052091584,0.0010725209],"category_scores_gemma":[0.0026496612,0.0001734267,0.00022212304,0.0004581441,0.0009005213,0.0011582893,0.0015621143,0.00065394706,0.00016737099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002926314,0.00015189643,0.001198972,0.0004140307,0.00009665452,0.0012072055,0.0011742342,0.15918201,0.052194465,0.5890954,0.0055198334,0.18947266],"study_design_scores_gemma":[0.000060452858,0.0001834018,0.0002906756,0.000050426217,0.00006332053,0.0010075938,0.00023110607,0.83787984,0.012618416,0.11880445,0.028737197,0.000073227944],"about_ca_topic_score_codex":0.00068463216,"about_ca_topic_score_gemma":0.0011278264,"teacher_disagreement_score":0.0011070732,"about_ca_system_score_codex":0.00046996505,"about_ca_system_score_gemma":0.0007485802,"threshold_uncertainty_score":0.0058547854},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40390238,0.0035322378,0.5774847,0.00036487012,0.00008696032,0.000052167008,0.00010884105,0.00027668974,0.014191131],"genre_scores_gemma":[0.9890443,0.00091051694,0.008656298,0.00002400358,0.000032057116,0.000017231945,0.000023565186,0.000009737525,0.0012821404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941885,0.00016252826,0.00002858711,0.00008341048,0.00017314826,0.00013347794],"domain_scores_gemma":[0.99700063,0.0020703801,0.00042052256,0.00012691943,0.00033590733,0.00004564243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006793141,0.0011623667,0.0008966843,0.000510801,0.00071357086,0.001357691,0.000670943,0.001062645,0.00061882247],"category_scores_gemma":[0.003401752,0.0002998195,0.00044274912,0.0006518448,0.0008744723,0.0010629892,0.00074544235,0.00064324954,0.00019544516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016733659,0.00003865375,0.0022264763,0.00019574305,0.00007593687,0.0010437822,0.00026615872,0.93891245,0.0145175485,0.024125885,0.00034055405,0.018089494],"study_design_scores_gemma":[0.000005081433,0.0001232608,0.0008800803,0.000013170859,0.000053006683,0.00042394368,0.00007301011,0.99056655,0.0036765065,0.003726308,0.00043821384,0.000020839832],"about_ca_topic_score_codex":0.0031938413,"about_ca_topic_score_gemma":0.0033204106,"teacher_disagreement_score":0.0031938413,"about_ca_system_score_codex":0.0010752461,"about_ca_system_score_gemma":0.0004994479,"threshold_uncertainty_score":0.0078015327},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00541422,0.0009271109,0.9832825,0.0002834616,0.00031208532,0.00008335011,0.000251897,0.0004608914,0.008984466],"genre_scores_gemma":[0.5310022,0.0028319627,0.43785787,0.0007090677,0.00048115937,0.00048768058,0.0018806432,0.00011939632,0.024629904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986828,0.00029958406,0.00005520327,0.00019419214,0.000591104,0.00017710439],"domain_scores_gemma":[0.99871755,0.0003661733,0.00008958705,0.00035546557,0.0004177209,0.000053487165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006943842,0.000586561,0.0007410753,0.00067302503,0.0005200204,0.0011625914,0.0010084895,0.0007053774,0.0032105257],"category_scores_gemma":[0.0022091991,0.0002121692,0.000335036,0.0013015715,0.0006721036,0.0011015702,0.0012653441,0.001170486,0.0017147657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046843503,0.000110474735,0.000676741,0.00023992656,0.000073022755,0.0002937498,0.00013752907,0.20180905,0.02299418,0.42236346,0.015645886,0.3351877],"study_design_scores_gemma":[0.000068361085,0.00012509672,0.00021414274,0.000037111142,0.000021637901,0.00026495708,0.000025078227,0.8887148,0.009479794,0.0714486,0.029569397,0.00003113369],"about_ca_topic_score_codex":0.0029917806,"about_ca_topic_score_gemma":0.0036992144,"teacher_disagreement_score":0.0032105257,"about_ca_system_score_codex":0.000990239,"about_ca_system_score_gemma":0.0017259464,"threshold_uncertainty_score":0.010740221},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41027373,0.0047222218,0.5702689,0.00028978873,0.0000820125,0.00006184586,0.0000998106,0.00021178501,0.013989924],"genre_scores_gemma":[0.98810005,0.0009098558,0.01032851,0.000021856144,0.00003049871,0.000018047569,0.000019194322,0.000009998059,0.00056192523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928635,0.0002798273,0.000028564898,0.0000812968,0.000216965,0.0001069802],"domain_scores_gemma":[0.9966587,0.0024416414,0.00027904703,0.00024361604,0.00032514505,0.000051825034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009893167,0.0006298369,0.00045604803,0.00048155698,0.0004746529,0.0009447432,0.0005779546,0.0006698527,0.00071142387],"category_scores_gemma":[0.0047542118,0.00023548784,0.000285887,0.00061629043,0.00092340005,0.0009987287,0.0006230533,0.00037472826,0.0002013552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003581536,0.000032864034,0.001769813,0.000264261,0.00007616692,0.00068209274,0.0002895425,0.8467292,0.017918795,0.07071725,0.0008521664,0.06030973],"study_design_scores_gemma":[0.000025025844,0.00033206967,0.00083447807,0.00003607215,0.00006918732,0.0004947059,0.00011067517,0.96263075,0.0073792986,0.026882734,0.0011680779,0.000036880832],"about_ca_topic_score_codex":0.0012303032,"about_ca_topic_score_gemma":0.0014809432,"teacher_disagreement_score":0.0012303032,"about_ca_system_score_codex":0.00081382366,"about_ca_system_score_gemma":0.00041953608,"threshold_uncertainty_score":0.005904734},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026470568,0.00045816155,0.97068465,0.00025219694,0.00001757576,0.00003493774,0.000021224709,0.00011109345,0.0019496087],"genre_scores_gemma":[0.8209498,0.00062300154,0.17648904,0.00011566981,0.00004072515,0.00018696589,0.00005394311,0.00002658288,0.0015143047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991912,0.00037449304,0.000021782116,0.00004580366,0.00031469157,0.00005193032],"domain_scores_gemma":[0.9981115,0.0012626969,0.00020097554,0.00022668939,0.00017218255,0.000025978652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014712022,0.00046052775,0.00039787177,0.00042931977,0.00032760022,0.0005270254,0.00076255033,0.0006692822,0.0005015891],"category_scores_gemma":[0.0052249315,0.00023529034,0.00028003522,0.00054258306,0.0012841944,0.0011054529,0.0010121611,0.0007319245,0.00014782831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010058848,0.00003411763,0.0003956222,0.00012137742,0.000024200846,0.00017092215,0.0002970455,0.67149043,0.013586884,0.2826123,0.00084061775,0.03032577],"study_design_scores_gemma":[0.000014580902,0.000035206944,0.000056234465,0.0000107827655,0.000004765178,0.000044554414,0.000012710946,0.95170707,0.0014639151,0.04601003,0.00063096883,0.000009146381],"about_ca_topic_score_codex":0.001279895,"about_ca_topic_score_gemma":0.0012956724,"teacher_disagreement_score":0.0014712022,"about_ca_system_score_codex":0.0010521249,"about_ca_system_score_gemma":0.00073357986,"threshold_uncertainty_score":0.007780552},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33241087,0.03643531,0.57982457,0.0028991138,0.00017374217,0.00008152316,0.00016643973,0.0005936734,0.04741473],"genre_scores_gemma":[0.97883576,0.0043219733,0.015083823,0.00009038421,0.00011722046,0.000020942443,0.000027070922,0.00003313751,0.0014697167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986148,0.00065812655,0.000031863718,0.00010552342,0.0004203671,0.00016925234],"domain_scores_gemma":[0.9954817,0.0034021772,0.00033303982,0.00030925832,0.00039338053,0.00008043048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013847149,0.0009702631,0.00087124447,0.0006900099,0.00049501733,0.0019893802,0.0008021011,0.002129213,0.0013436282],"category_scores_gemma":[0.0065745064,0.00036264092,0.00032891837,0.0013316966,0.00078858517,0.0025696016,0.0009228877,0.0007005271,0.00040332944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029269425,0.00011739417,0.0023568345,0.00027655318,0.00008633028,0.00046607436,0.0002518026,0.80706006,0.017689068,0.07860135,0.0014946617,0.09130717],"study_design_scores_gemma":[0.00002257957,0.00044789445,0.001646521,0.00004502946,0.000055610642,0.0007511806,0.00017832508,0.9447754,0.0057507777,0.04353761,0.0027270874,0.00006201118],"about_ca_topic_score_codex":0.00088202336,"about_ca_topic_score_gemma":0.0011787186,"teacher_disagreement_score":0.002129213,"about_ca_system_score_codex":0.0010602393,"about_ca_system_score_gemma":0.00029895408,"threshold_uncertainty_score":0.0076925755},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06637439,0.0007391479,0.92351174,0.00026310026,0.00009120475,0.00012700308,0.0001451954,0.0002506494,0.008497614],"genre_scores_gemma":[0.9363774,0.00029050815,0.059889697,0.00008059768,0.0000249943,0.00007525423,0.000058982216,0.000010177669,0.003192311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993357,0.00018125975,0.000024450284,0.0001248973,0.00020772616,0.0001259016],"domain_scores_gemma":[0.9991007,0.00035630123,0.00010511403,0.00015670492,0.00023323836,0.000047987407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095663744,0.0008224209,0.00054942555,0.0004033404,0.0005500168,0.0008440217,0.0014538364,0.0010472614,0.0012427322],"category_scores_gemma":[0.001599657,0.00020145543,0.00042247667,0.0007938282,0.00089705124,0.00088552263,0.0008353605,0.00061393925,0.0002552543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000247874,0.00009372012,0.0005549459,0.00020112022,0.000068773006,0.0004917412,0.00018026648,0.777765,0.019625193,0.15448135,0.0017517593,0.04453829],"study_design_scores_gemma":[0.000020314908,0.00007779446,0.00008632638,0.000010213467,0.000021240176,0.00011611666,0.000011360311,0.98925763,0.0026638,0.0066713393,0.0010463194,0.000017639819],"about_ca_topic_score_codex":0.003854331,"about_ca_topic_score_gemma":0.0051196353,"teacher_disagreement_score":0.003854331,"about_ca_system_score_codex":0.0018101172,"about_ca_system_score_gemma":0.001695658,"threshold_uncertainty_score":0.013133407},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5805118,0.004158419,0.37487173,0.0029910668,0.00020078772,0.00006326172,0.00022415291,0.00050734176,0.036471546],"genre_scores_gemma":[0.99391866,0.00068883796,0.004601126,0.000060687405,0.000041072555,0.000037028756,0.000020978689,0.00003714767,0.0005944863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997696,0.0013001082,0.00004640123,0.00017271712,0.00037015873,0.00041466643],"domain_scores_gemma":[0.95025223,0.04484588,0.001470119,0.0017510268,0.0010406607,0.00064000685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035453138,0.0007478441,0.00083650753,0.0006534449,0.0007402675,0.0014344628,0.0007771242,0.0010045958,0.001269743],"category_scores_gemma":[0.02134235,0.0005042879,0.00054191763,0.0007066029,0.0028015596,0.0029973185,0.001979551,0.0013427673,0.00017975784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023407723,0.000052697145,0.0011995891,0.00018505733,0.00007854735,0.0004755917,0.00025697102,0.87129194,0.008027467,0.103783496,0.0012251642,0.013189317],"study_design_scores_gemma":[0.000019989488,0.00010490327,0.000422473,0.000035947258,0.00003469241,0.00020838584,0.00008620479,0.95369446,0.0038279241,0.040846974,0.0006857208,0.00003221717],"about_ca_topic_score_codex":0.0010294233,"about_ca_topic_score_gemma":0.0008637918,"teacher_disagreement_score":0.0035453138,"about_ca_system_score_codex":0.001240272,"about_ca_system_score_gemma":0.0007004654,"threshold_uncertainty_score":0.018749654},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072980938,0.00042855946,0.99064386,0.0000924355,0.000024308321,0.000018457697,0.000015206103,0.00009247756,0.0013865088],"genre_scores_gemma":[0.52606726,0.0015015107,0.46583787,0.0001452295,0.00011440568,0.00016935739,0.00006798783,0.000027073806,0.0060693193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996903,0.00011220348,0.000015295402,0.000058187805,0.00009674131,0.000027330527],"domain_scores_gemma":[0.9995883,0.000221748,0.000056539888,0.00003996288,0.00007930139,0.0000141890505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046380635,0.0007776683,0.00047155583,0.00028498002,0.00038083782,0.00044227263,0.0005589009,0.00053875736,0.0015141778],"category_scores_gemma":[0.0011567435,0.00027373055,0.00030601924,0.0004078164,0.00048297035,0.00085128326,0.000505386,0.00045930725,0.00073906675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022749498,0.000083498446,0.00096497365,0.00033938736,0.00009304119,0.00031759994,0.00034368184,0.40304682,0.058080763,0.08508742,0.0028973983,0.44851786],"study_design_scores_gemma":[0.000035109948,0.00023431322,0.00019482242,0.000021076768,0.00004581642,0.00027305074,0.000064872365,0.96100545,0.010470355,0.019426778,0.008197724,0.000030557596],"about_ca_topic_score_codex":0.0008312842,"about_ca_topic_score_gemma":0.0015358529,"teacher_disagreement_score":0.0015141778,"about_ca_system_score_codex":0.00036416366,"about_ca_system_score_gemma":0.0003825967,"threshold_uncertainty_score":0.0050653815},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06304063,0.00040207102,0.93074816,0.00038695827,0.00003663841,0.000061417384,0.00013992585,0.00029334147,0.0048908577],"genre_scores_gemma":[0.81362265,0.0006368003,0.18217026,0.00016349925,0.00007017209,0.00017088815,0.00023032736,0.00006977544,0.0028657492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810874,0.0005756599,0.00005694899,0.0001427667,0.0009292833,0.00018655998],"domain_scores_gemma":[0.9943205,0.004033243,0.00037183767,0.00037310828,0.0007680336,0.00013318616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017859286,0.0006965439,0.0007458818,0.00044345515,0.0004710664,0.0013046452,0.00073981687,0.0008504153,0.001840101],"category_scores_gemma":[0.00709308,0.00030109193,0.000285036,0.0006158659,0.0012452565,0.001505993,0.0009848764,0.0009907071,0.0003987141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063103915,0.000082639366,0.0015549203,0.0002813166,0.00006806584,0.0003290732,0.00018307299,0.7254748,0.031147862,0.19935757,0.001675656,0.039214067],"study_design_scores_gemma":[0.000014624477,0.00005131132,0.00007529268,0.000010248561,0.000005351751,0.0001011652,0.000010024825,0.9824196,0.00506166,0.011907257,0.00033063302,0.000012768318],"about_ca_topic_score_codex":0.002015606,"about_ca_topic_score_gemma":0.002841414,"teacher_disagreement_score":0.002015606,"about_ca_system_score_codex":0.0014133462,"about_ca_system_score_gemma":0.0023425405,"threshold_uncertainty_score":0.010254562},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015817959,0.0003559726,0.9819656,0.00010163647,0.000034778306,0.000041741925,0.000040674076,0.00006379328,0.0015778828],"genre_scores_gemma":[0.54635674,0.0013351385,0.44929597,0.00013530132,0.00012007879,0.00033500316,0.00019184803,0.000045324632,0.0021846085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989029,0.00041405103,0.000070936774,0.0001309671,0.00040253208,0.00007861651],"domain_scores_gemma":[0.99734664,0.001343437,0.00057918817,0.00025200172,0.00040044117,0.00007815864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001000974,0.0008421579,0.0006800661,0.0007920227,0.000415394,0.0008430331,0.0009518965,0.0005585007,0.0006215231],"category_scores_gemma":[0.0045086,0.0003392206,0.0003909056,0.0009950176,0.0010199206,0.0011711167,0.0010226488,0.0010718778,0.00025049847],"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.00024992367,0.00006318897,0.00056289753,0.00039810338,0.000058850255,0.00015205692,0.0002867989,0.4285955,0.031991404,0.4343636,0.0012017954,0.10207581],"study_design_scores_gemma":[0.00008723961,0.00051266525,0.00013252081,0.00006169776,0.000034847708,0.00039675817,0.000041045867,0.8619974,0.014858892,0.11523415,0.006593471,0.00004930566],"about_ca_topic_score_codex":0.0002949127,"about_ca_topic_score_gemma":0.00034445644,"teacher_disagreement_score":0.001000974,"about_ca_system_score_codex":0.00071802293,"about_ca_system_score_gemma":0.0009074463,"threshold_uncertainty_score":0.005293727},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06212193,0.0020333158,0.9315772,0.00013344377,0.000047326146,0.00003135591,0.000020762875,0.00023229966,0.0038023912],"genre_scores_gemma":[0.941945,0.0010488125,0.05442341,0.00006662555,0.00007075998,0.00006568113,0.00002509529,0.000026701011,0.0023279334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886984,0.00045607824,0.000024766116,0.00012473742,0.00037857177,0.00014596431],"domain_scores_gemma":[0.99604225,0.0028915808,0.00031648955,0.00021527972,0.00046940765,0.00006513156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012254671,0.00061536545,0.0007419424,0.0005269186,0.0004421175,0.00080755824,0.0008928431,0.0010391254,0.0005798866],"category_scores_gemma":[0.004345104,0.00038570786,0.00040697522,0.0006789112,0.00091006956,0.0010788034,0.0008487166,0.0005331046,0.00029463193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011439402,0.00004804321,0.001251306,0.00013198463,0.00010397472,0.00049291906,0.00025106478,0.9159547,0.01105065,0.031515304,0.00064716843,0.03843849],"study_design_scores_gemma":[0.000010535634,0.000055049,0.00016383924,0.0000053764893,0.000017917684,0.00016857624,0.00002559047,0.9899358,0.0031043922,0.0058652335,0.00063639245,0.000011325465],"about_ca_topic_score_codex":0.0016133124,"about_ca_topic_score_gemma":0.0012392681,"teacher_disagreement_score":0.0016133124,"about_ca_system_score_codex":0.0006008284,"about_ca_system_score_gemma":0.00045204585,"threshold_uncertainty_score":0.006480992},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26550254,0.0032399737,0.7180557,0.0005510663,0.000059580583,0.00009135868,0.000103680046,0.00013596134,0.01226011],"genre_scores_gemma":[0.94396657,0.0018061554,0.052057523,0.000052731997,0.000046790192,0.00009066658,0.000046924477,0.00005779052,0.0018748903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990208,0.00052085944,0.000031132815,0.00012606435,0.0001652943,0.0001358449],"domain_scores_gemma":[0.99440527,0.0043593184,0.0005841334,0.00018798429,0.00031434163,0.00014883181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020434775,0.00087270176,0.00068225054,0.0012206197,0.00062446966,0.0011786512,0.0010437021,0.00092516677,0.0014711224],"category_scores_gemma":[0.010222651,0.00058924867,0.0003006599,0.0009469353,0.0020897663,0.0025616467,0.00075058104,0.0005428241,0.00024023274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012387149,0.000029872877,0.00073850213,0.000079615056,0.000028378445,0.00012614032,0.00008281317,0.91440314,0.0024418181,0.07099781,0.00042172993,0.010526396],"study_design_scores_gemma":[0.000049109007,0.00018345384,0.0006148962,0.000054997858,0.000042999236,0.00015372032,0.00019771766,0.9199042,0.0022036594,0.075245015,0.0013223747,0.000027911323],"about_ca_topic_score_codex":0.0009207596,"about_ca_topic_score_gemma":0.0010693143,"teacher_disagreement_score":0.0020434775,"about_ca_system_score_codex":0.0012639788,"about_ca_system_score_gemma":0.0006782725,"threshold_uncertainty_score":0.010807037},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33467868,0.007620769,0.5871821,0.0013235089,0.0001579813,0.000060071576,0.0006533419,0.0004920796,0.06783138],"genre_scores_gemma":[0.9874956,0.0014418261,0.007982105,0.000055129858,0.00007488421,0.000044084078,0.000095576885,0.000026352087,0.002784395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927586,0.00019525984,0.000022184438,0.00007651183,0.00026859855,0.0001616484],"domain_scores_gemma":[0.99672014,0.002570566,0.00019102715,0.00015500345,0.00031682066,0.00004650272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010636922,0.00041186597,0.00047967111,0.0006496759,0.00046073785,0.0012577807,0.00067246694,0.00071443815,0.0021910134],"category_scores_gemma":[0.0045964373,0.00027288837,0.00024556796,0.00059296784,0.0010401882,0.0016063328,0.000708934,0.0005284512,0.00041761444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001002283,0.000044685425,0.0009798007,0.00018968093,0.000033940552,0.00035871027,0.00016966039,0.774664,0.01572833,0.18181102,0.002274725,0.023645218],"study_design_scores_gemma":[0.000003295458,0.000031386597,0.0004996546,0.00002708691,0.000010568864,0.00017083752,0.000047982416,0.95479614,0.004433691,0.03886528,0.0010918421,0.000022142696],"about_ca_topic_score_codex":0.0017574565,"about_ca_topic_score_gemma":0.0011231893,"teacher_disagreement_score":0.0021910134,"about_ca_system_score_codex":0.0017131103,"about_ca_system_score_gemma":0.0005694518,"threshold_uncertainty_score":0.012429535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02928538,0.0013358622,0.96611685,0.00030485727,0.000044861117,0.000055862736,0.000030137639,0.00019813636,0.0026281292],"genre_scores_gemma":[0.9235175,0.0011794411,0.07304265,0.000107406086,0.00010091495,0.00024043703,0.000048875525,0.000062619074,0.0017000597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963238,0.0019392337,0.00014363379,0.0002796578,0.0009249533,0.00038871393],"domain_scores_gemma":[0.99063194,0.006105166,0.00086822937,0.0009929354,0.001240819,0.00016091397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058759884,0.000863141,0.0010194184,0.0009879472,0.0006666464,0.0011824623,0.0017986952,0.0011495901,0.00076409755],"category_scores_gemma":[0.016695244,0.0005223408,0.00033275143,0.0015673372,0.0021627385,0.0020018504,0.0014944188,0.0012279142,0.000277391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013841195,0.0000412247,0.00045582498,0.00008378617,0.000032635377,0.00012989834,0.00027644416,0.82588273,0.004797465,0.1263402,0.00081193785,0.04100945],"study_design_scores_gemma":[0.000016847449,0.000041460833,0.000107424254,0.000015279826,0.000009857695,0.000055534452,0.000025168401,0.9554896,0.0011913613,0.042431373,0.00059461675,0.000021543778],"about_ca_topic_score_codex":0.0026151661,"about_ca_topic_score_gemma":0.0017926806,"teacher_disagreement_score":0.0058759884,"about_ca_system_score_codex":0.0015928403,"about_ca_system_score_gemma":0.001234491,"threshold_uncertainty_score":0.031075597},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013358148,0.00037548534,0.9828256,0.00015522486,0.000027143265,0.000023190047,0.00006974116,0.00012494919,0.0030406064],"genre_scores_gemma":[0.8618688,0.0009860375,0.13183856,0.00013456622,0.000075884585,0.00012413015,0.00025434804,0.000046492547,0.0046711126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885213,0.00030584986,0.000038177106,0.00011209572,0.0005749679,0.00011663093],"domain_scores_gemma":[0.9973635,0.001668751,0.0002519846,0.00029829255,0.00038966176,0.00002786029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001142091,0.0007019818,0.0008500949,0.0003523489,0.0002625513,0.0008125501,0.0007399223,0.00081632374,0.001186119],"category_scores_gemma":[0.0046910727,0.00025839685,0.00030303004,0.0006988142,0.0007806047,0.0012674786,0.0006262682,0.0008364828,0.0004811569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007854788,0.000022309036,0.00039706376,0.00010928281,0.000029539679,0.0001739818,0.000064779175,0.8816365,0.0049467413,0.0917863,0.000704372,0.020050606],"study_design_scores_gemma":[0.000009078091,0.000016851633,0.00009065792,0.000010553914,0.000008363568,0.000055907567,0.0000058960995,0.9877412,0.0012510967,0.010316855,0.00048713599,0.0000064840647],"about_ca_topic_score_codex":0.0034705272,"about_ca_topic_score_gemma":0.005082219,"teacher_disagreement_score":0.0034705272,"about_ca_system_score_codex":0.0010526442,"about_ca_system_score_gemma":0.0012820391,"threshold_uncertainty_score":0.0076375008},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012816066,0.00023095885,0.9828857,0.00024825404,0.00009196936,0.0001755287,0.000085142165,0.0019443056,0.0015220296],"genre_scores_gemma":[0.6703594,0.00024033942,0.32653153,0.00034447934,0.00006714725,0.00024514747,0.00022010774,0.00013416234,0.0018576421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759704,0.00069050526,0.000116324074,0.00049137656,0.0008983271,0.00020643245],"domain_scores_gemma":[0.99369884,0.0034426972,0.00062112685,0.0011219761,0.0008839753,0.0002314048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002850251,0.00064001925,0.0010547694,0.0010034493,0.0008506265,0.0012997233,0.0021465558,0.0012664365,0.001613788],"category_scores_gemma":[0.013242996,0.00040195513,0.0004636764,0.0007321192,0.0021805284,0.0025731751,0.0029507014,0.0015781786,0.0003737575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000551129,0.0001260937,0.0020544135,0.00017943846,0.00006039947,0.00041818863,0.00032473984,0.74081093,0.01403303,0.06819841,0.0033968193,0.16984642],"study_design_scores_gemma":[0.000020838215,0.00003426355,0.00008023225,0.000010534925,0.0000053468093,0.000059393074,0.000019885558,0.9810838,0.0028778987,0.014862005,0.00093213737,0.000013686278],"about_ca_topic_score_codex":0.006377168,"about_ca_topic_score_gemma":0.0035406407,"teacher_disagreement_score":0.006377168,"about_ca_system_score_codex":0.0018417833,"about_ca_system_score_gemma":0.0023460512,"threshold_uncertainty_score":0.015073717},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11315129,0.001104202,0.87810504,0.00053741474,0.00003649137,0.000027608276,0.00004695157,0.00017656451,0.006814307],"genre_scores_gemma":[0.91920847,0.00058302,0.07830077,0.00010209973,0.00003701388,0.0000712029,0.000029752639,0.000039849896,0.0016278299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984769,0.00087138574,0.00005085781,0.00016577926,0.00025093323,0.00018412426],"domain_scores_gemma":[0.9943825,0.0043599275,0.00047096913,0.00037391452,0.00028863328,0.00012401941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030577122,0.00069896237,0.0010091629,0.00074591953,0.0007350421,0.0012983877,0.001140237,0.000789355,0.00075492385],"category_scores_gemma":[0.0074120318,0.00039331435,0.00035339364,0.001020354,0.0016750665,0.0022460106,0.0013013874,0.0007102658,0.00021454522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003864971,0.00005284666,0.00056176033,0.00011599314,0.000043712298,0.00020685194,0.0004901796,0.7838198,0.008116009,0.16961057,0.001150777,0.035445057],"study_design_scores_gemma":[0.000029346676,0.000084573854,0.00016441653,0.00001835001,0.000016766839,0.00014495724,0.000060374638,0.89051634,0.0029532344,0.10480744,0.001184057,0.000020075278],"about_ca_topic_score_codex":0.00071390724,"about_ca_topic_score_gemma":0.0005452784,"teacher_disagreement_score":0.0030577122,"about_ca_system_score_codex":0.0011117316,"about_ca_system_score_gemma":0.0006497719,"threshold_uncertainty_score":0.016170979},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047779642,0.0012822255,0.93707526,0.00031706993,0.000037152186,0.000051204785,0.0001356165,0.000197057,0.013124724],"genre_scores_gemma":[0.9386652,0.0019285107,0.05573799,0.00014009603,0.000103562226,0.00023100396,0.0001735615,0.00016885356,0.0028511137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983802,0.0005940354,0.000069277085,0.00026322078,0.00047220482,0.00022097911],"domain_scores_gemma":[0.98938495,0.007634069,0.0009528691,0.0009253995,0.0008433704,0.00025928864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026217815,0.0012593709,0.0012035382,0.0016846121,0.0010769535,0.0026817366,0.0013987749,0.001461748,0.0027698064],"category_scores_gemma":[0.016366845,0.00046802036,0.000528695,0.0012100696,0.0032726976,0.0054530934,0.002298464,0.0029490818,0.00082753686],"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.00018375396,0.000041874206,0.0007879112,0.0001546596,0.00003535219,0.00015273479,0.00033936245,0.39718443,0.011628342,0.5683678,0.0010222027,0.020101681],"study_design_scores_gemma":[0.000016776023,0.00006274552,0.00046415976,0.00006684981,0.000015341517,0.00028858674,0.0000916537,0.78658295,0.0065415367,0.20350233,0.0022765805,0.000090458576],"about_ca_topic_score_codex":0.0012215931,"about_ca_topic_score_gemma":0.0004581205,"teacher_disagreement_score":0.0027698064,"about_ca_system_score_codex":0.0017146572,"about_ca_system_score_gemma":0.0009069186,"threshold_uncertainty_score":0.013865471},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099278025,0.0004828173,0.8681121,0.0005019273,0.00015269467,0.00020232309,0.00026232892,0.0071649025,0.023842983],"genre_scores_gemma":[0.71863776,0.00023436686,0.26929396,0.00031061878,0.00003755707,0.00025189458,0.00028497458,0.00023865362,0.0107102785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995764,0.00012310871,0.000017527913,0.000046324276,0.0001868539,0.00004979438],"domain_scores_gemma":[0.9992034,0.0003526603,0.000039680945,0.0001796925,0.00018982732,0.000034750075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005086949,0.00026381068,0.00028887732,0.00036186766,0.00022477526,0.00040399554,0.00050310296,0.00038063675,0.0033927567],"category_scores_gemma":[0.0024996009,0.000116881885,0.00018251952,0.0003596492,0.00043793913,0.0008395039,0.000516103,0.00043378325,0.00057260116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012701205,0.0001638441,0.001512676,0.00020297203,0.000049526272,0.00079904834,0.0005696374,0.34731248,0.102854595,0.14924715,0.020627832,0.37539023],"study_design_scores_gemma":[0.000059955066,0.00015962834,0.0007373126,0.000034919627,0.000015391393,0.00018598232,0.000038359238,0.9326993,0.029423395,0.017493386,0.019116212,0.00003624538],"about_ca_topic_score_codex":0.0034568973,"about_ca_topic_score_gemma":0.0030898992,"teacher_disagreement_score":0.0034568973,"about_ca_system_score_codex":0.0005215664,"about_ca_system_score_gemma":0.00040558155,"threshold_uncertainty_score":0.011349916},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041524887,0.005212327,0.9378374,0.0006201309,0.00022399152,0.000056571742,0.00007562025,0.00031146017,0.01413761],"genre_scores_gemma":[0.84588027,0.0034878138,0.14516559,0.00022236399,0.00014240404,0.00009374243,0.00011749886,0.00002921831,0.004861135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973327,0.000085715656,0.000007928207,0.000037946855,0.00010027293,0.000034835306],"domain_scores_gemma":[0.9997794,0.000057288333,0.00002036569,0.00004361572,0.00008462768,0.000014671583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022716526,0.00034332075,0.00026449343,0.0003492561,0.0003601812,0.00063200644,0.00051231333,0.0006074509,0.0011249648],"category_scores_gemma":[0.00066663243,0.0001184457,0.0002051248,0.000620393,0.00036011665,0.0004371533,0.00036268376,0.0005119682,0.00041947255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009808433,0.0000611756,0.0010405154,0.00014143014,0.00004984105,0.00015328308,0.00008058938,0.6224747,0.017927947,0.19026658,0.0058848243,0.16182107],"study_design_scores_gemma":[0.000018268469,0.000110082954,0.00045804738,0.000017996188,0.000028627932,0.00018077041,0.000037989666,0.9197172,0.0026274577,0.059291296,0.017491093,0.000021214137],"about_ca_topic_score_codex":0.0019921276,"about_ca_topic_score_gemma":0.003163996,"teacher_disagreement_score":0.0019921276,"about_ca_system_score_codex":0.00074652507,"about_ca_system_score_gemma":0.0005231834,"threshold_uncertainty_score":0.0054163933},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2213714,0.0020433783,0.7480016,0.002091238,0.00010524526,0.00014963132,0.00026441677,0.00031539553,0.025657687],"genre_scores_gemma":[0.97634447,0.00049423636,0.01949701,0.00015658222,0.00007174663,0.0001085406,0.00003509005,0.00006891934,0.0032235098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978229,0.0011250166,0.00007090078,0.00021538237,0.00037483728,0.00039105103],"domain_scores_gemma":[0.9836986,0.014301035,0.00052305416,0.00042326402,0.00078027404,0.00027380176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044790045,0.0012778937,0.0018991901,0.0012867128,0.0008850346,0.0024396973,0.001954632,0.0023683547,0.0034901542],"category_scores_gemma":[0.018622119,0.0011613275,0.00043154942,0.0019089316,0.0027842317,0.0031297896,0.0026676876,0.00093621766,0.00052170345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004408111,0.0001355419,0.00061700976,0.00018973555,0.00005246734,0.00012623501,0.00026391962,0.87625444,0.0051704063,0.09216608,0.001443713,0.023139674],"study_design_scores_gemma":[0.00006008025,0.00009006892,0.00028701936,0.000035688896,0.000027958302,0.00007186195,0.000108108674,0.9001037,0.0013427264,0.09741696,0.00043158187,0.000024324254],"about_ca_topic_score_codex":0.0013824748,"about_ca_topic_score_gemma":0.0017424304,"teacher_disagreement_score":0.0044790045,"about_ca_system_score_codex":0.00218927,"about_ca_system_score_gemma":0.0011670319,"threshold_uncertainty_score":0.023687541},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18441932,0.00036009194,0.8076528,0.0009351924,0.00004439563,0.000050706,0.00004755145,0.000048896527,0.006441023],"genre_scores_gemma":[0.95327777,0.0002257119,0.04450947,0.00009409934,0.00006563269,0.00010618355,0.000019486617,0.000034163368,0.0016674036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976635,0.0010304626,0.00007216074,0.00019595899,0.00060046645,0.000437425],"domain_scores_gemma":[0.9894986,0.007936926,0.0010875337,0.00077460764,0.00045501432,0.0002473226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033723325,0.0006095649,0.00074545015,0.0005397432,0.00092034653,0.0009826013,0.0010041302,0.0013118308,0.001379969],"category_scores_gemma":[0.018302381,0.00042201963,0.00048721762,0.0010823549,0.0026292596,0.0033140476,0.0016306598,0.0012107868,0.00013749249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015211348,0.000038032034,0.0007002528,0.000041784202,0.000017934042,0.00031293518,0.00023873617,0.7523504,0.0030205804,0.23252515,0.00034493278,0.010257203],"study_design_scores_gemma":[0.000032671593,0.000053869324,0.00018427445,0.000011153582,0.0000102661015,0.00010996586,0.00008813064,0.91079235,0.0018311824,0.086083174,0.00079073856,0.000012181535],"about_ca_topic_score_codex":0.0016761427,"about_ca_topic_score_gemma":0.0012245721,"teacher_disagreement_score":0.0033723325,"about_ca_system_score_codex":0.0015554042,"about_ca_system_score_gemma":0.0010102065,"threshold_uncertainty_score":0.017834783},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005192538,0.00039459518,0.98695403,0.000316176,0.00003994452,0.000035146048,0.00008317114,0.000047904676,0.006936483],"genre_scores_gemma":[0.6313717,0.0021494778,0.34721532,0.00031769904,0.00022668277,0.0004890738,0.00028459,0.0001224784,0.017822908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993224,0.00033124976,0.000021809963,0.000078083925,0.00016761661,0.00007887915],"domain_scores_gemma":[0.9994499,0.00036534737,0.000045107838,0.00003825694,0.000071249066,0.00003006805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015734626,0.0010632287,0.0008258518,0.00046779934,0.0004033779,0.0014021305,0.001217266,0.0009789324,0.0028927785],"category_scores_gemma":[0.001917178,0.00045686192,0.0005563325,0.00096418976,0.000920239,0.0017262225,0.0013893024,0.0013280736,0.0004973339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003473731,0.000048521062,0.00012830866,0.000074079406,0.000023283128,0.00008244955,0.000065149296,0.6441886,0.0009143862,0.33307838,0.0027667163,0.018595455],"study_design_scores_gemma":[0.0000097762995,0.000021150121,0.0000396183,0.000008880919,0.000004802433,0.000019150724,0.000016678616,0.9168955,0.00016439475,0.080681026,0.002133492,0.0000055057594],"about_ca_topic_score_codex":0.002215364,"about_ca_topic_score_gemma":0.0022204816,"teacher_disagreement_score":0.0028927785,"about_ca_system_score_codex":0.0015975,"about_ca_system_score_gemma":0.0011373911,"threshold_uncertainty_score":0.01159066},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7005985,0.0010629977,0.2799636,0.0004984228,0.00004451898,0.000070691785,0.00012805256,0.00009652089,0.017536784],"genre_scores_gemma":[0.99401516,0.00020829895,0.00515838,0.000029248606,0.000020864476,0.000025069006,0.000015998448,0.0000049428713,0.00052208203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885046,0.00047887326,0.00003706487,0.00011662606,0.00030782045,0.00020925053],"domain_scores_gemma":[0.9941373,0.0044198204,0.00049008237,0.00023694611,0.0005342255,0.00018171324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002502269,0.0008864673,0.0005512289,0.0006937962,0.00087357283,0.0012204581,0.00073478324,0.0010218677,0.0010200522],"category_scores_gemma":[0.0079636,0.0003103157,0.00025622084,0.0007392714,0.0011296716,0.0015768561,0.0010229372,0.00046765423,0.00016195251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006837104,0.00009302558,0.0022465396,0.0001478219,0.00007386483,0.00060339324,0.00040403538,0.829168,0.04217357,0.096222594,0.00057599944,0.027607435],"study_design_scores_gemma":[0.00002459269,0.00024706338,0.00048895605,0.000016924778,0.000034595923,0.00032894395,0.00009171673,0.9725672,0.0065483423,0.01926672,0.00035892872,0.000025950347],"about_ca_topic_score_codex":0.0008789528,"about_ca_topic_score_gemma":0.0008707096,"teacher_disagreement_score":0.002502269,"about_ca_system_score_codex":0.0012679832,"about_ca_system_score_gemma":0.00047517847,"threshold_uncertainty_score":0.013233364},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01844115,0.0002109126,0.9807077,0.00009422282,0.000010176832,0.000012575738,0.000026855398,0.000059154296,0.00043715362],"genre_scores_gemma":[0.75757885,0.0008247807,0.2400306,0.000065427,0.0000769211,0.00008989017,0.00008717216,0.000030220075,0.0012161334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919635,0.00039484428,0.000037374997,0.00011293431,0.00020976983,0.000048739443],"domain_scores_gemma":[0.99667406,0.0024702724,0.00034357468,0.00022996358,0.00023504304,0.00004703807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016312544,0.0006714007,0.0008223394,0.00043642946,0.00036844387,0.000842948,0.0006267026,0.0010704426,0.00051452924],"category_scores_gemma":[0.01063146,0.00046315315,0.0005000681,0.000530596,0.0012687148,0.0014028717,0.0011315143,0.0006544477,0.00019195788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001718403,0.000032647065,0.00074121566,0.00016350707,0.000063436695,0.0001337829,0.00015831877,0.9064888,0.0074352263,0.043060817,0.0005162355,0.04103427],"study_design_scores_gemma":[0.000009735873,0.00002781534,0.00012481699,0.000005990374,0.000008566972,0.000048592905,0.000011532277,0.98735356,0.0018502331,0.0103672,0.00017885122,0.000013239586],"about_ca_topic_score_codex":0.0011039369,"about_ca_topic_score_gemma":0.0009469972,"teacher_disagreement_score":0.0016312544,"about_ca_system_score_codex":0.00041027967,"about_ca_system_score_gemma":0.000753709,"threshold_uncertainty_score":0.008627057},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068081175,0.0006823516,0.9889703,0.00015944318,0.00010474495,0.00007251444,0.000031014617,0.00012323035,0.0030482518],"genre_scores_gemma":[0.48769918,0.001853846,0.50348574,0.000265042,0.0001385914,0.0005335702,0.00017340404,0.000040291336,0.005810319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920887,0.00024893996,0.00003165007,0.00006921481,0.00038855273,0.000052742544],"domain_scores_gemma":[0.9992219,0.0003886749,0.00007470605,0.00009303038,0.00019719847,0.00002441304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075640006,0.00047763778,0.0004405187,0.00037253043,0.00039060423,0.000568784,0.0009654334,0.00073816965,0.0008359844],"category_scores_gemma":[0.0017825925,0.00015854654,0.0003370376,0.0005856641,0.0007116727,0.0008302476,0.0007571641,0.0008435276,0.00024690403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002021089,0.00010342258,0.00038834193,0.00043873876,0.000091846654,0.0007583383,0.00040723354,0.3154566,0.07557556,0.44316036,0.005878498,0.157539],"study_design_scores_gemma":[0.000040080875,0.00020242046,0.00010216607,0.000023618595,0.00003160129,0.00051864627,0.000018762146,0.9553737,0.00735365,0.024089132,0.01221455,0.000031610147],"about_ca_topic_score_codex":0.001219479,"about_ca_topic_score_gemma":0.0017702364,"teacher_disagreement_score":0.001219479,"about_ca_system_score_codex":0.00067848945,"about_ca_system_score_gemma":0.0010120411,"threshold_uncertainty_score":0.004922867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011414995,0.00010380028,0.9965713,0.00009537493,0.000025355925,0.000034054265,0.000040595198,0.00008540798,0.0019026261],"genre_scores_gemma":[0.1732931,0.0007989453,0.814375,0.00026242202,0.00010402631,0.00084107934,0.00039786758,0.00015374532,0.009773915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993168,0.00023202233,0.000028536908,0.00013085804,0.00022775347,0.000063956446],"domain_scores_gemma":[0.998747,0.00071609,0.000085135034,0.000074931486,0.00033690833,0.00003985848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014857323,0.0013968506,0.0012943323,0.00042899558,0.00038397367,0.0017870358,0.0010067712,0.0018991721,0.0075271977],"category_scores_gemma":[0.0034323626,0.00061951706,0.0007376064,0.0006463299,0.0010170382,0.0014108125,0.0013457059,0.0017618656,0.002103416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041926935,0.00005989712,0.00014968048,0.00022052822,0.00002255785,0.00010983355,0.00010148221,0.90641785,0.003603925,0.043260228,0.0036541107,0.042358067],"study_design_scores_gemma":[0.000016961756,0.000044026212,0.000038228573,0.000020636027,0.000004248847,0.000046912075,0.000028515193,0.9832759,0.0006182501,0.013758783,0.0021379043,0.000009661881],"about_ca_topic_score_codex":0.0013379736,"about_ca_topic_score_gemma":0.001874413,"teacher_disagreement_score":0.0075271977,"about_ca_system_score_codex":0.00080955954,"about_ca_system_score_gemma":0.0014557061,"threshold_uncertainty_score":0.025180995},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016654959,0.0014722941,0.9736419,0.00025745443,0.0000767711,0.00012400045,0.00004072406,0.00022936783,0.0075024758],"genre_scores_gemma":[0.7704238,0.0020124055,0.21871822,0.00021194728,0.00014594509,0.0003507787,0.000089387584,0.000038809667,0.008008703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990559,0.0004452135,0.00005236283,0.000109401306,0.00023101139,0.00010600344],"domain_scores_gemma":[0.9985531,0.00077641435,0.0001810104,0.00024574346,0.00020780115,0.000035875608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012837498,0.00077023846,0.0005655015,0.000535012,0.00063783134,0.00092352985,0.0014993452,0.0008560642,0.0032126599],"category_scores_gemma":[0.0027798992,0.0002787513,0.00047882687,0.0006316521,0.0008563947,0.0017274406,0.0011711484,0.0007005933,0.00082076306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030082825,0.00016023102,0.0008370457,0.0008882456,0.00013563213,0.00072759215,0.00094604405,0.38371834,0.025612146,0.38491446,0.0039128345,0.19784656],"study_design_scores_gemma":[0.0000637302,0.00026823382,0.0001658651,0.000057807945,0.000053040374,0.0006370015,0.00009003836,0.9427414,0.0062055825,0.040196944,0.009455654,0.00006484076],"about_ca_topic_score_codex":0.0006838161,"about_ca_topic_score_gemma":0.00070597755,"teacher_disagreement_score":0.0032126599,"about_ca_system_score_codex":0.00084273505,"about_ca_system_score_gemma":0.00040423652,"threshold_uncertainty_score":0.010747433},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7968027,0.00327538,0.18798275,0.0003875998,0.00013170068,0.00006143933,0.00026866503,0.0010224358,0.010067343],"genre_scores_gemma":[0.991979,0.00035536053,0.00673449,0.000017667962,0.000017040882,0.000021064245,0.00012871606,0.00003862775,0.0007081184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897885,0.00032034182,0.000045020966,0.000103105536,0.00043324145,0.00011944334],"domain_scores_gemma":[0.99772984,0.0012011565,0.00023665577,0.00024298127,0.00053302094,0.00005638947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018467508,0.00067992427,0.000509049,0.00059586123,0.00034664053,0.00055099354,0.0005006092,0.0005558017,0.0007758593],"category_scores_gemma":[0.0042055114,0.00015153617,0.00024576753,0.0008159649,0.00053525553,0.00070566917,0.0004793429,0.00039242543,0.00025107065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011680401,0.00028070027,0.0075684125,0.00038647375,0.00019522423,0.00051798334,0.00035658118,0.80302393,0.07723118,0.009162729,0.0030439578,0.09706471],"study_design_scores_gemma":[0.000026886653,0.0009851998,0.004104408,0.000026275724,0.000045679593,0.0003545909,0.00006923563,0.95333576,0.036931988,0.0026840528,0.0014006398,0.000035279507],"about_ca_topic_score_codex":0.0011473311,"about_ca_topic_score_gemma":0.00088885106,"teacher_disagreement_score":0.0018467508,"about_ca_system_score_codex":0.00073637697,"about_ca_system_score_gemma":0.00045003774,"threshold_uncertainty_score":0.009766638},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045649175,0.00058252976,0.9450466,0.00028077624,0.0000805354,0.00009313065,0.0002770738,0.00023728528,0.0077528763],"genre_scores_gemma":[0.73611563,0.0011184122,0.2536362,0.00025612247,0.00012263462,0.00018453793,0.00068542646,0.000043103646,0.007837938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920636,0.00022092336,0.000039554074,0.00011428794,0.00028397708,0.00013488402],"domain_scores_gemma":[0.99847525,0.0004309726,0.00020915756,0.00035616226,0.00044191946,0.000086533684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005969128,0.00080235425,0.0006784323,0.00045591246,0.00038882933,0.000715075,0.00070496474,0.00047869727,0.0016012547],"category_scores_gemma":[0.0021695297,0.00024803728,0.0003567194,0.0011861104,0.00088620756,0.00076576206,0.0010187615,0.0008581902,0.0008272869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007921611,0.00010307965,0.001192509,0.00029880725,0.00007642673,0.00040805395,0.00018079435,0.366945,0.04077286,0.4593796,0.0047799493,0.12507081],"study_design_scores_gemma":[0.000084423635,0.00027298013,0.00039098944,0.00003899332,0.000033676784,0.0005439762,0.000048389837,0.89655703,0.031658944,0.060023192,0.010292603,0.00005479382],"about_ca_topic_score_codex":0.0013167679,"about_ca_topic_score_gemma":0.0021318854,"teacher_disagreement_score":0.0016012547,"about_ca_system_score_codex":0.0006336585,"about_ca_system_score_gemma":0.0010819688,"threshold_uncertainty_score":0.005356729},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2165303,0.0003298904,0.7791249,0.0002328667,0.000018458455,0.000026038988,0.000024818395,0.00012754214,0.0035852198],"genre_scores_gemma":[0.98961896,0.00007983404,0.009744043,0.000018975634,0.000010960115,0.00001547779,0.0000060591437,0.0000050904223,0.0005005502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993765,0.0002702488,0.000017130673,0.000093482726,0.0001308167,0.000111862515],"domain_scores_gemma":[0.9993079,0.00039520973,0.00011392366,0.00006307942,0.00008602207,0.00003393423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007398567,0.0003850167,0.0006315025,0.00021421695,0.0004111792,0.0005093407,0.00057631725,0.0005038581,0.00033130895],"category_scores_gemma":[0.001632824,0.0002292449,0.0001900982,0.0004514836,0.001043638,0.0005613375,0.00068311946,0.00030876993,0.00010044651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002656348,0.00005315351,0.0013956015,0.00006804678,0.000043164073,0.0006555522,0.00029085265,0.8826373,0.030394074,0.0510926,0.0007230936,0.032380927],"study_design_scores_gemma":[0.000017546032,0.000050119706,0.00019477269,0.0000026579546,0.000008851084,0.000091496695,0.000024345647,0.9902423,0.0020046372,0.0070887622,0.0002647373,0.000009909388],"about_ca_topic_score_codex":0.0011835345,"about_ca_topic_score_gemma":0.0010736453,"teacher_disagreement_score":0.0011835345,"about_ca_system_score_codex":0.0005090245,"about_ca_system_score_gemma":0.00044532286,"threshold_uncertainty_score":0.0039128065},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5345571,0.0006460123,0.42132106,0.00092526886,0.000281157,0.0008635783,0.002214901,0.027751073,0.011439894],"genre_scores_gemma":[0.90616405,0.00015354973,0.08951132,0.00011009114,0.000053743708,0.0001999895,0.0020439334,0.00036617307,0.0013970641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985374,0.00047839867,0.000053618154,0.00018630152,0.00059605396,0.00014825727],"domain_scores_gemma":[0.9958545,0.0020862003,0.000183253,0.0010641051,0.0005570317,0.00025488058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019583167,0.00056979,0.00053946214,0.0007971844,0.00060371455,0.0008859851,0.0016165483,0.00058595836,0.0011014023],"category_scores_gemma":[0.009593346,0.00026808536,0.00022990488,0.0009889398,0.0010153363,0.0018491404,0.0016642618,0.0010354291,0.00031795588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017338652,0.0010863737,0.018575596,0.00039745215,0.00021720855,0.0011450874,0.0013931216,0.62589014,0.037740707,0.029510418,0.034988936,0.24732114],"study_design_scores_gemma":[0.000074097996,0.00016250873,0.0018045946,0.000009253469,0.000008834008,0.00012556696,0.00012043866,0.9817965,0.007392906,0.0052870275,0.0031902012,0.000028088725],"about_ca_topic_score_codex":0.010509115,"about_ca_topic_score_gemma":0.0095494855,"teacher_disagreement_score":0.010509115,"about_ca_system_score_codex":0.0008450477,"about_ca_system_score_gemma":0.0010267792,"threshold_uncertainty_score":0.020895839},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031138161,0.0010417347,0.95891035,0.0005562959,0.00009831303,0.000038373768,0.000057247675,0.0001448693,0.0080146],"genre_scores_gemma":[0.8932878,0.0017130655,0.099804685,0.00021694088,0.00012393133,0.00012421115,0.00008925629,0.00002720502,0.0046129692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999635,0.0001292886,0.00001536221,0.00004900965,0.00013099576,0.00004041109],"domain_scores_gemma":[0.9991979,0.0004850785,0.00006431506,0.00010423955,0.00011751753,0.000030881965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007573434,0.00040963266,0.00037730002,0.00038374186,0.00040987253,0.0007051875,0.0006276919,0.00071676803,0.0011948359],"category_scores_gemma":[0.0027075268,0.00016396986,0.00023712942,0.0003292371,0.00069859147,0.0017127882,0.00082991965,0.00063437235,0.00025226225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012705712,0.000029339777,0.0003586948,0.00017525072,0.000025357582,0.00054141105,0.0002960131,0.26333132,0.013327751,0.61318713,0.0034511317,0.10514958],"study_design_scores_gemma":[0.000019632293,0.000063580126,0.00008363797,0.000018864137,0.000012590804,0.0002234214,0.000026290285,0.7693293,0.0030596256,0.22112235,0.006023491,0.000017306365],"about_ca_topic_score_codex":0.0006888972,"about_ca_topic_score_gemma":0.00047550202,"teacher_disagreement_score":0.0011948359,"about_ca_system_score_codex":0.0006849213,"about_ca_system_score_gemma":0.0004821964,"threshold_uncertainty_score":0.004969418},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14089823,0.0012176473,0.8505363,0.0003812151,0.00010124138,0.00012440143,0.000044580014,0.00038457674,0.006311811],"genre_scores_gemma":[0.9784107,0.00023248188,0.020072274,0.000066452354,0.000013230365,0.000039078517,0.000020970014,0.000009217171,0.0011355364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915123,0.00026564003,0.000043822103,0.00017189524,0.0002051486,0.0001622684],"domain_scores_gemma":[0.9988601,0.00046419856,0.00018074721,0.00013621038,0.00022099513,0.00013768421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008673126,0.0013661634,0.00090771046,0.00092430273,0.0007373165,0.00080609554,0.0022376187,0.0007898016,0.0011317267],"category_scores_gemma":[0.0022233,0.00033394573,0.00065396447,0.00075492734,0.0008240706,0.0010987436,0.001474928,0.00045326998,0.00032353823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008905818,0.00027047953,0.0018761068,0.00037339295,0.00034658343,0.0027220477,0.0013564477,0.76760775,0.064943075,0.05869102,0.0035589365,0.097363584],"study_design_scores_gemma":[0.0000790762,0.00043057677,0.00036845097,0.000018079512,0.00011085801,0.0007930206,0.00024684006,0.9784363,0.008049946,0.009687798,0.0017362027,0.000042779735],"about_ca_topic_score_codex":0.0024290057,"about_ca_topic_score_gemma":0.0029352377,"teacher_disagreement_score":0.0024290057,"about_ca_system_score_codex":0.000764213,"about_ca_system_score_gemma":0.0011239798,"threshold_uncertainty_score":0.005544722},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011673702,0.00025896227,0.98709214,0.00010509252,0.000022341565,0.00002022759,0.000013610421,0.0001068524,0.0007069807],"genre_scores_gemma":[0.4661198,0.0004182757,0.53071004,0.000086051085,0.00004561152,0.00014486825,0.00012861106,0.00010057696,0.0022462523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960405,0.00019741165,0.000014202595,0.000048338974,0.00009358305,0.00004246858],"domain_scores_gemma":[0.9996362,0.00018289898,0.000040937506,0.000041138515,0.00007059828,0.000028238223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010581304,0.00067527726,0.00068349816,0.00044928738,0.00030950995,0.0006009401,0.0006380085,0.00054248504,0.00077215326],"category_scores_gemma":[0.0011629786,0.00038037394,0.00041039486,0.00052661204,0.00042123362,0.00094048947,0.00073704706,0.0008320513,0.00019703279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013032119,0.00007535639,0.00024351777,0.00006381711,0.00004476046,0.000046677666,0.00004728165,0.88703775,0.010610584,0.019373111,0.0014575425,0.08086926],"study_design_scores_gemma":[0.000007822635,0.000014055009,0.000021848899,0.0000013256546,0.0000027360486,0.000007082929,0.0000037094894,0.99645436,0.0005780944,0.0026834577,0.00022272088,0.0000027172223],"about_ca_topic_score_codex":0.0012330665,"about_ca_topic_score_gemma":0.0013083047,"teacher_disagreement_score":0.0012330665,"about_ca_system_score_codex":0.0007443793,"about_ca_system_score_gemma":0.0007515262,"threshold_uncertainty_score":0.005595982},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06592461,0.00032503437,0.92849725,0.0001630827,0.00002490147,0.00009890948,0.000023661583,0.00026247537,0.0046800263],"genre_scores_gemma":[0.6555702,0.00033351214,0.34178552,0.00011105414,0.000018930214,0.00031583838,0.00005322671,0.00005285684,0.0017589602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969983,0.00013747666,0.000009984919,0.000042946467,0.00006628312,0.000043485787],"domain_scores_gemma":[0.9990839,0.0006592701,0.00010235568,0.000036036505,0.00008713531,0.000031318283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009851645,0.00071453245,0.0006078355,0.0006699118,0.0004395391,0.0007513519,0.0008263584,0.00071898603,0.0010525435],"category_scores_gemma":[0.0025644957,0.00040007068,0.0005349475,0.000574442,0.0007365647,0.00046029408,0.0006257366,0.00041671432,0.00013067482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010603122,0.0000086928685,0.0001497347,0.00000901884,0.0000077994855,0.000015818687,0.000014017388,0.9901355,0.00041122027,0.0015956971,0.00006424403,0.007577707],"study_design_scores_gemma":[0.000006989934,0.000018883065,0.000042102904,0.0000034308816,0.000004615334,0.0000057716493,0.000008318113,0.9986657,0.0001946605,0.00086040155,0.0001875384,0.0000016812821],"about_ca_topic_score_codex":0.0053595146,"about_ca_topic_score_gemma":0.0054067695,"teacher_disagreement_score":0.0053595146,"about_ca_system_score_codex":0.0008133015,"about_ca_system_score_gemma":0.001032086,"threshold_uncertainty_score":0.010656595},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04737825,0.0004962819,0.9490623,0.0002022051,0.000019069385,0.00003194526,0.000019618203,0.00007439314,0.002715912],"genre_scores_gemma":[0.85619146,0.0009182304,0.139533,0.0000886554,0.00007193398,0.00016752735,0.00003806289,0.000047552483,0.0029435677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985061,0.00077296543,0.00003852404,0.00016013917,0.000425188,0.000096955235],"domain_scores_gemma":[0.99058074,0.007098404,0.00069462106,0.000468124,0.0010302895,0.00012781844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021827798,0.00096878555,0.00084130175,0.00058528746,0.00036955476,0.0007753881,0.00092913484,0.0010107361,0.0010274128],"category_scores_gemma":[0.011418511,0.00037008605,0.00040430223,0.00083099795,0.0017588749,0.001398316,0.0008657686,0.0008728202,0.0003713261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083454,0.000023394194,0.000297076,0.00009422567,0.000023127159,0.00011677036,0.00011114638,0.9195758,0.00590602,0.06293172,0.00030302923,0.010534203],"study_design_scores_gemma":[0.000014694523,0.000059522128,0.00005789696,0.000005800404,0.0000063542057,0.000060826245,0.0000106307425,0.9875289,0.0011197287,0.010918977,0.00021056653,0.000006072554],"about_ca_topic_score_codex":0.00085199863,"about_ca_topic_score_gemma":0.00057088974,"teacher_disagreement_score":0.0021827798,"about_ca_system_score_codex":0.0011033057,"about_ca_system_score_gemma":0.0005916125,"threshold_uncertainty_score":0.01154381},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005336776,0.0005169787,0.9927724,0.00018098572,0.000015439298,0.000023022701,0.00003585023,0.00012714764,0.0009914116],"genre_scores_gemma":[0.5411215,0.0013566704,0.45309693,0.00027714408,0.000107975975,0.00035311733,0.00021930115,0.000067700836,0.0033996683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980959,0.00101509,0.00007208525,0.00018171588,0.00055170024,0.00008340555],"domain_scores_gemma":[0.99405295,0.00457401,0.00047527693,0.0003597017,0.00048008206,0.00005802307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034298438,0.0006856148,0.0012801089,0.00059364195,0.0003678053,0.0012616664,0.00116179,0.0015853891,0.0013031103],"category_scores_gemma":[0.014358596,0.00075133465,0.00042597024,0.0007803496,0.0011892634,0.0019339565,0.0014626642,0.0015130955,0.0006805816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001566896,0.00004815499,0.00036935063,0.0001627854,0.0000593804,0.00014861752,0.00017467207,0.82206166,0.0040191207,0.11660808,0.0011821452,0.055009395],"study_design_scores_gemma":[0.000027752396,0.00002960878,0.00006983815,0.000013403605,0.0000056840668,0.000054976477,0.0000078739395,0.9640663,0.0011244545,0.03384097,0.00073971355,0.000019380412],"about_ca_topic_score_codex":0.0006140569,"about_ca_topic_score_gemma":0.00056810136,"teacher_disagreement_score":0.0034298438,"about_ca_system_score_codex":0.00093778624,"about_ca_system_score_gemma":0.0014822707,"threshold_uncertainty_score":0.018138945},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77183145,0.0010625152,0.22285444,0.00018119029,0.00004139163,0.00009089487,0.000040197498,0.0005255916,0.0033723249],"genre_scores_gemma":[0.97035396,0.00012284497,0.02917163,0.000023385683,0.0000064178653,0.000022592696,0.00002101337,0.000010166548,0.0002681615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992004,0.00038472872,0.000034838762,0.00006196678,0.00018597009,0.00013215329],"domain_scores_gemma":[0.9938205,0.004637305,0.00039626652,0.00027071108,0.00077195495,0.000103226506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018253669,0.0006760339,0.0006333707,0.000666628,0.00037265278,0.00058314565,0.000668789,0.00081914023,0.00045039845],"category_scores_gemma":[0.008560249,0.00015256715,0.00015424965,0.0005531979,0.0005108677,0.0006751875,0.00038019227,0.00033514557,0.00007644498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041825513,0.000111201785,0.0016574865,0.000046644847,0.000044884226,0.0000362234,0.000041146428,0.96529627,0.0028964477,0.0013960698,0.00015885987,0.027896611],"study_design_scores_gemma":[0.000017703509,0.00013149077,0.00024167376,0.0000023826276,0.000008549891,0.000016668651,0.000016599519,0.99708706,0.0022239997,0.00020115371,0.00004747108,0.000005242518],"about_ca_topic_score_codex":0.004706011,"about_ca_topic_score_gemma":0.0030498437,"teacher_disagreement_score":0.004706011,"about_ca_system_score_codex":0.00076039997,"about_ca_system_score_gemma":0.00095022685,"threshold_uncertainty_score":0.009653568},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11013822,0.0024377387,0.83321667,0.00067410484,0.00016597107,0.000054001077,0.0003101747,0.00035142642,0.052651644],"genre_scores_gemma":[0.95141447,0.0037353477,0.03455535,0.00033427702,0.000570095,0.00010214663,0.00024449642,0.00027053378,0.00877314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997707,0.0008185308,0.000081633865,0.00032542812,0.00079011,0.00027729067],"domain_scores_gemma":[0.9875031,0.009086895,0.0007998999,0.00067450444,0.0017330671,0.00020244552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025389015,0.0016361495,0.0011115797,0.0012065994,0.00041843034,0.0023100302,0.00086169346,0.0009795098,0.0035036865],"category_scores_gemma":[0.014821437,0.00049297,0.00046361762,0.0009718876,0.0022882812,0.0043137786,0.0016272677,0.0012907216,0.0013207751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034685188,0.000052904357,0.0014744883,0.0002567621,0.000071142276,0.0006020819,0.00034456846,0.5881042,0.015308021,0.35257253,0.0019178295,0.038948666],"study_design_scores_gemma":[0.00002772,0.00021199095,0.0012322674,0.00016460067,0.00008925216,0.00075496605,0.00017805793,0.7944433,0.00940972,0.18876337,0.004629507,0.00009519781],"about_ca_topic_score_codex":0.00078739546,"about_ca_topic_score_gemma":0.0006248147,"teacher_disagreement_score":0.0035036865,"about_ca_system_score_codex":0.0010339613,"about_ca_system_score_gemma":0.00059094664,"threshold_uncertainty_score":0.013427198},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023645429,0.001217855,0.9683298,0.00029478598,0.000046679917,0.000034524222,0.00009534134,0.0001331499,0.0062023466],"genre_scores_gemma":[0.92412513,0.0030452039,0.06646752,0.00013421303,0.00019500541,0.00019596404,0.00022028857,0.00008780535,0.005528785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928194,0.00024315999,0.000026056612,0.000084734536,0.00029164564,0.00007250812],"domain_scores_gemma":[0.99925476,0.00034769592,0.00013385793,0.00008972221,0.00015528311,0.000018542298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009765518,0.0009706112,0.000597398,0.0005007638,0.00028055153,0.0009422012,0.0013476278,0.0010979186,0.00064115453],"category_scores_gemma":[0.0029055786,0.0003774813,0.0004142403,0.0006235232,0.00061386876,0.0015377589,0.00069592946,0.0008352029,0.00034213343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005372901,0.000009277627,0.00014144852,0.000021285608,0.00000903944,0.000043157754,0.00003284102,0.97128314,0.0011790311,0.024104768,0.00018812298,0.0029825834],"study_design_scores_gemma":[7.529084e-7,0.000005042263,0.000041310468,0.0000022720326,0.0000017293022,0.000008721934,0.0000040490922,0.9949044,0.00014046731,0.004590711,0.00029810987,0.0000024738627],"about_ca_topic_score_codex":0.0036960875,"about_ca_topic_score_gemma":0.0015011672,"teacher_disagreement_score":0.0036960875,"about_ca_system_score_codex":0.0009359403,"about_ca_system_score_gemma":0.00062381657,"threshold_uncertainty_score":0.0073491335},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01086043,0.002590339,0.976904,0.00016200189,0.00007999547,0.000039564773,0.00013834111,0.00032672271,0.008898714],"genre_scores_gemma":[0.84184927,0.010272541,0.13670045,0.00025903588,0.0003768576,0.00020136005,0.00039585857,0.00023700207,0.009707707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990368,0.00027435608,0.000049174985,0.00009462296,0.00043599683,0.00010906191],"domain_scores_gemma":[0.9948435,0.0032001429,0.00039716577,0.00042248314,0.0010804418,0.000056332177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022293366,0.0011911375,0.0012848104,0.0014503297,0.00045413492,0.0017446862,0.00077301904,0.000958853,0.0030869057],"category_scores_gemma":[0.009532327,0.0005765884,0.0007922344,0.0013328297,0.00089851615,0.0017787893,0.0007070037,0.0012499737,0.0011436042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004669564,0.000019246547,0.00042595988,0.00019794943,0.000035578014,0.00038452883,0.00014139901,0.8692173,0.0031740607,0.10415023,0.0016691594,0.02053798],"study_design_scores_gemma":[0.0000035952041,0.00002435614,0.00020768214,0.00003420002,0.000011863184,0.00019619286,0.000025462945,0.97956926,0.0008525473,0.017901484,0.0011566491,0.00001669977],"about_ca_topic_score_codex":0.0023603905,"about_ca_topic_score_gemma":0.0010794064,"teacher_disagreement_score":0.0030869057,"about_ca_system_score_codex":0.0015191047,"about_ca_system_score_gemma":0.00090473203,"threshold_uncertainty_score":0.011789978},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033852093,0.00043128376,0.96253353,0.0002566474,0.000022155142,0.000029845174,0.000032708034,0.00007641151,0.0027653405],"genre_scores_gemma":[0.9078286,0.00081094715,0.08727634,0.00008722195,0.00005540121,0.00015435996,0.000038434522,0.00003328198,0.0037153957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948657,0.00024810078,0.000013885753,0.000073944044,0.00010685133,0.00007049145],"domain_scores_gemma":[0.9988682,0.00083999813,0.00011683409,0.000039820156,0.00009781489,0.00003738076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087934267,0.00092953286,0.00082016026,0.00039450152,0.00026068155,0.0007986078,0.0005311167,0.0009195743,0.0007058857],"category_scores_gemma":[0.0020657384,0.0004649497,0.0004604694,0.00069410336,0.00097555446,0.0010563361,0.0006795491,0.0004904659,0.00022674158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026872025,0.000018823332,0.00019192806,0.000035369932,0.000015360374,0.000069662645,0.00003191497,0.97993165,0.0021324498,0.01185434,0.00018429909,0.0055073723],"study_design_scores_gemma":[0.000007640677,0.000022410792,0.000052668303,0.0000022280637,0.0000033122913,0.000014033332,0.000010852146,0.9940924,0.0003110447,0.005364191,0.000114911614,0.0000043303835],"about_ca_topic_score_codex":0.0011667002,"about_ca_topic_score_gemma":0.0012496266,"teacher_disagreement_score":0.0011667002,"about_ca_system_score_codex":0.00071524567,"about_ca_system_score_gemma":0.00055867614,"threshold_uncertainty_score":0.0051894784},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4362296,0.0014595763,0.53010404,0.00075764226,0.00008903252,0.00010848848,0.00019037905,0.0008698485,0.030191338],"genre_scores_gemma":[0.98429996,0.0001895524,0.013761218,0.000034204415,0.000010964683,0.000018404464,0.000033530083,0.000019671055,0.0016325797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993368,0.00029663942,0.000023459206,0.00011047184,0.00012251428,0.000110143614],"domain_scores_gemma":[0.998519,0.0010300855,0.00015576211,0.000052568987,0.00019854945,0.000043991113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013936636,0.0010876325,0.0006598033,0.00032851912,0.00034420908,0.0011254053,0.0007155648,0.0010320015,0.0020422905],"category_scores_gemma":[0.0025374324,0.00035225588,0.00032686116,0.00028975419,0.0008497131,0.0006554239,0.00048785037,0.00060790934,0.0004463592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018751404,0.00014598753,0.0015626788,0.0002864011,0.000095780786,0.0001870542,0.0003347573,0.878966,0.040392075,0.031779375,0.0019153072,0.042459548],"study_design_scores_gemma":[0.00004096235,0.00025301878,0.000337373,0.000018922194,0.000024509261,0.000036217298,0.000042800428,0.98960924,0.0067181517,0.0026242884,0.00027762956,0.000016806569],"about_ca_topic_score_codex":0.0032830078,"about_ca_topic_score_gemma":0.0025982081,"teacher_disagreement_score":0.0032830078,"about_ca_system_score_codex":0.0013560072,"about_ca_system_score_gemma":0.0010643445,"threshold_uncertainty_score":0.009838581},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20674562,0.0007726469,0.78013974,0.00033314776,0.00007431816,0.000042591128,0.00019110586,0.00019867868,0.01150208],"genre_scores_gemma":[0.96028256,0.0004851694,0.03722876,0.00004158413,0.0000569487,0.00004162468,0.00007291216,0.000008181344,0.00178222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954826,0.00014093857,0.000020608239,0.00008352014,0.00010901489,0.0000976185],"domain_scores_gemma":[0.99927276,0.00037104436,0.00012233376,0.00010433777,0.00010361896,0.000025922458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038016078,0.00044429992,0.00070912583,0.00025350586,0.00042185892,0.0006409388,0.00046322003,0.0007001184,0.0007432431],"category_scores_gemma":[0.0015291906,0.00019529427,0.00027961744,0.0007212703,0.0007876111,0.00069272786,0.00067181897,0.0003871968,0.0001451432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054304925,0.00007747714,0.0016936377,0.0004274394,0.00008162843,0.0020290168,0.00042650467,0.6909815,0.054975744,0.2015764,0.0016449165,0.045542657],"study_design_scores_gemma":[0.000022512213,0.00011710239,0.00049157906,0.000015466148,0.000029873487,0.00042663026,0.000056998968,0.96852714,0.008576735,0.020632664,0.0010758424,0.000027470713],"about_ca_topic_score_codex":0.0009343343,"about_ca_topic_score_gemma":0.0009952674,"teacher_disagreement_score":0.0009343343,"about_ca_system_score_codex":0.00042775722,"about_ca_system_score_gemma":0.00050099613,"threshold_uncertainty_score":0.0031035542},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01915423,0.00075978204,0.97079575,0.00081067684,0.000049909024,0.000113080896,0.00004542362,0.000029046727,0.008242136],"genre_scores_gemma":[0.85702974,0.002130585,0.13114323,0.0002202215,0.0001841336,0.00038720967,0.0000734907,0.000039846454,0.008791626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978537,0.0012957836,0.00006282038,0.00013769328,0.00047663893,0.0001733111],"domain_scores_gemma":[0.9967475,0.002373917,0.0003113631,0.00015666148,0.00027667443,0.00013398573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004183982,0.00071332615,0.0012326017,0.0007210119,0.00079058023,0.0019341478,0.0014587631,0.0017151624,0.0028654689],"category_scores_gemma":[0.006307923,0.00051413657,0.0008597501,0.0010046742,0.0018841694,0.0021649345,0.0014742947,0.0016318245,0.0002940216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004628951,0.00005661923,0.00036876788,0.00008594617,0.000029381063,0.00021161832,0.000100417165,0.78875357,0.00082892855,0.19481172,0.0009802514,0.013726507],"study_design_scores_gemma":[0.000012223143,0.000023076545,0.00006646048,0.000011260605,0.000004905246,0.000034017965,0.000023117782,0.96097296,0.000119576165,0.03804044,0.0006843885,0.000007533815],"about_ca_topic_score_codex":0.0022885578,"about_ca_topic_score_gemma":0.0013518139,"teacher_disagreement_score":0.004183982,"about_ca_system_score_codex":0.002188033,"about_ca_system_score_gemma":0.0023123315,"threshold_uncertainty_score":0.02212727},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55012953,0.0033982142,0.43319017,0.00029561963,0.00006703505,0.000037984875,0.000036718164,0.00038105063,0.012463635],"genre_scores_gemma":[0.9951723,0.0003739236,0.0040371893,0.000014210518,0.000025461939,0.000009059223,0.0000074813147,0.000007403553,0.00035293004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990909,0.00035722862,0.000019704394,0.00007303121,0.0003073272,0.00015196022],"domain_scores_gemma":[0.9979728,0.0013874286,0.00017736573,0.00013503728,0.00029685558,0.000030580348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010911588,0.00055618613,0.00040814385,0.0005294545,0.00028368668,0.0006224126,0.000383627,0.00040093716,0.00040428335],"category_scores_gemma":[0.0035247495,0.00016602469,0.00022990312,0.0006849803,0.0007864652,0.0009072544,0.00044850455,0.00033059303,0.0001350587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004467378,0.00010449752,0.0033576027,0.00014063303,0.000087721586,0.00051940896,0.00034498758,0.82001203,0.086283684,0.027356276,0.000550142,0.060796406],"study_design_scores_gemma":[0.000015349344,0.00031094722,0.0015018885,0.000018159883,0.000053731037,0.00021092259,0.000047676436,0.972337,0.018059464,0.0065035466,0.0009213994,0.00001994165],"about_ca_topic_score_codex":0.00076102914,"about_ca_topic_score_gemma":0.0005041978,"teacher_disagreement_score":0.0010911588,"about_ca_system_score_codex":0.0008021076,"about_ca_system_score_gemma":0.00025835793,"threshold_uncertainty_score":0.0058197975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026359038,0.00028625154,0.9631623,0.000257259,0.00021996134,0.00029399208,0.000043116208,0.0018368129,0.007541163],"genre_scores_gemma":[0.4967224,0.0003463609,0.48718074,0.00016332969,0.00019666161,0.00075131014,0.00017756174,0.00010201328,0.014359748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962413,0.00011539347,0.000039013976,0.000059091934,0.00012057122,0.000041757805],"domain_scores_gemma":[0.99934477,0.00016332477,0.00006641698,0.00017736161,0.0001113381,0.00013662639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009690145,0.0004321544,0.0004996617,0.0004968035,0.0010315037,0.0015082231,0.0014046096,0.0008017272,0.0030493147],"category_scores_gemma":[0.0015147771,0.00024709126,0.00029483848,0.0003945378,0.00066001236,0.0014075168,0.0014447173,0.0010923159,0.0010013174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006018126,0.00051830406,0.0025530343,0.00027360438,0.00020836592,0.0011336985,0.0011986616,0.097135864,0.060096994,0.5850133,0.010847126,0.24041928],"study_design_scores_gemma":[0.00031518555,0.00045753425,0.0005240276,0.000039944294,0.00013273497,0.00034080257,0.00010150072,0.84739536,0.013846955,0.052216876,0.0845568,0.00007228551],"about_ca_topic_score_codex":0.0010193061,"about_ca_topic_score_gemma":0.0011280698,"teacher_disagreement_score":0.0030493147,"about_ca_system_score_codex":0.0004945806,"about_ca_system_score_gemma":0.00073468103,"threshold_uncertainty_score":0.010200977},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.557532,0.0032941725,0.42531684,0.00024558205,0.00006059251,0.00002197223,0.0001158871,0.0005709311,0.012841928],"genre_scores_gemma":[0.9931718,0.00034030294,0.005870755,0.0000136196995,0.000008902983,0.000008268695,0.00003063857,0.000019052353,0.0005366967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954045,0.00018336346,0.000013334932,0.000049612565,0.00013818315,0.00007509657],"domain_scores_gemma":[0.997514,0.0019139101,0.00015710405,0.00017100255,0.00021421482,0.000029834484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087811606,0.00033230887,0.0002931858,0.0004070379,0.00024660758,0.00069491356,0.00028785432,0.00032301064,0.0007526255],"category_scores_gemma":[0.0043222248,0.00018099393,0.00015068446,0.00061737245,0.00057882996,0.0009943902,0.0003046011,0.00025418936,0.00021446138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013435794,0.000022719416,0.0035363948,0.00005190052,0.000028510449,0.00017157245,0.000109044246,0.9401934,0.014339441,0.020210937,0.00032148397,0.020880286],"study_design_scores_gemma":[0.000009645534,0.00013015214,0.0032145467,0.000017133883,0.000040034796,0.00028944775,0.000099492165,0.9582315,0.023877015,0.012522144,0.0015456842,0.0000231553],"about_ca_topic_score_codex":0.00067625905,"about_ca_topic_score_gemma":0.00074497366,"teacher_disagreement_score":0.00087811606,"about_ca_system_score_codex":0.00069640187,"about_ca_system_score_gemma":0.00017209895,"threshold_uncertainty_score":0.005052805},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009017318,0.00034147713,0.98334736,0.0006159598,0.00010381086,0.00016042485,0.00019023364,0.00010788559,0.006115552],"genre_scores_gemma":[0.37985426,0.0011373153,0.6062221,0.0007499337,0.00022814369,0.00084338296,0.0005986826,0.00014780651,0.010218408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709094,0.0011344498,0.00020042225,0.0004099951,0.0008344121,0.00032974943],"domain_scores_gemma":[0.99346876,0.0032518106,0.0006305269,0.0016801243,0.0007224182,0.00024629934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00404123,0.0010425781,0.0010535351,0.0010188164,0.0011356063,0.0019193004,0.0041557564,0.0020007542,0.004911792],"category_scores_gemma":[0.012708251,0.00054945325,0.0009924978,0.0017601915,0.002303127,0.0063695223,0.005417326,0.003701289,0.0010798831],"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.00012966437,0.000058414047,0.00017805064,0.00015185548,0.000023216478,0.00010524633,0.00024670307,0.052888155,0.0024525782,0.8786016,0.00406668,0.06109781],"study_design_scores_gemma":[0.000116897994,0.00009807225,0.00010656633,0.00009969602,0.000028873501,0.00028793237,0.00009418798,0.5354508,0.003792841,0.4501268,0.009708325,0.00008892282],"about_ca_topic_score_codex":0.0011878122,"about_ca_topic_score_gemma":0.0013892938,"teacher_disagreement_score":0.004911792,"about_ca_system_score_codex":0.0018961565,"about_ca_system_score_gemma":0.0028133458,"threshold_uncertainty_score":0.021372318},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56984174,0.002505041,0.4076154,0.00081669533,0.00006317649,0.00007430803,0.00015339105,0.00018566728,0.01874459],"genre_scores_gemma":[0.99421966,0.00077566365,0.0037902424,0.000042606243,0.000044881755,0.000027508553,0.00002640194,0.000008365475,0.0010646179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993957,0.00026110018,0.000014318758,0.000059398073,0.0001462957,0.00012321459],"domain_scores_gemma":[0.9960311,0.0030748057,0.00042941546,0.0001442775,0.00021556945,0.000104671424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012796072,0.00045142812,0.00039265875,0.0005760525,0.00031914457,0.0007192872,0.0005311529,0.0005070613,0.0006877787],"category_scores_gemma":[0.0056730676,0.00027859377,0.00020493497,0.0006735621,0.001019835,0.0012417727,0.00060013385,0.00034949172,0.00010934539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016812817,0.000041188574,0.0012590219,0.00012479018,0.000025023792,0.00025116018,0.0001400523,0.9252137,0.004780322,0.059317548,0.0005382208,0.008140869],"study_design_scores_gemma":[0.000009552211,0.00004690468,0.00080561714,0.000011510765,0.00001100781,0.000051746876,0.000044655884,0.98125035,0.0005435953,0.017018974,0.00019935735,0.0000067260967],"about_ca_topic_score_codex":0.0020100505,"about_ca_topic_score_gemma":0.00180448,"teacher_disagreement_score":0.0020100505,"about_ca_system_score_codex":0.0009220229,"about_ca_system_score_gemma":0.00038952456,"threshold_uncertainty_score":0.006767273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058144905,0.0027229495,0.9118405,0.00066405116,0.00009483149,0.000058091577,0.00023631203,0.00034173313,0.025896627],"genre_scores_gemma":[0.9562056,0.0020001186,0.034944493,0.000108966764,0.00006963253,0.00007607716,0.00010297628,0.00012726829,0.0063648317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991304,0.00046612308,0.000022733744,0.00010641672,0.00016208872,0.000112175396],"domain_scores_gemma":[0.9982817,0.0012504549,0.00011894181,0.00012738635,0.00018801668,0.000033495176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011019979,0.00079793495,0.0006680765,0.0004518442,0.00043375324,0.0013260065,0.00090521236,0.00080739084,0.0035301952],"category_scores_gemma":[0.004279543,0.00036472268,0.00037888144,0.00077543384,0.001067589,0.0019325403,0.0009173947,0.00066512206,0.000714107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013340238,0.000030564875,0.00024399873,0.00010647598,0.000027333115,0.00011026103,0.000074095544,0.8856464,0.003584361,0.081640564,0.001813269,0.026589293],"study_design_scores_gemma":[0.000038876304,0.00008857666,0.00013911522,0.000021311522,0.000024245946,0.000092397684,0.000042123032,0.90156317,0.0030511077,0.092553705,0.0023653999,0.000019913876],"about_ca_topic_score_codex":0.0009983596,"about_ca_topic_score_gemma":0.0008133403,"teacher_disagreement_score":0.0035301952,"about_ca_system_score_codex":0.00091169035,"about_ca_system_score_gemma":0.0006657978,"threshold_uncertainty_score":0.011809707},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10793104,0.0008878071,0.8862161,0.00029051583,0.000061736406,0.000054238688,0.000030595565,0.00025203123,0.004275871],"genre_scores_gemma":[0.9803718,0.00015920332,0.018769737,0.000045217046,0.00001918121,0.000030340387,0.000011221844,0.0000067584506,0.0005865763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999474,0.00018588817,0.000016120246,0.00007918441,0.00014843525,0.0000964549],"domain_scores_gemma":[0.9994491,0.0002472674,0.00008116098,0.00006568187,0.00011637588,0.000040401414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000571249,0.00052713236,0.00039878956,0.0003980865,0.00054834597,0.0005545756,0.0006849242,0.00048631427,0.0005282356],"category_scores_gemma":[0.0014604805,0.00015124487,0.00020584208,0.0007101456,0.000706751,0.0005914428,0.0006881416,0.0004043215,0.000117048075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002694262,0.00010992998,0.0010636987,0.000110795656,0.00005441617,0.0004012445,0.00027636,0.8248144,0.03370405,0.04121775,0.002258823,0.0957191],"study_design_scores_gemma":[0.000008704569,0.00003946786,0.000116787836,0.000003751501,0.000009507156,0.00006497371,0.000024963267,0.9910466,0.0019059656,0.00605749,0.0007137879,0.000007953138],"about_ca_topic_score_codex":0.002578849,"about_ca_topic_score_gemma":0.0030069293,"teacher_disagreement_score":0.002578849,"about_ca_system_score_codex":0.00086261064,"about_ca_system_score_gemma":0.00055468845,"threshold_uncertainty_score":0.006258726},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005491464,0.0001732591,0.9925373,0.00008218775,0.000023187073,0.000026908072,0.000022840351,0.000077983335,0.001564894],"genre_scores_gemma":[0.6084396,0.000859404,0.38468087,0.00016598591,0.00011873944,0.00022627514,0.00013228643,0.000032058382,0.005344712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958044,0.00012650539,0.00002634215,0.00006620433,0.00016711204,0.0000334291],"domain_scores_gemma":[0.99966,0.00010722882,0.00004557959,0.00004629145,0.00013091398,0.000010003573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005989122,0.0005570854,0.0004864056,0.00021267595,0.00026305942,0.0006395991,0.0005243894,0.0006836587,0.0014616611],"category_scores_gemma":[0.001105485,0.00024548275,0.00031542877,0.00024106128,0.00033216793,0.00065756874,0.00047869593,0.00052791956,0.00070405466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010021266,0.000068462374,0.000726779,0.00030838273,0.000098854514,0.00030789978,0.00020336176,0.75747,0.073871955,0.050523087,0.002701732,0.11361932],"study_design_scores_gemma":[0.000024147195,0.00016984595,0.00018006223,0.000016854117,0.000026524074,0.00023830905,0.000029695157,0.9804401,0.010626834,0.0047433455,0.0034868796,0.000017437233],"about_ca_topic_score_codex":0.00038002635,"about_ca_topic_score_gemma":0.0006182106,"teacher_disagreement_score":0.0014616611,"about_ca_system_score_codex":0.00028801654,"about_ca_system_score_gemma":0.0005351224,"threshold_uncertainty_score":0.0048897266},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036074698,0.00066804735,0.94559896,0.00044460187,0.0002557869,0.0007426221,0.00023207408,0.002741963,0.013241221],"genre_scores_gemma":[0.7626925,0.000718842,0.2259691,0.00039453316,0.0001558961,0.00089714915,0.00041418866,0.00010205329,0.008655667],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887174,0.0002963261,0.0000858793,0.00013613625,0.00049592496,0.00011398282],"domain_scores_gemma":[0.9975073,0.00078945776,0.00028720192,0.00044829253,0.0008796713,0.00008812444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013605984,0.0005792362,0.00064800074,0.0005525637,0.0005937659,0.00093701854,0.0014441113,0.00060974446,0.0020441846],"category_scores_gemma":[0.0028276772,0.00017922968,0.00037591546,0.00045419662,0.00044843354,0.0007817955,0.00090055994,0.0008310288,0.0005319392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010408625,0.00047540583,0.0027101517,0.0008446587,0.00032158644,0.00089135027,0.0006523516,0.27870446,0.21329309,0.11897202,0.018499574,0.3635945],"study_design_scores_gemma":[0.00011664832,0.0004238364,0.00064454344,0.000030462861,0.00012346182,0.0008751057,0.0000539832,0.9011788,0.06068802,0.012238602,0.02353163,0.00009489991],"about_ca_topic_score_codex":0.0011265465,"about_ca_topic_score_gemma":0.000993052,"teacher_disagreement_score":0.0020441846,"about_ca_system_score_codex":0.00065344834,"about_ca_system_score_gemma":0.0011136832,"threshold_uncertainty_score":0.007195592},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17647603,0.00068088894,0.7940156,0.001895646,0.0001223246,0.00018082405,0.00002969728,0.00012175861,0.026477223],"genre_scores_gemma":[0.9820079,0.00027431044,0.016237548,0.000107221116,0.000048823746,0.00006313877,0.000004648474,0.000011833944,0.0012444766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979899,0.0013096445,0.000044013443,0.000118748176,0.0003701784,0.00016749736],"domain_scores_gemma":[0.9952494,0.0035846692,0.00037765567,0.00022541809,0.000295739,0.0002670422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002494291,0.00072448986,0.00064883346,0.00043850535,0.00083741307,0.0015655786,0.0011185549,0.0012682304,0.0015397011],"category_scores_gemma":[0.008614554,0.00034996652,0.00044831476,0.00061682635,0.0025949762,0.0033465885,0.0019400296,0.0012559048,0.00021895739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020404987,0.00023092303,0.0014662099,0.000138811,0.00006844455,0.00057638646,0.0006203683,0.34058142,0.010800436,0.5959471,0.00141048,0.047955472],"study_design_scores_gemma":[0.000089121604,0.0002025859,0.000334715,0.000024251389,0.000027287979,0.0002614845,0.00019550517,0.5729036,0.0014980697,0.42111042,0.0033146234,0.000038379305],"about_ca_topic_score_codex":0.0004927095,"about_ca_topic_score_gemma":0.00047415547,"teacher_disagreement_score":0.002494291,"about_ca_system_score_codex":0.0010249161,"about_ca_system_score_gemma":0.0007425903,"threshold_uncertainty_score":0.013191223},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013608804,0.0003746283,0.9845573,0.00006636684,0.000024055418,0.000023463803,0.000013826769,0.00009862542,0.0012329578],"genre_scores_gemma":[0.7275905,0.0005972118,0.2692882,0.00007586754,0.00007401923,0.0001343512,0.000040818595,0.00002208185,0.0021769316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994135,0.00022112367,0.00003963868,0.00009169225,0.00015890818,0.00007515689],"domain_scores_gemma":[0.99907625,0.00052000734,0.00011718976,0.00011768626,0.00014331742,0.000025554755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008727209,0.00077020546,0.0006145688,0.00037295345,0.00040642,0.0004833867,0.0011112706,0.0008387599,0.0011834669],"category_scores_gemma":[0.0027737813,0.00030602913,0.00036557866,0.0007333457,0.0004968941,0.0011691388,0.00076245447,0.0008705914,0.00028482245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016891035,0.00008495088,0.0003595601,0.000116220435,0.00003744362,0.00011760924,0.00024149784,0.77675253,0.014257499,0.024405567,0.00086727267,0.18259095],"study_design_scores_gemma":[0.000011626153,0.000050971674,0.00006932768,0.0000079705815,0.000009027796,0.000050516053,0.000008116757,0.99410915,0.0017243939,0.0034454907,0.0005044115,0.000008959463],"about_ca_topic_score_codex":0.0013925676,"about_ca_topic_score_gemma":0.0017305886,"teacher_disagreement_score":0.0013925676,"about_ca_system_score_codex":0.0005648222,"about_ca_system_score_gemma":0.00055969704,"threshold_uncertainty_score":0.004615426},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30797592,0.0069827465,0.66265184,0.0012777557,0.00014597432,0.00008535803,0.0005580542,0.00044331056,0.019879164],"genre_scores_gemma":[0.98683095,0.0020217376,0.009317211,0.00008544756,0.0001305513,0.00007406586,0.00015176645,0.000047544312,0.0013406058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625576,0.001554711,0.00015378464,0.0002896167,0.0013579273,0.00038818622],"domain_scores_gemma":[0.94046825,0.052102316,0.0028625051,0.0014977821,0.002765066,0.00030419655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056902245,0.0013162394,0.001503134,0.0012746237,0.0007251091,0.0016961537,0.0012031741,0.0015047194,0.0019963556],"category_scores_gemma":[0.042611793,0.0006383239,0.0004102079,0.0017672157,0.0027320269,0.0026491787,0.0015755974,0.0014355191,0.00035564337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002623938,0.000042807533,0.001800611,0.00024869255,0.000058791353,0.00044790903,0.00035760266,0.8956265,0.0020737103,0.08091766,0.0010541867,0.01710919],"study_design_scores_gemma":[0.00002890234,0.00007388647,0.0011692238,0.000069832655,0.000033593038,0.00030803736,0.00008896343,0.95723146,0.0013656112,0.039081294,0.000513771,0.00003544834],"about_ca_topic_score_codex":0.0020326434,"about_ca_topic_score_gemma":0.0010012831,"teacher_disagreement_score":0.0056902245,"about_ca_system_score_codex":0.0017413335,"about_ca_system_score_gemma":0.00077414955,"threshold_uncertainty_score":0.030093193},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12267812,0.0010419498,0.8545109,0.0012072237,0.00007274998,0.00008738418,0.00016050001,0.00018535662,0.02005578],"genre_scores_gemma":[0.9457241,0.0011368907,0.049421806,0.00017050879,0.00010236281,0.00020641621,0.000114818926,0.00010407509,0.0030189457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890757,0.00042868438,0.00004136912,0.00015015595,0.00032544642,0.00014679544],"domain_scores_gemma":[0.99046856,0.0058509125,0.0012202975,0.00049113337,0.0015812938,0.00038779163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031734293,0.00091031316,0.00077701674,0.0011310849,0.00078495237,0.001422628,0.0016246013,0.0010539632,0.003963484],"category_scores_gemma":[0.0137598775,0.0006305601,0.00042747392,0.001215862,0.0018009199,0.0026001835,0.0016649059,0.0010940217,0.00064016506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020487465,0.00007494379,0.0010492889,0.00024076014,0.00003823661,0.0000897052,0.0003350986,0.62556654,0.0120099485,0.3403779,0.0022590042,0.017753657],"study_design_scores_gemma":[0.000030506995,0.00015216522,0.0005010101,0.00004658847,0.000019129626,0.00012506961,0.00020253616,0.8702222,0.0041098776,0.12311684,0.001445251,0.000028759616],"about_ca_topic_score_codex":0.00066308846,"about_ca_topic_score_gemma":0.00061841746,"teacher_disagreement_score":0.003963484,"about_ca_system_score_codex":0.0018614243,"about_ca_system_score_gemma":0.000985112,"threshold_uncertainty_score":0.01678288},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08675117,0.0012112906,0.9043043,0.000467302,0.000037614445,0.00008152491,0.00010539567,0.00010961779,0.006931749],"genre_scores_gemma":[0.9426346,0.00077266456,0.05358463,0.00008510942,0.00005370692,0.00011774988,0.00005385941,0.000054538537,0.0026430406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987832,0.0006344871,0.000043695392,0.0001373075,0.00020524912,0.00019610708],"domain_scores_gemma":[0.99788046,0.0015296285,0.00026654944,0.00008280959,0.00018142004,0.00005912786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016724914,0.001054045,0.0010464246,0.0006231519,0.0002943158,0.0013922123,0.0008963387,0.0009336549,0.0025151658],"category_scores_gemma":[0.004305551,0.000576941,0.00029111185,0.0009912339,0.0010426665,0.0017664774,0.0009730397,0.0006375952,0.00046966094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014976824,0.00006126316,0.00028710958,0.00011847214,0.000036290956,0.00013015405,0.000092445436,0.9173172,0.003718016,0.05441609,0.00062341394,0.023049723],"study_design_scores_gemma":[0.000040911225,0.00006183258,0.00012502942,0.000008607839,0.000011236615,0.000044197288,0.000033361295,0.96851707,0.00082395173,0.02982489,0.0004975207,0.0000114824015],"about_ca_topic_score_codex":0.0009893959,"about_ca_topic_score_gemma":0.0009963025,"teacher_disagreement_score":0.0025151658,"about_ca_system_score_codex":0.0013322472,"about_ca_system_score_gemma":0.00082335086,"threshold_uncertainty_score":0.009666204},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071224025,0.0001054819,0.9895209,0.00011710162,0.00002029357,0.000028143735,0.000040138413,0.000042176525,0.0030033945],"genre_scores_gemma":[0.5865074,0.000947477,0.40671736,0.00018633598,0.000069798734,0.00033401052,0.00018851178,0.00005491476,0.0049942653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923503,0.00035065922,0.00002998834,0.00007259196,0.00022439235,0.00008723447],"domain_scores_gemma":[0.99911565,0.00043808614,0.0001122267,0.000087186716,0.00019410554,0.000052797106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012644286,0.0010730803,0.0006878954,0.00046488058,0.0003492403,0.0010056663,0.000676185,0.00076781685,0.0021361297],"category_scores_gemma":[0.0027252224,0.00044416988,0.00041020103,0.0007807907,0.0011135802,0.001130213,0.001217514,0.0009171121,0.0007562199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035495881,0.000104267965,0.00042408524,0.00021781377,0.000045654026,0.00019005375,0.00018546727,0.62410116,0.03225137,0.2715261,0.0024471504,0.06815193],"study_design_scores_gemma":[0.00003775669,0.000079290745,0.000060143262,0.000026584006,0.000012311426,0.00009225296,0.000034847242,0.95396227,0.006901064,0.037294403,0.0014707611,0.000028374627],"about_ca_topic_score_codex":0.0006041019,"about_ca_topic_score_gemma":0.0011484798,"teacher_disagreement_score":0.0021361297,"about_ca_system_score_codex":0.0006830862,"about_ca_system_score_gemma":0.001087645,"threshold_uncertainty_score":0.00714612},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009786433,0.006016463,0.96295375,0.0013920484,0.00032682816,0.00008513058,0.00024162288,0.00018920179,0.019008417],"genre_scores_gemma":[0.56588167,0.01846983,0.3891892,0.0013809258,0.0021814909,0.00088762736,0.0012579422,0.00077763654,0.01997358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925672,0.0036170133,0.00042267414,0.00085933064,0.0020809523,0.00045289288],"domain_scores_gemma":[0.97734535,0.015093452,0.0017842711,0.0021471495,0.0029658594,0.0006639868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068773,0.0029488448,0.0015859961,0.0046102,0.0014930932,0.0036719805,0.0022973663,0.0030598366,0.0031079694],"category_scores_gemma":[0.031704936,0.00054157857,0.0011071686,0.0045293393,0.006356724,0.009380047,0.005299162,0.00505221,0.001062365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027520999,0.000009567743,0.00015949052,0.00008111118,0.000015877566,0.00003743605,0.000103468796,0.039610766,0.00052858033,0.94319284,0.0013133754,0.014919948],"study_design_scores_gemma":[0.000006602794,0.00006875081,0.00013649213,0.00008401911,0.000011152957,0.00007852248,0.00004071968,0.1355433,0.0007846802,0.856435,0.0067749578,0.0000358593],"about_ca_topic_score_codex":0.002303312,"about_ca_topic_score_gemma":0.0008786698,"teacher_disagreement_score":0.0068773,"about_ca_system_score_codex":0.004517328,"about_ca_system_score_gemma":0.0016163836,"threshold_uncertainty_score":0.036371112},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03224201,0.0006378756,0.9654746,0.00018484739,0.00001528392,0.000014753343,0.00001964719,0.00017644385,0.0012344709],"genre_scores_gemma":[0.8532665,0.00044448773,0.14515013,0.00008263833,0.000040189225,0.00004184322,0.00003545195,0.000029891284,0.0009089628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815863,0.0008158402,0.000102056496,0.00023218305,0.00056116784,0.00013009504],"domain_scores_gemma":[0.99632984,0.002640741,0.0003122929,0.00031570063,0.00034588578,0.000055627035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021985613,0.0005849083,0.00094095996,0.00063799764,0.00029425492,0.0012634161,0.0010284773,0.0011442254,0.00037424828],"category_scores_gemma":[0.009411123,0.00041855144,0.00033695443,0.0007037917,0.0013766808,0.0020424672,0.0013708684,0.00048650624,0.00021931675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027832566,0.00006733536,0.00095881487,0.0001638905,0.00006017292,0.00019195215,0.00038216772,0.739375,0.019191628,0.11524351,0.00074196793,0.12334529],"study_design_scores_gemma":[0.000018690573,0.00006209916,0.00009355176,0.000009175529,0.000008753013,0.00007424128,0.000016979118,0.9721363,0.0037732976,0.023329433,0.00046199522,0.00001555449],"about_ca_topic_score_codex":0.00065453566,"about_ca_topic_score_gemma":0.0005693679,"teacher_disagreement_score":0.0021985613,"about_ca_system_score_codex":0.0008972958,"about_ca_system_score_gemma":0.000777692,"threshold_uncertainty_score":0.011627257},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39862984,0.00080193306,0.5686713,0.0017861314,0.00012403177,0.00016987362,0.0013465427,0.00080364273,0.027666708],"genre_scores_gemma":[0.88874537,0.00042966646,0.104534395,0.00029535193,0.00008215568,0.00013221985,0.00060023094,0.00011513903,0.0050654975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981608,0.0006110674,0.000107504995,0.00036028112,0.00037714868,0.00038326366],"domain_scores_gemma":[0.9931339,0.0037061146,0.0010099154,0.0010200294,0.0006840465,0.00044594394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014228867,0.00070582755,0.00092794537,0.0009067199,0.0008149694,0.002145938,0.0009096322,0.0011625976,0.0030590715],"category_scores_gemma":[0.010058678,0.0004805956,0.00049327104,0.0011231102,0.0012709463,0.002629003,0.00169888,0.0016131056,0.0005819086],"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.0005517076,0.00012410052,0.0010213426,0.00021265566,0.000046401514,0.00024524008,0.00031981856,0.3233228,0.010204586,0.60701245,0.0065257545,0.05041319],"study_design_scores_gemma":[0.00007527422,0.00017093221,0.0004020351,0.000043668868,0.000019100453,0.00023383147,0.000125068,0.45582455,0.005026656,0.5353444,0.0026859825,0.000048560567],"about_ca_topic_score_codex":0.0008904257,"about_ca_topic_score_gemma":0.001285573,"teacher_disagreement_score":0.0030590715,"about_ca_system_score_codex":0.0016148823,"about_ca_system_score_gemma":0.0014042144,"threshold_uncertainty_score":0.011716843},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5587141,0.0024753741,0.41118675,0.0006300909,0.000060821007,0.0001674039,0.00021186731,0.0003431452,0.026210448],"genre_scores_gemma":[0.98980296,0.00050713966,0.008696677,0.000026961583,0.00001532657,0.000062318235,0.000042505166,0.000024387396,0.00082165597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796677,0.0008592232,0.00007747189,0.0001545501,0.0006269555,0.00031504745],"domain_scores_gemma":[0.985059,0.011242437,0.001443135,0.00062279304,0.0014684201,0.00016409186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037348843,0.0010234519,0.0009800708,0.0011643752,0.0007132208,0.0012873975,0.00088478933,0.0009328884,0.0013572345],"category_scores_gemma":[0.014928212,0.00034200004,0.0004250941,0.0009770031,0.0015063536,0.0015950637,0.0016453798,0.0008390033,0.0002758011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030332356,0.000120452285,0.0026860884,0.00016220564,0.00008131212,0.0002359581,0.00035301704,0.87773615,0.012089554,0.08284882,0.0005622411,0.022820927],"study_design_scores_gemma":[0.000009957045,0.00014298785,0.00025311447,0.000011448319,0.000024708146,0.00009796251,0.00006691946,0.9888653,0.0027703575,0.007468447,0.00027107555,0.000017611514],"about_ca_topic_score_codex":0.0025333527,"about_ca_topic_score_gemma":0.0019761822,"teacher_disagreement_score":0.0037348843,"about_ca_system_score_codex":0.0015612734,"about_ca_system_score_gemma":0.0014460188,"threshold_uncertainty_score":0.019752204},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023021188,0.0008110393,0.99485177,0.00025496702,0.000037482212,0.000018223418,0.000023424496,0.00005710675,0.0016437571],"genre_scores_gemma":[0.49857482,0.004721541,0.4863703,0.0002622324,0.00040460593,0.00047632874,0.00022861827,0.00012169798,0.008839825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987159,0.0006520057,0.00004793627,0.00012730621,0.0003654328,0.00009148715],"domain_scores_gemma":[0.9991698,0.0004717662,0.000096085445,0.00010623454,0.00012286608,0.00003314761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018644282,0.00086415396,0.00074370607,0.0005829061,0.000367961,0.0011448413,0.0009172632,0.0009805262,0.0010157141],"category_scores_gemma":[0.0033530404,0.00040995868,0.0004156037,0.0013081596,0.0013621944,0.0017377372,0.0013195549,0.0011740308,0.00029485478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007087136,0.000032357293,0.0001738865,0.00013820933,0.000037507132,0.000065778,0.00008153885,0.6347589,0.0028925445,0.29902843,0.0027597987,0.05996023],"study_design_scores_gemma":[0.000012337365,0.000018913097,0.00005845674,0.000011003384,0.000009255985,0.000027756581,0.000012597061,0.89497226,0.0007476328,0.10094271,0.0031772894,0.000009779933],"about_ca_topic_score_codex":0.0017712582,"about_ca_topic_score_gemma":0.0017725307,"teacher_disagreement_score":0.0018644282,"about_ca_system_score_codex":0.0011638319,"about_ca_system_score_gemma":0.001636751,"threshold_uncertainty_score":0.009860158},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8938838,0.001686416,0.09870831,0.00013312719,0.000026765894,0.000025103069,0.000092738635,0.00012371244,0.0053200647],"genre_scores_gemma":[0.99580413,0.00030846318,0.0034898666,0.000010198996,0.000008164224,0.000005787166,0.000027432521,0.0000073775914,0.00033861658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992761,0.00022508316,0.000024763882,0.00009156046,0.00025104525,0.000131499],"domain_scores_gemma":[0.9956117,0.0029620763,0.0004000905,0.00031484728,0.0006379182,0.00007335314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010766125,0.0010286102,0.0006572564,0.00054228597,0.00038839865,0.00081692525,0.00055336196,0.0008744073,0.00090526487],"category_scores_gemma":[0.0057259826,0.00017237717,0.00029138394,0.0005514399,0.0009610851,0.000886431,0.00077493634,0.00050530507,0.00024301937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050159404,0.00004459413,0.0026006976,0.00013628986,0.00007739804,0.0004261356,0.0002097718,0.9460949,0.028140567,0.006473318,0.00014592013,0.015148781],"study_design_scores_gemma":[0.000010515678,0.0004076996,0.00196262,0.000018678038,0.00005034483,0.0002854433,0.00007429025,0.9828824,0.01152097,0.0025653834,0.00018838063,0.000033219585],"about_ca_topic_score_codex":0.0016223242,"about_ca_topic_score_gemma":0.0014419497,"teacher_disagreement_score":0.0016223242,"about_ca_system_score_codex":0.00072054483,"about_ca_system_score_gemma":0.00038750845,"threshold_uncertainty_score":0.0056937337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31158504,0.005226234,0.6494232,0.0013947374,0.00047375215,0.00021266608,0.0003975843,0.0003485653,0.030938184],"genre_scores_gemma":[0.94597846,0.002143237,0.041920606,0.00021655373,0.00034863662,0.00021591753,0.00016489864,0.00007587764,0.008935718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991811,0.00025365865,0.000022387634,0.0000880784,0.00020167865,0.000253148],"domain_scores_gemma":[0.99716824,0.00175696,0.00035982297,0.0001867103,0.0003568361,0.00017142521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010900919,0.0008228163,0.00059782516,0.0007618774,0.00083479355,0.0009961592,0.00076459505,0.0011812791,0.002015844],"category_scores_gemma":[0.004739915,0.0002804654,0.000582687,0.0007945411,0.0013111602,0.0013784807,0.0011086547,0.0014211606,0.00022850189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034003792,0.00012167145,0.0015663407,0.00018901161,0.000056881676,0.00032451045,0.00022704453,0.36755338,0.008924527,0.59214646,0.0043560443,0.02419411],"study_design_scores_gemma":[0.0000385682,0.00014388117,0.00026946788,0.00003234273,0.000022412985,0.0001441941,0.000059414586,0.9232042,0.001887117,0.07091569,0.0032600784,0.000022695833],"about_ca_topic_score_codex":0.0030635914,"about_ca_topic_score_gemma":0.0019540752,"teacher_disagreement_score":0.0030635914,"about_ca_system_score_codex":0.0013398826,"about_ca_system_score_gemma":0.0013220431,"threshold_uncertainty_score":0.009721577},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15145598,0.0011369896,0.8409633,0.00031630168,0.000052216783,0.00014302564,0.00011217842,0.0013789177,0.004441118],"genre_scores_gemma":[0.8854029,0.00048256415,0.111556955,0.00004293377,0.000036102523,0.000102888116,0.00009619942,0.00004097437,0.0022384257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932337,0.00020576653,0.000031245592,0.0001110385,0.00024417278,0.00008441751],"domain_scores_gemma":[0.9987501,0.00062457984,0.00011437355,0.0002616611,0.00017551272,0.0000737603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078261766,0.00043392382,0.0007074795,0.0008781667,0.00080310844,0.0006665889,0.0011975442,0.00063110655,0.0007684335],"category_scores_gemma":[0.0018918421,0.0002741555,0.0002497992,0.0011632163,0.0006131402,0.0019417319,0.0013347517,0.00037830413,0.00027373654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053242873,0.00021254855,0.0019298056,0.00025773043,0.0001105465,0.00092339463,0.0004919563,0.6579715,0.05542961,0.030673373,0.004423089,0.24704404],"study_design_scores_gemma":[0.00003542608,0.00014145196,0.00051984366,0.000009475632,0.00001679123,0.00035216036,0.00015260992,0.96064734,0.016087538,0.018049166,0.0039599477,0.000028194881],"about_ca_topic_score_codex":0.0021579722,"about_ca_topic_score_gemma":0.002214781,"teacher_disagreement_score":0.0021579722,"about_ca_system_score_codex":0.00039371967,"about_ca_system_score_gemma":0.00051913585,"threshold_uncertainty_score":0.004290879},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020465688,0.00011773068,0.99731016,0.000039775412,0.0000093777235,0.0000059984745,0.000004934573,0.000059352522,0.00040600877],"genre_scores_gemma":[0.764182,0.0007213309,0.23167795,0.000120781646,0.00011418279,0.00014747532,0.000052236068,0.000081431484,0.0029027387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994885,0.00013956177,0.000027640992,0.00011493709,0.00017365695,0.000055783006],"domain_scores_gemma":[0.99926394,0.00042033038,0.000098153556,0.00007837733,0.00012354991,0.000015657744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090379245,0.00064189645,0.0008310173,0.00032304635,0.00043198286,0.0007819489,0.00089710683,0.0007585147,0.0008786199],"category_scores_gemma":[0.0024748328,0.0003943859,0.0004484308,0.00037203653,0.0006942892,0.0014981747,0.0007565529,0.00080088153,0.0002666296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039943978,0.000021378066,0.00019527637,0.000054949745,0.000032542957,0.00005034947,0.00009997806,0.91451186,0.003409463,0.022405367,0.0005540584,0.05862485],"study_design_scores_gemma":[0.0000046411387,0.000015023042,0.000040178064,0.0000036464585,0.000005502371,0.000012292874,0.0000054948205,0.9957891,0.0006946098,0.0030546251,0.00036845228,0.0000062974036],"about_ca_topic_score_codex":0.0047999434,"about_ca_topic_score_gemma":0.0033087456,"teacher_disagreement_score":0.0047999434,"about_ca_system_score_codex":0.000816791,"about_ca_system_score_gemma":0.00089271675,"threshold_uncertainty_score":0.009544015},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062272507,0.0005709473,0.99054164,0.00006763001,0.00005094292,0.000055076227,0.000022858252,0.0002621883,0.0022013711],"genre_scores_gemma":[0.58430916,0.0012481789,0.40827712,0.00022532976,0.00010065499,0.0004217791,0.00016776734,0.00011411394,0.005135909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991418,0.00033485395,0.000049644597,0.00012225381,0.00027162852,0.000079668236],"domain_scores_gemma":[0.99917114,0.00029403644,0.00010635764,0.00014095138,0.00026100466,0.000026580688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018019712,0.00076591276,0.00041623213,0.0004528016,0.00038127846,0.0012653839,0.0010216292,0.0006486214,0.0027169797],"category_scores_gemma":[0.0022595592,0.00042771726,0.0003746554,0.00032834723,0.00032854543,0.0007647903,0.00086241757,0.00068796065,0.000786515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017054011,0.00011894654,0.00077493535,0.00038653117,0.0002175993,0.00030317326,0.00021379591,0.6675977,0.043986302,0.08475986,0.004455743,0.1970148],"study_design_scores_gemma":[0.000025375664,0.00016117045,0.00017126868,0.0000191016,0.00004834777,0.00012943482,0.000017741595,0.9799454,0.007021392,0.007195705,0.0052483645,0.00001664605],"about_ca_topic_score_codex":0.00057413295,"about_ca_topic_score_gemma":0.0011528839,"teacher_disagreement_score":0.0027169797,"about_ca_system_score_codex":0.00057652325,"about_ca_system_score_gemma":0.0005919735,"threshold_uncertainty_score":0.009529829},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009599745,0.00036159318,0.98630816,0.00014532825,0.00004566236,0.0000358804,0.000034150118,0.00022215518,0.0032473537],"genre_scores_gemma":[0.65022814,0.0013321312,0.34347796,0.00027090625,0.00012704988,0.0002671837,0.00018965594,0.00007189369,0.0040351157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992518,0.00023030034,0.00003703841,0.000055186647,0.0003198526,0.00010581633],"domain_scores_gemma":[0.9989832,0.00037816854,0.0000977547,0.00024863772,0.0002512746,0.000040972696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095670135,0.0004259114,0.0004196457,0.00057927176,0.00046545503,0.0008030537,0.0010185626,0.00073271635,0.001074773],"category_scores_gemma":[0.0031049557,0.00021294662,0.00042928377,0.00079885096,0.0005644135,0.001543154,0.0017258617,0.00095712516,0.0003053361],"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.00025713842,0.00008061374,0.00072168576,0.00020027641,0.00007150964,0.00040580914,0.00035097954,0.34341455,0.030570585,0.38808852,0.004710785,0.23112752],"study_design_scores_gemma":[0.000024667177,0.000058956222,0.00014090439,0.00002651793,0.000027777012,0.00014387682,0.000023857297,0.9088541,0.007522545,0.077385075,0.0057687717,0.000022887567],"about_ca_topic_score_codex":0.0013566834,"about_ca_topic_score_gemma":0.0010681917,"teacher_disagreement_score":0.0013566834,"about_ca_system_score_codex":0.00067738205,"about_ca_system_score_gemma":0.00079920655,"threshold_uncertainty_score":0.0050595403},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02276459,0.00047712852,0.9756414,0.00007621924,0.000027922055,0.000019804424,0.000018661718,0.000113708964,0.00086048857],"genre_scores_gemma":[0.8831192,0.00076492736,0.11472571,0.00004984833,0.00006271743,0.00007338846,0.000054873137,0.000023017794,0.0011263494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992005,0.00030201275,0.000034627337,0.00010973577,0.00026125615,0.000091842296],"domain_scores_gemma":[0.99727964,0.0018786145,0.00024623185,0.00023368277,0.00031026272,0.000051537056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010965274,0.0008932746,0.00078810175,0.00042364118,0.0003804983,0.0007681414,0.000973656,0.0010946781,0.0005100724],"category_scores_gemma":[0.0068635736,0.00051037635,0.00042864095,0.00087194535,0.0008151857,0.0013009803,0.0008383488,0.0008751529,0.00015237524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019631513,0.00004877926,0.0009482688,0.00014120617,0.00006912814,0.00026423467,0.00013157596,0.8858244,0.014358,0.013974954,0.0005245128,0.08351852],"study_design_scores_gemma":[0.0000058003857,0.000036547583,0.00013842239,0.000005345768,0.00001293341,0.000060675076,0.0000056506947,0.99633765,0.0019356577,0.0012737403,0.00017970694,0.000007863872],"about_ca_topic_score_codex":0.0033244116,"about_ca_topic_score_gemma":0.003331806,"teacher_disagreement_score":0.0033244116,"about_ca_system_score_codex":0.0005391887,"about_ca_system_score_gemma":0.00096394034,"threshold_uncertainty_score":0.006610155},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24643631,0.0026307052,0.7372619,0.0004435849,0.00009987887,0.000060469927,0.00013913489,0.00015011536,0.012777951],"genre_scores_gemma":[0.9841111,0.00071974617,0.012585554,0.00004514659,0.000031662006,0.000041183936,0.00004079678,0.000020307327,0.002404531],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961483,0.00011752475,0.000008813929,0.000046049874,0.0001363523,0.000076418466],"domain_scores_gemma":[0.9976809,0.0016432957,0.00019665864,0.00008543077,0.00034188412,0.000051732837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010389013,0.0007588855,0.00043451454,0.00055802765,0.0003714527,0.0008206778,0.0008035601,0.0005922407,0.0013803284],"category_scores_gemma":[0.0046541314,0.00032722813,0.00024348528,0.00039501803,0.00086514757,0.0010713041,0.00065853517,0.00060689216,0.00025428244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012976154,0.000025934025,0.0005385653,0.0000794202,0.000022798666,0.00021828864,0.0001683999,0.89786065,0.013965384,0.079335496,0.0004409297,0.0072143953],"study_design_scores_gemma":[0.000004388784,0.000032050764,0.00009496862,0.0000060872467,0.00000621844,0.000044792883,0.000016699963,0.99386287,0.0011240436,0.00455528,0.0002448996,0.000007737254],"about_ca_topic_score_codex":0.0019432701,"about_ca_topic_score_gemma":0.001169552,"teacher_disagreement_score":0.0019432701,"about_ca_system_score_codex":0.001745311,"about_ca_system_score_gemma":0.0007246645,"threshold_uncertainty_score":0.012663186},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04261181,0.0006872445,0.95316434,0.00016339867,0.000056267316,0.00006431729,0.000023194227,0.00016410311,0.0030652229],"genre_scores_gemma":[0.80090034,0.0006382219,0.19601302,0.00014602114,0.00009948788,0.00010762622,0.000036480855,0.00001673704,0.002042047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992843,0.00021450598,0.000036141937,0.00013272672,0.0002443573,0.00008807481],"domain_scores_gemma":[0.998458,0.0005725323,0.00030146012,0.00033059384,0.00028745917,0.000049927534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011216529,0.00093609904,0.0006071951,0.00064734794,0.00040918638,0.0008036079,0.0015035557,0.0010736423,0.0007854702],"category_scores_gemma":[0.002725685,0.00036044413,0.00051884644,0.00074256235,0.0012205649,0.0018589046,0.000991256,0.0006934091,0.00050829264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008946022,0.00025293409,0.0028426524,0.0005775452,0.00024496045,0.0015442186,0.0010649796,0.21593724,0.20591931,0.2955615,0.0022312563,0.2729288],"study_design_scores_gemma":[0.00019422526,0.0014321075,0.0006944584,0.00006124452,0.00019336512,0.0022016047,0.00010389429,0.860096,0.07631854,0.047013737,0.01157449,0.00011638761],"about_ca_topic_score_codex":0.0004915475,"about_ca_topic_score_gemma":0.0004733566,"teacher_disagreement_score":0.0015035557,"about_ca_system_score_codex":0.00053860183,"about_ca_system_score_gemma":0.0004563955,"threshold_uncertainty_score":0.0059319735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07854709,0.001487666,0.9142252,0.000366136,0.0000335766,0.0000304718,0.00002753344,0.00012855513,0.0051537324],"genre_scores_gemma":[0.93999076,0.00064120226,0.057375725,0.000072436924,0.000050454088,0.000051735165,0.000017272896,0.00001008292,0.0017904773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999191,0.0004795114,0.000020417488,0.00007975776,0.00017362744,0.000055763852],"domain_scores_gemma":[0.99859613,0.001061532,0.00012277189,0.00009856808,0.000088626584,0.00003240872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012422942,0.00043814437,0.00049600215,0.00032918595,0.0003716897,0.000549513,0.0006003072,0.0008795807,0.0005424434],"category_scores_gemma":[0.0029009709,0.00027069508,0.00015671435,0.0005938598,0.0009995003,0.0010374389,0.0007145808,0.0003739448,0.00018147865],"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.0003616481,0.000046273875,0.0010319802,0.00013962136,0.0000409448,0.0006079665,0.00028206967,0.7579885,0.019582123,0.14811258,0.0010770537,0.07072926],"study_design_scores_gemma":[0.00005651591,0.00015908036,0.00026556224,0.000014777176,0.000016584856,0.00030431128,0.000056021792,0.9273363,0.0043196594,0.06613809,0.0013165487,0.000016510747],"about_ca_topic_score_codex":0.0003444681,"about_ca_topic_score_gemma":0.0005554053,"teacher_disagreement_score":0.0012422942,"about_ca_system_score_codex":0.0004257013,"about_ca_system_score_gemma":0.00029015864,"threshold_uncertainty_score":0.0065699816},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85310686,0.00068908895,0.14216112,0.00020264578,0.000019972706,0.000027461345,0.00004061009,0.00007256944,0.0036797193],"genre_scores_gemma":[0.9978759,0.00008683033,0.0016829883,0.000009282487,0.000004044161,0.000006882926,0.000010525921,0.000002050476,0.0003215035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921894,0.00039914355,0.00001732042,0.00006815158,0.00013750493,0.000159044],"domain_scores_gemma":[0.9978027,0.0013480519,0.00027637684,0.00008371417,0.00042730971,0.00006191261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001283611,0.00055300974,0.0006673342,0.00058340526,0.00053219456,0.00064801646,0.00068096566,0.00091639365,0.0003892525],"category_scores_gemma":[0.0028805018,0.00025397423,0.0002970219,0.00077547046,0.0009640051,0.0008111534,0.0008000275,0.0002474102,0.00009478908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056119836,0.000021524967,0.0013722979,0.000022668863,0.000021041067,0.0002056017,0.00008887085,0.9876062,0.0018880608,0.005511167,0.000120665,0.0030858614],"study_design_scores_gemma":[0.0000052187784,0.00005743562,0.000374658,0.0000022903191,0.000009015873,0.000056222743,0.00007860797,0.9965641,0.00071612594,0.0019890121,0.00013963958,0.00000768686],"about_ca_topic_score_codex":0.0052501434,"about_ca_topic_score_gemma":0.0038988632,"teacher_disagreement_score":0.0052501434,"about_ca_system_score_codex":0.0008899532,"about_ca_system_score_gemma":0.00052104244,"threshold_uncertainty_score":0.010439217},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59745437,0.007569186,0.34929523,0.001061638,0.00014691731,0.00009577057,0.00048815072,0.0006672407,0.04322144],"genre_scores_gemma":[0.98474413,0.0011049595,0.011445339,0.000044972952,0.00003025279,0.000023821327,0.0000994291,0.000038039485,0.002468964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987662,0.0004204617,0.000033685774,0.00008045204,0.00047707433,0.00022220064],"domain_scores_gemma":[0.99585813,0.0025634929,0.00040176423,0.00027699178,0.0008415953,0.000058112033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017316393,0.0012283934,0.0009921938,0.00086534995,0.00060514844,0.0008590905,0.000703073,0.0010637987,0.0019526725],"category_scores_gemma":[0.00531219,0.00023969302,0.00041122606,0.0008695634,0.0009286224,0.0010368717,0.00063524727,0.0004980562,0.0005244986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037316693,0.000059660717,0.0020475218,0.0001802199,0.0000760739,0.0004437218,0.00019442257,0.9273787,0.017903605,0.039242823,0.0007872316,0.0113128405],"study_design_scores_gemma":[0.000009833251,0.00006505233,0.0006020895,0.00001563734,0.00001529389,0.00012356542,0.000029003391,0.99248815,0.0029483414,0.0034001225,0.0002839213,0.000019006528],"about_ca_topic_score_codex":0.0056662397,"about_ca_topic_score_gemma":0.0034594694,"teacher_disagreement_score":0.0056662397,"about_ca_system_score_codex":0.0017106923,"about_ca_system_score_gemma":0.0011726008,"threshold_uncertainty_score":0.012412012},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12625636,0.0021449768,0.8612043,0.0004904764,0.00003698698,0.000032898093,0.000085311956,0.00011496698,0.00963376],"genre_scores_gemma":[0.9633588,0.0010110794,0.034514118,0.000067958616,0.000073821015,0.000041770854,0.000044594533,0.000021882135,0.00086586806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998156,0.0006432626,0.00007667364,0.00017220914,0.0008044369,0.00014742307],"domain_scores_gemma":[0.9862851,0.011534127,0.0007898255,0.0006588499,0.0006064732,0.00012567609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002677697,0.00050121464,0.0006579,0.0006223002,0.00053706666,0.00123411,0.0005663705,0.0010533816,0.0011907666],"category_scores_gemma":[0.018708995,0.00035028695,0.00030949965,0.0006645417,0.0014547644,0.0025264085,0.0016263957,0.00088697637,0.00017155225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027742327,0.000059470905,0.0014743307,0.00031754453,0.000059827576,0.00037895332,0.00036600826,0.60019666,0.025109723,0.3154714,0.00044154227,0.05584707],"study_design_scores_gemma":[0.00001697641,0.00022467549,0.00069694914,0.00004859727,0.000022100425,0.0005897188,0.000059296515,0.8827425,0.011341032,0.103448436,0.0007707552,0.0000388309],"about_ca_topic_score_codex":0.0003269609,"about_ca_topic_score_gemma":0.00022284768,"teacher_disagreement_score":0.002677697,"about_ca_system_score_codex":0.00085101405,"about_ca_system_score_gemma":0.00033959872,"threshold_uncertainty_score":0.0141611695},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06562915,0.0038007728,0.9141303,0.0010024792,0.00008439869,0.000041648706,0.00016241362,0.0002738568,0.014874981],"genre_scores_gemma":[0.9529071,0.0027939638,0.040673755,0.00016328246,0.00030548702,0.0001084375,0.00014384033,0.000116239986,0.0027879896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932253,0.00031222973,0.000018243914,0.00005995725,0.00022299863,0.00006408704],"domain_scores_gemma":[0.99729925,0.002049992,0.0002409369,0.00017794655,0.0001865757,0.000045338627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015491926,0.0009971746,0.0006929725,0.0008838868,0.00027201168,0.0009599677,0.00073692173,0.0010420077,0.00135509],"category_scores_gemma":[0.010436671,0.00031279112,0.000371189,0.00071545364,0.0013979431,0.001804889,0.0007755026,0.00090441486,0.0003518216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061806866,0.000022360151,0.0004911159,0.00016662218,0.000028257009,0.00014317695,0.00013425894,0.658938,0.004737349,0.31774047,0.0012887537,0.01624792],"study_design_scores_gemma":[0.000003910741,0.000020977403,0.00025753517,0.000021169813,0.000004925352,0.000073535884,0.000011372339,0.9383292,0.0006058562,0.06003513,0.0006264031,0.000010044662],"about_ca_topic_score_codex":0.0007690284,"about_ca_topic_score_gemma":0.0003454817,"teacher_disagreement_score":0.0015491926,"about_ca_system_score_codex":0.0008737797,"about_ca_system_score_gemma":0.0005137138,"threshold_uncertainty_score":0.008193076},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18498437,0.0011434358,0.8088432,0.00028788237,0.000065275795,0.000019533796,0.000042594955,0.00021086342,0.004402851],"genre_scores_gemma":[0.9540174,0.00047469736,0.043917365,0.000050644187,0.00006492494,0.00002076652,0.00002850249,0.000011919217,0.0014137638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993937,0.00019389977,0.000018434457,0.000097320095,0.00018946789,0.00010722356],"domain_scores_gemma":[0.99866605,0.00089316274,0.00014388649,0.000120307224,0.00015655906,0.000020011219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078346714,0.00045646448,0.00056566077,0.00024429453,0.00033587776,0.0005666094,0.0003976016,0.000574647,0.00028831876],"category_scores_gemma":[0.0032868376,0.00023162988,0.00023885966,0.0005452717,0.0005352535,0.00081454165,0.0007614364,0.00036942566,0.00011822995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014392861,0.000026671893,0.0017210966,0.000058745158,0.00004350234,0.00028784198,0.00016193661,0.9103144,0.0112645915,0.008242397,0.00044011252,0.06729486],"study_design_scores_gemma":[0.0000093322415,0.00004770975,0.00045087124,0.000005924104,0.000016952485,0.00013280795,0.000037788046,0.9913892,0.00470734,0.0025393793,0.0006494973,0.000013202002],"about_ca_topic_score_codex":0.0023451464,"about_ca_topic_score_gemma":0.0021284423,"teacher_disagreement_score":0.0023451464,"about_ca_system_score_codex":0.00045183126,"about_ca_system_score_gemma":0.0006380003,"threshold_uncertainty_score":0.0046629906},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00862759,0.0033629304,0.9804254,0.00071781967,0.00011284,0.000073883035,0.00004633476,0.00012319085,0.0065101148],"genre_scores_gemma":[0.8139969,0.005699028,0.17273566,0.00037290793,0.00043500544,0.0004895751,0.00013508213,0.00014801668,0.005987709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867874,0.00057169003,0.00005646878,0.00020106751,0.00033734986,0.00015469636],"domain_scores_gemma":[0.99856204,0.0010108468,0.00010715089,0.000090886104,0.00017633272,0.000052758092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015248378,0.0010097917,0.0013041607,0.0006507942,0.00070815306,0.0014260502,0.0011689612,0.0010318413,0.0025999337],"category_scores_gemma":[0.0049330555,0.0003879213,0.0003326677,0.0014023714,0.0011641053,0.0018784094,0.0010841814,0.0009461733,0.0003513634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097080374,0.000048933653,0.00018887072,0.00021876546,0.000043283577,0.0001091735,0.00009529105,0.84640956,0.0019350692,0.10149322,0.0031081797,0.04625263],"study_design_scores_gemma":[0.000029461184,0.000028171906,0.00006401261,0.000015367601,0.000010657461,0.000028280872,0.00003245177,0.94715756,0.00039526363,0.050224576,0.002002136,0.000011960311],"about_ca_topic_score_codex":0.0033909045,"about_ca_topic_score_gemma":0.0029365553,"teacher_disagreement_score":0.0033909045,"about_ca_system_score_codex":0.0019086328,"about_ca_system_score_gemma":0.0016193143,"threshold_uncertainty_score":0.013848126},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015648142,0.0044625807,0.9437749,0.004840867,0.00034754662,0.00007904114,0.00015024026,0.00054520345,0.030151593],"genre_scores_gemma":[0.68592936,0.0075981,0.2961969,0.0026240798,0.0007917493,0.00032339647,0.00034211754,0.00027424743,0.005919992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98871416,0.0055334955,0.00047827524,0.00061687286,0.0041792584,0.00047791458],"domain_scores_gemma":[0.96277636,0.028470436,0.0009611565,0.004508961,0.0030118998,0.00027125794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0095858695,0.0009015648,0.0015952345,0.0010284063,0.0013839568,0.0030522456,0.001785088,0.00240306,0.002896544],"category_scores_gemma":[0.0495675,0.0006912434,0.000598292,0.0014357291,0.0039639133,0.0072355513,0.0038497837,0.0033026186,0.0019251406],"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.00038018098,0.00006664323,0.0014130921,0.0004683965,0.00006420873,0.00023896674,0.00038949394,0.14828238,0.0045929244,0.6910847,0.0064168796,0.14660206],"study_design_scores_gemma":[0.00007961501,0.00010066623,0.00015240093,0.00015218946,0.000019741745,0.00069376087,0.000107606276,0.5264436,0.0039109797,0.4605074,0.0077319406,0.000100030884],"about_ca_topic_score_codex":0.0019280262,"about_ca_topic_score_gemma":0.0015946332,"teacher_disagreement_score":0.0095858695,"about_ca_system_score_codex":0.0013239647,"about_ca_system_score_gemma":0.0023734674,"threshold_uncertainty_score":0.05069554},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077412575,0.0017749687,0.9141581,0.00015442334,0.0000683527,0.000035306097,0.00006433622,0.00011748155,0.0062144483],"genre_scores_gemma":[0.9071478,0.00093079597,0.09001717,0.000044272656,0.000035863555,0.000034517907,0.00004943453,0.000008445435,0.0017317024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998367,0.00005822447,0.0000047221524,0.000017744425,0.0000651551,0.000017338501],"domain_scores_gemma":[0.9996611,0.00017581042,0.000038953927,0.00003825948,0.00007742319,0.00000840879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025509833,0.00027528146,0.00023531143,0.0001477263,0.00013153591,0.0002970191,0.00037665278,0.00034819654,0.00080536306],"category_scores_gemma":[0.00079053914,0.0000731615,0.00016396362,0.0002479186,0.00018620215,0.00028189292,0.0001924918,0.00025587858,0.00018758462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017050872,0.000072840136,0.00094820204,0.00031930406,0.00006810127,0.00046630428,0.00014193321,0.6977859,0.0945768,0.101201974,0.0014669634,0.10278116],"study_design_scores_gemma":[0.0000069531698,0.00006226386,0.00012924695,0.000007815177,0.000008541207,0.00008434823,0.0000073421133,0.99116474,0.004465642,0.0028860795,0.0011715785,0.0000054744064],"about_ca_topic_score_codex":0.0008711411,"about_ca_topic_score_gemma":0.0012940839,"teacher_disagreement_score":0.0008711411,"about_ca_system_score_codex":0.00034112053,"about_ca_system_score_gemma":0.00039621093,"threshold_uncertainty_score":0.00269413},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042557903,0.000676855,0.9536638,0.00023826897,0.000034293702,0.00004208337,0.00005483945,0.00011182127,0.0026202127],"genre_scores_gemma":[0.8451979,0.000721664,0.15114085,0.000090418114,0.000070696944,0.00013830271,0.00006532054,0.000053578213,0.002521192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930537,0.00036068543,0.000020587519,0.0000943906,0.000121233694,0.00009762177],"domain_scores_gemma":[0.9991773,0.00056492095,0.000100848985,0.00005657278,0.00006675636,0.000033570275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010351761,0.00057554076,0.00079398026,0.0002933401,0.0004948463,0.0010014375,0.00078357547,0.0007793379,0.00071647135],"category_scores_gemma":[0.0021614342,0.0003708885,0.00025176175,0.00070108386,0.00062492903,0.0011365479,0.00063200586,0.00057473907,0.00025027647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006436661,0.00005371819,0.0002044377,0.00004002091,0.000016546548,0.00008931563,0.000065862994,0.953586,0.0027043526,0.013441394,0.0007111121,0.02902292],"study_design_scores_gemma":[0.000007697145,0.000015869884,0.00005422029,0.0000019765566,0.000004073893,0.000016372805,0.000015733292,0.99414366,0.0007468063,0.0046387515,0.0003508911,0.0000039932606],"about_ca_topic_score_codex":0.0029529512,"about_ca_topic_score_gemma":0.004135741,"teacher_disagreement_score":0.0029529512,"about_ca_system_score_codex":0.0009191989,"about_ca_system_score_gemma":0.0010302328,"threshold_uncertainty_score":0.0066692233},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007942937,0.00073301926,0.9880966,0.00010678522,0.000076816934,0.000012994495,0.000040927087,0.00021653279,0.002773547],"genre_scores_gemma":[0.7462412,0.0037124238,0.24297878,0.00025510797,0.00033742434,0.00022109612,0.00020774812,0.00027638595,0.00576978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855393,0.00032620825,0.000063081745,0.0001455958,0.00075332215,0.00015785507],"domain_scores_gemma":[0.99406415,0.004147497,0.00035091102,0.0006989989,0.0006766884,0.00006182864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021615268,0.0013047283,0.0011316922,0.0011456012,0.00042107262,0.001471268,0.0016159113,0.0014252763,0.0019213449],"category_scores_gemma":[0.016587218,0.0004950027,0.0007200337,0.0012934272,0.0013992917,0.0024504447,0.0011633338,0.0022626023,0.00096719974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004146744,0.000017182392,0.00038306828,0.0000890536,0.000021309324,0.00012546337,0.00009017159,0.8997644,0.0035487607,0.07481304,0.0010707146,0.020035362],"study_design_scores_gemma":[0.0000031590637,0.0000123763875,0.00011136115,0.00001796493,0.000006131257,0.000091642236,0.000009846899,0.9815029,0.0011612296,0.016372278,0.00069935597,0.000011724278],"about_ca_topic_score_codex":0.0018677304,"about_ca_topic_score_gemma":0.0011058457,"teacher_disagreement_score":0.0021615268,"about_ca_system_score_codex":0.0013288308,"about_ca_system_score_gemma":0.00070393184,"threshold_uncertainty_score":0.011431396},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6497155,0.007926235,0.27467933,0.0016137691,0.00033925602,0.00010113855,0.00070390775,0.00059811847,0.06432275],"genre_scores_gemma":[0.9913168,0.0010268325,0.005573278,0.000070047136,0.00007277022,0.00002138088,0.00015141598,0.000039742405,0.0017276712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978764,0.00090819766,0.000044714605,0.00018146551,0.0005363192,0.00045278485],"domain_scores_gemma":[0.9868221,0.009818505,0.00074548746,0.0006225078,0.0017769107,0.00021448753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034615938,0.0016026533,0.0010067909,0.0010991629,0.00077037833,0.0010945366,0.001224203,0.0012464017,0.0030241436],"category_scores_gemma":[0.015719755,0.00033073963,0.0004726622,0.0012862207,0.0015821559,0.0018818455,0.0014692786,0.00078942016,0.00042309854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074422226,0.000083069965,0.0029753365,0.00014753564,0.000105955376,0.00018949536,0.00017784575,0.93630236,0.0060927477,0.030172568,0.0015669357,0.021441868],"study_design_scores_gemma":[0.000026051313,0.00016099258,0.0012882453,0.000028674955,0.0000442915,0.00011605961,0.00006759692,0.9887735,0.0021388212,0.006898062,0.000423274,0.00003433815],"about_ca_topic_score_codex":0.007263551,"about_ca_topic_score_gemma":0.0049953233,"teacher_disagreement_score":0.007263551,"about_ca_system_score_codex":0.0018486399,"about_ca_system_score_gemma":0.0015429034,"threshold_uncertainty_score":0.018306911},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14478178,0.0027442824,0.8404079,0.00049245957,0.00008855581,0.0000511772,0.00007467659,0.00018294447,0.0111762155],"genre_scores_gemma":[0.92128825,0.0039049508,0.07219736,0.000076403325,0.00013448954,0.000061568455,0.000065775086,0.000042912532,0.002228177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924695,0.00047967318,0.000028779703,0.000046249024,0.00014188487,0.00005644802],"domain_scores_gemma":[0.9978411,0.0016452746,0.00017367688,0.00017141922,0.00014243988,0.000026055965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011939445,0.00077109114,0.0005303831,0.00051465875,0.00037915478,0.00074709544,0.00036137176,0.0005854275,0.0008447579],"category_scores_gemma":[0.004686516,0.0002868437,0.00020270942,0.00081315846,0.001105157,0.0015852571,0.00065652357,0.000509747,0.0003502312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003459727,0.000036860663,0.00075058936,0.00013674425,0.00002748206,0.0005419497,0.00016814873,0.8078291,0.009622247,0.107644804,0.0008352283,0.07206091],"study_design_scores_gemma":[0.000033575958,0.0002408088,0.00040933472,0.000054880733,0.000032272757,0.000577613,0.0000620139,0.8627402,0.011638003,0.120670654,0.0034998085,0.000040866715],"about_ca_topic_score_codex":0.00042147064,"about_ca_topic_score_gemma":0.00033748115,"teacher_disagreement_score":0.0011939445,"about_ca_system_score_codex":0.00036162813,"about_ca_system_score_gemma":0.00031299546,"threshold_uncertainty_score":0.006314218},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059735592,0.0016955602,0.9283868,0.00029452,0.000032381555,0.000027368515,0.00009544719,0.00022548642,0.00950691],"genre_scores_gemma":[0.869893,0.001749862,0.12323867,0.0001467399,0.0000520287,0.0001065256,0.00016224915,0.00011380782,0.004537096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929833,0.00022711504,0.000027330287,0.000059093974,0.00032949852,0.000058614474],"domain_scores_gemma":[0.9977023,0.0013278987,0.00020085636,0.00022643141,0.0005123889,0.00003008382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014380552,0.0006303461,0.0005454162,0.0007166502,0.00030973196,0.00075922726,0.0006409865,0.00076575956,0.0010422291],"category_scores_gemma":[0.0053839725,0.00022481343,0.00027936324,0.0006341723,0.0009368668,0.0012898459,0.0006090201,0.00063834066,0.00040331946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004101449,0.00001100879,0.0003945102,0.00007638599,0.000011858484,0.00008792083,0.00014952813,0.9100376,0.0034862235,0.0750266,0.0004732188,0.010204137],"study_design_scores_gemma":[0.000003786322,0.000012232541,0.00014877251,0.000014565691,0.000002800421,0.000059445105,0.000019709636,0.98176354,0.00075944385,0.016901439,0.00030531758,0.000008830697],"about_ca_topic_score_codex":0.0018910473,"about_ca_topic_score_gemma":0.0011986381,"teacher_disagreement_score":0.0018910473,"about_ca_system_score_codex":0.0010575232,"about_ca_system_score_gemma":0.0006540022,"threshold_uncertainty_score":0.007672906},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071416,0.00023390946,0.99137735,0.00009524066,0.000037098158,0.00006528831,0.000009298506,0.00008423849,0.00095591776],"genre_scores_gemma":[0.65703166,0.0007839022,0.33920845,0.0002433992,0.00013967686,0.0006130913,0.000058357284,0.000048294427,0.001873247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980116,0.0007491627,0.00014351888,0.0002900046,0.00069299084,0.000112711365],"domain_scores_gemma":[0.99597025,0.0022814805,0.0005611879,0.0004435769,0.0006688799,0.00007451323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00247628,0.0008679806,0.000711611,0.00089348137,0.00070818135,0.00080044963,0.0015439837,0.0010882606,0.0007224349],"category_scores_gemma":[0.010044139,0.00028720874,0.00036347745,0.0009104641,0.0015196675,0.0017494289,0.0015540859,0.0013397818,0.00023517483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028817024,0.00017466545,0.000855221,0.0005579183,0.0001741279,0.00046379646,0.00097478455,0.3846747,0.0983518,0.31846163,0.0030628103,0.1919604],"study_design_scores_gemma":[0.000045162364,0.00029522815,0.00017106027,0.00003622097,0.00005919944,0.00044148442,0.000061208666,0.9464684,0.011312757,0.036208186,0.0048470404,0.000054034233],"about_ca_topic_score_codex":0.00044267418,"about_ca_topic_score_gemma":0.0005334978,"teacher_disagreement_score":0.00247628,"about_ca_system_score_codex":0.00066333025,"about_ca_system_score_gemma":0.00084307475,"threshold_uncertainty_score":0.013095975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11411465,0.000985255,0.87643826,0.00065371237,0.000056084755,0.00006125366,0.00010419937,0.00008602653,0.0075005735],"genre_scores_gemma":[0.9386019,0.0016743216,0.052991483,0.00010008042,0.00007759259,0.00011598278,0.00009265332,0.000022214625,0.0063238335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958414,0.00015456897,0.00001152855,0.00006973829,0.00011301198,0.000066997236],"domain_scores_gemma":[0.9985524,0.0010323342,0.00016820841,0.000076183205,0.00012522549,0.00004563559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008002864,0.0005917329,0.0005405358,0.00031277857,0.0005158829,0.00087671063,0.00073067116,0.000958669,0.0016760008],"category_scores_gemma":[0.0019187827,0.0002774897,0.00044385306,0.0005070374,0.0010520121,0.0010348896,0.0006917155,0.0006923085,0.00028885584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016751296,0.000043437434,0.00030803177,0.00019918682,0.000045804314,0.0006062357,0.0002503655,0.8141019,0.009639738,0.1565031,0.0012157081,0.016918993],"study_design_scores_gemma":[0.000019910553,0.00006413122,0.000101022655,0.000006994849,0.00001492472,0.00015312135,0.000033105058,0.9693886,0.001280084,0.028124267,0.0008005269,0.000013367415],"about_ca_topic_score_codex":0.0023217106,"about_ca_topic_score_gemma":0.0018269384,"teacher_disagreement_score":0.0023217106,"about_ca_system_score_codex":0.0010184748,"about_ca_system_score_gemma":0.00074405805,"threshold_uncertainty_score":0.007389605},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06303817,0.0073631117,0.86147654,0.002251747,0.00021678362,0.00022806822,0.00085938274,0.00046467557,0.064101525],"genre_scores_gemma":[0.87268156,0.008653895,0.106048904,0.00061452854,0.0004124406,0.0010393928,0.0007186787,0.00028789384,0.009542585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99603796,0.0018862095,0.00013242883,0.0003387641,0.0009050335,0.00069962314],"domain_scores_gemma":[0.9738461,0.023462443,0.0006552964,0.0005099839,0.0012512534,0.00027485998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005292184,0.0028418393,0.002431595,0.0018036538,0.0013379253,0.0034913372,0.0022991805,0.0017353039,0.0046592257],"category_scores_gemma":[0.024168568,0.0009218433,0.000747724,0.0021433441,0.0031060658,0.0043614376,0.00315192,0.0030409433,0.001290072],"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.00052229775,0.00009827385,0.00034528555,0.0006276928,0.0000686259,0.00036197092,0.00048295592,0.39308664,0.0037526244,0.5735447,0.0053184666,0.021790568],"study_design_scores_gemma":[0.000082372775,0.00012273614,0.00017470194,0.00019433211,0.000026299715,0.00019213588,0.00014452449,0.64608985,0.0020234718,0.34803975,0.0028593016,0.000050503277],"about_ca_topic_score_codex":0.0019444099,"about_ca_topic_score_gemma":0.0012927252,"teacher_disagreement_score":0.005292184,"about_ca_system_score_codex":0.0031114907,"about_ca_system_score_gemma":0.0022186665,"threshold_uncertainty_score":0.027988017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06542389,0.0005402721,0.9293234,0.00019495517,0.00009264649,0.000053232245,0.00009068488,0.0002097138,0.00407123],"genre_scores_gemma":[0.83216125,0.00068187795,0.16259971,0.00016582802,0.000089908586,0.00017975553,0.00016065568,0.00005008387,0.0039109783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994893,0.00009126926,0.00003629066,0.00007170778,0.00024217517,0.000069072325],"domain_scores_gemma":[0.9984004,0.00048093987,0.00034195615,0.00030827385,0.0003620985,0.000106371015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060117064,0.00034302895,0.000375573,0.00047909716,0.0004961097,0.0006754256,0.00056074606,0.00043976912,0.0008340418],"category_scores_gemma":[0.0029548751,0.00016175759,0.0003325846,0.0006980285,0.0010185004,0.00083871314,0.0009600958,0.0009598104,0.0002524167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025207756,0.000038946906,0.0006339931,0.00012237091,0.000022259612,0.00016874177,0.00031863994,0.24112815,0.026980134,0.65516436,0.0015411037,0.073629126],"study_design_scores_gemma":[0.000059313512,0.00026658125,0.00016658603,0.000038719838,0.000019025367,0.00034662738,0.000051774194,0.7328155,0.013449531,0.24123244,0.011514344,0.0000395752],"about_ca_topic_score_codex":0.00082829385,"about_ca_topic_score_gemma":0.0009436175,"teacher_disagreement_score":0.0008340418,"about_ca_system_score_codex":0.00081763475,"about_ca_system_score_gemma":0.0012848935,"threshold_uncertainty_score":0.0059324503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01123186,0.00010759396,0.9877324,0.000047457037,0.000033410743,0.000038957653,0.000008218853,0.00012932814,0.0006707787],"genre_scores_gemma":[0.49631873,0.00012837855,0.5007701,0.00006344504,0.000049546008,0.00017012974,0.000043969736,0.000037115253,0.0024185202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996679,0.00009124318,0.000018230874,0.00005942898,0.000112322254,0.00005082377],"domain_scores_gemma":[0.9993144,0.00036741633,0.000049664774,0.00007690954,0.00015430196,0.00003734257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011549679,0.00046692035,0.0006307975,0.00049070275,0.0008769342,0.0007057492,0.0011466411,0.00079699035,0.0014957457],"category_scores_gemma":[0.0032599617,0.0002010751,0.00026967397,0.00044036756,0.0006947512,0.0010080405,0.00066788675,0.0005574543,0.00035196435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031216544,0.000131286,0.0007059412,0.000065191474,0.000050278828,0.00016335785,0.00027137925,0.65323305,0.0108373,0.03430701,0.0020875882,0.2978355],"study_design_scores_gemma":[0.000023707174,0.000028719323,0.00005233074,0.0000025570023,0.0000050074136,0.00003447739,0.000011553304,0.9936429,0.0012833143,0.004152694,0.0007566376,0.0000059247254],"about_ca_topic_score_codex":0.0029994422,"about_ca_topic_score_gemma":0.0032770995,"teacher_disagreement_score":0.0029994422,"about_ca_system_score_codex":0.00089457346,"about_ca_system_score_gemma":0.0010853388,"threshold_uncertainty_score":0.006490648},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30283523,0.005092781,0.6507213,0.0014750101,0.00012658534,0.000050049028,0.0003603982,0.0005878207,0.038750835],"genre_scores_gemma":[0.9937604,0.0009995996,0.00417554,0.000056547095,0.00006109023,0.00005284217,0.000058083166,0.000024464922,0.0008113542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985373,0.0005186692,0.00004118384,0.00013295905,0.00042850632,0.0003414145],"domain_scores_gemma":[0.98826104,0.009171681,0.00054836634,0.0007487192,0.0011345177,0.0001355725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017649316,0.000631186,0.0007287786,0.0008053431,0.00047442605,0.001276183,0.0007800906,0.0007179528,0.0016492923],"category_scores_gemma":[0.015638554,0.00037728602,0.00025686706,0.0009867267,0.0024669783,0.0020124433,0.0014536247,0.0008153384,0.00033187924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013487457,0.000019185352,0.0005801376,0.00012187923,0.00003413635,0.00020738288,0.0002175741,0.85327345,0.004343625,0.12726654,0.0011713073,0.012629946],"study_design_scores_gemma":[0.000013908525,0.00002320648,0.00024755445,0.000040960756,0.000013690583,0.000076906974,0.00005143307,0.95388436,0.0018450132,0.043095455,0.0006854392,0.00002203392],"about_ca_topic_score_codex":0.0039383746,"about_ca_topic_score_gemma":0.0016385246,"teacher_disagreement_score":0.0039383746,"about_ca_system_score_codex":0.0015279694,"about_ca_system_score_gemma":0.0012002342,"threshold_uncertainty_score":0.0110862255},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021373956,0.00063070323,0.9701971,0.00048738735,0.000054746062,0.000054098036,0.00020950678,0.00036628015,0.006626287],"genre_scores_gemma":[0.6853712,0.0013063059,0.3048301,0.0003102228,0.00019215769,0.00030909112,0.00080528035,0.00030719832,0.0065683844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968771,0.0010344908,0.0001430419,0.00090217806,0.0007169242,0.0003262212],"domain_scores_gemma":[0.9911997,0.0063071926,0.00072248036,0.0011296349,0.00045997417,0.00018103035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028113546,0.0018351253,0.0017257205,0.00096940045,0.00054532965,0.0023447024,0.0020138533,0.0019355677,0.004870076],"category_scores_gemma":[0.01766042,0.0009219865,0.0020301503,0.0010338707,0.0023274291,0.0042177825,0.002907722,0.003300555,0.00068845385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010107906,0.000032056345,0.00045207315,0.00016681514,0.000047920767,0.00006144528,0.0000796743,0.8994971,0.0008798261,0.082457826,0.0009085837,0.015315688],"study_design_scores_gemma":[0.000014202793,0.000029611527,0.000055452554,0.00001626336,0.0000100195375,0.000025984291,0.000014545691,0.8978336,0.00041994732,0.100502536,0.0010706803,0.00000726077],"about_ca_topic_score_codex":0.0023629419,"about_ca_topic_score_gemma":0.0016243506,"teacher_disagreement_score":0.004870076,"about_ca_system_score_codex":0.0026320422,"about_ca_system_score_gemma":0.0009722113,"threshold_uncertainty_score":0.019096851},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32674673,0.007746212,0.6162876,0.0014529072,0.00018862658,0.000068408015,0.00022664046,0.00030344253,0.046979528],"genre_scores_gemma":[0.9868219,0.0017088411,0.009800559,0.000077895354,0.000120505356,0.000030496694,0.00002964949,0.000018614222,0.0013915441],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992787,0.00028890578,0.00001698667,0.00006418209,0.00022716582,0.00012402418],"domain_scores_gemma":[0.9969886,0.0024305154,0.00017351643,0.0001275187,0.00019516361,0.000084689025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013193847,0.0007873545,0.00048800156,0.0007302347,0.00041230948,0.0012644418,0.00064468046,0.00054113584,0.0014029237],"category_scores_gemma":[0.0052212006,0.000345939,0.00029151453,0.00080390315,0.001173499,0.0018055462,0.00091560284,0.0007328179,0.00020784106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021216292,0.000058789767,0.00083380553,0.00021311411,0.00005982884,0.00037425882,0.00018216537,0.55558425,0.01600872,0.38495848,0.0018671408,0.039647274],"study_design_scores_gemma":[0.000012157428,0.000088719826,0.0003948906,0.000023346945,0.000037213398,0.00023071877,0.00004850789,0.8255832,0.003234672,0.16905877,0.0012677225,0.000020063773],"about_ca_topic_score_codex":0.00066878233,"about_ca_topic_score_gemma":0.00075589673,"teacher_disagreement_score":0.0014029237,"about_ca_system_score_codex":0.0013437759,"about_ca_system_score_gemma":0.00045007933,"threshold_uncertainty_score":0.00974977},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16358663,0.0009873236,0.7796621,0.0007709869,0.0005669492,0.0017049655,0.00064763566,0.020897739,0.031175707],"genre_scores_gemma":[0.6549248,0.000500493,0.31164816,0.00079256133,0.00026498182,0.00093461655,0.0007724155,0.00017766486,0.029984327],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951124,0.00006361827,0.000025327958,0.000105617335,0.0002382174,0.000055913915],"domain_scores_gemma":[0.999605,0.00006711259,0.000039080554,0.0000775847,0.00015113776,0.00006011948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040614948,0.00069121836,0.0005589507,0.0007419481,0.0009474461,0.00070056587,0.0014991338,0.0007699449,0.0061880504],"category_scores_gemma":[0.00052517146,0.00024629696,0.00028748543,0.00062130817,0.00051926577,0.00068401324,0.0006075887,0.0008074313,0.0023384443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001150607,0.0006465358,0.0034277074,0.0007311448,0.00014677944,0.0012251625,0.00053490826,0.009304652,0.5474469,0.017299546,0.019192213,0.39889377],"study_design_scores_gemma":[0.00089355325,0.0062662605,0.00480084,0.00018021966,0.0004984469,0.0057698027,0.00019180388,0.19638096,0.5679254,0.0050328854,0.21174008,0.00031980412],"about_ca_topic_score_codex":0.0017998822,"about_ca_topic_score_gemma":0.0015530518,"teacher_disagreement_score":0.0061880504,"about_ca_system_score_codex":0.00065774424,"about_ca_system_score_gemma":0.0007183908,"threshold_uncertainty_score":0.02070111},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10953832,0.0013760261,0.88260704,0.00068135187,0.00006882605,0.00005220159,0.00007704051,0.00021552031,0.005383629],"genre_scores_gemma":[0.9474171,0.00058770407,0.050380487,0.00010639211,0.00007188196,0.000047696936,0.00003186763,0.000020167266,0.0013367531],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989772,0.000494624,0.000028560256,0.000100098914,0.00029520088,0.00010428293],"domain_scores_gemma":[0.9971,0.0021586625,0.00022804781,0.00028454507,0.00016326824,0.0000654055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014932262,0.00066299405,0.0007983232,0.00040522058,0.00052945653,0.0011558105,0.00073491875,0.0013338901,0.0009891439],"category_scores_gemma":[0.0058748773,0.00036261548,0.00034664565,0.00042911724,0.0015323149,0.0015788781,0.0013036074,0.0008697544,0.00025862016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001836765,0.000039973183,0.000555732,0.00016632829,0.000027497153,0.0004219038,0.00013427659,0.91928136,0.0076214867,0.053025223,0.0004967209,0.018045852],"study_design_scores_gemma":[0.000014387505,0.000045344907,0.00013654117,0.000008830187,0.000007148973,0.00008581661,0.000017152095,0.9814989,0.0013558562,0.016591731,0.00022611044,0.000012282484],"about_ca_topic_score_codex":0.0010317502,"about_ca_topic_score_gemma":0.0009004119,"teacher_disagreement_score":0.0014932262,"about_ca_system_score_codex":0.00067012117,"about_ca_system_score_gemma":0.00063004764,"threshold_uncertainty_score":0.007897079},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018214656,0.0029960563,0.9728957,0.0010279206,0.00015353484,0.00004100164,0.00002581538,0.00011497626,0.0045303553],"genre_scores_gemma":[0.8727101,0.0036861666,0.118305534,0.00039232438,0.00047904297,0.00011275969,0.00003618488,0.000048694863,0.004229166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989359,0.00045592838,0.00004251412,0.00011591725,0.00036284424,0.00008697721],"domain_scores_gemma":[0.99856144,0.00075104914,0.00016669635,0.0002133281,0.00024090572,0.00006663191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016259111,0.00071341416,0.0006451452,0.00050272926,0.00054823357,0.0014605041,0.0015104753,0.0010799788,0.0008698036],"category_scores_gemma":[0.0028796142,0.00027013873,0.00030211845,0.00076241954,0.0009996293,0.0018593195,0.0014793968,0.0013388724,0.00017817359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015030045,0.00014012108,0.0005441624,0.0004999133,0.00012288241,0.0003251915,0.0005658421,0.52416384,0.02583361,0.19662832,0.004528885,0.24649695],"study_design_scores_gemma":[0.000009663999,0.00006972673,0.00011570027,0.000027216702,0.000018655863,0.00008064958,0.00009864266,0.94085926,0.0020749597,0.05351992,0.003107285,0.000018280622],"about_ca_topic_score_codex":0.0007653404,"about_ca_topic_score_gemma":0.0011306707,"teacher_disagreement_score":0.0016259111,"about_ca_system_score_codex":0.000577144,"about_ca_system_score_gemma":0.00067916553,"threshold_uncertainty_score":0.008598745},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058624838,0.00072884717,0.93122935,0.0004173557,0.000033229848,0.000042486547,0.00011543952,0.00018659065,0.008621826],"genre_scores_gemma":[0.907544,0.0008355823,0.08819369,0.00011922364,0.00008105928,0.00008324247,0.00010746949,0.000044336663,0.0029913597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887997,0.0004914146,0.00004037479,0.00019273753,0.0002501997,0.00014531231],"domain_scores_gemma":[0.9976648,0.0015751721,0.0003079354,0.00014046213,0.0002516687,0.000060023107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010959709,0.0010425206,0.0010160548,0.00027475602,0.00031807568,0.0009951688,0.0005136773,0.00084578,0.0018958278],"category_scores_gemma":[0.0038750083,0.00044535656,0.00032862092,0.00062721374,0.0010724969,0.0016081647,0.00077527063,0.0007196849,0.00054136675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024849948,0.0000581848,0.00026850423,0.00017512307,0.000039289615,0.00034112483,0.00011768167,0.8937106,0.020756586,0.061840136,0.001450824,0.020993467],"study_design_scores_gemma":[0.000040770243,0.00013079963,0.00015701914,0.000011481452,0.000017235634,0.0001574492,0.0000372468,0.9784752,0.0048394674,0.015592684,0.0005194372,0.00002112727],"about_ca_topic_score_codex":0.00088328234,"about_ca_topic_score_gemma":0.0009206487,"teacher_disagreement_score":0.0018958278,"about_ca_system_score_codex":0.0007505378,"about_ca_system_score_gemma":0.0009381995,"threshold_uncertainty_score":0.006342113},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044779226,0.00032995798,0.95100576,0.000060689425,0.000033985973,0.00001614915,0.0000076017313,0.00013617109,0.003630431],"genre_scores_gemma":[0.9687816,0.00015152607,0.029581854,0.000040307936,0.000040063584,0.000027915754,0.000009586574,0.000015055944,0.0013520919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996921,0.000068271955,0.0000120508075,0.00006365601,0.00012532012,0.00003856674],"domain_scores_gemma":[0.9995315,0.00022611348,0.0000635176,0.00004846711,0.00010889221,0.000021569327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035809493,0.00040188403,0.00027456225,0.00020789736,0.00027264832,0.00048981066,0.00074126926,0.0002956438,0.00074440916],"category_scores_gemma":[0.0010971015,0.00013206716,0.00017887133,0.00025377382,0.000555147,0.00045391463,0.000520898,0.0004021458,0.00018440984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002507451,0.00011706962,0.0012246786,0.00017559587,0.0000661145,0.00042829063,0.00050202856,0.61024296,0.08586795,0.069327034,0.0013141119,0.23048338],"study_design_scores_gemma":[0.000021560021,0.0001667386,0.00017169284,0.0000065756485,0.000017751574,0.000100136465,0.000030879004,0.98087823,0.007259322,0.009729506,0.0016072766,0.000010389457],"about_ca_topic_score_codex":0.00087008096,"about_ca_topic_score_gemma":0.000769598,"teacher_disagreement_score":0.00087008096,"about_ca_system_score_codex":0.0003192307,"about_ca_system_score_gemma":0.0003015274,"threshold_uncertainty_score":0.002490282},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05256108,0.004563834,0.87938505,0.0019069193,0.00016196312,0.00016041944,0.0006992608,0.00040157733,0.06015988],"genre_scores_gemma":[0.9298578,0.0056066606,0.05485658,0.0005125398,0.00030406128,0.00090596307,0.0005110758,0.00021327057,0.007232059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99672145,0.0013381802,0.000100825484,0.00034985636,0.00072844286,0.000761214],"domain_scores_gemma":[0.9815996,0.014701663,0.00089102203,0.00076325936,0.0016766095,0.00036778487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004781615,0.0023081813,0.0019065728,0.0023046602,0.0013195014,0.0031729601,0.0028120084,0.0016965508,0.007364553],"category_scores_gemma":[0.02808908,0.00084094267,0.0010460514,0.0025282465,0.003366864,0.004751947,0.0037663493,0.0025488809,0.0016722789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019129697,0.000057363406,0.00033240498,0.00038783994,0.00005941329,0.00030059167,0.00040063664,0.49903738,0.0023734244,0.47796988,0.0041143475,0.014775387],"study_design_scores_gemma":[0.000023835193,0.00005052652,0.0001780485,0.00014092818,0.000025383515,0.00020208835,0.00010924214,0.76217514,0.00091373856,0.23403044,0.0021082524,0.0000422891],"about_ca_topic_score_codex":0.0028828064,"about_ca_topic_score_gemma":0.0014094663,"teacher_disagreement_score":0.007364553,"about_ca_system_score_codex":0.003918131,"about_ca_system_score_gemma":0.00200052,"threshold_uncertainty_score":0.028428137},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033326668,0.0000366133,0.9961427,0.00006928312,0.0000038163066,0.000012325559,0.000014205666,0.00009241816,0.0002959054],"genre_scores_gemma":[0.46487162,0.00036806014,0.53308195,0.00009598575,0.000027732065,0.00022183124,0.00017432735,0.00007133566,0.0010872381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988416,0.0005247138,0.000043219425,0.00013726526,0.0003838906,0.000069391506],"domain_scores_gemma":[0.99600273,0.002583008,0.0004863352,0.00046889283,0.00039741702,0.00006167816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017923402,0.00064744515,0.00059512054,0.0008546497,0.00040152736,0.0009622923,0.0012539255,0.0007494132,0.00054565544],"category_scores_gemma":[0.011391635,0.00042337392,0.00039621015,0.0010870285,0.0015535798,0.0029278412,0.0016585055,0.0013815061,0.00019022622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000798168,0.000019500942,0.00090286875,0.00006642424,0.000018694462,0.000079273486,0.00012330982,0.8816197,0.0056314627,0.057344027,0.00053766544,0.053577255],"study_design_scores_gemma":[0.0000036180593,0.000007945256,0.00005678184,0.0000038556564,0.0000019145257,0.000021746544,0.000009233321,0.98692906,0.0011136152,0.011582434,0.0002641063,0.0000056790523],"about_ca_topic_score_codex":0.003401182,"about_ca_topic_score_gemma":0.0026343174,"teacher_disagreement_score":0.003401182,"about_ca_system_score_codex":0.0010113616,"about_ca_system_score_gemma":0.0011193654,"threshold_uncertainty_score":0.009478927},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037953844,0.015327861,0.9075268,0.0025187326,0.0008314783,0.000085377746,0.00007428621,0.00043974165,0.0694002],"genre_scores_gemma":[0.37798563,0.038099803,0.52150726,0.0017896541,0.0018606317,0.0006227001,0.00017828801,0.00026709712,0.057688832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99908304,0.0003891828,0.00004644151,0.00017673406,0.00024086222,0.000063789215],"domain_scores_gemma":[0.9991768,0.00037728494,0.00011361569,0.00018703679,0.00011037739,0.00003479849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009656427,0.0010144047,0.00044706455,0.00076797855,0.0007395662,0.0015138166,0.0012977164,0.0017176658,0.005815106],"category_scores_gemma":[0.0025604933,0.00038193437,0.00044653643,0.0009122816,0.0024635717,0.0035668788,0.0016249315,0.0019790235,0.0027756684],"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.000011931053,0.0000068743475,0.000048555157,0.00010807088,0.000007251652,0.00012203553,0.00017929886,0.0033307485,0.0021878202,0.96389496,0.0032049112,0.026897548],"study_design_scores_gemma":[0.000032836262,0.00018863987,0.00022276695,0.00019491333,0.000046448964,0.0022357432,0.00027169604,0.031975143,0.00508971,0.52575994,0.43392426,0.000057766003],"about_ca_topic_score_codex":0.0005856077,"about_ca_topic_score_gemma":0.0007713182,"teacher_disagreement_score":0.005815106,"about_ca_system_score_codex":0.0010189018,"about_ca_system_score_gemma":0.0004492636,"threshold_uncertainty_score":0.019453526},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06584609,0.00081533834,0.9231909,0.00032933365,0.00003651142,0.00006119856,0.00008566576,0.00012103329,0.009514002],"genre_scores_gemma":[0.9213076,0.0004954996,0.07489436,0.00005900597,0.00004119882,0.00010481431,0.000052079144,0.000040858213,0.0030046117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995147,0.0002214635,0.00001632229,0.000055456978,0.00010247671,0.000089617526],"domain_scores_gemma":[0.9985545,0.0011588488,0.00009679946,0.000051718867,0.0000974994,0.00004068285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086689787,0.00070700236,0.000648678,0.00044063208,0.00045928312,0.0011108007,0.0006894269,0.0006899862,0.002394684],"category_scores_gemma":[0.0027936937,0.0002773273,0.0002886191,0.00062975346,0.00060814084,0.0011732812,0.000692445,0.00050556887,0.0002972715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016689699,0.00006388844,0.0002894558,0.00010663596,0.000027486774,0.00017846534,0.00009618416,0.9239556,0.0032919978,0.035584148,0.0012940345,0.03494521],"study_design_scores_gemma":[0.000011311954,0.000030017618,0.00008031515,0.0000055474507,0.000006461815,0.000049706756,0.00002298589,0.9880084,0.00059528544,0.010890746,0.00029381114,0.0000054505545],"about_ca_topic_score_codex":0.0021873345,"about_ca_topic_score_gemma":0.002440268,"teacher_disagreement_score":0.002394684,"about_ca_system_score_codex":0.0010925012,"about_ca_system_score_gemma":0.0009379458,"threshold_uncertainty_score":0.0080109835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009061917,0.00025920046,0.9852189,0.00013864214,0.00008117252,0.000035288518,0.000021165304,0.00027445727,0.004909208],"genre_scores_gemma":[0.52048093,0.0004936541,0.4712656,0.00017578529,0.00013192871,0.00023220472,0.00010766342,0.000040719122,0.007071573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995727,0.00013317577,0.000021250527,0.000032917073,0.00017898878,0.000060974806],"domain_scores_gemma":[0.99956447,0.00016515334,0.000028963525,0.000097435266,0.00012772021,0.000016183414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000344398,0.0004634106,0.00025511076,0.0003147835,0.00028356633,0.0004750154,0.0006229936,0.00054971466,0.0027921742],"category_scores_gemma":[0.0009557547,0.00014793858,0.0002977895,0.0003437359,0.00041690582,0.00056722027,0.00043521405,0.00066125835,0.0007923741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023133158,0.00013230054,0.0006703502,0.00021673195,0.00006585751,0.00038400336,0.00023703142,0.13679676,0.15261725,0.3477,0.006081996,0.35486633],"study_design_scores_gemma":[0.00007281444,0.0003238468,0.00032569122,0.000063625674,0.00006194775,0.0007086185,0.000048967144,0.8326385,0.10305414,0.035097502,0.02755072,0.000053647724],"about_ca_topic_score_codex":0.0010103587,"about_ca_topic_score_gemma":0.0015669074,"teacher_disagreement_score":0.0027921742,"about_ca_system_score_codex":0.00037365544,"about_ca_system_score_gemma":0.0006861113,"threshold_uncertainty_score":0.009340763},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09598226,0.0004968439,0.89844215,0.00021486582,0.000025299027,0.000045867273,0.000016913615,0.00007582101,0.00469997],"genre_scores_gemma":[0.9720535,0.00025289578,0.025770776,0.00004693152,0.000020068332,0.00007003681,0.000008316185,0.000015917898,0.0017615635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996935,0.00014621137,0.000006721664,0.00003498714,0.00007691715,0.000041820047],"domain_scores_gemma":[0.9988943,0.00082283746,0.00012809527,0.00004840952,0.00008298088,0.000023327302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006429977,0.00043338747,0.00042335433,0.00020041838,0.0003086854,0.00043785875,0.00052821677,0.0005550539,0.0009175539],"category_scores_gemma":[0.003558361,0.00024939465,0.00017855625,0.00032378203,0.0008278898,0.00078105234,0.0005716014,0.00034012282,0.00014001259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023705623,0.000016008822,0.00019490502,0.000018126382,0.000009252692,0.00006508905,0.000048167214,0.9758306,0.0016594662,0.014487746,0.00014840339,0.0074985097],"study_design_scores_gemma":[0.0000069114944,0.000019745485,0.000050130537,0.0000023360747,0.0000028171155,0.000014909507,0.000012459497,0.9938797,0.00032580967,0.005486803,0.00019526454,0.0000030636334],"about_ca_topic_score_codex":0.001086777,"about_ca_topic_score_gemma":0.0008212548,"teacher_disagreement_score":0.001086777,"about_ca_system_score_codex":0.00056778116,"about_ca_system_score_gemma":0.00032069304,"threshold_uncertainty_score":0.0041195154},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074039,0.00084488443,0.9885311,0.00017541248,0.000016768867,0.000014378026,0.0000140048205,0.00005389444,0.0029455873],"genre_scores_gemma":[0.7449663,0.0030366685,0.24638985,0.00024316538,0.00021770096,0.00019128747,0.00006222805,0.00010199741,0.004790739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984634,0.0009841827,0.000039094113,0.00013924084,0.00029033681,0.00008381205],"domain_scores_gemma":[0.9983261,0.0012629636,0.00015090943,0.00006873175,0.00016078065,0.000030470428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021217272,0.0011180376,0.00088101585,0.00043513544,0.00022429207,0.00092354923,0.00053731864,0.0011719748,0.001186349],"category_scores_gemma":[0.0038648536,0.00047386088,0.0004941765,0.0008373237,0.0011232215,0.0016393666,0.0007802623,0.00076438667,0.0005008237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010390614,0.000036588935,0.0002152193,0.00014643461,0.00005053112,0.00008289992,0.00008221793,0.8927551,0.005691923,0.06726765,0.0007194054,0.032848105],"study_design_scores_gemma":[0.000030409201,0.000103930695,0.0001330127,0.000021417552,0.000016321952,0.000050547067,0.000025151807,0.9533855,0.002436242,0.042661775,0.0011219529,0.000013740896],"about_ca_topic_score_codex":0.00041970029,"about_ca_topic_score_gemma":0.00037697805,"teacher_disagreement_score":0.0021217272,"about_ca_system_score_codex":0.00061919005,"about_ca_system_score_gemma":0.00045424642,"threshold_uncertainty_score":0.011220932},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048127804,0.00014767413,0.9503396,0.000048886122,0.000017914872,0.000031679625,0.000011780825,0.00010181108,0.0011728659],"genre_scores_gemma":[0.82429945,0.00011958854,0.17424102,0.00003496286,0.000017006485,0.00007540773,0.00002422957,0.000013957955,0.0011743413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976736,0.00007485525,0.000012947224,0.00003940132,0.000068358604,0.000037028272],"domain_scores_gemma":[0.9994966,0.0002641736,0.00007181164,0.000053939664,0.00009277133,0.000020596131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004607124,0.00038208495,0.00043225902,0.00026253253,0.0003779583,0.0004021414,0.00068258384,0.00031489125,0.00039891445],"category_scores_gemma":[0.0016394422,0.0001594027,0.0001914333,0.0003490705,0.0003747783,0.0004606151,0.000451084,0.00034983092,0.00011879261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002103185,0.000077884295,0.0016411903,0.000071845076,0.000050282717,0.00019226574,0.00028547557,0.7337727,0.026494289,0.023701286,0.0009943316,0.21250819],"study_design_scores_gemma":[0.0000106911175,0.000065726425,0.00015022003,0.0000030684273,0.000007740444,0.000093192466,0.000013825535,0.9939541,0.0033170353,0.0018576625,0.0005190856,0.000007670546],"about_ca_topic_score_codex":0.0016267279,"about_ca_topic_score_gemma":0.0019198093,"teacher_disagreement_score":0.0016267279,"about_ca_system_score_codex":0.000386455,"about_ca_system_score_gemma":0.00080515473,"threshold_uncertainty_score":0.0032345057},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03524366,0.0011228652,0.95725507,0.0002572087,0.000035684276,0.000029944242,0.000038953403,0.00007072748,0.0059458935],"genre_scores_gemma":[0.909438,0.0016651084,0.086312965,0.00006359711,0.00009904482,0.00010474735,0.000059446706,0.000054973236,0.0022019774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921536,0.00039379622,0.000021055495,0.000051820607,0.00022631073,0.00009161866],"domain_scores_gemma":[0.9973569,0.0021122904,0.00016329739,0.00017776532,0.00015334562,0.000036409685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018535032,0.0006741436,0.00052307796,0.00051200576,0.00040153976,0.00091408484,0.0006393276,0.0004878457,0.0009769817],"category_scores_gemma":[0.0064454605,0.00030517083,0.0003679935,0.0010926723,0.0011802219,0.0020574352,0.0007353724,0.00075995695,0.00013830775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038104576,0.000023779288,0.00025603815,0.000058622172,0.000017010148,0.00004247939,0.000042371197,0.7933381,0.0014350795,0.19114834,0.0006273504,0.012972686],"study_design_scores_gemma":[0.0000044950157,0.00002267714,0.0000613907,0.0000058982673,0.000004591937,0.00001742483,0.0000100282205,0.95373696,0.0005430343,0.045116585,0.00047307913,0.0000038339745],"about_ca_topic_score_codex":0.0013871982,"about_ca_topic_score_gemma":0.0015108688,"teacher_disagreement_score":0.0018535032,"about_ca_system_score_codex":0.001220118,"about_ca_system_score_gemma":0.000891774,"threshold_uncertainty_score":0.009802341},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046923343,0.0007907677,0.9452053,0.0002963002,0.000037745245,0.000052776526,0.000031938558,0.00015845444,0.0065034437],"genre_scores_gemma":[0.8824585,0.0005802476,0.11314425,0.00012043764,0.00006157779,0.00011901599,0.000048689846,0.000029104382,0.0034381421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991798,0.0004351121,0.00002424198,0.000086678694,0.00020059805,0.00007357778],"domain_scores_gemma":[0.9964684,0.002910047,0.00015821206,0.00021674266,0.00019951585,0.00004699501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001155439,0.0005982655,0.00053198636,0.0003696703,0.00039755064,0.00062796654,0.00070543983,0.0006086918,0.0013172972],"category_scores_gemma":[0.005653536,0.00021844254,0.00024464697,0.00046821916,0.0011633238,0.0010275871,0.0009453339,0.0006493463,0.00030367554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022799356,0.00005239093,0.0005228105,0.0001609081,0.0000400911,0.00036025804,0.00028887458,0.702031,0.013531993,0.20803936,0.0016915621,0.07305272],"study_design_scores_gemma":[0.000024458452,0.00007168113,0.00009844253,0.000013902607,0.000010678822,0.0001251107,0.000018549019,0.9534975,0.002674036,0.042260814,0.0011932234,0.000011691113],"about_ca_topic_score_codex":0.0006527832,"about_ca_topic_score_gemma":0.00087466644,"teacher_disagreement_score":0.0013172972,"about_ca_system_score_codex":0.0006948195,"about_ca_system_score_gemma":0.0005157369,"threshold_uncertainty_score":0.0061106086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012341131,0.0004715427,0.9847451,0.00022633314,0.000049813338,0.000064755804,0.000032234188,0.00023474268,0.0018343978],"genre_scores_gemma":[0.7527487,0.0012598865,0.24076554,0.00024194455,0.000120413526,0.0005817872,0.00018141665,0.00007011318,0.0040301257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991872,0.0003296432,0.00002912518,0.000072949144,0.0003053112,0.000075801305],"domain_scores_gemma":[0.99802566,0.0013798862,0.00018432508,0.00013886188,0.00024862454,0.000022727196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015239496,0.0005014184,0.00045404813,0.0008160107,0.00031973934,0.0004431426,0.0011636995,0.00076164724,0.00084078556],"category_scores_gemma":[0.0050990395,0.00023236734,0.00039803318,0.0010188983,0.0009766296,0.0010003671,0.00064370525,0.0007494264,0.00023274473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017359229,0.000058271366,0.00034786662,0.00014112952,0.00003552294,0.0002255211,0.00017392203,0.7971288,0.010433904,0.13930202,0.0018301257,0.050149333],"study_design_scores_gemma":[0.000023969367,0.000043264394,0.00004688939,0.000009784772,0.000009665493,0.00003373569,0.0000075463036,0.9801908,0.0010261475,0.017849823,0.000746166,0.000012340939],"about_ca_topic_score_codex":0.0037116532,"about_ca_topic_score_gemma":0.0032595356,"teacher_disagreement_score":0.0037116532,"about_ca_system_score_codex":0.0010407378,"about_ca_system_score_gemma":0.0010187936,"threshold_uncertainty_score":0.008059561},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8849272,0.002909962,0.106090836,0.00034148016,0.00006215294,0.000045333978,0.000053298118,0.0003164105,0.00525334],"genre_scores_gemma":[0.9919161,0.00025158963,0.0074782153,0.00002987386,0.000018878256,0.000011670244,0.000022596641,0.000010735478,0.00026030972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961448,0.0019336216,0.000118385826,0.00020531968,0.0011561272,0.0004417716],"domain_scores_gemma":[0.98786616,0.008579062,0.0009757185,0.0009963914,0.0013638188,0.00021892991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003248462,0.0007743735,0.0007624712,0.00091248367,0.00030358668,0.0009801643,0.00064957223,0.0013962687,0.00054923573],"category_scores_gemma":[0.014619323,0.00022173158,0.0002715414,0.0008383584,0.0008570713,0.0013746009,0.0011262456,0.0003623131,0.0001669771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047421935,0.00023367952,0.009441822,0.00032257536,0.00037163022,0.00034340442,0.00023657433,0.79148465,0.03140679,0.016618986,0.0005335873,0.1442641],"study_design_scores_gemma":[0.00012780364,0.0016607415,0.0020652493,0.000022376084,0.00012146045,0.00031309726,0.000068773224,0.95824087,0.032960646,0.003800714,0.0005629973,0.000055279128],"about_ca_topic_score_codex":0.00125434,"about_ca_topic_score_gemma":0.001034341,"teacher_disagreement_score":0.003248462,"about_ca_system_score_codex":0.0007208717,"about_ca_system_score_gemma":0.00073889067,"threshold_uncertainty_score":0.017179728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82480633,0.0020656006,0.16339561,0.00041350894,0.00007268123,0.000055456887,0.00017428007,0.00035902098,0.008657524],"genre_scores_gemma":[0.9971835,0.0002642309,0.0019886051,0.000013514135,0.000014365938,0.000016384352,0.000027812788,0.000008194126,0.00048338226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908614,0.00034765436,0.000029454224,0.000093594084,0.00029436883,0.00014873708],"domain_scores_gemma":[0.99614775,0.0025358459,0.0003110719,0.00023122127,0.0006679778,0.000106133244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017798904,0.00086098147,0.00055097044,0.0005060363,0.00051326037,0.0009099104,0.00045739464,0.00070498994,0.00055372366],"category_scores_gemma":[0.006377131,0.00025233225,0.00016978238,0.0005093876,0.0007495733,0.00087513914,0.00077188807,0.00032555,0.00021182094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029596506,0.000060071867,0.003316411,0.00007459705,0.000069900096,0.00013443523,0.00015062149,0.9655299,0.009961757,0.0052306047,0.00040912256,0.01476652],"study_design_scores_gemma":[0.000024282124,0.00036535852,0.0017861377,0.000009913429,0.0000302956,0.00011138694,0.000069894006,0.9873591,0.004742404,0.005124674,0.0003568494,0.00001963518],"about_ca_topic_score_codex":0.0025492883,"about_ca_topic_score_gemma":0.0012708615,"teacher_disagreement_score":0.0025492883,"about_ca_system_score_codex":0.0008613943,"about_ca_system_score_gemma":0.00061253447,"threshold_uncertainty_score":0.0094130635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060286444,0.000655847,0.9287778,0.00019456775,0.000046344005,0.00006644255,0.000072304996,0.0001683776,0.009731762],"genre_scores_gemma":[0.9261954,0.0005843259,0.07111173,0.000052691343,0.000029310593,0.0000932237,0.000032085773,0.00000840806,0.0018928556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927133,0.0003015302,0.00003750123,0.00009983823,0.00020444256,0.00008536352],"domain_scores_gemma":[0.99810433,0.0012732414,0.00022346934,0.00015715566,0.00020496707,0.000036800124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011587738,0.0009962711,0.0006749913,0.0003864038,0.00050741574,0.00085543556,0.0010342746,0.00073532516,0.0014192754],"category_scores_gemma":[0.0025714599,0.0003802695,0.0005446027,0.0005321509,0.0006475174,0.0011550027,0.00097470434,0.0006219382,0.00038295577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035381984,0.00007744754,0.0011383385,0.00043270472,0.00011253043,0.0009209248,0.00032550443,0.76186806,0.033406273,0.1305106,0.0010490837,0.06980464],"study_design_scores_gemma":[0.00001704266,0.00015812855,0.00017764211,0.000022682138,0.000043186963,0.00033272893,0.00003780174,0.97828263,0.00542517,0.014694375,0.0007820287,0.000026565642],"about_ca_topic_score_codex":0.0007178451,"about_ca_topic_score_gemma":0.0012583068,"teacher_disagreement_score":0.0014192754,"about_ca_system_score_codex":0.0006306346,"about_ca_system_score_gemma":0.000537654,"threshold_uncertainty_score":0.0061282516},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033087138,0.00069355796,0.9617679,0.00015671115,0.000047848607,0.00008494842,0.000018564697,0.00014969762,0.0039936006],"genre_scores_gemma":[0.66965646,0.0010651184,0.32602692,0.00017655414,0.00008406793,0.000114601244,0.000048452664,0.000019345842,0.0028085706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995332,0.00016601669,0.000024169653,0.00006785072,0.00016739474,0.00004139527],"domain_scores_gemma":[0.9995485,0.00019409892,0.00007089211,0.00010613675,0.000060917067,0.000019429977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083586056,0.00072702393,0.00062617305,0.000495272,0.0003752552,0.0006053621,0.000777781,0.00089711754,0.00082361326],"category_scores_gemma":[0.0011047744,0.00022694467,0.0005338101,0.00060277537,0.00091115665,0.0013793363,0.00097191636,0.0004909484,0.00043223434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039994132,0.00014862805,0.00221026,0.00060264755,0.00018140323,0.0010734966,0.0007816917,0.104383215,0.1875111,0.35298038,0.0011409937,0.34858632],"study_design_scores_gemma":[0.0001627587,0.0013221115,0.0012924774,0.00014017384,0.00014149288,0.0040866937,0.00013458292,0.74373966,0.09571251,0.12798847,0.025119344,0.00015968147],"about_ca_topic_score_codex":0.00019854527,"about_ca_topic_score_gemma":0.0003399025,"teacher_disagreement_score":0.00089711754,"about_ca_system_score_codex":0.0003071659,"about_ca_system_score_gemma":0.00030126766,"threshold_uncertainty_score":0.004420519},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3512553,0.0024718964,0.63247734,0.00043544086,0.00010300678,0.0001455914,0.00012620511,0.00026117446,0.012724143],"genre_scores_gemma":[0.9718198,0.0006176125,0.024341993,0.000034496585,0.000038959384,0.000065587505,0.000037465983,0.000005600019,0.0030385212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946266,0.00016670556,0.000020591347,0.000086906875,0.00017248817,0.00009057023],"domain_scores_gemma":[0.99830997,0.000885486,0.00036698507,0.00013562491,0.00024438597,0.000057446923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006264061,0.0008920102,0.00072902243,0.00041953832,0.00058928883,0.0009350486,0.00093222334,0.0010712311,0.0010858689],"category_scores_gemma":[0.0019324025,0.0002885269,0.00035823355,0.0007788609,0.0008109099,0.001123436,0.00084653066,0.0006021331,0.0003165199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043123227,0.000121751276,0.0031943312,0.00032107215,0.0002107726,0.001972445,0.0009697269,0.7269021,0.03488108,0.1358955,0.0017115276,0.09338842],"study_design_scores_gemma":[0.000035670673,0.0002553939,0.00054185075,0.000015811158,0.00006403629,0.0004761152,0.0001363238,0.9741286,0.0039057587,0.018495096,0.0019111208,0.000034271583],"about_ca_topic_score_codex":0.0013364097,"about_ca_topic_score_gemma":0.0017102812,"teacher_disagreement_score":0.0013364097,"about_ca_system_score_codex":0.0006451747,"about_ca_system_score_gemma":0.00035760846,"threshold_uncertainty_score":0.0046811104},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019723497,0.00026592426,0.9765322,0.0001258951,0.000042054548,0.0000672435,0.000025918642,0.000070928516,0.0031462729],"genre_scores_gemma":[0.6845044,0.0006396347,0.31162906,0.00012124169,0.00007288574,0.0003770598,0.00007203432,0.000033656368,0.0025500506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980478,0.0007913408,0.00009179288,0.00023034909,0.0006489835,0.00018958155],"domain_scores_gemma":[0.99683183,0.0014428283,0.0006127632,0.00039738463,0.0005378845,0.00017736244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017957943,0.0009262481,0.0006349776,0.0005998599,0.00047344505,0.0009781758,0.0011727108,0.0013389814,0.0006661701],"category_scores_gemma":[0.005641513,0.0004099151,0.000457893,0.0006520287,0.0014585305,0.0008697834,0.0015723131,0.0007136018,0.00025218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019997175,0.00009732684,0.0006447686,0.00018301669,0.00008406532,0.0002671374,0.00035856498,0.5429075,0.02551789,0.35525092,0.0010659846,0.07342292],"study_design_scores_gemma":[0.00007242717,0.00022621849,0.000091284324,0.000029419274,0.000022322982,0.00021033522,0.000042774434,0.9158352,0.007726894,0.072381064,0.0033328063,0.000029366855],"about_ca_topic_score_codex":0.0005759526,"about_ca_topic_score_gemma":0.00047182967,"teacher_disagreement_score":0.0017957943,"about_ca_system_score_codex":0.0007277015,"about_ca_system_score_gemma":0.0012713718,"threshold_uncertainty_score":0.009497225},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54063785,0.0016287443,0.44786918,0.00031459602,0.00006324772,0.00009955369,0.00015494046,0.00025648082,0.008975449],"genre_scores_gemma":[0.991907,0.00037346187,0.0066115013,0.00003978769,0.0000206774,0.00003032742,0.000021903494,0.000009207623,0.0009861443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802786,0.0010319357,0.000035671128,0.0002025128,0.00032367473,0.00037827052],"domain_scores_gemma":[0.99478793,0.0038087664,0.00053647964,0.00027848606,0.00045413393,0.00013417198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002614664,0.0016237831,0.0014170483,0.0006766581,0.00064705993,0.0013828375,0.001140765,0.0015594972,0.0007216374],"category_scores_gemma":[0.004842504,0.00052951684,0.00076864735,0.0011613745,0.0017902147,0.0019536596,0.0016685161,0.0006106938,0.00027920454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013151517,0.000027344857,0.0008065526,0.000049578593,0.000067346235,0.0003545266,0.0001427336,0.98209375,0.0032000705,0.010149345,0.00012527229,0.0028518476],"study_design_scores_gemma":[0.000036730256,0.00017965984,0.00025260632,0.000009011487,0.00003315234,0.00013981332,0.000061658146,0.9921496,0.0012682345,0.00567348,0.00017344183,0.000022677055],"about_ca_topic_score_codex":0.002844182,"about_ca_topic_score_gemma":0.0017625575,"teacher_disagreement_score":0.002844182,"about_ca_system_score_codex":0.001163658,"about_ca_system_score_gemma":0.0007193201,"threshold_uncertainty_score":0.013827801},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44838873,0.00017618242,0.54659367,0.00015317656,0.00003380223,0.00006495851,0.000012584954,0.00024618945,0.004330741],"genre_scores_gemma":[0.9458505,0.000032564218,0.05314468,0.00003200428,0.000007633931,0.000034749726,0.0000131292945,0.000016814545,0.0008678244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997285,0.00011792997,0.000009356057,0.000030855223,0.00006773118,0.00004553896],"domain_scores_gemma":[0.999238,0.00043310595,0.000091378846,0.00006929298,0.000114021896,0.000054267755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085768127,0.0002520168,0.00019176397,0.00032970545,0.00025544883,0.0003364705,0.0006208272,0.0002559171,0.0005195316],"category_scores_gemma":[0.0022732248,0.00012509488,0.0001274489,0.0002864409,0.00028769794,0.00049553125,0.00041334447,0.00032327557,0.000051838048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065667054,0.00038812464,0.009870567,0.00008205737,0.000079890844,0.00015970135,0.00025182418,0.57900715,0.04233265,0.034131866,0.0008872606,0.33215225],"study_design_scores_gemma":[0.000023993822,0.00018629087,0.00079362566,0.0000035507353,0.000010320137,0.000036538786,0.000021533599,0.9916819,0.0046288026,0.0019267659,0.00068090303,0.000005880691],"about_ca_topic_score_codex":0.001423616,"about_ca_topic_score_gemma":0.0026832547,"teacher_disagreement_score":0.001423616,"about_ca_system_score_codex":0.00038981912,"about_ca_system_score_gemma":0.000476806,"threshold_uncertainty_score":0.0045359135},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11871855,0.0019599106,0.8585746,0.00028401363,0.00013687114,0.00009902679,0.0001624847,0.00057600037,0.019488573],"genre_scores_gemma":[0.9501999,0.0013445342,0.04444256,0.000077527155,0.000047101006,0.00006927785,0.0001314407,0.000013728066,0.0036738862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997869,0.00004788226,0.000005538589,0.00002906489,0.000093054936,0.000037537582],"domain_scores_gemma":[0.99964714,0.00014746388,0.00004436892,0.000044922974,0.00009075297,0.000025371826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015122294,0.00027171825,0.00022507572,0.00032475524,0.00038507592,0.0005878387,0.00061487674,0.00041434655,0.0008561992],"category_scores_gemma":[0.0006623167,0.00013530528,0.00017904521,0.00047444348,0.00040661593,0.00060767034,0.00040221403,0.0003391351,0.00021620757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012792279,0.000063156775,0.0015174352,0.00021057439,0.00006537122,0.00056938326,0.00024450573,0.7409736,0.03158925,0.11023841,0.0033847408,0.111015625],"study_design_scores_gemma":[0.000016729336,0.000110581816,0.00069555565,0.000010238236,0.000027236298,0.00023243281,0.00005517447,0.95499116,0.0042734654,0.028832285,0.0107349185,0.000020191945],"about_ca_topic_score_codex":0.0023410076,"about_ca_topic_score_gemma":0.002492793,"teacher_disagreement_score":0.0023410076,"about_ca_system_score_codex":0.0004039578,"about_ca_system_score_gemma":0.00037554008,"threshold_uncertainty_score":0.0046548247},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0093942685,0.09911355,0.86591375,0.0040585636,0.00047346245,0.00008380421,0.00004015429,0.00009418542,0.02082831],"genre_scores_gemma":[0.6001398,0.12189056,0.2621488,0.0012004237,0.0037360948,0.0003290168,0.00007782934,0.00006181824,0.010415645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991998,0.00028002437,0.000052830164,0.00012832375,0.0002698915,0.0000690015],"domain_scores_gemma":[0.99873954,0.0007946512,0.00012315424,0.00009336551,0.00021070665,0.000038571685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001764925,0.0006810468,0.0010321185,0.00092662533,0.0006005787,0.0023618336,0.0021630195,0.0017678889,0.0012135804],"category_scores_gemma":[0.0021214818,0.0005058817,0.00053059397,0.0017673041,0.0014010292,0.0029818949,0.0011259634,0.0014167224,0.0003891488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007467704,0.00025983888,0.0011465165,0.0012005367,0.00010353178,0.00038172412,0.00034375885,0.18767864,0.0035191993,0.4918419,0.004645549,0.30880415],"study_design_scores_gemma":[0.000023301462,0.00017059527,0.0007255363,0.00030146638,0.00005405892,0.00043986217,0.00025753322,0.6457801,0.0023845034,0.31693804,0.032858714,0.00006624865],"about_ca_topic_score_codex":0.001210725,"about_ca_topic_score_gemma":0.0010245807,"teacher_disagreement_score":0.0023618336,"about_ca_system_score_codex":0.0013928832,"about_ca_system_score_gemma":0.0006479248,"threshold_uncertainty_score":0.010106146},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25992724,0.0012789944,0.71449167,0.00074196834,0.00010590754,0.00007945153,0.00036877688,0.001171738,0.021834238],"genre_scores_gemma":[0.9732512,0.00048539796,0.024221977,0.000069837406,0.00006233245,0.000082244864,0.00013793245,0.00007103507,0.0016180031],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816555,0.0005363958,0.000070361966,0.00023879795,0.0005302688,0.0004587293],"domain_scores_gemma":[0.99258536,0.005208192,0.00060500466,0.000875841,0.00058993674,0.00013558274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019475057,0.00068771513,0.0007158571,0.0009746839,0.0008112991,0.0019256878,0.0009229009,0.00054335623,0.0020126519],"category_scores_gemma":[0.008140775,0.0002606741,0.00033023235,0.0016056395,0.0013164418,0.0035785134,0.0011852493,0.0007595967,0.00034827524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001142098,0.00012131904,0.002398266,0.00035683808,0.0000885011,0.00036742844,0.00038587573,0.61852366,0.041408688,0.25688496,0.0028438044,0.075478464],"study_design_scores_gemma":[0.00002933818,0.0002052847,0.00060941366,0.000043598648,0.000059298618,0.00030742705,0.00011684706,0.8107079,0.035635673,0.15016748,0.0020744966,0.000043196447],"about_ca_topic_score_codex":0.000825418,"about_ca_topic_score_gemma":0.00066671666,"teacher_disagreement_score":0.0020126519,"about_ca_system_score_codex":0.0019170858,"about_ca_system_score_gemma":0.0013015759,"threshold_uncertainty_score":0.013909459},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050128583,0.0007865584,0.9315824,0.00040980862,0.000043589072,0.000075816584,0.000111366884,0.00016243348,0.01669946],"genre_scores_gemma":[0.92539006,0.000730693,0.06648256,0.0001389669,0.000049159553,0.00017595734,0.00009960294,0.00007127152,0.006861614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921966,0.0003053037,0.000024370254,0.00012534179,0.00018622162,0.00013905094],"domain_scores_gemma":[0.9991683,0.0005575841,0.00008382043,0.00004446349,0.00011213815,0.000033723547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011011579,0.0007095027,0.0007938448,0.000534606,0.0003846687,0.0014329985,0.0007462565,0.0008448295,0.0026717961],"category_scores_gemma":[0.0038179476,0.0005628311,0.00028698074,0.00072931213,0.0010375229,0.0013496296,0.0010054293,0.00061209325,0.0006437779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016456445,0.000078813006,0.00026195802,0.00012259005,0.000034090106,0.00017095993,0.00019653418,0.83835965,0.0045942822,0.09893454,0.0026648284,0.054417245],"study_design_scores_gemma":[0.000025597281,0.000026527354,0.00010095353,0.000008691902,0.000005631047,0.000033502998,0.000034528213,0.9479676,0.00061691884,0.050387602,0.0007837871,0.000008672477],"about_ca_topic_score_codex":0.0013902772,"about_ca_topic_score_gemma":0.0015350488,"teacher_disagreement_score":0.0026717961,"about_ca_system_score_codex":0.0012745108,"about_ca_system_score_gemma":0.00092652737,"threshold_uncertainty_score":0.009247243},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005187169,0.00031033,0.9927698,0.00012131287,0.000029934148,0.00003304629,0.000021740681,0.00015903769,0.0013675817],"genre_scores_gemma":[0.4322785,0.0010218922,0.5610926,0.00026448545,0.0000982611,0.00022646385,0.00009309546,0.000027325757,0.004897356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999398,0.00019628469,0.000039754887,0.00011185883,0.00020873941,0.000045369914],"domain_scores_gemma":[0.99927276,0.00029631166,0.000095983414,0.00012893816,0.00017723149,0.000028697812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090401905,0.0010576844,0.0006888207,0.00047929338,0.00044666333,0.00057713763,0.0010547583,0.00092120055,0.0016567279],"category_scores_gemma":[0.0015474182,0.00037895024,0.00044593497,0.0006796751,0.0005161276,0.0014924507,0.0008182427,0.0006380651,0.0011903174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038633592,0.00017522705,0.0017411307,0.00049071707,0.00017177133,0.00042359257,0.0004704589,0.34946018,0.094249986,0.099830285,0.0035676993,0.44903266],"study_design_scores_gemma":[0.00010498312,0.0005199646,0.0003678465,0.000047925354,0.00009826501,0.00073914137,0.00009864979,0.92452234,0.03052054,0.029704865,0.013196818,0.00007872896],"about_ca_topic_score_codex":0.0007066356,"about_ca_topic_score_gemma":0.0013552506,"teacher_disagreement_score":0.0016567279,"about_ca_system_score_codex":0.0004077449,"about_ca_system_score_gemma":0.00046030525,"threshold_uncertainty_score":0.005542338},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033449512,0.0013469358,0.9625902,0.00024933633,0.000024088422,0.000029132072,0.00001906771,0.00008776074,0.0022039213],"genre_scores_gemma":[0.9477713,0.00149197,0.04975652,0.00007981474,0.0000534941,0.00006825868,0.00001813994,0.000018089304,0.00074249116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980323,0.00092727656,0.00007213339,0.00023997,0.00053760293,0.00019067724],"domain_scores_gemma":[0.9966641,0.0024507737,0.0003377222,0.00021510065,0.00028931213,0.000042881275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021510434,0.00079860364,0.0007188257,0.0005095124,0.0004538675,0.0011938477,0.00073397526,0.0008130206,0.00069270906],"category_scores_gemma":[0.007820124,0.00039717843,0.00054019585,0.0006680548,0.0019451763,0.0017061651,0.0010757815,0.0007278409,0.00018243444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012536219,0.000044951867,0.0013582978,0.00018431002,0.00007218317,0.00036314919,0.0004049219,0.7892784,0.0103017595,0.16523248,0.00070630474,0.031927876],"study_design_scores_gemma":[0.000012010968,0.00008132032,0.00018349235,0.000018628623,0.000019276315,0.0001151414,0.000053667754,0.9627448,0.0016635814,0.034434237,0.00065910746,0.000014819251],"about_ca_topic_score_codex":0.0010936246,"about_ca_topic_score_gemma":0.00077828363,"teacher_disagreement_score":0.0021510434,"about_ca_system_score_codex":0.0012333913,"about_ca_system_score_gemma":0.0012002633,"threshold_uncertainty_score":0.011375964},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034295542,0.0001849655,0.99473864,0.00008308173,0.000031390213,0.000038587725,0.000046023415,0.00012947507,0.0013182946],"genre_scores_gemma":[0.45623142,0.0009928176,0.53483033,0.00044363958,0.000268953,0.00061351754,0.0004935924,0.00019989205,0.0059258775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974146,0.0011204915,0.00011775344,0.00044856046,0.0006230866,0.0002755468],"domain_scores_gemma":[0.99649006,0.0018253917,0.00038336508,0.0003419603,0.00084649626,0.00011271396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034819199,0.002809751,0.0016365828,0.0008199981,0.0007769798,0.0018018648,0.0021304402,0.0018003946,0.0043579377],"category_scores_gemma":[0.007600922,0.0014149029,0.0010517221,0.0011405114,0.001236687,0.0022537229,0.0019730013,0.0016364737,0.002057065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012237625,0.00021239184,0.00138259,0.00071272306,0.00047454546,0.00021085961,0.00043275135,0.62851155,0.02694749,0.09432529,0.0032220196,0.24234398],"study_design_scores_gemma":[0.00008746063,0.00031126887,0.0003331956,0.0000673125,0.00014887277,0.00022496466,0.000039173756,0.9654108,0.007831263,0.02251506,0.002972703,0.000057991656],"about_ca_topic_score_codex":0.001150654,"about_ca_topic_score_gemma":0.002461008,"teacher_disagreement_score":0.0043579377,"about_ca_system_score_codex":0.0008225827,"about_ca_system_score_gemma":0.0022844675,"threshold_uncertainty_score":0.018414378},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05211705,0.011929259,0.9121651,0.002553976,0.0003775702,0.00007104571,0.000050628343,0.00015152615,0.020583753],"genre_scores_gemma":[0.88540244,0.009870803,0.09532253,0.00039401342,0.00053038535,0.0001752463,0.00007203262,0.0000459789,0.008186661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990428,0.0005149354,0.000025333671,0.000086572974,0.00021653762,0.00011380496],"domain_scores_gemma":[0.9968104,0.0024729955,0.0002990375,0.00015975107,0.0001698661,0.00008794721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016253586,0.00066614436,0.00059399765,0.00067199185,0.00086681155,0.0016154988,0.0010116287,0.0016781332,0.0012310622],"category_scores_gemma":[0.00502389,0.00034159518,0.0003832936,0.0011655815,0.0019204142,0.0024612083,0.0011852742,0.0009054935,0.00030840098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004521797,0.000033979508,0.00058081263,0.00017360503,0.000048563226,0.0002979076,0.00026238002,0.43471128,0.001771714,0.53402805,0.0021207693,0.025925694],"study_design_scores_gemma":[0.000024548,0.000073556155,0.00020081032,0.000034790963,0.00002961201,0.00018024465,0.0000897593,0.5850539,0.0006848134,0.4040124,0.009595225,0.000020295576],"about_ca_topic_score_codex":0.0009784255,"about_ca_topic_score_gemma":0.00080197817,"teacher_disagreement_score":0.0016781332,"about_ca_system_score_codex":0.00084404706,"about_ca_system_score_gemma":0.0006167499,"threshold_uncertainty_score":0.008595824},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053776823,0.00029846138,0.9349781,0.00045398693,0.00005724854,0.00005614366,0.00010134233,0.00023479466,0.010043098],"genre_scores_gemma":[0.87461936,0.00040697103,0.11604873,0.00026014567,0.00013594238,0.00018119713,0.00019692487,0.00007297869,0.008077731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993755,0.00016455792,0.000015420746,0.000086602624,0.00023193707,0.00012602458],"domain_scores_gemma":[0.9984244,0.00086615566,0.00013564965,0.00030897383,0.00019447655,0.0000702703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005582487,0.00038638705,0.0004864195,0.00080994965,0.0005114624,0.0008566349,0.0011050943,0.0007026664,0.00171882],"category_scores_gemma":[0.0035402353,0.00018597113,0.00028184615,0.0009828059,0.0010096759,0.0017739091,0.0015308704,0.0011346748,0.00031578686],"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.00028140965,0.00006764554,0.00059605023,0.000074177275,0.000026338776,0.00020700591,0.00023742922,0.3212412,0.008419548,0.51458,0.0037125763,0.15055662],"study_design_scores_gemma":[0.000019039418,0.00002761915,0.00013486293,0.000009989571,0.0000062544204,0.0000910166,0.000019280686,0.90019834,0.0020391028,0.09434397,0.0030991125,0.000011512463],"about_ca_topic_score_codex":0.0025996407,"about_ca_topic_score_gemma":0.0025447153,"teacher_disagreement_score":0.0025996407,"about_ca_system_score_codex":0.0012738688,"about_ca_system_score_gemma":0.0006529092,"threshold_uncertainty_score":0.009242594},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18377037,0.00062102464,0.8116349,0.00018626652,0.00001977708,0.000049444476,0.00005450409,0.00020629547,0.0034574342],"genre_scores_gemma":[0.9819518,0.00015698082,0.017213698,0.000014245453,0.000008867111,0.000025157155,0.000018125758,0.0000058763953,0.0006051613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943715,0.0002436904,0.000019965248,0.00008093116,0.00014124125,0.000077038436],"domain_scores_gemma":[0.99929833,0.00039900496,0.00013468497,0.000039700495,0.00010816887,0.000020005546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005607901,0.00062976487,0.00061462336,0.00026289246,0.0002439947,0.0005666715,0.0004870679,0.00046237983,0.0005609117],"category_scores_gemma":[0.0013703267,0.0002503619,0.00022329413,0.00050816423,0.0005315938,0.00064161205,0.0003760703,0.00024623377,0.00013276655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013888974,0.000026202873,0.00072709273,0.000063169675,0.000038502618,0.00020277627,0.00008611771,0.96520156,0.00970587,0.0064775995,0.0003443799,0.016987853],"study_design_scores_gemma":[0.000015597221,0.000078375226,0.0002161085,0.0000031830455,0.000013752966,0.0000447178,0.000015082898,0.99521244,0.0015417904,0.0027059563,0.00014683856,0.000006182393],"about_ca_topic_score_codex":0.0016769712,"about_ca_topic_score_gemma":0.0015607071,"teacher_disagreement_score":0.0016769712,"about_ca_system_score_codex":0.0006344845,"about_ca_system_score_gemma":0.00046185896,"threshold_uncertainty_score":0.0046035647},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067751914,0.00047040242,0.929075,0.0001987036,0.000021348555,0.000032635526,0.000020090467,0.0001389799,0.0022909162],"genre_scores_gemma":[0.8674602,0.00034592603,0.13094765,0.0001266432,0.00003772747,0.000045406963,0.0000151610875,0.000011553797,0.0010096579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989906,0.00042255747,0.00003930846,0.00017136137,0.00027792586,0.00009821471],"domain_scores_gemma":[0.9984372,0.00076644245,0.00024086084,0.00031954158,0.00020065457,0.000035178233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012472484,0.0005324858,0.00058133405,0.00046050604,0.00042301323,0.0005500679,0.00095482304,0.0011046623,0.00035635743],"category_scores_gemma":[0.0026227853,0.0002602517,0.00033115517,0.0005238731,0.0014253916,0.0011365071,0.00086186465,0.00048725528,0.0002728259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006344341,0.00012857342,0.0022966326,0.00035742237,0.0002113755,0.002307724,0.0012768502,0.5501806,0.10790643,0.21629505,0.0014247304,0.11698014],"study_design_scores_gemma":[0.000051046565,0.00023355322,0.00033222922,0.000015454978,0.000054158536,0.0010536456,0.000075149816,0.9548568,0.019868117,0.021416834,0.0019907535,0.00005232891],"about_ca_topic_score_codex":0.00059159956,"about_ca_topic_score_gemma":0.00062831375,"teacher_disagreement_score":0.0012472484,"about_ca_system_score_codex":0.00029893327,"about_ca_system_score_gemma":0.0003499532,"threshold_uncertainty_score":0.006596148},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04039821,0.0023916792,0.950506,0.00038365816,0.0001232901,0.00003814711,0.000014672083,0.00013476802,0.006009553],"genre_scores_gemma":[0.8675945,0.0027735112,0.12619063,0.0002012093,0.00025688324,0.000081513506,0.00004855437,0.00003801758,0.0028151234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921286,0.00027481953,0.000025936703,0.00005063488,0.0003463561,0.00008924602],"domain_scores_gemma":[0.9974619,0.0018703666,0.00014984803,0.00017932561,0.00030206144,0.000036532063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010684681,0.00062195334,0.0003671495,0.00042639053,0.00026435175,0.000597566,0.00054396276,0.0005617901,0.0005940376],"category_scores_gemma":[0.003969058,0.00019744088,0.0002843799,0.0005675637,0.0010339204,0.0015969693,0.0008939238,0.00063199503,0.00018480694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019765462,0.00010868708,0.0012799911,0.00021159691,0.000112820686,0.0002816816,0.0002627599,0.5698021,0.0411405,0.17950653,0.0010382048,0.20605741],"study_design_scores_gemma":[0.000025107496,0.00030238394,0.0003143513,0.000028864508,0.00005042607,0.00022110458,0.000035106314,0.9202476,0.009710805,0.065563865,0.003470971,0.000029433751],"about_ca_topic_score_codex":0.0009558244,"about_ca_topic_score_gemma":0.0013658323,"teacher_disagreement_score":0.0010684681,"about_ca_system_score_codex":0.00040774603,"about_ca_system_score_gemma":0.00052959885,"threshold_uncertainty_score":0.005650699},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010281568,0.0004422252,0.9867069,0.00010157269,0.00007734216,0.000055200628,0.00004491663,0.00019253687,0.002097823],"genre_scores_gemma":[0.7409255,0.0007685673,0.25364926,0.00009045056,0.00006239062,0.0002022916,0.00012968424,0.000031976942,0.0041399067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994599,0.0001645792,0.000029292822,0.000068646346,0.00021222158,0.00006529499],"domain_scores_gemma":[0.9993755,0.0001353739,0.00007531884,0.00014938539,0.00022517104,0.000039317238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064538687,0.0005698826,0.00053568505,0.00048049868,0.00048530477,0.00050338136,0.000965777,0.0005976443,0.0010986086],"category_scores_gemma":[0.0013374386,0.00017740786,0.00034072433,0.0006618305,0.00062208343,0.00084698695,0.0009984319,0.00073349074,0.00044806738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004192616,0.00014261558,0.00064072805,0.0003096716,0.00011091081,0.00065571326,0.00032579558,0.3763492,0.11202249,0.21662855,0.0053577377,0.28703734],"study_design_scores_gemma":[0.000030946187,0.00018384252,0.00020095792,0.000026327583,0.000045644385,0.0005053223,0.000018822997,0.95387095,0.0222751,0.015370005,0.0074144774,0.000057635072],"about_ca_topic_score_codex":0.0011607325,"about_ca_topic_score_gemma":0.0018979062,"teacher_disagreement_score":0.0011607325,"about_ca_system_score_codex":0.00048568676,"about_ca_system_score_gemma":0.00089619565,"threshold_uncertainty_score":0.0036752224},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048106916,0.001045657,0.9427146,0.00043083215,0.00008845313,0.00011453936,0.00014800375,0.0004009779,0.0069499672],"genre_scores_gemma":[0.57756543,0.0009975603,0.41848156,0.00013654612,0.000060385337,0.00015394986,0.00015362192,0.00004651546,0.0024045263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996978,0.00011050099,0.000015418895,0.000023549219,0.00012471301,0.00002814398],"domain_scores_gemma":[0.99928916,0.00028135817,0.000082793646,0.00018460563,0.00014142087,0.000020654104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041586848,0.000456792,0.00033856087,0.00041425708,0.00044211457,0.0005531652,0.000469184,0.00053789816,0.0010588049],"category_scores_gemma":[0.001802327,0.00013129445,0.00025002484,0.0005593147,0.0005957411,0.00061854156,0.0006065976,0.0006949337,0.0005431297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004978575,0.00013047276,0.0009776643,0.0007547908,0.000057063775,0.00049573404,0.0004228275,0.1750344,0.20458394,0.40938768,0.0036207354,0.20403683],"study_design_scores_gemma":[0.000035244546,0.00020159499,0.00023341711,0.000075010954,0.000040902793,0.00048786707,0.000032632703,0.8823899,0.07059844,0.033581115,0.012265831,0.000058044017],"about_ca_topic_score_codex":0.00063357153,"about_ca_topic_score_gemma":0.0009765774,"teacher_disagreement_score":0.0010588049,"about_ca_system_score_codex":0.00054248585,"about_ca_system_score_gemma":0.0006421706,"threshold_uncertainty_score":0.0039360523},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50436014,0.0030041845,0.47536147,0.00042264882,0.00005050435,0.00004930695,0.00017670856,0.00038857557,0.016186476],"genre_scores_gemma":[0.9910835,0.00073148916,0.007244472,0.000037378893,0.000019039599,0.000017653072,0.00004786162,0.000016920092,0.0008017431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987526,0.00041728505,0.000035663576,0.00010751961,0.00046934964,0.00021748783],"domain_scores_gemma":[0.9949851,0.0033463242,0.00048144735,0.00020932425,0.00090224907,0.000075551376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016010581,0.0012621442,0.0007299007,0.00084637856,0.00053642545,0.0010343229,0.00066057616,0.00097079936,0.0010226445],"category_scores_gemma":[0.006450174,0.0002937812,0.00046989587,0.0010687659,0.0011556213,0.0009166359,0.0010152522,0.00062315486,0.0002710352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013112921,0.000023523336,0.0021082105,0.000087860775,0.000056144727,0.00026110784,0.00015786957,0.9685855,0.0075744954,0.011546835,0.00023493398,0.009232255],"study_design_scores_gemma":[0.00000554631,0.000072724215,0.00074258156,0.000011734878,0.000025537685,0.00012745081,0.000041759577,0.99406224,0.0023842012,0.0023543588,0.0001556885,0.000016095973],"about_ca_topic_score_codex":0.005647192,"about_ca_topic_score_gemma":0.0031698125,"teacher_disagreement_score":0.005647192,"about_ca_system_score_codex":0.0017389364,"about_ca_system_score_gemma":0.00090356776,"threshold_uncertainty_score":0.012616932},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.955622,0.000580053,0.04100521,0.00019113174,0.00004891967,0.000061667815,0.000035887802,0.00012913703,0.0023259323],"genre_scores_gemma":[0.9983222,0.00018778346,0.0012460575,0.000031062304,0.000008813189,0.000008706842,0.000010898095,0.0000050484605,0.00017942002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918634,0.00027717295,0.00002423072,0.00006897228,0.0001574099,0.0002858151],"domain_scores_gemma":[0.9897317,0.008103425,0.0010213843,0.00034801938,0.00050677755,0.00028865982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013111045,0.00068379194,0.0005025395,0.00048060613,0.0006741812,0.0006350756,0.000522026,0.0005245846,0.0005447821],"category_scores_gemma":[0.00788288,0.00025923757,0.00039805594,0.00034081124,0.001137999,0.0016237135,0.0009765234,0.0005917653,0.00007758048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038126137,0.0001389275,0.0110065015,0.00011067291,0.000092282855,0.00057275227,0.00016943399,0.96135426,0.012455146,0.0022967933,0.00029012776,0.011131991],"study_design_scores_gemma":[0.00005280257,0.0014297322,0.005204297,0.000025511285,0.00017051301,0.0005147044,0.00028192476,0.97644174,0.013771531,0.0017410223,0.00032546872,0.00004073676],"about_ca_topic_score_codex":0.0029109407,"about_ca_topic_score_gemma":0.002522565,"teacher_disagreement_score":0.0029109407,"about_ca_system_score_codex":0.0007012255,"about_ca_system_score_gemma":0.0003617947,"threshold_uncertainty_score":0.006933868},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051119704,0.0025451079,0.9390961,0.00029406435,0.00004210741,0.000023740418,0.000035913345,0.0000886534,0.006754675],"genre_scores_gemma":[0.95789057,0.0012174489,0.039538123,0.00006520879,0.00006119201,0.00003143611,0.000021996606,0.000006716934,0.0011672337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997427,0.00009465164,0.000006395707,0.000023945038,0.00010018345,0.00003201396],"domain_scores_gemma":[0.99956304,0.00027026882,0.0000394597,0.000037958453,0.000078302146,0.000010966031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037564355,0.000249603,0.0002705702,0.00024715322,0.0003541771,0.00035642437,0.00029903476,0.00045129194,0.0006207627],"category_scores_gemma":[0.0015134859,0.0001249068,0.00020318117,0.000552564,0.0004314036,0.0003987088,0.00047893325,0.00035411076,0.00017126916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000867375,0.000023397659,0.000953189,0.0001675561,0.00004562453,0.0003203837,0.00021950647,0.6928745,0.029376283,0.18705754,0.0011760433,0.087699264],"study_design_scores_gemma":[0.0000089878495,0.00014354388,0.00037630508,0.000025440266,0.00002018536,0.00040243904,0.000055009696,0.9221851,0.0042412477,0.06869098,0.0038209655,0.00002985121],"about_ca_topic_score_codex":0.000739035,"about_ca_topic_score_gemma":0.0012149122,"teacher_disagreement_score":0.000739035,"about_ca_system_score_codex":0.000489057,"about_ca_system_score_gemma":0.0003597022,"threshold_uncertainty_score":0.0035483837},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049379375,0.0063486323,0.8013001,0.025659971,0.0070403125,0.00014713725,0.0005259824,0.000948585,0.10864992],"genre_scores_gemma":[0.72838265,0.0117333215,0.14895327,0.011251636,0.011429205,0.00063848775,0.00055593654,0.001155528,0.085900016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790335,0.0007734099,0.00008325048,0.0005695033,0.0004708385,0.00019967476],"domain_scores_gemma":[0.9885759,0.008498705,0.0004979423,0.0014374332,0.00036897877,0.0006210688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002563069,0.0011663835,0.0017974644,0.0017606432,0.0026074192,0.0027143802,0.0022311118,0.0022777542,0.0068192543],"category_scores_gemma":[0.012443564,0.00073927105,0.0020239854,0.0021040186,0.004815988,0.0106146755,0.006197461,0.0069794958,0.0011523908],"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.000028322449,0.000014270162,0.000101617705,0.00005354198,0.000011824334,0.000070967595,0.00010737719,0.0011048602,0.00054962497,0.9869664,0.0045899944,0.00640131],"study_design_scores_gemma":[0.000015014506,0.000029549037,0.00014244851,0.000015606689,0.00002143664,0.00017237436,0.00003075757,0.0062039006,0.00067695335,0.9822918,0.010376136,0.000024012385],"about_ca_topic_score_codex":0.00084945845,"about_ca_topic_score_gemma":0.00057161006,"teacher_disagreement_score":0.0068192543,"about_ca_system_score_codex":0.0015224201,"about_ca_system_score_gemma":0.00074889493,"threshold_uncertainty_score":0.022812665},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16604379,0.0051028,0.8133725,0.00073632435,0.00015120985,0.000071507784,0.00014222325,0.00012801855,0.014251596],"genre_scores_gemma":[0.96494883,0.0034572918,0.028327374,0.00010267113,0.00015603637,0.00005663613,0.00008036838,0.00008662977,0.0027841546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990895,0.00033368624,0.000046446017,0.00008400596,0.00033267264,0.00011367642],"domain_scores_gemma":[0.9898637,0.00759148,0.0008388498,0.00049705134,0.0010009469,0.00020785513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021796643,0.0011817951,0.0007172064,0.00074791536,0.00037053545,0.0011128278,0.0007562649,0.0006479291,0.0013542547],"category_scores_gemma":[0.013566674,0.00040122622,0.00045936593,0.00054149964,0.0014953833,0.0028253521,0.0012039783,0.001411111,0.0003308188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040558074,0.00006733142,0.0020198252,0.0003171883,0.00007556282,0.0009721422,0.0006115772,0.68864155,0.024771795,0.25523308,0.0013654704,0.025518876],"study_design_scores_gemma":[0.000016833223,0.000115128154,0.0007111229,0.000041020387,0.000028046345,0.0004497951,0.000116510455,0.9496984,0.0060146716,0.04163345,0.0011274241,0.000047640602],"about_ca_topic_score_codex":0.0008661588,"about_ca_topic_score_gemma":0.00040993895,"teacher_disagreement_score":0.0021796643,"about_ca_system_score_codex":0.0014360236,"about_ca_system_score_gemma":0.0004610678,"threshold_uncertainty_score":0.0115273},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012382543,0.00087608845,0.98036975,0.00013040831,0.000059520175,0.000026967698,0.000019384797,0.00014494009,0.0059904396],"genre_scores_gemma":[0.6536859,0.0027784007,0.329786,0.00029512425,0.00022177283,0.00013519854,0.00009373802,0.000035927544,0.012967925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998018,0.00003939982,0.00000924522,0.000023165958,0.00010107567,0.000025241316],"domain_scores_gemma":[0.99963784,0.00018685772,0.000032509983,0.00006184079,0.00007365167,0.000007220511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026600726,0.00038072566,0.00023499732,0.0002858129,0.00020174819,0.00032312455,0.0003828377,0.00043499525,0.0022071074],"category_scores_gemma":[0.0012223794,0.00012709247,0.00019561687,0.0004102984,0.00034644196,0.0006294193,0.00058063905,0.00053271046,0.0007044899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015454966,0.000091015856,0.0005096996,0.00028086585,0.000050030343,0.00025560253,0.00033303487,0.24548207,0.077253476,0.21415646,0.0030602708,0.4583729],"study_design_scores_gemma":[0.00005080606,0.00019529891,0.00044647235,0.000060509665,0.000039035353,0.0005938207,0.000052211617,0.8814448,0.032120235,0.06827449,0.016682744,0.000039635135],"about_ca_topic_score_codex":0.0006165742,"about_ca_topic_score_gemma":0.0009358587,"teacher_disagreement_score":0.0022071074,"about_ca_system_score_codex":0.0002615317,"about_ca_system_score_gemma":0.0003925504,"threshold_uncertainty_score":0.0073834658},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008253497,0.00054171955,0.9896375,0.00012381372,0.000017367805,0.000013488678,0.00001648908,0.000072109855,0.0013239736],"genre_scores_gemma":[0.75948,0.001607943,0.23542981,0.00010750149,0.00009595983,0.00015959717,0.00006372478,0.000060075672,0.0029953653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904364,0.0005452176,0.000031495234,0.000103632345,0.00019710368,0.00007897328],"domain_scores_gemma":[0.9990565,0.0006358936,0.00007893138,0.00006523061,0.00013485094,0.000028596813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001292831,0.0007643073,0.0007516243,0.00028987828,0.00027503015,0.0007414974,0.0005587515,0.0009329218,0.000994594],"category_scores_gemma":[0.0022536446,0.00037555618,0.00032353488,0.00074128195,0.0006841984,0.0012115788,0.0005777522,0.0006429872,0.0003552044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008074421,0.0000213255,0.00021311219,0.00008212423,0.000019828174,0.00010344257,0.00005282317,0.9142473,0.0046525174,0.048641086,0.0005866295,0.03129904],"study_design_scores_gemma":[0.00001587905,0.000038461527,0.00004546377,0.000006090653,0.000004804485,0.000031213585,0.000013902105,0.98370206,0.000869765,0.014691556,0.00057493825,0.000005863315],"about_ca_topic_score_codex":0.001081523,"about_ca_topic_score_gemma":0.0010549191,"teacher_disagreement_score":0.001292831,"about_ca_system_score_codex":0.00080497557,"about_ca_system_score_gemma":0.0006208225,"threshold_uncertainty_score":0.006837189},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14627324,0.010998774,0.77686566,0.0015016856,0.0002948223,0.0002456398,0.001277868,0.0007656928,0.06177659],"genre_scores_gemma":[0.9412416,0.0061500454,0.048403226,0.0002718953,0.00022508475,0.00043661642,0.0004400161,0.00015554215,0.0026758423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937495,0.0028514708,0.0002852299,0.00053442974,0.0013757269,0.0012036845],"domain_scores_gemma":[0.9663616,0.027320553,0.0021485412,0.001690521,0.0020410945,0.00043765618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060848743,0.0031248382,0.0021861629,0.0026752062,0.0011307272,0.0038397068,0.0024782408,0.0017197513,0.0035136917],"category_scores_gemma":[0.032551385,0.00089493534,0.0013031859,0.0026671928,0.0030449037,0.0038476302,0.0034007647,0.0024035058,0.0013046091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069891504,0.00012861392,0.0009452277,0.00091951864,0.00017081056,0.0005751007,0.00053355424,0.56418157,0.007208466,0.38330972,0.0031355477,0.03819304],"study_design_scores_gemma":[0.000070701135,0.00027718628,0.000555729,0.00047958078,0.000094420735,0.0008997999,0.00026202007,0.78956527,0.008534695,0.19609727,0.0030430565,0.0001203548],"about_ca_topic_score_codex":0.0011804034,"about_ca_topic_score_gemma":0.0006666556,"teacher_disagreement_score":0.0060848743,"about_ca_system_score_codex":0.0022503596,"about_ca_system_score_gemma":0.0016626511,"threshold_uncertainty_score":0.03218025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15250637,0.001642457,0.8419958,0.00027997256,0.000021739304,0.000039111197,0.00002986342,0.00030650024,0.0031780961],"genre_scores_gemma":[0.8828745,0.0006335277,0.11509871,0.000121348115,0.000062511375,0.000056744742,0.000037012047,0.000014799715,0.0011008432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861383,0.0006142879,0.000051357085,0.00013033596,0.0005039246,0.00008631228],"domain_scores_gemma":[0.9986739,0.00084747735,0.00017840609,0.00013775929,0.0001311438,0.000031191415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014910437,0.0005192328,0.00070161425,0.0005859813,0.00028313085,0.0008071055,0.000629419,0.0007591614,0.00040676654],"category_scores_gemma":[0.0031608965,0.00044164681,0.0003743384,0.0008397147,0.00093907426,0.00086589064,0.0010864297,0.00045571776,0.00027206822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008035774,0.00012649434,0.0026131482,0.0003129913,0.00018179714,0.00055641274,0.00062789046,0.4128386,0.16350806,0.07691517,0.00072890177,0.34078696],"study_design_scores_gemma":[0.00013091805,0.0007466963,0.0013647173,0.000045310306,0.000099892655,0.0006563956,0.00006497139,0.8824464,0.06009013,0.05114126,0.0031294327,0.000083876614],"about_ca_topic_score_codex":0.00020679597,"about_ca_topic_score_gemma":0.00025395342,"teacher_disagreement_score":0.0014910437,"about_ca_system_score_codex":0.00041298036,"about_ca_system_score_gemma":0.00026315023,"threshold_uncertainty_score":0.007885456},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020379724,0.00033176853,0.9760893,0.00026662447,0.00007888126,0.00007989463,0.000024776698,0.00017856857,0.002570408],"genre_scores_gemma":[0.8943275,0.00033272145,0.10343502,0.00016437122,0.000089779685,0.0002255899,0.000041315212,0.000018926421,0.0013647507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897975,0.0004064376,0.0000511985,0.00011365288,0.00031876683,0.00013015885],"domain_scores_gemma":[0.99707794,0.0015758154,0.00030364568,0.00053451804,0.0004145546,0.00009346646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019729037,0.00048604593,0.0004666465,0.0006718186,0.0007470677,0.0006412682,0.0016742178,0.00090935174,0.0007378676],"category_scores_gemma":[0.0058008325,0.00026885016,0.00029551756,0.00073961733,0.0011569869,0.0014453386,0.0016654497,0.00082492974,0.00013226856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002499532,0.00015499853,0.0007890508,0.00021680251,0.000074373325,0.0004273635,0.0004315708,0.37209782,0.047466453,0.44345346,0.0034413552,0.13119689],"study_design_scores_gemma":[0.000045693607,0.000119317694,0.00014098265,0.000020411859,0.000026830574,0.00029491505,0.00004371919,0.92849,0.0053717345,0.062141325,0.0032664705,0.0000387106],"about_ca_topic_score_codex":0.0007345326,"about_ca_topic_score_gemma":0.0009426703,"teacher_disagreement_score":0.0019729037,"about_ca_system_score_codex":0.0006830589,"about_ca_system_score_gemma":0.0012067104,"threshold_uncertainty_score":0.010433793},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.815355,0.0011327526,0.16315009,0.0006860187,0.000038531536,0.00003327123,0.00017931403,0.00023000827,0.019194996],"genre_scores_gemma":[0.9967334,0.00025165928,0.002496519,0.000044327648,0.000025962736,0.00001175774,0.000024322835,0.000014003815,0.0003979252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969952,0.0013815747,0.00008747656,0.00023847041,0.0008487694,0.00044860307],"domain_scores_gemma":[0.9810244,0.015488574,0.0013053978,0.0007650355,0.0012092534,0.0002074255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002984039,0.00123123,0.0011507664,0.00036821578,0.00047768423,0.001345034,0.0005648798,0.0011079019,0.00112076],"category_scores_gemma":[0.01686954,0.00031466287,0.00034456843,0.00047828173,0.0014950928,0.0017291937,0.0013780581,0.0008722769,0.0002641066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006920856,0.000074835814,0.00351126,0.00015617441,0.00009455986,0.0006770031,0.00021084382,0.9253189,0.034125637,0.017702531,0.00027141208,0.017164733],"study_design_scores_gemma":[0.00007061511,0.00066225487,0.0024540601,0.000032572116,0.00008404855,0.000678016,0.00017824567,0.95795906,0.027912693,0.009547904,0.00037490155,0.000045643443],"about_ca_topic_score_codex":0.0006861816,"about_ca_topic_score_gemma":0.0005596651,"teacher_disagreement_score":0.002984039,"about_ca_system_score_codex":0.0006495186,"about_ca_system_score_gemma":0.00070469134,"threshold_uncertainty_score":0.015781283},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7861999,0.005521435,0.18450624,0.0008166255,0.00010085728,0.0000528443,0.00010217762,0.0007146851,0.021985237],"genre_scores_gemma":[0.9953556,0.0006379755,0.0036269429,0.000028582783,0.000019533838,0.0000071012796,0.000009246018,0.000016633707,0.00029826013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886215,0.00067057856,0.000026480337,0.00008915398,0.00018674212,0.00016496099],"domain_scores_gemma":[0.9897125,0.008620089,0.00058415945,0.0006184596,0.00035360514,0.00011124419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013285688,0.00081316044,0.000447563,0.00041634505,0.00031413115,0.0005374157,0.00050112914,0.0006658644,0.0012024576],"category_scores_gemma":[0.009529036,0.00020142183,0.00024541744,0.00044540732,0.0011293731,0.001197023,0.0005908965,0.0003855259,0.00018889918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049688056,0.00010833785,0.0015093916,0.00017466318,0.00007702038,0.00044912758,0.00011717467,0.8964599,0.04091617,0.01537676,0.0006306278,0.043683995],"study_design_scores_gemma":[0.00008455322,0.0013182042,0.0026711717,0.00005435218,0.00029116592,0.0007216543,0.00014822268,0.8922276,0.08146307,0.018750716,0.0022103596,0.00005890923],"about_ca_topic_score_codex":0.00053034775,"about_ca_topic_score_gemma":0.0006322776,"teacher_disagreement_score":0.0013285688,"about_ca_system_score_codex":0.0005187117,"about_ca_system_score_gemma":0.00029534262,"threshold_uncertainty_score":0.007026255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25465336,0.002650398,0.73469806,0.0013788006,0.00005400568,0.000067428155,0.00012168418,0.0001967534,0.006179595],"genre_scores_gemma":[0.95980114,0.0013191595,0.037170436,0.000082838225,0.000074054435,0.00010528652,0.00006507482,0.000077854434,0.0013042802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990206,0.0004965796,0.000028726463,0.00009031872,0.00021252234,0.00015129478],"domain_scores_gemma":[0.9943771,0.0047036353,0.00033447094,0.0001547633,0.00032401085,0.00010598117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022470143,0.00077657745,0.000697926,0.0007114805,0.0006314793,0.000810258,0.00088760536,0.0013163233,0.0012429617],"category_scores_gemma":[0.011687809,0.00041101503,0.00029137978,0.0007671823,0.0007683629,0.0031269467,0.0008106174,0.00062746485,0.0001477077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021517905,0.00008734634,0.0010829762,0.00018795297,0.000031626605,0.00014517359,0.00019275214,0.8838052,0.011159012,0.07038029,0.0008964619,0.031816013],"study_design_scores_gemma":[0.000011004,0.00007840455,0.00027122942,0.000013627682,0.00001064776,0.0000962194,0.00005358247,0.9753568,0.0019529824,0.021728745,0.00041572872,0.000011042604],"about_ca_topic_score_codex":0.0006342116,"about_ca_topic_score_gemma":0.0006730824,"teacher_disagreement_score":0.0022470143,"about_ca_system_score_codex":0.0013227528,"about_ca_system_score_gemma":0.00057680934,"threshold_uncertainty_score":0.011883497},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047271952,0.0010971077,0.9413582,0.0002809604,0.000034322613,0.00006703655,0.000069017784,0.000056154044,0.009765182],"genre_scores_gemma":[0.85441494,0.0029232341,0.13626248,0.000102806465,0.000109547174,0.00020708817,0.00010119889,0.00006989216,0.0058087846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940586,0.00030913512,0.000020942049,0.000073548465,0.00012049961,0.00007005245],"domain_scores_gemma":[0.99847525,0.0012434041,0.000110928915,0.000037106318,0.00011068777,0.000022552895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014149318,0.0009084225,0.00120522,0.0005695047,0.00038501318,0.0009775884,0.00058415113,0.0007950357,0.0014368882],"category_scores_gemma":[0.0035376828,0.00053207256,0.00039223768,0.0009287529,0.001202075,0.0011701777,0.0007007605,0.0006536704,0.0002471353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092739254,0.000040750383,0.00020442477,0.000108686545,0.000025658428,0.00010241978,0.00011176616,0.8887387,0.002380817,0.08447193,0.0008285965,0.02289355],"study_design_scores_gemma":[0.000011746044,0.000029295783,0.0000557795,0.000008744441,0.0000065294585,0.000019362482,0.00001660434,0.9770657,0.00044900627,0.02194343,0.00038871673,0.0000051401016],"about_ca_topic_score_codex":0.002119861,"about_ca_topic_score_gemma":0.002307077,"teacher_disagreement_score":0.002119861,"about_ca_system_score_codex":0.0012546028,"about_ca_system_score_gemma":0.0009254479,"threshold_uncertainty_score":0.009102821},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02420372,0.0017513797,0.96679026,0.0004120587,0.000116664974,0.00007091045,0.00011676303,0.00010300323,0.0064352257],"genre_scores_gemma":[0.75395864,0.002288243,0.23608598,0.0004026716,0.0001576536,0.0002594664,0.00031287628,0.000020984826,0.0065134307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926084,0.00018686226,0.000027569573,0.00008949195,0.00037590408,0.000059307702],"domain_scores_gemma":[0.9983754,0.00071381696,0.00019627131,0.00027323738,0.00039544087,0.000045725996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076634646,0.00031859704,0.00044722928,0.00033817443,0.00023479284,0.00047014854,0.0008169592,0.0007454022,0.0014708015],"category_scores_gemma":[0.0023550761,0.00016042951,0.00013290538,0.0007390466,0.00078351266,0.0007058232,0.00076767453,0.00067112176,0.00037693855],"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.00020304322,0.000087182256,0.0015913262,0.0004601731,0.00004496365,0.0001850324,0.00021375886,0.1405618,0.06067225,0.6597321,0.0031574208,0.13309087],"study_design_scores_gemma":[0.000060207072,0.00020232754,0.0009774124,0.0000627531,0.000018935043,0.00041678155,0.0000439624,0.8518622,0.025547907,0.10850326,0.012263369,0.000040979572],"about_ca_topic_score_codex":0.0007767218,"about_ca_topic_score_gemma":0.000756386,"teacher_disagreement_score":0.0014708015,"about_ca_system_score_codex":0.00061549037,"about_ca_system_score_gemma":0.00081640156,"threshold_uncertainty_score":0.004920304},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88681537,0.0012021998,0.10142592,0.00031264755,0.000034860615,0.00004625399,0.0001738696,0.00020714107,0.009781755],"genre_scores_gemma":[0.9969682,0.00017853126,0.002463176,0.0000151373015,0.000009854464,0.000010029658,0.000029338604,0.000010789292,0.00031489524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988379,0.00044671958,0.000043290627,0.000099896155,0.00034349636,0.00022865672],"domain_scores_gemma":[0.9828342,0.014285547,0.000898911,0.0005024344,0.001346735,0.000132196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020575516,0.0010479725,0.0006552993,0.0007147487,0.0004726327,0.0007953433,0.0006893271,0.00087590324,0.00076544617],"category_scores_gemma":[0.016035045,0.00024234949,0.0003537968,0.00083836156,0.0013785792,0.0010194179,0.0007397654,0.00048096568,0.00013429997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023622092,0.000034274115,0.0014076846,0.00004947466,0.000036553778,0.00011721965,0.00007244574,0.98507243,0.0031715827,0.0033737149,0.00016061374,0.006267797],"study_design_scores_gemma":[0.000014047382,0.00013616846,0.00083702,0.000008632365,0.000020640184,0.00008125664,0.000031075375,0.9959972,0.001480555,0.0013116979,0.00006759425,0.000014030834],"about_ca_topic_score_codex":0.008202052,"about_ca_topic_score_gemma":0.0049844375,"teacher_disagreement_score":0.008202052,"about_ca_system_score_codex":0.0011073981,"about_ca_system_score_gemma":0.00083100743,"threshold_uncertainty_score":0.016308606},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09323068,0.0037416385,0.8208234,0.0060403943,0.00041644313,0.00022234903,0.0011271578,0.00035921627,0.07403883],"genre_scores_gemma":[0.9202091,0.0054864567,0.057954334,0.0010498222,0.00084321765,0.0008308366,0.0005396812,0.0003017148,0.012784759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99579006,0.0012900995,0.00016313759,0.0005694083,0.0012487378,0.00093869306],"domain_scores_gemma":[0.96073264,0.029051961,0.0026353546,0.0029340142,0.0038187993,0.00082712295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006242445,0.0014775117,0.0018085617,0.0020658406,0.0015071019,0.0039256625,0.0026270696,0.0021244092,0.009217806],"category_scores_gemma":[0.039734054,0.0007306485,0.0012851935,0.001881336,0.0041768397,0.0074062455,0.004478565,0.0044042217,0.0015541842],"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.0001238736,0.00003025134,0.00020632365,0.0001772564,0.000024805266,0.00013946877,0.00033444155,0.0553851,0.0025073308,0.9320665,0.0026317295,0.0063729594],"study_design_scores_gemma":[0.00006527941,0.00007077632,0.0003919627,0.00017630131,0.00003599139,0.00046536827,0.00013675554,0.32357487,0.0032955066,0.66812253,0.0035766333,0.00008794817],"about_ca_topic_score_codex":0.0016897315,"about_ca_topic_score_gemma":0.00074022514,"teacher_disagreement_score":0.009217806,"about_ca_system_score_codex":0.0040302514,"about_ca_system_score_gemma":0.0023646804,"threshold_uncertainty_score":0.033013582},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03611338,0.0008299376,0.9504408,0.000551541,0.000069178015,0.000056555975,0.00015784075,0.00019543555,0.011585281],"genre_scores_gemma":[0.85383797,0.0014005502,0.13654287,0.00018667647,0.000119235156,0.0002072197,0.00018576292,0.00009728061,0.007422478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869066,0.0005501668,0.000046113164,0.00024088476,0.0002953854,0.00017684806],"domain_scores_gemma":[0.99904937,0.0005724058,0.000099070465,0.00006703053,0.00017412197,0.00003797616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015923573,0.0011599306,0.0012310253,0.00059077964,0.00043196965,0.0016828304,0.0009504271,0.0011221231,0.0026758905],"category_scores_gemma":[0.0035237784,0.0003878194,0.00054440444,0.0008806822,0.0010127312,0.0016694091,0.0014256157,0.0010925407,0.0007368944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016032817,0.000032519725,0.00026113182,0.00021683259,0.000048168913,0.0001466473,0.0001347923,0.8693109,0.0044802194,0.096423365,0.0022253196,0.026559768],"study_design_scores_gemma":[0.000020039164,0.00003432633,0.00007744009,0.0000131773695,0.000012550944,0.000061625804,0.000025527244,0.9751285,0.0015982344,0.02244028,0.00057307805,0.00001528819],"about_ca_topic_score_codex":0.0018608193,"about_ca_topic_score_gemma":0.0010475043,"teacher_disagreement_score":0.0026758905,"about_ca_system_score_codex":0.0011934583,"about_ca_system_score_gemma":0.0017327153,"threshold_uncertainty_score":0.008951724},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024465952,0.00036503005,0.97247046,0.00016168355,0.000017157134,0.000028625085,0.000025707834,0.00008619233,0.0023791944],"genre_scores_gemma":[0.88864547,0.00073543,0.107010044,0.00007155681,0.000040197767,0.00014864307,0.000043349195,0.00005142604,0.0032540374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993667,0.00035274247,0.00002358477,0.00007630673,0.00012296991,0.00005779076],"domain_scores_gemma":[0.99918216,0.00058924645,0.00008693611,0.000037887436,0.00008177093,0.00002191981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011558529,0.0009079172,0.0011578149,0.0004437932,0.00029669135,0.0009812715,0.00070310786,0.00088272744,0.0007302712],"category_scores_gemma":[0.0020687091,0.00047822116,0.00035783197,0.0005987609,0.0008956754,0.0009018024,0.0007677817,0.00056940346,0.00022696111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006274047,0.000026843405,0.00014883273,0.00006423476,0.000021804624,0.00008756763,0.0000653907,0.96565574,0.0025530995,0.014675507,0.00040600696,0.016232288],"study_design_scores_gemma":[0.000008023727,0.000023788849,0.000035222947,0.000003653472,0.0000041265953,0.000020000225,0.000008606782,0.9931117,0.00070697814,0.0059196637,0.00015423638,0.0000040017812],"about_ca_topic_score_codex":0.0008452664,"about_ca_topic_score_gemma":0.00069663685,"teacher_disagreement_score":0.0011578149,"about_ca_system_score_codex":0.0007795714,"about_ca_system_score_gemma":0.0005329235,"threshold_uncertainty_score":0.006112814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07321309,0.00199339,0.90343714,0.00040158056,0.000037008725,0.00012975764,0.0001867345,0.0002776102,0.020323744],"genre_scores_gemma":[0.9236013,0.0016061864,0.06840352,0.0002001784,0.000060316863,0.0004469923,0.0001428887,0.00010295795,0.0054355836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910885,0.00040880364,0.000030461502,0.000092649774,0.00021123131,0.00014793494],"domain_scores_gemma":[0.9942919,0.0043898877,0.0005606458,0.0002253142,0.00040979192,0.00012255169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024027273,0.0010386445,0.00069926755,0.00096480816,0.0004902593,0.0014087993,0.0010810297,0.00086696143,0.0030190297],"category_scores_gemma":[0.010301341,0.0003835491,0.0006312648,0.00069398765,0.0014449327,0.0013324642,0.001648436,0.00088673976,0.0006694308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019667971,0.000046775305,0.00043962608,0.0001199956,0.00004941993,0.00022422918,0.00053930626,0.71864736,0.003915097,0.2579373,0.0019170626,0.015967181],"study_design_scores_gemma":[0.000040092535,0.000089287605,0.00024347486,0.000037807906,0.000031045794,0.00016316738,0.000100647674,0.8920328,0.0016431976,0.1033776,0.002213567,0.000027243103],"about_ca_topic_score_codex":0.0021010311,"about_ca_topic_score_gemma":0.0014739282,"teacher_disagreement_score":0.0030190297,"about_ca_system_score_codex":0.0015311372,"about_ca_system_score_gemma":0.0009984329,"threshold_uncertainty_score":0.012706935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014289113,0.00022240798,0.98132,0.0000727123,0.00001874944,0.000038567854,0.000043829863,0.00012071659,0.0038739492],"genre_scores_gemma":[0.7809133,0.00042663846,0.21188366,0.000099645884,0.00004267428,0.00026451456,0.00013467141,0.000109178975,0.006125764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990833,0.00036169437,0.000031743362,0.0001345275,0.00026961227,0.00011905855],"domain_scores_gemma":[0.99924135,0.0004930937,0.000073573676,0.00006234388,0.000107324966,0.000022238322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011155412,0.00083824096,0.00067890994,0.00044328396,0.00031904326,0.00072348764,0.00089812983,0.0005434637,0.0027998404],"category_scores_gemma":[0.0036890337,0.00038593388,0.00027472718,0.0007909589,0.00057503197,0.00096327707,0.0010416787,0.0005669494,0.0007010945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012204728,0.000047727397,0.0002451192,0.00007503456,0.000029928717,0.00007981311,0.00008394621,0.86685914,0.004509065,0.040768605,0.0017078209,0.08547169],"study_design_scores_gemma":[0.000015496607,0.0000358996,0.00007472814,0.000004008029,0.0000061627493,0.000030997104,0.000012769891,0.98000276,0.0007521171,0.018318534,0.0007410256,0.0000055334167],"about_ca_topic_score_codex":0.0009789701,"about_ca_topic_score_gemma":0.0013308566,"teacher_disagreement_score":0.0027998404,"about_ca_system_score_codex":0.00074737176,"about_ca_system_score_gemma":0.000764732,"threshold_uncertainty_score":0.009366393},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15338407,0.0016163855,0.83242077,0.00037011487,0.00005448755,0.000039504866,0.00009923418,0.00020441694,0.011811004],"genre_scores_gemma":[0.95151794,0.0010013126,0.04439253,0.00006760346,0.000032584267,0.00005239173,0.00006252119,0.000013224324,0.0028599566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994104,0.00021943192,0.000020725101,0.00007491749,0.0001740602,0.0001004989],"domain_scores_gemma":[0.998579,0.000902355,0.00014012809,0.000077218814,0.0002541567,0.00004715567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007610288,0.00064613833,0.0004746936,0.00041083933,0.0002717991,0.0007378022,0.00043808858,0.0008051359,0.0011989356],"category_scores_gemma":[0.0035336658,0.00034445527,0.00018429224,0.0006859498,0.0006596712,0.00085846375,0.00065475126,0.0003237499,0.0005225537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050897023,0.000038643404,0.0019199235,0.00016023296,0.00006170324,0.00056939595,0.00019360235,0.83253455,0.037407998,0.055394433,0.0011255519,0.07008494],"study_design_scores_gemma":[0.00003487531,0.0002011872,0.0006010672,0.000021271488,0.00002374584,0.00027532672,0.000054379554,0.97791404,0.0042434004,0.015628077,0.00096994796,0.000032700576],"about_ca_topic_score_codex":0.0010445043,"about_ca_topic_score_gemma":0.0011090148,"teacher_disagreement_score":0.0011989356,"about_ca_system_score_codex":0.000573275,"about_ca_system_score_gemma":0.0003480213,"threshold_uncertainty_score":0.0041594505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30320376,0.0010185319,0.6786805,0.0006139947,0.000030088124,0.00006859513,0.00013805971,0.00021607493,0.016030468],"genre_scores_gemma":[0.98765045,0.00028392763,0.010789234,0.00004172306,0.000015702906,0.000042380467,0.000035016557,0.000017299575,0.001124264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982653,0.0008397754,0.000053794258,0.00021492496,0.0004089383,0.00021732658],"domain_scores_gemma":[0.9967415,0.002202517,0.0004049693,0.0001458266,0.000426547,0.000078639954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00276998,0.0012301796,0.000897622,0.00049331854,0.0004456407,0.0014659746,0.0007252583,0.0011169742,0.0007891735],"category_scores_gemma":[0.0073666763,0.0003507961,0.00034951672,0.0007783429,0.0016291126,0.0011568823,0.0015072984,0.0005606349,0.00023780481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080817066,0.000025640673,0.000468419,0.000037609243,0.000025367266,0.00007090915,0.00008246411,0.97568095,0.0027704542,0.013500049,0.00019393628,0.0070635257],"study_design_scores_gemma":[0.000014733697,0.000083462604,0.00028842626,0.0000072783114,0.000014858746,0.000037987164,0.000041316554,0.98987645,0.0014439315,0.008001434,0.00017890785,0.000011165117],"about_ca_topic_score_codex":0.001930349,"about_ca_topic_score_gemma":0.0011871697,"teacher_disagreement_score":0.00276998,"about_ca_system_score_codex":0.0013916522,"about_ca_system_score_gemma":0.00093190494,"threshold_uncertainty_score":0.014649212},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17166424,0.010160609,0.7968362,0.0022091367,0.00015935693,0.00011147678,0.00021934517,0.0008345456,0.017805094],"genre_scores_gemma":[0.96646357,0.003920012,0.026289834,0.000119625794,0.00026425457,0.000075930744,0.00012124548,0.000097912576,0.0026475894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997764,0.0008451949,0.00004721412,0.00020911203,0.0007993511,0.00033512292],"domain_scores_gemma":[0.9924055,0.0051075104,0.0008076986,0.00048026213,0.0010669103,0.00013218139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003495869,0.0015470335,0.00082941575,0.0013912222,0.0006964055,0.0018680157,0.0010727731,0.0012087425,0.0017737453],"category_scores_gemma":[0.0114670945,0.0005287084,0.00043490177,0.0018814165,0.0014008272,0.0020268008,0.0011933031,0.0015222069,0.00047049508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018340656,0.0000759259,0.0010529356,0.00014433962,0.00006656433,0.00010915638,0.000104587656,0.91256404,0.0069546956,0.042675026,0.0017778154,0.034291584],"study_design_scores_gemma":[0.0000056709027,0.000056128458,0.00030147625,0.000014521652,0.000014877497,0.000069410395,0.000016429205,0.99106795,0.0010404593,0.0070436522,0.00035813282,0.000011283651],"about_ca_topic_score_codex":0.0035457436,"about_ca_topic_score_gemma":0.0019852982,"teacher_disagreement_score":0.0035457436,"about_ca_system_score_codex":0.0028585177,"about_ca_system_score_gemma":0.0013187345,"threshold_uncertainty_score":0.020740092},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62000555,0.001417311,0.36316836,0.000318637,0.000101863094,0.00005426516,0.0001139071,0.0001981251,0.0146221],"genre_scores_gemma":[0.9925498,0.00044075365,0.0045556505,0.000040549,0.000048148126,0.000013171089,0.000021218448,0.000012638929,0.0023180586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993894,0.00017419753,0.000010952966,0.00005776524,0.00018352101,0.00018423157],"domain_scores_gemma":[0.9983171,0.0010870035,0.00019460147,0.000097750286,0.00023944654,0.000064079555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006488523,0.0007719683,0.00042301547,0.00051068247,0.0003884366,0.0010011266,0.00047856427,0.0004890136,0.0016818333],"category_scores_gemma":[0.0023311414,0.00019498316,0.00038778764,0.00066225894,0.0010360739,0.0010648769,0.0005479966,0.00058047444,0.00022308665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002319353,0.000033774864,0.0010929258,0.00004746002,0.00006933881,0.00018238627,0.00009634575,0.9543522,0.007049518,0.02689704,0.00041058715,0.009536414],"study_design_scores_gemma":[0.000010007639,0.00007502817,0.00032889243,0.000004898945,0.000017888042,0.000036365982,0.000023881872,0.9911884,0.001677217,0.0064037624,0.00022480485,0.000008843442],"about_ca_topic_score_codex":0.0033135184,"about_ca_topic_score_gemma":0.0019136948,"teacher_disagreement_score":0.0033135184,"about_ca_system_score_codex":0.001296742,"about_ca_system_score_gemma":0.00042402823,"threshold_uncertainty_score":0.009408593},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049226396,0.0024347648,0.9138632,0.00025787938,0.00024450294,0.00008732267,0.00022043147,0.00046972622,0.03319582],"genre_scores_gemma":[0.9438499,0.0019274825,0.042431004,0.00012238482,0.00011383807,0.00009918239,0.00015060915,0.000028522309,0.011276941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995814,0.0001668114,0.000017400924,0.00007449653,0.00009903932,0.00006092953],"domain_scores_gemma":[0.9993338,0.0002337888,0.000091583745,0.00009694781,0.00020543514,0.00003842247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040089226,0.0006668068,0.0005338615,0.00036513165,0.00062927086,0.0008253165,0.0011101073,0.00075519184,0.0030073496],"category_scores_gemma":[0.00083582464,0.0001617434,0.00024179628,0.00066331506,0.00025648993,0.0009348878,0.0008000843,0.000442408,0.00088666874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078106765,0.00018555895,0.002327689,0.0008719059,0.00013722546,0.0020440079,0.00037624437,0.427682,0.049457196,0.22693373,0.010738243,0.27846503],"study_design_scores_gemma":[0.000028129583,0.00019244102,0.00028149268,0.000033518343,0.00005890854,0.00058147433,0.00008557225,0.9499361,0.0059691453,0.025982315,0.016818045,0.000032999415],"about_ca_topic_score_codex":0.0011284293,"about_ca_topic_score_gemma":0.0017376421,"teacher_disagreement_score":0.0030073496,"about_ca_system_score_codex":0.00030737594,"about_ca_system_score_gemma":0.0004134028,"threshold_uncertainty_score":0.010060608},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14804356,0.03983538,0.66360277,0.02677861,0.0009547966,0.0002558354,0.0008332913,0.0020662588,0.11762945],"genre_scores_gemma":[0.9367059,0.01527365,0.039223008,0.00093442824,0.0010021147,0.00032469307,0.00026367925,0.00026917772,0.006003444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799854,0.00082670443,0.00007046542,0.00023822166,0.00064477196,0.00022129697],"domain_scores_gemma":[0.9870292,0.010246354,0.00057153386,0.0009821824,0.00080170116,0.00036904728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040252814,0.0009805678,0.001331152,0.0011405738,0.0010386023,0.0024622504,0.0015914805,0.0013275362,0.0051452853],"category_scores_gemma":[0.01958022,0.00049404794,0.00041050187,0.0015982707,0.002356317,0.008178332,0.0029455984,0.0021022793,0.0007861089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003776325,0.00009479453,0.002223971,0.00051461416,0.00011476069,0.00055681966,0.0005399682,0.40501273,0.007947156,0.4781439,0.014977666,0.089496],"study_design_scores_gemma":[0.00006708663,0.00008421114,0.00064139377,0.00011809887,0.00005510675,0.00039990296,0.00018781636,0.6174031,0.0016712366,0.36406758,0.015271277,0.000033288165],"about_ca_topic_score_codex":0.0012699607,"about_ca_topic_score_gemma":0.0009888923,"teacher_disagreement_score":0.0051452853,"about_ca_system_score_codex":0.0015956226,"about_ca_system_score_gemma":0.00074322533,"threshold_uncertainty_score":0.021287978},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07500403,0.0012173513,0.89977986,0.0018996154,0.00010322972,0.00014768372,0.0002864822,0.00050779764,0.021053955],"genre_scores_gemma":[0.910863,0.0012615465,0.081440404,0.00037831956,0.00017577426,0.0004476413,0.00034528782,0.00020533305,0.0048827166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714965,0.0014354263,0.000092365066,0.00029524564,0.00062368927,0.00040359684],"domain_scores_gemma":[0.9592068,0.036568783,0.0014338726,0.0010404491,0.0013279087,0.00042211733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005629835,0.001119309,0.0016650931,0.0011644639,0.00086954056,0.0014312528,0.0021356754,0.0017226558,0.0027799916],"category_scores_gemma":[0.04555041,0.00072019774,0.00060121133,0.0012119885,0.002843344,0.00344883,0.0023661002,0.0018167157,0.00053680106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023002739,0.00006490727,0.00053299614,0.00019245737,0.000043441414,0.00011234721,0.00014697023,0.7889267,0.0019406686,0.19480325,0.002522642,0.010483574],"study_design_scores_gemma":[0.000047592337,0.0000397266,0.00009787737,0.000019357876,0.000010899309,0.000033218625,0.000024493482,0.91525525,0.0004908658,0.0835145,0.00045639038,0.000009812284],"about_ca_topic_score_codex":0.003449769,"about_ca_topic_score_gemma":0.0019400517,"teacher_disagreement_score":0.005629835,"about_ca_system_score_codex":0.0030713815,"about_ca_system_score_gemma":0.0023260145,"threshold_uncertainty_score":0.029773772},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94231415,0.0022138257,0.04799863,0.000286043,0.00009457756,0.000043113774,0.00018757494,0.00036720137,0.0064948183],"genre_scores_gemma":[0.99743515,0.00038995055,0.0015419446,0.000019676543,0.000011329911,0.000010875147,0.000058188132,0.00000988695,0.00052302965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868184,0.00047698626,0.00005042976,0.00013291693,0.00031770652,0.00034003748],"domain_scores_gemma":[0.9944865,0.0035043464,0.00049238745,0.00027680316,0.0010741415,0.00016580678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001264225,0.0008452229,0.0006527241,0.00088567706,0.00067556725,0.0010178821,0.0005887036,0.001062191,0.0010219081],"category_scores_gemma":[0.0044327383,0.00014728984,0.0002660907,0.0009737376,0.0007412957,0.0008648632,0.0008394207,0.00047444005,0.0002246028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017631702,0.00022075987,0.0150368605,0.0006566493,0.00020208454,0.0011360116,0.00037100617,0.9030726,0.04328163,0.0047771735,0.0008591555,0.028622894],"study_design_scores_gemma":[0.000037429345,0.0020323715,0.0066770827,0.00005012413,0.00012882527,0.00090769184,0.0003415808,0.9592328,0.028824326,0.0012467718,0.00044736033,0.000073687756],"about_ca_topic_score_codex":0.0029232455,"about_ca_topic_score_gemma":0.0016725472,"teacher_disagreement_score":0.0029232455,"about_ca_system_score_codex":0.00064044545,"about_ca_system_score_gemma":0.00048666113,"threshold_uncertainty_score":0.006685972},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012143079,0.00014247173,0.9870368,0.00014356094,0.000010870473,0.000034160035,0.000038108272,0.00017101533,0.00027987876],"genre_scores_gemma":[0.7558894,0.00043008133,0.24134618,0.00020943508,0.00007103429,0.00036976836,0.0004057427,0.0000793284,0.0011990672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962664,0.0018857814,0.00015308845,0.0005380032,0.0009425809,0.00021412368],"domain_scores_gemma":[0.97721577,0.018136417,0.0019757634,0.0013092407,0.0011912498,0.00017155019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065767244,0.0008746805,0.0010562243,0.0016043114,0.00064341945,0.0011292547,0.0023018168,0.0011428604,0.00046597887],"category_scores_gemma":[0.03706607,0.00078264263,0.00064072665,0.0014900983,0.0025035548,0.0032452014,0.0016159243,0.0014852217,0.00015676412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006680333,0.000019449017,0.000566609,0.000034416767,0.000022994851,0.00004106185,0.00004073069,0.96916807,0.00051403535,0.01664484,0.000249017,0.012631879],"study_design_scores_gemma":[0.000007475903,0.000008531108,0.00006411764,0.0000032528035,0.0000035774324,0.000010076981,0.0000037661212,0.9901552,0.000295336,0.00938563,0.000058495745,0.000004591333],"about_ca_topic_score_codex":0.0065325033,"about_ca_topic_score_gemma":0.0037050676,"teacher_disagreement_score":0.0065767244,"about_ca_system_score_codex":0.0022577324,"about_ca_system_score_gemma":0.0017307369,"threshold_uncertainty_score":0.034781516},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9471409,0.001714966,0.045744814,0.0001481147,0.000077669974,0.00017811502,0.00012458077,0.00021989488,0.0046509057],"genre_scores_gemma":[0.9857275,0.00027252958,0.013436052,0.000016679502,0.00001739469,0.000036423146,0.000069533584,0.000018475153,0.00040554116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971866,0.0017926903,0.00010908285,0.000149908,0.0005307143,0.00023094162],"domain_scores_gemma":[0.9844701,0.012011809,0.0009209188,0.00065082184,0.0017104815,0.00023586472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046963925,0.0006831084,0.00053376437,0.0009594872,0.00047304423,0.0010025669,0.00071015244,0.00056822645,0.0011179721],"category_scores_gemma":[0.016831283,0.00022225059,0.00025531076,0.0005860396,0.00052477315,0.0011204361,0.0004954616,0.00040314533,0.00015683065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003614173,0.00038916655,0.00849097,0.00038572654,0.00012291862,0.00017839242,0.00018646469,0.8529393,0.03752186,0.0085172895,0.0007328014,0.08692096],"study_design_scores_gemma":[0.0002697052,0.0043119118,0.004902293,0.00006841832,0.0002419384,0.00016764528,0.00020734505,0.9218185,0.062816,0.002763898,0.0023686076,0.000063755186],"about_ca_topic_score_codex":0.0029507957,"about_ca_topic_score_gemma":0.0027660604,"teacher_disagreement_score":0.0046963925,"about_ca_system_score_codex":0.0019845418,"about_ca_system_score_gemma":0.0006155807,"threshold_uncertainty_score":0.024837255},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5384942,0.005942957,0.4085728,0.0011745377,0.00011777822,0.0001398728,0.00068303087,0.00084896974,0.04402585],"genre_scores_gemma":[0.99189454,0.0008814766,0.0053586564,0.000039893992,0.000042944088,0.000025221152,0.00009198052,0.000022559632,0.0016427846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790096,0.0006479339,0.00008212924,0.00023192109,0.0007015142,0.00043558798],"domain_scores_gemma":[0.9934297,0.004167486,0.00063775486,0.00038968815,0.0012369375,0.0001384034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001977762,0.0015964197,0.0012229903,0.0011125676,0.0005449885,0.0014014989,0.0010652418,0.0013657978,0.0019367703],"category_scores_gemma":[0.0075247483,0.0004131936,0.0006146023,0.0011037451,0.001435077,0.0011283578,0.0010959493,0.00073403196,0.0007209706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005325386,0.000044966015,0.0022326922,0.00024515972,0.0001447175,0.00080657384,0.00020646762,0.9348872,0.019412415,0.02630513,0.0007366877,0.014445525],"study_design_scores_gemma":[0.00002360649,0.00023224895,0.0012871638,0.000031843498,0.000079125355,0.00039048394,0.00006313442,0.98778987,0.0051735705,0.004430252,0.00046414608,0.000034551947],"about_ca_topic_score_codex":0.006208593,"about_ca_topic_score_gemma":0.0028598842,"teacher_disagreement_score":0.006208593,"about_ca_system_score_codex":0.0020935037,"about_ca_system_score_gemma":0.0014357181,"threshold_uncertainty_score":0.015189528},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006074331,0.000075499964,0.99618834,0.00029595962,0.00002589709,0.000028539089,0.000025660662,0.00004134899,0.002711375],"genre_scores_gemma":[0.18051164,0.00079546805,0.8101489,0.00040188836,0.00015827821,0.00043714,0.00016140768,0.000088527646,0.007296765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99719656,0.001351448,0.00010863161,0.00028580413,0.00091606245,0.00014146442],"domain_scores_gemma":[0.9973326,0.0014271734,0.00013982391,0.00064586994,0.00039843522,0.000056219862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003092697,0.0009635927,0.0006171698,0.000910083,0.00072211755,0.001546019,0.0018837686,0.0015519593,0.004075298],"category_scores_gemma":[0.0075526824,0.00048298322,0.0006708292,0.0013258202,0.002241011,0.0023161033,0.0029616416,0.0027039393,0.0010463584],"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.000037409307,0.000024415844,0.000113018155,0.00009479717,0.000020145042,0.00008764781,0.00010996319,0.16132766,0.0023086541,0.79083973,0.0024034323,0.04263302],"study_design_scores_gemma":[0.000023261593,0.00004754542,0.00003907688,0.000035071105,0.000010456552,0.00012912865,0.000033454748,0.48000664,0.0018433694,0.50803643,0.009775758,0.000019822359],"about_ca_topic_score_codex":0.0015061314,"about_ca_topic_score_gemma":0.0015347089,"teacher_disagreement_score":0.004075298,"about_ca_system_score_codex":0.0012304058,"about_ca_system_score_gemma":0.0020908467,"threshold_uncertainty_score":0.016355932},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014722747,0.008220453,0.9314009,0.0035175711,0.00087924855,0.00008226664,0.00038587634,0.0003460857,0.04044484],"genre_scores_gemma":[0.64516747,0.017678278,0.28216535,0.0018685743,0.0025026472,0.0008462778,0.0013424949,0.00044714907,0.04798176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983529,0.00079238554,0.00007577616,0.00017528354,0.00044245072,0.00016114033],"domain_scores_gemma":[0.9979328,0.0012319714,0.00015618654,0.00036921343,0.00026260424,0.000047248453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016612515,0.00087396876,0.00073817844,0.0014712814,0.0005391835,0.0017454661,0.00094372674,0.0012841448,0.0044935266],"category_scores_gemma":[0.007049445,0.00034664237,0.00073204737,0.0017144507,0.0020936301,0.0030944601,0.0018572896,0.0024421946,0.001187225],"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.00001651269,0.0000038038197,0.00005409436,0.00004852882,0.0000060412117,0.000046183653,0.00006071665,0.014198603,0.00039560447,0.97253954,0.0025350458,0.010095349],"study_design_scores_gemma":[0.00000910302,0.00001681552,0.00008477479,0.00005365169,0.0000059262225,0.00007531574,0.000028746093,0.10839588,0.00055991096,0.8794436,0.011310315,0.000016052125],"about_ca_topic_score_codex":0.0018270733,"about_ca_topic_score_gemma":0.00193304,"teacher_disagreement_score":0.0044935266,"about_ca_system_score_codex":0.0015635556,"about_ca_system_score_gemma":0.0010591263,"threshold_uncertainty_score":0.015032351},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024508495,0.005602525,0.9164264,0.005887011,0.00060021743,0.00009590226,0.000083892206,0.00011392791,0.04668163],"genre_scores_gemma":[0.8640775,0.014201146,0.09994837,0.0022703463,0.0026788018,0.00080216344,0.00016771132,0.00012734711,0.015726544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976676,0.0012342785,0.00007560999,0.0002425952,0.0005512983,0.00022857207],"domain_scores_gemma":[0.9926092,0.0056998516,0.0003758203,0.00058423163,0.00055924215,0.00017169565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032846297,0.0009518298,0.0010380608,0.0009233258,0.001193986,0.0018466191,0.0014195418,0.002062343,0.0025096268],"category_scores_gemma":[0.009967906,0.00040949153,0.0005224576,0.0016235056,0.0032478587,0.0038147077,0.003072656,0.0021805854,0.0007213634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004953075,0.000019376646,0.00021502397,0.000093360526,0.000020283422,0.00021467688,0.00022211674,0.06666776,0.00102505,0.9169713,0.0034106444,0.011090819],"study_design_scores_gemma":[0.00004802538,0.00007653223,0.00014486609,0.000062374136,0.00002062416,0.00019985801,0.000053660144,0.1943076,0.00048282734,0.79028094,0.014301856,0.000020879834],"about_ca_topic_score_codex":0.00058251707,"about_ca_topic_score_gemma":0.00042910577,"teacher_disagreement_score":0.0032846297,"about_ca_system_score_codex":0.0012567281,"about_ca_system_score_gemma":0.0005485793,"threshold_uncertainty_score":0.017370999},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06126231,0.0019132224,0.93221027,0.00020883154,0.00006296566,0.000043150016,0.00003911775,0.0002446681,0.004015361],"genre_scores_gemma":[0.9296426,0.0006230747,0.06894468,0.0000797128,0.000058938243,0.000047419537,0.000022215618,0.000017150109,0.000564227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987625,0.0005823038,0.00005404845,0.00014254842,0.00029769915,0.00016100578],"domain_scores_gemma":[0.9987207,0.0007537009,0.00021502262,0.00013320318,0.00013574114,0.00004156558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001497846,0.0009307049,0.0009448342,0.0005279407,0.0005017125,0.0009457939,0.001513153,0.00071831414,0.00066433114],"category_scores_gemma":[0.003287905,0.0002601527,0.0005140067,0.0008530558,0.0007888381,0.001242241,0.0011036504,0.0007577029,0.00015135738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004598728,0.000095622905,0.0006744271,0.0002733934,0.00012391388,0.00062970526,0.00041213614,0.7970538,0.021610964,0.08749455,0.0011672262,0.09000439],"study_design_scores_gemma":[0.000023617455,0.00012341507,0.00017437211,0.000012082544,0.000022566966,0.00020033086,0.000024450464,0.9838178,0.0020033831,0.012850125,0.0007286843,0.00001921538],"about_ca_topic_score_codex":0.0011329672,"about_ca_topic_score_gemma":0.000992251,"teacher_disagreement_score":0.001513153,"about_ca_system_score_codex":0.0006125838,"about_ca_system_score_gemma":0.0005085175,"threshold_uncertainty_score":0.007921457},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048402995,0.00091660715,0.99066544,0.0000675081,0.000035650413,0.000023990315,0.00006249453,0.00012017084,0.0032679052],"genre_scores_gemma":[0.8154975,0.0055463947,0.17232819,0.00017483998,0.0004495732,0.00023152553,0.00026718914,0.00014923299,0.0053554866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995351,0.00014269911,0.000025442492,0.000053215263,0.00018665455,0.000056825043],"domain_scores_gemma":[0.9991353,0.00048724684,0.00013296345,0.00007181842,0.0001516233,0.000021123418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010999904,0.0012347379,0.0007267988,0.0012338121,0.00026188826,0.00091274333,0.0009876338,0.0007037038,0.0016408992],"category_scores_gemma":[0.0028923138,0.00033452566,0.0008310533,0.0009584598,0.000731496,0.0011299918,0.0006525329,0.0011121851,0.00050575443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056035435,0.000040020645,0.00048607396,0.00017105047,0.000058501875,0.00033275736,0.00012274881,0.7562784,0.010527583,0.20696703,0.0015095634,0.02345032],"study_design_scores_gemma":[0.0000023718412,0.000038908023,0.00016039118,0.000012753466,0.000013803785,0.00010063353,0.000014899808,0.98512036,0.0009358922,0.012600294,0.0009862426,0.000013439972],"about_ca_topic_score_codex":0.0013611924,"about_ca_topic_score_gemma":0.00082085066,"teacher_disagreement_score":0.0016408992,"about_ca_system_score_codex":0.00084058533,"about_ca_system_score_gemma":0.00070790306,"threshold_uncertainty_score":0.006098926},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025402762,0.00042836124,0.97287786,0.000121263554,0.000022661528,0.000021470385,0.000017943848,0.000096994736,0.0010105945],"genre_scores_gemma":[0.8368476,0.0006154356,0.1604725,0.00011153375,0.00006341815,0.00009314453,0.000052201038,0.000028168673,0.0017159822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984915,0.0007538758,0.0000633599,0.00020859465,0.000389322,0.00009329419],"domain_scores_gemma":[0.99557483,0.0030591388,0.0003314575,0.00042314242,0.0005368886,0.000074498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019034467,0.0008196708,0.0007276471,0.0004216706,0.00032131645,0.00065208215,0.0010033036,0.0009918691,0.0006496843],"category_scores_gemma":[0.008992207,0.0004489419,0.00028320294,0.0006063022,0.0011037461,0.001297683,0.0010950639,0.00067366514,0.00022023774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024183693,0.00005785992,0.0007214342,0.00013322175,0.00007492158,0.00016877546,0.00019348007,0.8864029,0.014831165,0.026649827,0.00033824344,0.07018633],"study_design_scores_gemma":[0.0000146141665,0.00009210094,0.0001271541,0.000009785565,0.000022453278,0.000079007965,0.00001242014,0.9880265,0.006139445,0.0050310544,0.00043288743,0.000012435286],"about_ca_topic_score_codex":0.0012155708,"about_ca_topic_score_gemma":0.0012791406,"teacher_disagreement_score":0.0019034467,"about_ca_system_score_codex":0.00044219996,"about_ca_system_score_gemma":0.0008553027,"threshold_uncertainty_score":0.010066509},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06725103,0.002392861,0.92433244,0.00034701423,0.00023056123,0.00007244671,0.00008157063,0.000215937,0.005076207],"genre_scores_gemma":[0.91610074,0.0012390981,0.07961821,0.0001460639,0.00013178342,0.000098554876,0.00006497402,0.000051849747,0.0025486436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915016,0.00037070212,0.00003512089,0.00013047339,0.00016664264,0.00014684664],"domain_scores_gemma":[0.99817157,0.0010927295,0.00024589262,0.00010661706,0.0002892511,0.00009397355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002079189,0.00099603,0.00083736685,0.000446101,0.0007057132,0.001439701,0.0008311662,0.0006208204,0.0017931749],"category_scores_gemma":[0.0035219458,0.00045557859,0.0004454933,0.00070754957,0.0007969015,0.0011166534,0.0010388285,0.00079508155,0.00033884327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008662012,0.000059546765,0.00048840273,0.00008995239,0.000042283333,0.00016902159,0.000079182566,0.95691675,0.0034856135,0.023329262,0.0009043593,0.014348994],"study_design_scores_gemma":[0.000007342233,0.000029084076,0.00006749667,0.0000033567749,0.000008151569,0.000023833729,0.0000137768,0.9963736,0.00051064254,0.0025463516,0.00041153393,0.0000046979494],"about_ca_topic_score_codex":0.0036644689,"about_ca_topic_score_gemma":0.003528562,"teacher_disagreement_score":0.0036644689,"about_ca_system_score_codex":0.0015780072,"about_ca_system_score_gemma":0.001716394,"threshold_uncertainty_score":0.011449277},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8063382,0.0020086996,0.17607296,0.00020327671,0.000055280343,0.00006764091,0.00013638492,0.00030432417,0.014813238],"genre_scores_gemma":[0.9972361,0.00023922673,0.0018157361,0.0000094865545,0.000010232049,0.000008820602,0.000022834303,0.000005844057,0.0006517639],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994301,0.00016791595,0.000014959635,0.00006942829,0.00017059474,0.00014688763],"domain_scores_gemma":[0.99799407,0.0011831155,0.00020625086,0.00010988827,0.00043024553,0.00007646362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006317388,0.0010482371,0.0005807116,0.00051827804,0.00034538918,0.00065883744,0.0006551235,0.0007243928,0.0012069759],"category_scores_gemma":[0.002474255,0.0002151916,0.00038589028,0.0005430055,0.0007435873,0.0004653193,0.0006170139,0.00031019768,0.00028727995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016588543,0.00001849493,0.0010543752,0.000059754933,0.000032379594,0.00026230488,0.000050111674,0.9827068,0.00816191,0.0025848683,0.00020832468,0.0046948325],"study_design_scores_gemma":[0.000004805848,0.0001325103,0.0005980616,0.0000052396945,0.000014803323,0.00009942838,0.000020135456,0.99700147,0.0016265537,0.00038956193,0.00009758758,0.000009819003],"about_ca_topic_score_codex":0.0046389517,"about_ca_topic_score_gemma":0.0024851877,"teacher_disagreement_score":0.0046389517,"about_ca_system_score_codex":0.0008967231,"about_ca_system_score_gemma":0.00053404726,"threshold_uncertainty_score":0.009223878},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026881838,0.001999532,0.96549535,0.0003630864,0.00005369261,0.000029834662,0.000062316365,0.00012535804,0.004988957],"genre_scores_gemma":[0.7148412,0.0033378494,0.27486062,0.00018067817,0.0001690212,0.00017902747,0.00018746033,0.000045413108,0.0061988863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994431,0.0002034594,0.000023543196,0.000053760534,0.0002301532,0.00004587038],"domain_scores_gemma":[0.9986224,0.00076148525,0.0001325518,0.00019974091,0.00025122555,0.000032726715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070780487,0.00054456195,0.00045850978,0.0004129845,0.00031029765,0.0005944839,0.0004291385,0.00052190956,0.00091093447],"category_scores_gemma":[0.003435331,0.0002838057,0.00021625108,0.00073678896,0.00080811634,0.00062601245,0.0005986194,0.0006873927,0.00039769086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001477272,0.00003823683,0.00035451248,0.00029524937,0.000036123372,0.00013826932,0.0002489141,0.39937517,0.024353068,0.46941596,0.0031928252,0.102403946],"study_design_scores_gemma":[0.000022396409,0.000051836472,0.0001253219,0.000026916809,0.000011779285,0.00007207695,0.000019333149,0.907748,0.005592171,0.082645476,0.0036664545,0.000018176559],"about_ca_topic_score_codex":0.0013337281,"about_ca_topic_score_gemma":0.0020191052,"teacher_disagreement_score":0.0013337281,"about_ca_system_score_codex":0.00094393885,"about_ca_system_score_gemma":0.0012297543,"threshold_uncertainty_score":0.006848812},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11209259,0.0011217715,0.875966,0.0006720668,0.000037263675,0.000094508585,0.00019456088,0.00014670561,0.009674546],"genre_scores_gemma":[0.9457188,0.00055431895,0.050367787,0.000058657755,0.000027340742,0.00008725856,0.00006900205,0.00004186951,0.0030748674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991295,0.00041768502,0.000029243396,0.000102776474,0.00014388065,0.00017686098],"domain_scores_gemma":[0.9985671,0.001025266,0.00018454682,0.000056090114,0.00011846136,0.00004853778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016105222,0.0010342465,0.0011735237,0.00057643483,0.00032908336,0.0013872248,0.0006755451,0.00086022785,0.0021702533],"category_scores_gemma":[0.004470039,0.00064917153,0.0003419495,0.0009311386,0.0010307545,0.0015974089,0.0009167137,0.0006828832,0.00034848132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007584923,0.000025676587,0.00018173053,0.000050782997,0.000018914481,0.00011224509,0.000041433406,0.96897084,0.0012489274,0.017386595,0.00049238664,0.011394727],"study_design_scores_gemma":[0.000029754256,0.000030928644,0.00010916775,0.0000055531123,0.000006219796,0.000028833205,0.000022362316,0.9858743,0.00040679626,0.013179199,0.00029900225,0.000007796552],"about_ca_topic_score_codex":0.0036882805,"about_ca_topic_score_gemma":0.003258953,"teacher_disagreement_score":0.0036882805,"about_ca_system_score_codex":0.0016581252,"about_ca_system_score_gemma":0.0011783628,"threshold_uncertainty_score":0.0120306015},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31782687,0.003838237,0.6571105,0.00079402834,0.00013251985,0.00014899537,0.00012925366,0.0004867765,0.019532744],"genre_scores_gemma":[0.9906977,0.00082067424,0.006502955,0.000040802952,0.00004092813,0.000045081953,0.000038020855,0.00002655352,0.0017872438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887437,0.000393008,0.00002188553,0.00008308914,0.00044538823,0.00018226301],"domain_scores_gemma":[0.99715376,0.0018823144,0.00018052399,0.0001372503,0.00059641735,0.000049756858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021502902,0.0008493925,0.0005899975,0.00077726564,0.00054224284,0.00083410216,0.00072115374,0.0006205282,0.0016481675],"category_scores_gemma":[0.006392632,0.00029605985,0.0004278394,0.0006934217,0.0009087385,0.0009524154,0.000591789,0.000603922,0.00033858282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010287998,0.00003829864,0.00068167364,0.000074851065,0.000034263267,0.00011451158,0.00016950512,0.9413128,0.0075582266,0.035224225,0.0007861396,0.0139026595],"study_design_scores_gemma":[0.0000029435912,0.000050551236,0.0001631789,0.000003906019,0.00000646031,0.000024268238,0.00001853794,0.997373,0.00043440962,0.0017746051,0.00014272066,0.0000054272446],"about_ca_topic_score_codex":0.00531088,"about_ca_topic_score_gemma":0.0027752514,"teacher_disagreement_score":0.00531088,"about_ca_system_score_codex":0.0021932046,"about_ca_system_score_gemma":0.0010091638,"threshold_uncertainty_score":0.01591283},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14056453,0.0010461743,0.83636594,0.0005515678,0.00016256384,0.00019586553,0.00017770162,0.0011664147,0.019769246],"genre_scores_gemma":[0.93950087,0.00031901328,0.05319668,0.00012723159,0.000057312343,0.00015145812,0.000120768724,0.000010616266,0.006515997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962676,0.000071915034,0.000016431455,0.00007561151,0.00016035039,0.000048900794],"domain_scores_gemma":[0.99964166,0.000062875704,0.000047858048,0.00007232327,0.00014388537,0.00003134611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028612235,0.0004706119,0.0005396573,0.00036034314,0.00072975084,0.0007424895,0.0008197493,0.0007338309,0.0013663305],"category_scores_gemma":[0.00051171816,0.0001611919,0.00022424954,0.0005916799,0.0004319184,0.00070107117,0.00092795765,0.0003585168,0.0005863251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061845145,0.00031001514,0.0017384494,0.00040209104,0.00014154232,0.0020909077,0.0005789393,0.35447094,0.27813196,0.09349205,0.011234394,0.25679025],"study_design_scores_gemma":[0.000086418615,0.00036995977,0.0004774522,0.000017489892,0.000058856498,0.00079876266,0.00005737187,0.9618783,0.016418198,0.007906657,0.011879932,0.00005058113],"about_ca_topic_score_codex":0.0017569998,"about_ca_topic_score_gemma":0.0017948133,"teacher_disagreement_score":0.0017569998,"about_ca_system_score_codex":0.00039381205,"about_ca_system_score_gemma":0.0006474705,"threshold_uncertainty_score":0.004570782},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2490722,0.00033729692,0.72544885,0.00049578544,0.00007684219,0.00009972637,0.00005989934,0.0003608302,0.024048561],"genre_scores_gemma":[0.96572167,0.00015702557,0.029510234,0.000047939993,0.000025838413,0.0000882831,0.0000258498,0.000008304695,0.0044149174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938357,0.00023924511,0.000019130019,0.00009722088,0.00019361988,0.000067140616],"domain_scores_gemma":[0.99930656,0.00029134506,0.000088096844,0.00010664112,0.00013753847,0.0000696623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007622053,0.000338935,0.0004999185,0.0003967221,0.0005307483,0.000902322,0.0008815747,0.00084777136,0.0017995927],"category_scores_gemma":[0.0011130107,0.00026720014,0.00032536106,0.00039716766,0.0010262536,0.0008865175,0.0012163272,0.0005537421,0.0004767237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022992629,0.000114155504,0.0010687901,0.00008129806,0.000081911,0.00068445667,0.00039398973,0.802604,0.03279493,0.13914692,0.0008584358,0.02194117],"study_design_scores_gemma":[0.000063608175,0.00013927993,0.00023712206,0.0000067795486,0.000021069274,0.000109460205,0.000049789258,0.9758479,0.0018329815,0.01995515,0.0017189708,0.000017901397],"about_ca_topic_score_codex":0.0011810546,"about_ca_topic_score_gemma":0.00085983286,"teacher_disagreement_score":0.0017995927,"about_ca_system_score_codex":0.000559033,"about_ca_system_score_gemma":0.00063873467,"threshold_uncertainty_score":0.0060201883},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048744526,0.0006760108,0.9474753,0.00018064119,0.000055385823,0.00008673849,0.000046937694,0.000278809,0.0024555826],"genre_scores_gemma":[0.7782741,0.0008832096,0.21889792,0.000106698295,0.000096818505,0.00017287326,0.00010275137,0.00004991652,0.0014156604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989485,0.00051026663,0.000048751754,0.000104127495,0.0002883848,0.00010001055],"domain_scores_gemma":[0.99790764,0.0013776508,0.00022842307,0.00021890418,0.00019335939,0.00007405945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014998713,0.0006357303,0.0006670182,0.00061882514,0.0007695272,0.0006473631,0.00077522546,0.0004326146,0.00050223403],"category_scores_gemma":[0.003133465,0.00042853615,0.00038599403,0.0013145811,0.0009426617,0.00085860596,0.0006359378,0.000553363,0.00012811809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092619026,0.0000460058,0.000476778,0.00007718538,0.000027788727,0.000089002315,0.00009686739,0.9261913,0.005086027,0.029179635,0.00076444953,0.037872396],"study_design_scores_gemma":[0.000015807502,0.00005404116,0.00010548655,0.0000037561433,0.000006605616,0.00003811441,0.00001750794,0.981128,0.0010805918,0.016812947,0.0007307739,0.0000063681964],"about_ca_topic_score_codex":0.0024962458,"about_ca_topic_score_gemma":0.0024776042,"teacher_disagreement_score":0.0024962458,"about_ca_system_score_codex":0.00095123425,"about_ca_system_score_gemma":0.0013002539,"threshold_uncertainty_score":0.007932186},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056201033,0.0010614503,0.93823385,0.00028878392,0.000073618656,0.00008468631,0.000059166097,0.00023729898,0.003760182],"genre_scores_gemma":[0.8976832,0.0005207298,0.0990231,0.00009581629,0.000052031955,0.00014098878,0.00006003136,0.000008055098,0.0024160983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941075,0.0001952592,0.000032936954,0.000095883035,0.00018739305,0.000077871744],"domain_scores_gemma":[0.99936026,0.00019874609,0.000115022565,0.00013663802,0.00015841174,0.00003091141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006690577,0.000719666,0.0007532688,0.00043123076,0.0005368016,0.00049294863,0.0015955945,0.00081795035,0.0005620678],"category_scores_gemma":[0.0012058526,0.000260733,0.00040323645,0.00064438814,0.0005773429,0.0009850455,0.00088498654,0.00036887525,0.00036246754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006023204,0.00026026557,0.001289301,0.00056103145,0.00018660314,0.001513593,0.0009920191,0.43728283,0.17739397,0.12556079,0.0043864693,0.24997087],"study_design_scores_gemma":[0.000086495114,0.00040747455,0.00023728983,0.000021104926,0.00008009506,0.0008123811,0.000050266965,0.9710786,0.009579142,0.013449945,0.004140384,0.000056866196],"about_ca_topic_score_codex":0.00097153906,"about_ca_topic_score_gemma":0.0012665398,"teacher_disagreement_score":0.0015955945,"about_ca_system_score_codex":0.00041689313,"about_ca_system_score_gemma":0.0004901946,"threshold_uncertainty_score":0.0035383701},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62103665,0.0019561676,0.32818645,0.00037762977,0.00016080726,0.00007959345,0.00021487988,0.00068594445,0.047301866],"genre_scores_gemma":[0.9906453,0.00047166122,0.0071423682,0.00009527349,0.000017876366,0.00002330704,0.000088288965,0.00007506562,0.0014408414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815375,0.0004584698,0.00007629788,0.00016889581,0.0007320892,0.0004104397],"domain_scores_gemma":[0.988586,0.007939235,0.0006869492,0.0007274433,0.0018348019,0.0002255387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016419439,0.0007538606,0.00067119853,0.0006987499,0.0007793274,0.0009534849,0.00090469414,0.00061542407,0.0018040669],"category_scores_gemma":[0.008715326,0.00033569016,0.00058466825,0.0007699295,0.0008376074,0.0013890114,0.0009671481,0.0008064989,0.00043612774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039648026,0.00011115604,0.008604584,0.00019123996,0.00014371827,0.00085490453,0.00031918605,0.9048566,0.02891314,0.015601615,0.0008856248,0.039121743],"study_design_scores_gemma":[0.000036340338,0.0006933208,0.007817389,0.000054559758,0.00025627686,0.0012638075,0.00045139412,0.93942535,0.037565112,0.00876105,0.0036035106,0.00007187356],"about_ca_topic_score_codex":0.003072469,"about_ca_topic_score_gemma":0.003730462,"teacher_disagreement_score":0.003072469,"about_ca_system_score_codex":0.0013388393,"about_ca_system_score_gemma":0.00073648326,"threshold_uncertainty_score":0.009714007},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25994164,0.0031501343,0.6979009,0.000740308,0.000046107354,0.00007733814,0.00018536735,0.0004315013,0.03752674],"genre_scores_gemma":[0.98788327,0.0005909947,0.009940705,0.000051065013,0.000059623326,0.00003903643,0.000065291475,0.00002257558,0.0013474923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968035,0.0012559474,0.000067534624,0.00026597624,0.001307039,0.00030001235],"domain_scores_gemma":[0.99008304,0.00714081,0.0007675099,0.0006882861,0.0012122485,0.00010813477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028717893,0.0011141055,0.00086625083,0.0008584199,0.00044205683,0.0013129364,0.0009258038,0.00097154785,0.0015144482],"category_scores_gemma":[0.010883597,0.0003614005,0.0004648334,0.0015831112,0.0013051772,0.0012754379,0.0014532607,0.00057397754,0.00038097418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002821788,0.000045493467,0.0015451502,0.0001107782,0.00009642823,0.00015137543,0.00012722799,0.93264157,0.0075295125,0.030370407,0.0005388461,0.026561128],"study_design_scores_gemma":[0.000024858102,0.00019622144,0.0009607712,0.000014967691,0.000041469924,0.00018236328,0.00003195468,0.9844201,0.002961552,0.0106076365,0.0005376378,0.000020523561],"about_ca_topic_score_codex":0.0012737596,"about_ca_topic_score_gemma":0.0007058013,"teacher_disagreement_score":0.0028717893,"about_ca_system_score_codex":0.0019377881,"about_ca_system_score_gemma":0.0007879531,"threshold_uncertainty_score":0.015187681},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040088566,0.00024980446,0.99355525,0.00013513055,0.000014927429,0.000026423932,0.0000330244,0.000052137337,0.001924484],"genre_scores_gemma":[0.5805996,0.0014361946,0.40778342,0.00022215131,0.000086755936,0.0004952231,0.00018808122,0.00012971499,0.009058861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899477,0.00054737355,0.000034683326,0.00012525826,0.00018969268,0.00010825983],"domain_scores_gemma":[0.99836403,0.0012102077,0.00013117952,0.000077024364,0.00016435704,0.000053213982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018843345,0.0012459002,0.0011465538,0.00057528407,0.00038189616,0.0014636925,0.001097527,0.0013035422,0.00333413],"category_scores_gemma":[0.0043293266,0.00078525953,0.0005249537,0.0011010241,0.001319499,0.0023679729,0.0012957489,0.0010589997,0.0007395927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056138182,0.000045496003,0.00020827692,0.00008709433,0.000020357124,0.00006705265,0.000067552006,0.9069595,0.002054227,0.062639914,0.001379225,0.026415206],"study_design_scores_gemma":[0.00001172042,0.000023991335,0.000049570877,0.000008384974,0.0000040904324,0.000021686501,0.000015316033,0.9741228,0.0003456731,0.024850104,0.0005367276,0.000009883287],"about_ca_topic_score_codex":0.0018361185,"about_ca_topic_score_gemma":0.0025406447,"teacher_disagreement_score":0.00333413,"about_ca_system_score_codex":0.0015395685,"about_ca_system_score_gemma":0.0011460405,"threshold_uncertainty_score":0.011170447},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044004455,0.0010690115,0.952074,0.00013681599,0.0000980382,0.000120644836,0.000025903839,0.0004385432,0.002032616],"genre_scores_gemma":[0.7948862,0.0007202009,0.20022628,0.00015985908,0.000075006654,0.00015506356,0.00005933509,0.0000236435,0.0036944489],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955994,0.00013955537,0.000017957458,0.00007231157,0.0001736816,0.000036472433],"domain_scores_gemma":[0.99939895,0.00021432323,0.00006708122,0.00012990301,0.00015882723,0.00003092316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089430285,0.00041626743,0.0003530116,0.0003138276,0.000484002,0.00028032027,0.0011794526,0.0005859712,0.0006275938],"category_scores_gemma":[0.0011882053,0.00016527098,0.0004091343,0.00032434153,0.00038946627,0.0006862064,0.00044949708,0.0005175977,0.00028056678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038706165,0.00038418398,0.0016407184,0.00045539343,0.00023497935,0.00094423624,0.000842396,0.302975,0.19265856,0.13079959,0.0042096307,0.36446822],"study_design_scores_gemma":[0.00004635444,0.00054301927,0.00048451868,0.000010176379,0.000067666224,0.00061740587,0.00004319036,0.9671449,0.012954929,0.009274664,0.008765961,0.000047179794],"about_ca_topic_score_codex":0.0008243977,"about_ca_topic_score_gemma":0.0011397337,"teacher_disagreement_score":0.0011794526,"about_ca_system_score_codex":0.00027599366,"about_ca_system_score_gemma":0.00047050498,"threshold_uncertainty_score":0.0047296286},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09157865,0.0059214607,0.893848,0.00032018163,0.00007186476,0.000043676355,0.000075523356,0.00017825858,0.007962325],"genre_scores_gemma":[0.951687,0.0033932517,0.0415785,0.00006883803,0.00007073678,0.00006507144,0.0000419569,0.000018597642,0.003075948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927264,0.00034185415,0.000018620067,0.0000977531,0.00017468138,0.00009458676],"domain_scores_gemma":[0.9983103,0.0011833261,0.00018683466,0.00011302447,0.00018039225,0.000026056387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010403815,0.0007199507,0.0007012629,0.000558534,0.00046933067,0.0011451304,0.0007667851,0.0011083263,0.00073975767],"category_scores_gemma":[0.0024792217,0.0003816694,0.00038015065,0.0008840338,0.0010072121,0.0010557073,0.000519921,0.0004576993,0.00021906827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007022688,0.000016133215,0.00050063053,0.00013765515,0.000050921284,0.00043580838,0.00012681786,0.9134323,0.0054998137,0.059570216,0.0006837739,0.019475777],"study_design_scores_gemma":[0.000014836514,0.00011419197,0.0003981497,0.000021092674,0.000031900083,0.00025312402,0.000057446494,0.96451914,0.0014184266,0.03136741,0.0017819165,0.000022392813],"about_ca_topic_score_codex":0.0020925645,"about_ca_topic_score_gemma":0.0018780429,"teacher_disagreement_score":0.0020925645,"about_ca_system_score_codex":0.0011567891,"about_ca_system_score_gemma":0.00044356083,"threshold_uncertainty_score":0.008393168},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051902406,0.0015010354,0.9435569,0.00041614866,0.000048382903,0.000036667665,0.000028017423,0.000086137756,0.0024243183],"genre_scores_gemma":[0.92458194,0.0012495575,0.072971314,0.00007090441,0.000048546808,0.000082209066,0.00003450642,0.000017969362,0.0009431795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993125,0.00036297517,0.000021796108,0.000047443365,0.00019006399,0.000065219014],"domain_scores_gemma":[0.9983229,0.0010797387,0.0001812922,0.00018447917,0.00019923058,0.000032340457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012422216,0.00045157055,0.00048043893,0.00044917926,0.000344772,0.00057030784,0.0009165783,0.0006571167,0.0005429946],"category_scores_gemma":[0.004681767,0.000205456,0.00029082442,0.000723978,0.00078358286,0.0012100195,0.000808632,0.0005454529,0.00012526989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007902896,0.000038312977,0.000654494,0.00011104354,0.00004364011,0.000112059606,0.00015661126,0.8741373,0.010698917,0.06375145,0.000741374,0.049475823],"study_design_scores_gemma":[0.000009834654,0.000051895633,0.00016450897,0.00000894455,0.000010576612,0.000048024274,0.000017864628,0.9800729,0.0019155798,0.016912142,0.0007774986,0.0000102684635],"about_ca_topic_score_codex":0.0010228822,"about_ca_topic_score_gemma":0.001262971,"teacher_disagreement_score":0.0012422216,"about_ca_system_score_codex":0.00066839176,"about_ca_system_score_gemma":0.0004970237,"threshold_uncertainty_score":0.0065695643},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06890608,0.0017463556,0.9259109,0.00015691246,0.00002529202,0.0000467848,0.00009403724,0.00021503241,0.002898626],"genre_scores_gemma":[0.92739934,0.0012652958,0.06933657,0.000029266324,0.000029223349,0.00006683335,0.00010132163,0.00002826059,0.001743854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995043,0.00023649563,0.000021301057,0.000043570344,0.00014525649,0.000049001002],"domain_scores_gemma":[0.9993267,0.000448158,0.000080416314,0.000045399567,0.000088010616,0.000011356789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007170044,0.00077902677,0.00051113026,0.0004172973,0.00023265177,0.0006421461,0.00047845682,0.00036695265,0.00047936596],"category_scores_gemma":[0.0021072698,0.00030133,0.00022261344,0.00044892885,0.0004337615,0.00071429205,0.00040201758,0.00027278092,0.00019732288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037351318,0.000015140512,0.00019507635,0.000048615057,0.000019450521,0.000041421416,0.000034758792,0.96699756,0.003046727,0.010462638,0.0003322648,0.018769061],"study_design_scores_gemma":[0.000006074391,0.000037313777,0.00010613944,0.0000034424518,0.000009410192,0.00002218949,0.0000124778635,0.9886052,0.0012690732,0.009443326,0.00048037522,0.0000049901],"about_ca_topic_score_codex":0.0012700853,"about_ca_topic_score_gemma":0.0021194485,"teacher_disagreement_score":0.0012700853,"about_ca_system_score_codex":0.0007349993,"about_ca_system_score_gemma":0.00053933205,"threshold_uncertainty_score":0.0053328276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24334143,0.0008286449,0.75271297,0.00018878172,0.00006306232,0.000051957915,0.0000341352,0.0002425145,0.0025366002],"genre_scores_gemma":[0.9548184,0.00015517484,0.044254642,0.000042374773,0.000028499964,0.000026271078,0.000020334333,0.000006135733,0.0006481896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994684,0.00029037445,0.000029248265,0.0000752946,0.00009211783,0.000044619166],"domain_scores_gemma":[0.99882144,0.0005372994,0.00012598884,0.00029127448,0.00017781867,0.000046232508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006452967,0.00042870938,0.00044445533,0.0003177156,0.00027134703,0.00042672417,0.00059331075,0.00034444232,0.0004975003],"category_scores_gemma":[0.0018011626,0.0001550316,0.000317277,0.00037529191,0.00032291334,0.0005125131,0.0005012476,0.00032531176,0.0002498454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001100892,0.00017217136,0.006862986,0.00019159567,0.00029650205,0.00079886086,0.0005478965,0.34807682,0.24455562,0.02789602,0.001989553,0.36751112],"study_design_scores_gemma":[0.00005894195,0.00044366918,0.0013115925,0.000014931567,0.00007127109,0.000549954,0.000046957324,0.9466646,0.041935895,0.006480661,0.0023941293,0.000027386412],"about_ca_topic_score_codex":0.0002082112,"about_ca_topic_score_gemma":0.00025874,"teacher_disagreement_score":0.0006452967,"about_ca_system_score_codex":0.00022729093,"about_ca_system_score_gemma":0.00016896985,"threshold_uncertainty_score":0.003412664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4035606,0.0022543136,0.5747357,0.00063320325,0.000057300233,0.00007816916,0.0001715163,0.0004434612,0.01806575],"genre_scores_gemma":[0.9930356,0.00036639808,0.0053163064,0.000041727748,0.00002256621,0.00004060837,0.000031295378,0.00003203166,0.0011132978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840444,0.0005789631,0.000033847467,0.00015164523,0.00047309234,0.00035804082],"domain_scores_gemma":[0.99209714,0.0059902645,0.00061809283,0.00035274218,0.00081625726,0.00012549128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002741458,0.0010286729,0.0011541013,0.0012315189,0.00060119416,0.0013648825,0.0015629699,0.0009326378,0.0012918556],"category_scores_gemma":[0.012096316,0.00055453647,0.00063851493,0.0010961128,0.0018109883,0.0015255023,0.0011483036,0.0009381562,0.00031302142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012406119,0.000038112412,0.00072776846,0.000053322445,0.000036235357,0.0002340768,0.00017701731,0.9636279,0.003432735,0.028264243,0.00030028494,0.0029842583],"study_design_scores_gemma":[0.0000050613085,0.00001897673,0.00016507054,0.0000046138134,0.000010209684,0.000040276973,0.00002013143,0.9960049,0.00046050837,0.0031948122,0.000067454974,0.000008024746],"about_ca_topic_score_codex":0.0066607143,"about_ca_topic_score_gemma":0.0020378025,"teacher_disagreement_score":0.0066607143,"about_ca_system_score_codex":0.0023836643,"about_ca_system_score_gemma":0.0012637881,"threshold_uncertainty_score":0.017294765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022068607,0.0007693553,0.97408795,0.00014461445,0.00003408349,0.000023103801,0.000014281185,0.000055039265,0.0028028656],"genre_scores_gemma":[0.9139086,0.0011861412,0.081735834,0.000092129594,0.00009545434,0.00011692322,0.000035755733,0.000028267124,0.002800933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992212,0.00041876917,0.000017306029,0.00007137352,0.00019685466,0.00007447899],"domain_scores_gemma":[0.9984118,0.0011001833,0.00014541329,0.000113862436,0.00020173067,0.000026951779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001203678,0.0007615914,0.0005119335,0.00036065123,0.0003406834,0.00074187695,0.00084845215,0.00082608085,0.00075172965],"category_scores_gemma":[0.0037094797,0.00027255813,0.00038778782,0.0006794073,0.0011589961,0.0008509171,0.00061664736,0.0006314134,0.00022874623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039024442,0.000022381339,0.0003869526,0.00007443773,0.0000244096,0.00023075166,0.00012916139,0.8739049,0.004290624,0.10713761,0.00068568747,0.013074032],"study_design_scores_gemma":[0.0000050132767,0.000024915329,0.000059287246,0.000006127645,0.0000065408653,0.000046923018,0.000017305778,0.98631567,0.00045989145,0.012494431,0.00055838673,0.0000055523465],"about_ca_topic_score_codex":0.0014240355,"about_ca_topic_score_gemma":0.0014082306,"teacher_disagreement_score":0.0014240355,"about_ca_system_score_codex":0.0010721224,"about_ca_system_score_gemma":0.0005921021,"threshold_uncertainty_score":0.0077788234},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3715123,0.0007464807,0.5936145,0.00053714303,0.00009883336,0.000088676155,0.00006916467,0.00064230425,0.032690614],"genre_scores_gemma":[0.9858283,0.0003305682,0.011426164,0.00009392306,0.00007253466,0.00004423738,0.0000136032395,0.000037133887,0.0021536623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995808,0.00010122569,0.000009118412,0.00006317818,0.000110570385,0.00013501103],"domain_scores_gemma":[0.998304,0.0010658108,0.00017481923,0.00018744885,0.00013639573,0.00013156039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006785797,0.0007233615,0.0005687794,0.0007419155,0.0005943734,0.0012039922,0.00057653646,0.00057334744,0.001063937],"category_scores_gemma":[0.0035211775,0.00027077974,0.00037111275,0.00046088238,0.0014631678,0.0018024439,0.001075534,0.00056981255,0.00027389894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002105664,0.00020908185,0.0017190618,0.00012461722,0.00012248426,0.00065549935,0.00065408024,0.6445899,0.041291248,0.27067792,0.0033651127,0.036380474],"study_design_scores_gemma":[0.000030040434,0.00007076499,0.0006677202,0.000010270281,0.000037452544,0.00010461978,0.00010825592,0.91273206,0.004958369,0.07945098,0.0018157146,0.000013782504],"about_ca_topic_score_codex":0.0015526969,"about_ca_topic_score_gemma":0.0009600391,"teacher_disagreement_score":0.0015526969,"about_ca_system_score_codex":0.00077061914,"about_ca_system_score_gemma":0.00043044344,"threshold_uncertainty_score":0.0055912137},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6480983,0.0012355571,0.32239282,0.0009509103,0.00009552946,0.00009033901,0.00026901532,0.0010020805,0.02586561],"genre_scores_gemma":[0.9925914,0.00011063433,0.006404783,0.000035882065,0.000009064243,0.000024662866,0.00005613689,0.000018560313,0.0007488057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998825,0.00044910246,0.000029733597,0.00011015789,0.00031510883,0.0002709102],"domain_scores_gemma":[0.9930561,0.004996843,0.00046545858,0.0006108196,0.00074113975,0.0001295263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024582515,0.00041863942,0.00043835447,0.00062649057,0.00056382176,0.00072549505,0.00062733033,0.0006853042,0.0009882372],"category_scores_gemma":[0.0094105,0.00015858057,0.00016358492,0.00069572654,0.0013343183,0.0010934976,0.001028937,0.000562719,0.00018462553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070398237,0.00006585387,0.0015093053,0.000082417566,0.00003511292,0.00015271686,0.00020939158,0.8533178,0.01976237,0.09232859,0.0014660148,0.03036644],"study_design_scores_gemma":[0.00002583114,0.00011559162,0.00044031758,0.000016861304,0.000016767815,0.00008509465,0.000035375164,0.9575365,0.016013658,0.02505922,0.0006315643,0.00002318602],"about_ca_topic_score_codex":0.0025275743,"about_ca_topic_score_gemma":0.0016430583,"teacher_disagreement_score":0.0025275743,"about_ca_system_score_codex":0.0019427079,"about_ca_system_score_gemma":0.0012709947,"threshold_uncertainty_score":0.014095426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06259863,0.00036046747,0.93373907,0.000118456956,0.000049398575,0.00014259381,0.00005902466,0.000329001,0.0026034573],"genre_scores_gemma":[0.8243507,0.00018316245,0.17288658,0.000060324237,0.000046837675,0.0002035252,0.00007690566,0.000018275618,0.002173535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996692,0.00013151621,0.000018557135,0.000054640852,0.00008175901,0.00004430381],"domain_scores_gemma":[0.9993262,0.00021223126,0.00012390039,0.00014261855,0.00012417306,0.00007092002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005235441,0.00034684516,0.00039158855,0.00045294102,0.00076911156,0.00037652315,0.0008423526,0.00037233782,0.000908372],"category_scores_gemma":[0.0015512258,0.00016305436,0.00017135867,0.0005409688,0.0005292756,0.00058957445,0.00066287233,0.00039834538,0.0004310503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007102833,0.00029951337,0.0015439522,0.00017563156,0.000075553326,0.00034666777,0.00060622866,0.27142987,0.113419354,0.097725786,0.0046645976,0.5090026],"study_design_scores_gemma":[0.00009106711,0.0005417099,0.0006452746,0.00001493999,0.00004394685,0.0004880925,0.00004511559,0.9613754,0.018091794,0.0114671895,0.0071436395,0.00005185004],"about_ca_topic_score_codex":0.0014299109,"about_ca_topic_score_gemma":0.0021937713,"teacher_disagreement_score":0.0014299109,"about_ca_system_score_codex":0.00045257204,"about_ca_system_score_gemma":0.0006731825,"threshold_uncertainty_score":0.0032836795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07640046,0.00088384957,0.916927,0.0002730945,0.000024874395,0.000051557316,0.000057965844,0.00012401784,0.0052572717],"genre_scores_gemma":[0.96742576,0.00049592,0.029510647,0.000046819398,0.000017678838,0.00010541702,0.000031276937,0.000026732561,0.0023397026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990746,0.000511047,0.000026694666,0.0001102937,0.00013115887,0.00014625551],"domain_scores_gemma":[0.99885714,0.0007873574,0.000119920456,0.00005541616,0.0001289187,0.00005124341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015176602,0.001092048,0.0007988171,0.00056869024,0.00032557765,0.0010905656,0.00094491075,0.0011673594,0.0007302013],"category_scores_gemma":[0.0037044112,0.0005008047,0.00027795782,0.0009902772,0.001009786,0.0011317703,0.00090687803,0.00041776197,0.00024392283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056691122,0.000024594157,0.00021555182,0.00002917466,0.000026355652,0.00008598608,0.000048956776,0.9718408,0.0013565996,0.015192442,0.0002637882,0.010858978],"study_design_scores_gemma":[0.000017495875,0.000045027387,0.000071555434,0.0000044458366,0.000012011776,0.000022157477,0.000023197108,0.9864976,0.0005695451,0.01232966,0.00040087051,0.0000065402187],"about_ca_topic_score_codex":0.0020158591,"about_ca_topic_score_gemma":0.001769491,"teacher_disagreement_score":0.0020158591,"about_ca_system_score_codex":0.0009864527,"about_ca_system_score_gemma":0.00064693013,"threshold_uncertainty_score":0.008026242},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029708067,0.00046886478,0.96791726,0.00012848794,0.00002322323,0.000052513744,0.000017144946,0.000082154045,0.0016022815],"genre_scores_gemma":[0.92470187,0.00045430238,0.07333773,0.00006142049,0.000032416865,0.000115894785,0.000015369216,0.000018625862,0.0012623351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945194,0.000247808,0.000023733899,0.00007749267,0.00015146074,0.00004763924],"domain_scores_gemma":[0.99900204,0.00070919533,0.00010267706,0.000041514686,0.00012319403,0.000021432179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010447397,0.0006204173,0.000718205,0.00022029002,0.00028602907,0.00080060563,0.0006100066,0.000626995,0.0012073991],"category_scores_gemma":[0.0027414162,0.00039343172,0.0002848143,0.00031476008,0.0007724877,0.0009740002,0.00046335338,0.00048489877,0.00020677391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001242328,0.000049546965,0.00028851928,0.000131223,0.000026349602,0.00013432153,0.00012012347,0.9599117,0.008464664,0.0075320615,0.00024311703,0.022974059],"study_design_scores_gemma":[0.000014237019,0.00006627591,0.000050565483,0.0000058086366,0.000005994149,0.000021679007,0.000007787461,0.99753416,0.00076552725,0.0013583854,0.00016521494,0.0000043115683],"about_ca_topic_score_codex":0.0018065271,"about_ca_topic_score_gemma":0.0015388591,"teacher_disagreement_score":0.0018065271,"about_ca_system_score_codex":0.0006686577,"about_ca_system_score_gemma":0.0005470513,"threshold_uncertainty_score":0.0055251718},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015426844,0.0017415793,0.97900945,0.00029410288,0.000049113536,0.00003775079,0.000025896867,0.0001431264,0.0032720934],"genre_scores_gemma":[0.84447634,0.0024046188,0.14841598,0.00014891617,0.00015415522,0.00019117678,0.000046690697,0.0000850968,0.004077122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983455,0.0010321455,0.00004139895,0.00020670991,0.0002472022,0.00012702133],"domain_scores_gemma":[0.99901974,0.00068641343,0.00010747506,0.00006733993,0.000088333756,0.000030751242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014618872,0.001113251,0.0011489491,0.00059900014,0.00049129693,0.001448939,0.0012262587,0.001603106,0.0012544141],"category_scores_gemma":[0.0033878412,0.0005726587,0.0005018957,0.001286404,0.0014748801,0.00213941,0.0010868168,0.0008266317,0.0003899929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050191364,0.00001933443,0.00018144933,0.00007210029,0.00002458337,0.00015981724,0.00006727007,0.9340943,0.0012783605,0.044682648,0.0005414987,0.0188285],"study_design_scores_gemma":[0.000012831333,0.000028107605,0.000039808212,0.000004842016,0.0000071380077,0.000044973473,0.000019203015,0.97596526,0.0003441775,0.022720214,0.00080598943,0.000007410952],"about_ca_topic_score_codex":0.0012185798,"about_ca_topic_score_gemma":0.0009740434,"teacher_disagreement_score":0.001603106,"about_ca_system_score_codex":0.0010744419,"about_ca_system_score_gemma":0.0005697368,"threshold_uncertainty_score":0.0077956915},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55121875,0.00076474267,0.44126922,0.0002799717,0.00003710128,0.000040637726,0.000059483966,0.00014923154,0.0061807553],"genre_scores_gemma":[0.99406415,0.00016861656,0.005273114,0.00002562319,0.000014076335,0.0000125600045,0.0000099718345,0.000006221295,0.0004256685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998602,0.00050770625,0.000047910973,0.00014295909,0.0003579795,0.00034157897],"domain_scores_gemma":[0.98609805,0.0109389415,0.0012382276,0.00073712366,0.00079660356,0.00019102209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023091831,0.00067791616,0.00082460704,0.00053698226,0.0006961859,0.0011243284,0.000762776,0.00079301617,0.00023697483],"category_scores_gemma":[0.0110296,0.00040068652,0.00022849144,0.00082932046,0.001235752,0.001645727,0.0014718524,0.0005043098,0.000087165376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000444137,0.000072358525,0.0055985893,0.00013481968,0.00011026667,0.0019156891,0.00083238696,0.91307133,0.014303684,0.030853987,0.00051104015,0.03215164],"study_design_scores_gemma":[0.000017861415,0.00013034127,0.0010691924,0.000010822209,0.00004022687,0.0005289864,0.00023530962,0.9794939,0.00412845,0.013763982,0.00055720715,0.00002370176],"about_ca_topic_score_codex":0.0024004984,"about_ca_topic_score_gemma":0.0035262024,"teacher_disagreement_score":0.0024004984,"about_ca_system_score_codex":0.0006943141,"about_ca_system_score_gemma":0.00095784815,"threshold_uncertainty_score":0.012212276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45444718,0.0012536399,0.5357832,0.00017171746,0.00003854955,0.000081132544,0.00011458371,0.00019317819,0.007916813],"genre_scores_gemma":[0.98842686,0.00037130903,0.010457414,0.000019081379,0.000015529911,0.000017453323,0.000012626474,0.0000063508255,0.000673448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988851,0.00051188574,0.000038408478,0.000104395505,0.00028626705,0.00017390915],"domain_scores_gemma":[0.9963284,0.0025540602,0.000559232,0.00020416323,0.0002846103,0.000069623675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015910411,0.0009794482,0.00084693317,0.00050111813,0.0005175918,0.0012332569,0.0006105105,0.0009896623,0.00049982866],"category_scores_gemma":[0.0033620798,0.0003337379,0.0006103459,0.00061993644,0.0013569193,0.0011386262,0.00064403936,0.00042235808,0.00016451643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014283754,0.0000377529,0.000750427,0.000083861894,0.000044653974,0.00047014296,0.00012708317,0.96082705,0.011582956,0.020947073,0.00013364921,0.004852605],"study_design_scores_gemma":[0.000010871341,0.00012558844,0.0002459409,0.0000050731023,0.00001786025,0.00011373998,0.000029829958,0.9924204,0.002869428,0.004044904,0.00010213074,0.000014321458],"about_ca_topic_score_codex":0.0018670319,"about_ca_topic_score_gemma":0.0013010745,"teacher_disagreement_score":0.0018670319,"about_ca_system_score_codex":0.0007364759,"about_ca_system_score_gemma":0.00045654064,"threshold_uncertainty_score":0.008414328},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30329725,0.0055541773,0.66478544,0.0004910173,0.00009718357,0.00005854246,0.00046443523,0.00042505967,0.024826879],"genre_scores_gemma":[0.9894419,0.0020830184,0.0070588035,0.000030133415,0.00006357053,0.000049209306,0.00014558075,0.00003344087,0.0010943597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991647,0.0002755119,0.000032691478,0.00005871881,0.00025245166,0.00021608644],"domain_scores_gemma":[0.99292177,0.0055560716,0.00037911558,0.00034925365,0.00071938557,0.000074440184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013721393,0.00087761914,0.0006585082,0.0012294387,0.0004950617,0.0009971353,0.000676087,0.0004324008,0.0016145486],"category_scores_gemma":[0.008865069,0.0003139401,0.0003551644,0.001280493,0.0018917908,0.0015308894,0.0008482683,0.00056533655,0.0003443256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006407725,0.000012659515,0.00059452566,0.00009337075,0.000038686652,0.00018601444,0.00014121195,0.895686,0.0035903791,0.08414487,0.0007749811,0.014673284],"study_design_scores_gemma":[0.0000054747875,0.000033339937,0.00051898975,0.000041509717,0.000023719786,0.00013160559,0.00004776618,0.9574056,0.002757187,0.03816969,0.0008329339,0.00003208063],"about_ca_topic_score_codex":0.0031011647,"about_ca_topic_score_gemma":0.0018220511,"teacher_disagreement_score":0.0031011647,"about_ca_system_score_codex":0.0013871758,"about_ca_system_score_gemma":0.0008412131,"threshold_uncertainty_score":0.010064721},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016635358,0.0045749806,0.93853635,0.0013870434,0.0006552863,0.00016807996,0.00041974435,0.0005701314,0.037053015],"genre_scores_gemma":[0.670906,0.008868022,0.29922074,0.0013468605,0.0013394516,0.0009527351,0.0007020719,0.00037722537,0.016286934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99217284,0.002496034,0.00040413387,0.0011989662,0.0024594583,0.00126863],"domain_scores_gemma":[0.989297,0.0062621143,0.000831622,0.001552662,0.0016872883,0.00036935305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061665014,0.0031331882,0.0020897742,0.0027271283,0.0017259783,0.004321683,0.00303271,0.0024448796,0.0048060063],"category_scores_gemma":[0.017636325,0.0009865556,0.0017327005,0.00272269,0.0030526838,0.006237699,0.0048154984,0.0050030416,0.002154518],"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.00045834557,0.00012921871,0.00040459467,0.0006023914,0.0001397899,0.000770142,0.00057781115,0.116161026,0.013248543,0.7989579,0.013151021,0.05539923],"study_design_scores_gemma":[0.00014030628,0.00025872982,0.0002704402,0.00030588263,0.00015115342,0.0017500201,0.00014368397,0.64354885,0.013182643,0.31634325,0.023641557,0.0002634534],"about_ca_topic_score_codex":0.0011695871,"about_ca_topic_score_gemma":0.000760506,"teacher_disagreement_score":0.0061665014,"about_ca_system_score_codex":0.0030918932,"about_ca_system_score_gemma":0.0022731847,"threshold_uncertainty_score":0.032611966},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020731991,0.00037809293,0.976343,0.00016642413,0.000019399375,0.000043862077,0.000019472089,0.000095327836,0.0022025264],"genre_scores_gemma":[0.86826134,0.00038392795,0.12887277,0.00013420678,0.000046670986,0.00022607876,0.000032597578,0.000080650076,0.0019617043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821305,0.0010152435,0.000076784054,0.00017991647,0.00030700123,0.00020800058],"domain_scores_gemma":[0.99722964,0.0016343094,0.0003391694,0.00024322612,0.00044458703,0.00010904128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046111825,0.0011330561,0.0008527775,0.0006663561,0.0005816197,0.0013518229,0.0012472639,0.00077242707,0.00087606313],"category_scores_gemma":[0.008984189,0.00036963736,0.00029225615,0.00085496774,0.0011519849,0.0020571356,0.0021644393,0.0007481028,0.0002022775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008036821,0.00007672549,0.0005399334,0.00008891642,0.00003657282,0.00009061965,0.00021439437,0.8431037,0.0058273785,0.107302584,0.0012841666,0.04135464],"study_design_scores_gemma":[0.000007955756,0.0000435048,0.00009410883,0.000006053424,0.000005773574,0.00002298507,0.000021749422,0.97371405,0.0011736784,0.024442034,0.00046257713,0.0000055624614],"about_ca_topic_score_codex":0.0012568927,"about_ca_topic_score_gemma":0.0012722022,"teacher_disagreement_score":0.0046111825,"about_ca_system_score_codex":0.0015928495,"about_ca_system_score_gemma":0.0010741159,"threshold_uncertainty_score":0.024386525},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38824707,0.006389795,0.48133498,0.0013915845,0.0005034019,0.00014988969,0.0005218982,0.00029788038,0.121163525],"genre_scores_gemma":[0.9892537,0.0008692137,0.005970641,0.000060473696,0.00009404139,0.000033414013,0.0000462461,0.000030686413,0.0036416282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991105,0.0002530044,0.000015497715,0.00008921068,0.00022857849,0.0003032395],"domain_scores_gemma":[0.9980123,0.0011750158,0.00015776041,0.00015813834,0.0004193253,0.000077387915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085006095,0.00089093915,0.00055548735,0.00078119553,0.0006116623,0.0019706995,0.0012807949,0.001204061,0.0020610883],"category_scores_gemma":[0.005052708,0.00030071897,0.0005562079,0.0011215782,0.0012246112,0.0027361326,0.0008395611,0.00083504815,0.0002634914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029982253,0.00003814876,0.00063619664,0.000046703408,0.000020175698,0.00015938214,0.000028443883,0.95261157,0.0012760765,0.038975682,0.0005021693,0.00567539],"study_design_scores_gemma":[0.0000035274209,0.00003053586,0.00024316848,0.00001268127,0.000019260982,0.00005387502,0.000027318185,0.99025786,0.0009865997,0.006923168,0.0014312095,0.000010761489],"about_ca_topic_score_codex":0.013310386,"about_ca_topic_score_gemma":0.0065474208,"teacher_disagreement_score":0.013310386,"about_ca_system_score_codex":0.002523231,"about_ca_system_score_gemma":0.0016153413,"threshold_uncertainty_score":0.026465774},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04356208,0.0018346657,0.94936454,0.0008791777,0.00008719753,0.000092114584,0.000020733009,0.00012896881,0.004030512],"genre_scores_gemma":[0.9671948,0.00069699204,0.030873323,0.000076630124,0.00008429137,0.000114109105,0.000015123394,0.00000835491,0.00093632616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968002,0.0018955569,0.00016811305,0.00027989666,0.0006277689,0.00022843452],"domain_scores_gemma":[0.99489284,0.0031454256,0.0008793996,0.0003667684,0.0005374586,0.00017806314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033372466,0.0005886697,0.0007837827,0.0005585281,0.00097258005,0.0014860131,0.0009777169,0.001157703,0.00043522837],"category_scores_gemma":[0.01087536,0.00034587225,0.00038476806,0.0009000353,0.0018430505,0.0026014699,0.0016521503,0.0009936814,0.00012304068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021467448,0.00009660771,0.0027616061,0.0002851502,0.00015714305,0.0010311847,0.0014820686,0.6398524,0.005481772,0.23832375,0.0021727255,0.10814091],"study_design_scores_gemma":[0.00003329838,0.000084795065,0.0002786083,0.000020902839,0.000027615439,0.00013100605,0.00011582068,0.9266354,0.000784894,0.06980597,0.0020579614,0.00002368466],"about_ca_topic_score_codex":0.0025166315,"about_ca_topic_score_gemma":0.0018219887,"teacher_disagreement_score":0.0033372466,"about_ca_system_score_codex":0.0014089792,"about_ca_system_score_gemma":0.0010248276,"threshold_uncertainty_score":0.017649293},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030805998,0.0022681188,0.9564568,0.0005004098,0.00015147268,0.00027446318,0.0000706538,0.00030764958,0.009164364],"genre_scores_gemma":[0.8553938,0.0018398829,0.13590127,0.00029097046,0.0000896279,0.00060019817,0.00011318008,0.000021117507,0.005749785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998985,0.0003325681,0.00006523011,0.00015592639,0.00030445342,0.00015671426],"domain_scores_gemma":[0.9986565,0.0005343679,0.0001523462,0.00027822587,0.00032692507,0.000051600535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013862659,0.00084360514,0.0005934298,0.00078961655,0.0007852195,0.0010734372,0.0014894458,0.00096223183,0.0015183345],"category_scores_gemma":[0.0026518435,0.00023105813,0.00043896982,0.0009836537,0.0010964319,0.0014822616,0.0016851455,0.0007851764,0.00037531156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026777425,0.00016775624,0.0007614093,0.0007109803,0.00016441554,0.0012081513,0.0017127511,0.23016347,0.034482695,0.5375606,0.0074810497,0.18531893],"study_design_scores_gemma":[0.000155975,0.00037311588,0.00033774498,0.00007965975,0.0001172526,0.0010441002,0.00019477398,0.84077644,0.0074690958,0.12777182,0.021572443,0.00010757805],"about_ca_topic_score_codex":0.0015550405,"about_ca_topic_score_gemma":0.0016927272,"teacher_disagreement_score":0.0015550405,"about_ca_system_score_codex":0.0008700623,"about_ca_system_score_gemma":0.001078362,"threshold_uncertainty_score":0.0073313713},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14183183,0.0020229479,0.8476697,0.00026528593,0.00005954507,0.000042743257,0.00006325605,0.00022478226,0.007819938],"genre_scores_gemma":[0.9825143,0.0004364833,0.016131466,0.00003398828,0.00001756793,0.000023534014,0.000015627147,0.000008451641,0.00081862515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948573,0.00018238238,0.000022390743,0.00007310188,0.0001372929,0.00009905666],"domain_scores_gemma":[0.99859995,0.0009354849,0.0001727843,0.00007364406,0.00018578532,0.00003240427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008494525,0.00059858634,0.00049842015,0.00035168594,0.00032350648,0.0007302333,0.0006018927,0.00049399637,0.00080654386],"category_scores_gemma":[0.0034838812,0.00023611308,0.00025941437,0.00053874555,0.00064483413,0.00071063853,0.0005100476,0.00053374574,0.00015702832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016370414,0.00005033835,0.00065667264,0.00012386143,0.00003099041,0.00018260114,0.00018038,0.90740746,0.009890066,0.04751254,0.0005325957,0.033268914],"study_design_scores_gemma":[0.0000045063634,0.000026027172,0.00007926912,0.000005288487,0.0000042017145,0.000021750604,0.000011030462,0.9942966,0.0006410169,0.0047640027,0.00014089036,0.0000053583226],"about_ca_topic_score_codex":0.00238562,"about_ca_topic_score_gemma":0.002491111,"teacher_disagreement_score":0.00238562,"about_ca_system_score_codex":0.0012177153,"about_ca_system_score_gemma":0.00066713546,"threshold_uncertainty_score":0.008835137},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6761992,0.0032298423,0.30493814,0.00032220298,0.00012157442,0.00008436004,0.00009112313,0.0004943313,0.014519233],"genre_scores_gemma":[0.9780277,0.00031106768,0.021193523,0.00002280457,0.00002903937,0.000012208665,0.000027156484,0.0000072249627,0.00036932307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988417,0.00038978292,0.000048792404,0.00014836002,0.00041210564,0.00015922672],"domain_scores_gemma":[0.9970584,0.0016740514,0.000258249,0.00030902197,0.00064644805,0.000053798743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014927357,0.0007446322,0.00055625266,0.00055563083,0.00028550107,0.0006123535,0.0005313987,0.0007142152,0.0005057913],"category_scores_gemma":[0.0057651973,0.00012171133,0.00025343653,0.00067880057,0.00045673343,0.0010839641,0.00054463773,0.00029417162,0.00018314605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035182326,0.00040085017,0.013407542,0.00041802123,0.00019755776,0.000577624,0.00031103918,0.43005168,0.07236449,0.0100422595,0.0011913622,0.4675194],"study_design_scores_gemma":[0.000115038165,0.002365065,0.0034693426,0.00003832918,0.00020845784,0.0007121443,0.00009629561,0.9504695,0.038271762,0.0020200699,0.002187488,0.000046573863],"about_ca_topic_score_codex":0.00227814,"about_ca_topic_score_gemma":0.0023163853,"teacher_disagreement_score":0.00227814,"about_ca_system_score_codex":0.0004078063,"about_ca_system_score_gemma":0.0004414107,"threshold_uncertainty_score":0.007894456},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022088442,0.0017157742,0.96809053,0.0010744907,0.00013860723,0.00006201275,0.00010958712,0.00010219398,0.0066183065],"genre_scores_gemma":[0.9100368,0.0038913207,0.07963252,0.00044050266,0.0004835734,0.00020755926,0.0001650227,0.00009307046,0.005049606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987282,0.0005308433,0.000045057262,0.00017213802,0.00028371345,0.00024011511],"domain_scores_gemma":[0.99331266,0.005784202,0.00031135816,0.00016718972,0.00031287683,0.00011182403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020380558,0.0014882549,0.0016880463,0.0005986859,0.0007344637,0.0017707371,0.0010289086,0.0015733929,0.0033098261],"category_scores_gemma":[0.0081440685,0.0006730927,0.0005135449,0.001409945,0.0027636099,0.0029580053,0.0019393925,0.0020700563,0.0003258158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001567108,0.000051520266,0.00018444436,0.00015225726,0.000026849,0.00008866159,0.000079553916,0.89229935,0.001526881,0.08852333,0.0016230043,0.015287387],"study_design_scores_gemma":[0.00003702721,0.00004857147,0.000060129067,0.000012387939,0.0000069237676,0.00001804741,0.000019200195,0.9462917,0.00034410844,0.052734073,0.00041545718,0.0000124297485],"about_ca_topic_score_codex":0.0032893552,"about_ca_topic_score_gemma":0.0017423292,"teacher_disagreement_score":0.0033098261,"about_ca_system_score_codex":0.0011955041,"about_ca_system_score_gemma":0.0012498802,"threshold_uncertainty_score":0.011072457},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024235914,0.0023959016,0.9701835,0.00043224593,0.000091957125,0.000034707617,0.000019917987,0.00016661674,0.002439243],"genre_scores_gemma":[0.8215604,0.0030351644,0.17262481,0.00015120058,0.00021264255,0.000135251,0.000065420085,0.000035277153,0.0021798224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996873,0.0001294334,0.000012621974,0.000032176922,0.00011243836,0.000026047825],"domain_scores_gemma":[0.9992015,0.00045215807,0.00010052505,0.00009416628,0.00013346953,0.00001813361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007462113,0.00032408777,0.00028340932,0.00048014525,0.00025536187,0.00037778934,0.00088599103,0.00053365086,0.00042990193],"category_scores_gemma":[0.0022764574,0.0001504371,0.00021469913,0.00066722446,0.00056016725,0.00082952756,0.00053812924,0.0006248566,0.00009654128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000151217,0.00006562966,0.0007564385,0.00030850948,0.00009353939,0.00029302586,0.0002127247,0.51706165,0.048868906,0.20157883,0.0036751379,0.22693437],"study_design_scores_gemma":[0.000013040428,0.000078390374,0.00019307484,0.000018013612,0.000023566214,0.0001172588,0.000019035406,0.9493936,0.006165602,0.04086211,0.0030967887,0.000019532012],"about_ca_topic_score_codex":0.0008406534,"about_ca_topic_score_gemma":0.00076089066,"teacher_disagreement_score":0.00088599103,"about_ca_system_score_codex":0.00042287578,"about_ca_system_score_gemma":0.000431352,"threshold_uncertainty_score":0.003946364},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015041837,0.00064159033,0.98021233,0.00012223335,0.000037730333,0.00003350059,0.00003775884,0.000119383476,0.0037536442],"genre_scores_gemma":[0.8493443,0.0016386322,0.14319521,0.00009817804,0.000092538,0.00016765212,0.00006616705,0.000026478621,0.0053707804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926037,0.00034208948,0.000028027604,0.00010175704,0.00018109818,0.000086672044],"domain_scores_gemma":[0.9992617,0.00039496066,0.00011734965,0.00007011279,0.0001379741,0.000018011777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008432331,0.001312307,0.0006826304,0.00032266777,0.00032092916,0.001090352,0.0010632328,0.00082970114,0.0012380388],"category_scores_gemma":[0.0011600604,0.00038981525,0.0006761924,0.000556643,0.0005719472,0.0011487752,0.0005005596,0.0005768696,0.00043453003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016770758,0.00006209485,0.0010024172,0.0001800091,0.00011179599,0.00040843344,0.0001755726,0.8321994,0.017478753,0.085772015,0.0016394509,0.060802348],"study_design_scores_gemma":[0.000008882936,0.00007247646,0.00014322146,0.000008478994,0.000027283664,0.0001713679,0.0000182934,0.9885719,0.002120524,0.007729904,0.0011145545,0.000013104686],"about_ca_topic_score_codex":0.00076253834,"about_ca_topic_score_gemma":0.0013304923,"teacher_disagreement_score":0.001312307,"about_ca_system_score_codex":0.0008589677,"about_ca_system_score_gemma":0.0003353618,"threshold_uncertainty_score":0.0062322617},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15024514,0.0005815445,0.8457588,0.00024221791,0.00002773383,0.000056629102,0.000051560055,0.00025405994,0.0027823918],"genre_scores_gemma":[0.98074603,0.0003107111,0.018068194,0.000027402943,0.00002246512,0.000065015265,0.000030371397,0.000033787943,0.0006961245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990331,0.00038745836,0.000026838597,0.000093851704,0.00029938348,0.00015947396],"domain_scores_gemma":[0.9943228,0.0044245464,0.00039747992,0.00019986011,0.0005640602,0.00009129761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026590999,0.0006173404,0.0006488715,0.0010945888,0.0005872015,0.000990876,0.00091257767,0.0005959592,0.000853053],"category_scores_gemma":[0.011337578,0.00029686198,0.00040718474,0.0011887493,0.0015646098,0.0019316265,0.0007691266,0.00061452936,0.0001403971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017496664,0.00004061396,0.0011345275,0.00009585598,0.000033925302,0.00016269817,0.00022130263,0.889639,0.008040709,0.08632609,0.00040235824,0.013728007],"study_design_scores_gemma":[0.0000024563512,0.000024704883,0.000104626364,0.000003822696,0.0000045572137,0.000019355222,0.000017359973,0.98944783,0.00097389775,0.009296845,0.0001005824,0.0000040109485],"about_ca_topic_score_codex":0.0015582399,"about_ca_topic_score_gemma":0.0013082623,"teacher_disagreement_score":0.0026590999,"about_ca_system_score_codex":0.0025434787,"about_ca_system_score_gemma":0.0009849605,"threshold_uncertainty_score":0.018454313},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027777217,0.0003874018,0.9942028,0.00015288021,0.000051429623,0.000009183587,0.000012031429,0.00003308875,0.002373428],"genre_scores_gemma":[0.58136135,0.0047269566,0.39598307,0.00058038766,0.00089933054,0.00025549834,0.00022216441,0.00011512457,0.01585615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986046,0.00045501153,0.000059954302,0.00021086191,0.000551083,0.00011844558],"domain_scores_gemma":[0.99830085,0.0009785045,0.00010957028,0.00026550816,0.00029934128,0.000046243505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015215796,0.0009127903,0.00073505216,0.0005631912,0.00041542112,0.0011115707,0.0006971393,0.0012353436,0.0021649182],"category_scores_gemma":[0.0034764067,0.00027716736,0.0004623697,0.0011058552,0.001683578,0.001606521,0.0012415237,0.0011199324,0.000697781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018486928,0.000047200076,0.00045118527,0.00014189527,0.00005057772,0.00009247374,0.00014933084,0.33003852,0.012320656,0.5036167,0.003350209,0.14955643],"study_design_scores_gemma":[0.000030432915,0.00011638236,0.00018020788,0.000029237952,0.000014753269,0.00009010777,0.000022431994,0.8574938,0.004092114,0.12911433,0.008793293,0.000022932896],"about_ca_topic_score_codex":0.0009793208,"about_ca_topic_score_gemma":0.0008896658,"teacher_disagreement_score":0.0021649182,"about_ca_system_score_codex":0.0008890909,"about_ca_system_score_gemma":0.000640076,"threshold_uncertainty_score":0.008046925},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02944436,0.0015373395,0.9582138,0.00037909867,0.00005240822,0.000054481374,0.00005240932,0.00011249802,0.010153628],"genre_scores_gemma":[0.9118094,0.001250401,0.07938258,0.0001202567,0.00007103182,0.00011593122,0.00006553706,0.000075070646,0.0071099363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993963,0.00028645128,0.000023683378,0.0000901659,0.00012474284,0.00007859131],"domain_scores_gemma":[0.9981505,0.0014478507,0.00016035946,0.00004669651,0.00016410576,0.000030434432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013353226,0.0015572973,0.0012690049,0.0005473152,0.00030074507,0.001218993,0.0007653345,0.0013930956,0.0017600843],"category_scores_gemma":[0.0032641864,0.00058859476,0.0006183697,0.0007608087,0.0009758724,0.0009759816,0.0009879284,0.00096330774,0.00039620942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010194579,0.0000345972,0.00013558677,0.00016345935,0.000055188346,0.00009071242,0.00005681995,0.97148603,0.0022763838,0.01434746,0.0005844144,0.0106673855],"study_design_scores_gemma":[0.000014759105,0.000053488693,0.00006913164,0.000007231993,0.000010568801,0.00002044777,0.000011577918,0.99303424,0.0005101973,0.005946434,0.00031534067,0.0000066549374],"about_ca_topic_score_codex":0.001922243,"about_ca_topic_score_gemma":0.0011867535,"teacher_disagreement_score":0.001922243,"about_ca_system_score_codex":0.0011651752,"about_ca_system_score_gemma":0.000588597,"threshold_uncertainty_score":0.008454025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028252037,0.0030770595,0.9657034,0.0003247734,0.00011986995,0.00005999963,0.000023734148,0.00034289501,0.0020962302],"genre_scores_gemma":[0.8889451,0.0033612722,0.10446449,0.00013346096,0.00027835762,0.00020646445,0.000065388354,0.000029378885,0.0025160187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989072,0.00053395337,0.00005311959,0.000112751,0.00032978918,0.00006319735],"domain_scores_gemma":[0.9980831,0.001181163,0.00025876652,0.00022794896,0.00020680265,0.00004221959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018756676,0.00060802844,0.0007294912,0.0007379449,0.00046328825,0.0008890379,0.00079196383,0.0009994345,0.00035876242],"category_scores_gemma":[0.0034964886,0.00031921334,0.00034084,0.0011634151,0.0013255356,0.0013861279,0.0010981765,0.00076764636,0.00014748421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019166512,0.000083472136,0.0010681418,0.00038667416,0.00013428715,0.00026571876,0.000432979,0.6979809,0.018112365,0.12897459,0.0013947134,0.15097453],"study_design_scores_gemma":[0.0000314392,0.00017167258,0.0001780486,0.000025460577,0.000030296695,0.000086839274,0.00002280957,0.93406594,0.0040082396,0.057762526,0.0035950658,0.000021675169],"about_ca_topic_score_codex":0.0007431159,"about_ca_topic_score_gemma":0.0005696874,"teacher_disagreement_score":0.0018756676,"about_ca_system_score_codex":0.0005103586,"about_ca_system_score_gemma":0.00044709674,"threshold_uncertainty_score":0.009919584},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16497259,0.0010324616,0.8126093,0.0007321808,0.0000805974,0.000118051976,0.0003002229,0.00036481427,0.019789806],"genre_scores_gemma":[0.9747667,0.0005646169,0.022503514,0.00013172651,0.000033372635,0.00006487389,0.00010517498,0.000046725178,0.0017833691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979699,0.0008986792,0.00013626234,0.00029345448,0.00039857352,0.0003031274],"domain_scores_gemma":[0.9883691,0.009284185,0.00085423497,0.00060249167,0.0007075208,0.0001824203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003485431,0.0014465399,0.0015012166,0.00069485686,0.00063139416,0.0019143333,0.00070162595,0.001014251,0.0015250767],"category_scores_gemma":[0.013921572,0.0006168428,0.00050800154,0.0008169798,0.0026684604,0.0015946164,0.0015154046,0.0010454197,0.00038165084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048457962,0.000046903617,0.0021028153,0.00032180647,0.00013114774,0.00060359325,0.00047950807,0.73614043,0.018996505,0.21308023,0.0023767285,0.025235793],"study_design_scores_gemma":[0.00003826237,0.00014605171,0.0005631542,0.000036458434,0.00004366734,0.00022253009,0.00006484399,0.9185656,0.0058854655,0.07386587,0.00053731084,0.000030746614],"about_ca_topic_score_codex":0.0020111506,"about_ca_topic_score_gemma":0.0021924973,"teacher_disagreement_score":0.003485431,"about_ca_system_score_codex":0.0016782937,"about_ca_system_score_gemma":0.0021987045,"threshold_uncertainty_score":0.018432915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039399434,0.0007380116,0.9569413,0.00010178108,0.00003174219,0.00006131389,0.000035975892,0.00012074243,0.0025696629],"genre_scores_gemma":[0.85627353,0.0010278907,0.14056127,0.00005409809,0.000043165244,0.00014724991,0.000075940516,0.000011663706,0.0018050998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997149,0.0000911392,0.000017778375,0.000027398062,0.00012146395,0.000027299158],"domain_scores_gemma":[0.9994861,0.00022551618,0.0000910024,0.00007453092,0.00010922507,0.000013605178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053366815,0.0004581017,0.00036659322,0.00036474096,0.00034692136,0.00038695434,0.00054086745,0.00039127955,0.00066021964],"category_scores_gemma":[0.0010725132,0.00017435571,0.000280528,0.00035633025,0.0004239781,0.0004837462,0.00036583422,0.00033948137,0.0002130699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002282038,0.00008376599,0.0010782777,0.00040862674,0.00011557424,0.00078554737,0.0004294448,0.5573903,0.11546281,0.17776337,0.0026781904,0.14357594],"study_design_scores_gemma":[0.00002170904,0.0002460021,0.00022710332,0.000017057017,0.000040392268,0.00053100794,0.000024344967,0.97035027,0.010668422,0.014985203,0.002865995,0.00002255399],"about_ca_topic_score_codex":0.00068440614,"about_ca_topic_score_gemma":0.0012783556,"teacher_disagreement_score":0.00068440614,"about_ca_system_score_codex":0.0004546586,"about_ca_system_score_gemma":0.00049449597,"threshold_uncertainty_score":0.003298819},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065409385,0.0005529545,0.93129104,0.00015919955,0.000021228852,0.000051062172,0.000028297376,0.00007635791,0.0024104703],"genre_scores_gemma":[0.7759084,0.00064583,0.22030704,0.00008551016,0.00005119049,0.00007493256,0.000060705504,0.000022394757,0.0028440638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989411,0.00035296203,0.000047676327,0.000103188795,0.00048693895,0.00006813205],"domain_scores_gemma":[0.99816966,0.0010061709,0.00032388503,0.00019091673,0.00026874756,0.00004057497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011303831,0.0006076742,0.0005188059,0.00027103702,0.00025180998,0.00076836685,0.000553536,0.0009508233,0.0006165956],"category_scores_gemma":[0.0038625854,0.0002855356,0.0003229395,0.00047196166,0.00070122484,0.0008382114,0.0005138563,0.000552381,0.00030271584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018419059,0.00014652891,0.0016074806,0.00019365957,0.00008118624,0.00034115306,0.00030683653,0.7157969,0.057657596,0.16424696,0.00064139836,0.058796052],"study_design_scores_gemma":[0.000016056785,0.00011923568,0.00016303088,0.000009072836,0.000013994629,0.00012108219,0.000016043283,0.9811654,0.009341052,0.008401296,0.00062076695,0.00001290311],"about_ca_topic_score_codex":0.0007363605,"about_ca_topic_score_gemma":0.0010508102,"teacher_disagreement_score":0.0011303831,"about_ca_system_score_codex":0.0006057708,"about_ca_system_score_gemma":0.0007310281,"threshold_uncertainty_score":0.0059781075},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16476865,0.00068307994,0.82766867,0.00033224304,0.00003439404,0.00005857574,0.000042973043,0.00016842784,0.0062430315],"genre_scores_gemma":[0.9741037,0.00021987253,0.024712602,0.000050000443,0.000018628254,0.000044873992,0.000015589385,0.000005250278,0.0008294243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911326,0.00042177105,0.000039985964,0.00010537853,0.00024324116,0.00007631204],"domain_scores_gemma":[0.9991762,0.00042330922,0.00014343554,0.000079774836,0.00014486343,0.00003249113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007510465,0.0004986573,0.0006451765,0.00035138536,0.0005646682,0.00057390187,0.00060330617,0.0006812227,0.00057786977],"category_scores_gemma":[0.0012878274,0.0002795351,0.00029296838,0.0009234542,0.0010581118,0.00084120035,0.0008582703,0.00034554134,0.00015907503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035589735,0.00011296741,0.0029155083,0.00020769211,0.00010978475,0.0008995715,0.0006375022,0.7913113,0.08598374,0.051701944,0.0012537506,0.0645103],"study_design_scores_gemma":[0.00001888446,0.00009693212,0.00027056146,0.000007446889,0.000018407249,0.00014272062,0.000028087305,0.99030775,0.0030588477,0.0056726015,0.0003618555,0.000015915084],"about_ca_topic_score_codex":0.00093275774,"about_ca_topic_score_gemma":0.00119022,"teacher_disagreement_score":0.00093275774,"about_ca_system_score_codex":0.00066762837,"about_ca_system_score_gemma":0.00037602155,"threshold_uncertainty_score":0.00484401},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072098956,0.00021999342,0.9914795,0.000082484235,0.00003259493,0.000043698856,0.000011155514,0.00017127763,0.00074942096],"genre_scores_gemma":[0.41944262,0.00044927633,0.57621866,0.0001413179,0.000098390825,0.00041651228,0.000118844975,0.0000739892,0.0030403805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945337,0.00021527745,0.000029620882,0.00009026181,0.00016476405,0.000046633042],"domain_scores_gemma":[0.9993297,0.00038805476,0.000054462085,0.000072586794,0.00012669724,0.000028444596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011610637,0.0006382266,0.0007626347,0.0006964337,0.00067630224,0.00043569662,0.0014204233,0.0007831954,0.0011084493],"category_scores_gemma":[0.0028207023,0.00024258692,0.00042489168,0.0006608422,0.0005257557,0.0010098876,0.00120587,0.0006249412,0.0004031432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037322656,0.00013847311,0.0006044122,0.00013361876,0.00009694078,0.00020539494,0.00039993695,0.5290895,0.014892275,0.039192803,0.004794205,0.41007924],"study_design_scores_gemma":[0.00007890383,0.00014004517,0.00008493699,0.000008336215,0.00001986456,0.000083263745,0.000027637268,0.98632634,0.0016065878,0.009415325,0.0021964225,0.000012213308],"about_ca_topic_score_codex":0.00094846275,"about_ca_topic_score_gemma":0.00097005273,"teacher_disagreement_score":0.0014204233,"about_ca_system_score_codex":0.00051385706,"about_ca_system_score_gemma":0.00051534304,"threshold_uncertainty_score":0.006140411},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.819853,0.00087661133,0.17212425,0.0001863578,0.000040185416,0.00003520196,0.00004743175,0.000246321,0.0065905973],"genre_scores_gemma":[0.99203014,0.00010943115,0.007632258,0.000011725495,0.00000935803,0.000008752308,0.000010052406,0.000003996428,0.00018441385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989329,0.0004643526,0.000038337013,0.0000824859,0.00032099005,0.00016084629],"domain_scores_gemma":[0.9963954,0.0023703303,0.00044060627,0.00022417823,0.0004937246,0.00007577775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017377175,0.0007362524,0.00078229955,0.00038283222,0.00040158283,0.0006840602,0.0005557243,0.00069998595,0.0003500239],"category_scores_gemma":[0.0052968073,0.0001523982,0.0002666728,0.00055489043,0.0007295892,0.0009595498,0.00089431944,0.0003551883,0.00008861106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005408504,0.00013128159,0.0037453575,0.00015306025,0.00007533843,0.00095132366,0.00026433432,0.92603207,0.033375226,0.010064063,0.00036211053,0.024304997],"study_design_scores_gemma":[0.000019581154,0.000305788,0.0006859014,0.000008054043,0.00004954866,0.00024175293,0.00005833395,0.9884171,0.00887302,0.0011536413,0.0001714182,0.00001582819],"about_ca_topic_score_codex":0.0013300811,"about_ca_topic_score_gemma":0.0010393788,"teacher_disagreement_score":0.0017377175,"about_ca_system_score_codex":0.0005103163,"about_ca_system_score_gemma":0.00048743992,"threshold_uncertainty_score":0.009190023},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19615605,0.0017856462,0.7871185,0.00033895535,0.000050699935,0.000055195196,0.000047382986,0.00021441728,0.014233184],"genre_scores_gemma":[0.9774304,0.0006567252,0.020741789,0.00006752973,0.000037872655,0.00005800849,0.000022935179,0.000010121198,0.00097462663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902785,0.0004911017,0.00001758525,0.00008309303,0.00024006967,0.00014024095],"domain_scores_gemma":[0.99766773,0.0015323171,0.00019006792,0.00023834902,0.00028385175,0.00008763773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018443282,0.0004204237,0.00047713786,0.0005094085,0.00068883447,0.00085811573,0.0006321513,0.00093483157,0.0005329456],"category_scores_gemma":[0.0028797213,0.00029625467,0.00025861422,0.00074160943,0.0013574912,0.0010447144,0.0008502031,0.0005747067,0.00017141702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019203912,0.00008861192,0.0023498503,0.00012196462,0.00008873081,0.0005517885,0.00077177654,0.5612501,0.01824336,0.36039546,0.002524462,0.05342192],"study_design_scores_gemma":[0.000039251394,0.00023085017,0.00062657095,0.000023417833,0.000028971159,0.00032534017,0.00010606591,0.85077447,0.0038736654,0.14054786,0.003391277,0.000032236578],"about_ca_topic_score_codex":0.0009098289,"about_ca_topic_score_gemma":0.00084281614,"teacher_disagreement_score":0.0018443282,"about_ca_system_score_codex":0.0008329545,"about_ca_system_score_gemma":0.00042929157,"threshold_uncertainty_score":0.009753883},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03636649,0.0006157445,0.95983326,0.0001758165,0.00005213975,0.00006410321,0.000017680375,0.00011486887,0.0027598597],"genre_scores_gemma":[0.7996938,0.0007119881,0.19642048,0.00013787534,0.00009384544,0.00013437856,0.00002978671,0.000012827914,0.0027650674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99922585,0.00026137815,0.000044422057,0.00012758395,0.0002636898,0.00007700239],"domain_scores_gemma":[0.99891245,0.00046191565,0.00019002758,0.00019839992,0.00020532777,0.000031869415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014684722,0.0009045838,0.0005497681,0.0006589414,0.0004975954,0.0007825494,0.0012984538,0.00095664064,0.00065694796],"category_scores_gemma":[0.0028076877,0.00035702527,0.00048754772,0.0006461962,0.0011794723,0.0017232808,0.0010282996,0.00049180386,0.00034343143],"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.0005978937,0.00015813038,0.0020930348,0.00056672917,0.00019062687,0.0015726225,0.0010630185,0.19545397,0.11531011,0.48629037,0.0018155985,0.19488782],"study_design_scores_gemma":[0.00013684978,0.0010241461,0.0004761777,0.00006488743,0.00016029982,0.0017879857,0.00014475807,0.83075595,0.059052423,0.09620412,0.010095897,0.000096555734],"about_ca_topic_score_codex":0.0005139195,"about_ca_topic_score_gemma":0.0005460969,"teacher_disagreement_score":0.0014684722,"about_ca_system_score_codex":0.0005055565,"about_ca_system_score_gemma":0.00045610112,"threshold_uncertainty_score":0.007766068},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29095945,0.013583543,0.6356848,0.001519646,0.00020521913,0.00007026135,0.0002054304,0.000497297,0.05727438],"genre_scores_gemma":[0.98305535,0.003030119,0.012391307,0.000063211846,0.00007792649,0.000031480857,0.000027652712,0.0000152204475,0.0013077698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994392,0.00021936667,0.000019896805,0.000043304794,0.00017271558,0.00010552797],"domain_scores_gemma":[0.99810886,0.0013761906,0.00015018505,0.00014694336,0.00017727139,0.00004052586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007152062,0.000660829,0.00047119032,0.00045193356,0.00051536394,0.00097532297,0.00035061772,0.00072425784,0.00092809653],"category_scores_gemma":[0.0036927827,0.00026897195,0.00027248825,0.00072365726,0.00095810095,0.0009727436,0.00066004886,0.00047859235,0.00030379483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009817769,0.00005708279,0.0010016513,0.00023306496,0.000034097717,0.00042151025,0.00023092395,0.7014705,0.027250877,0.23623532,0.0015414463,0.031425342],"study_design_scores_gemma":[0.00002213285,0.000163517,0.0010356447,0.00006471156,0.000037905542,0.0004485768,0.0001297414,0.87244606,0.0135228075,0.10896943,0.0031173844,0.00004211733],"about_ca_topic_score_codex":0.0014271092,"about_ca_topic_score_gemma":0.0015986945,"teacher_disagreement_score":0.0014271092,"about_ca_system_score_codex":0.0008093736,"about_ca_system_score_gemma":0.00044461133,"threshold_uncertainty_score":0.0058724284},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20727858,0.020888608,0.68060863,0.0053384956,0.00074221904,0.00014544051,0.0011448252,0.0007927561,0.08306044],"genre_scores_gemma":[0.9785243,0.0052350312,0.010470831,0.0003401095,0.00061252026,0.00019817581,0.00022531729,0.00016235806,0.004231322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981236,0.0007557745,0.000052144907,0.00016859475,0.0005358493,0.00036408586],"domain_scores_gemma":[0.9713823,0.024736587,0.0006728994,0.0009026231,0.0020158018,0.0002897468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004560205,0.0012662273,0.0014557276,0.0029107442,0.001108728,0.0023718453,0.001961124,0.001066036,0.0046206824],"category_scores_gemma":[0.024398077,0.00085436594,0.00050757173,0.003045878,0.0028151136,0.004851009,0.002630773,0.0018355796,0.0006860734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041682442,0.00009656975,0.0007469427,0.0004205305,0.00010119844,0.0002519431,0.00048782417,0.7252593,0.0049747694,0.23055483,0.007416366,0.029272847],"study_design_scores_gemma":[0.000016162756,0.00003783005,0.0002619128,0.000076015465,0.00004052569,0.00006868774,0.0000759651,0.9220331,0.0012406888,0.07464576,0.0014761884,0.000027142923],"about_ca_topic_score_codex":0.004294029,"about_ca_topic_score_gemma":0.0018782404,"teacher_disagreement_score":0.0046206824,"about_ca_system_score_codex":0.0036460492,"about_ca_system_score_gemma":0.0010448144,"threshold_uncertainty_score":0.026454031},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24164665,0.004511774,0.7458332,0.0003469033,0.00005747697,0.000064200896,0.000108705855,0.00013381126,0.007297241],"genre_scores_gemma":[0.98278606,0.0010509776,0.014977738,0.00003100292,0.000021175289,0.000031950232,0.000034007473,0.00002785553,0.001039194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992957,0.0002212708,0.000033677192,0.00008201368,0.00030274346,0.000064584005],"domain_scores_gemma":[0.99672025,0.0022434855,0.00041757408,0.00018889728,0.0003613637,0.00006850553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013500976,0.00083187333,0.00057285605,0.00045807572,0.00028697198,0.00079450017,0.00051926874,0.00044655686,0.0008716215],"category_scores_gemma":[0.005149935,0.00027083527,0.00030096908,0.00036200637,0.0009021939,0.0012931869,0.00065836665,0.0005851628,0.000234072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022353427,0.000045080273,0.0010736058,0.00020202922,0.00006058986,0.00038055185,0.00028224467,0.90289676,0.028021622,0.051539328,0.00039520144,0.014879436],"study_design_scores_gemma":[0.000012874058,0.00008514424,0.00041139408,0.000017705359,0.000016483957,0.00022484994,0.000051190786,0.976939,0.0058746864,0.015863998,0.00047823577,0.000024476563],"about_ca_topic_score_codex":0.00067238807,"about_ca_topic_score_gemma":0.00041452827,"teacher_disagreement_score":0.0013696137,"about_ca_system_score_codex":0.0013696137,"about_ca_system_score_gemma":0.00042509646,"threshold_uncertainty_score":0.009937286},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038589697,0.0014020429,0.9508469,0.0004856068,0.00004872631,0.000050601193,0.00007144982,0.00011577891,0.0083893165],"genre_scores_gemma":[0.92410475,0.0014003827,0.070272826,0.00009685474,0.00007569408,0.00015718394,0.00005209756,0.000049485454,0.0037908219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868435,0.0007503651,0.00003720772,0.0001236871,0.00023493163,0.00016943112],"domain_scores_gemma":[0.99832505,0.0012588425,0.00016645485,0.00006706105,0.00013775818,0.000044710483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015401697,0.0010827427,0.0010028888,0.0005202502,0.00038361675,0.0012752825,0.00091767067,0.00091101864,0.0018097828],"category_scores_gemma":[0.004512409,0.00043770144,0.00033031864,0.0010551804,0.0010638286,0.0015706845,0.0010692867,0.00069338107,0.00043006177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073184376,0.000029213383,0.00020121818,0.000080508646,0.000030454705,0.00015008541,0.000056481193,0.9460581,0.0016396564,0.03632232,0.0006742945,0.014684469],"study_design_scores_gemma":[0.000019943976,0.000033447788,0.00006131453,0.000005367004,0.0000075699304,0.000037026428,0.000015800171,0.9830215,0.00046905375,0.015758904,0.0005637436,0.0000063902853],"about_ca_topic_score_codex":0.001546801,"about_ca_topic_score_gemma":0.0011046529,"teacher_disagreement_score":0.0018097828,"about_ca_system_score_codex":0.0010230532,"about_ca_system_score_gemma":0.0006991569,"threshold_uncertainty_score":0.008145273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09369804,0.0006310047,0.902118,0.00028546693,0.00001724861,0.000044229648,0.000033922333,0.000121172074,0.0030509466],"genre_scores_gemma":[0.9630684,0.00050095696,0.03508261,0.00004897802,0.000027645703,0.00007939242,0.000023875788,0.000019816614,0.0011482559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889,0.0006427011,0.000024905723,0.00010895274,0.00018404574,0.00014944388],"domain_scores_gemma":[0.9987901,0.0008821455,0.00012851627,0.00006225971,0.000091895316,0.00004512206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011491155,0.0009091227,0.0006846991,0.0006116495,0.00043000295,0.0009293052,0.00088923564,0.001061762,0.00045956543],"category_scores_gemma":[0.0036139297,0.000514937,0.00025448593,0.0010355045,0.0015287633,0.0010270939,0.00091032014,0.0004419753,0.00017114264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042445598,0.000020388321,0.0002646621,0.000019822437,0.000011561256,0.00009913317,0.00008613365,0.97499156,0.0015717895,0.012447119,0.00024453888,0.010200822],"study_design_scores_gemma":[0.000012130695,0.000031148247,0.00006255025,0.0000028682698,0.000006543189,0.000028594688,0.000023980943,0.9864638,0.0005849471,0.0125648165,0.00021345016,0.000005076545],"about_ca_topic_score_codex":0.0018203623,"about_ca_topic_score_gemma":0.0015501479,"teacher_disagreement_score":0.0018203623,"about_ca_system_score_codex":0.001044083,"about_ca_system_score_gemma":0.0005236017,"threshold_uncertainty_score":0.0075753927},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6355651,0.0013760179,0.35462168,0.0006194999,0.000054376596,0.0001217478,0.00010197878,0.0002390261,0.007300495],"genre_scores_gemma":[0.9915917,0.00021705535,0.0072722156,0.00004155402,0.000020886244,0.0000317392,0.000017785107,0.000007031594,0.0007999415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682766,0.0016523938,0.00009709948,0.00031740617,0.0006127364,0.0004927852],"domain_scores_gemma":[0.9762066,0.019433666,0.0020191802,0.0007704362,0.0013332709,0.00023678296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004472,0.002025877,0.0014882436,0.0006955085,0.00079061266,0.001290941,0.0011399628,0.0013851052,0.0006522951],"category_scores_gemma":[0.012668152,0.0004681475,0.0005382028,0.0009384079,0.0021449479,0.001692536,0.0015515441,0.00070998026,0.00017928779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055203866,0.00010116729,0.0037707514,0.00014406552,0.00016655965,0.0013750597,0.0002885882,0.95930094,0.0088746045,0.01651884,0.0002906298,0.00861679],"study_design_scores_gemma":[0.000048102556,0.00044952094,0.00067142176,0.000011820978,0.00009098364,0.00048476848,0.00009127948,0.9883702,0.0051419884,0.004396884,0.00021502774,0.000028162043],"about_ca_topic_score_codex":0.0029056682,"about_ca_topic_score_gemma":0.0019048859,"teacher_disagreement_score":0.004472,"about_ca_system_score_codex":0.0011294181,"about_ca_system_score_gemma":0.001090447,"threshold_uncertainty_score":0.023650467},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029767647,0.00031483494,0.96640265,0.00013368991,0.00003544035,0.000050789055,0.00006123281,0.00019753037,0.0030360492],"genre_scores_gemma":[0.56192386,0.0007343241,0.43496504,0.000081899576,0.000028020953,0.00013735796,0.000115139715,0.000049055536,0.0019654024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996705,0.000098886456,0.000016743808,0.00003202411,0.00015440346,0.000027401233],"domain_scores_gemma":[0.9994697,0.00021553959,0.00006270108,0.00011505238,0.0001175957,0.000019462492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047649295,0.00036073066,0.00031008356,0.00040029633,0.00030126792,0.0004991457,0.00039936937,0.00044255017,0.0009910582],"category_scores_gemma":[0.0021009143,0.00015887675,0.00023405813,0.0004330509,0.00052882277,0.0006675231,0.00061080506,0.0005988277,0.00035794286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019265823,0.000060660335,0.00061992527,0.00023303746,0.000025148873,0.00018563833,0.00019873898,0.29114556,0.05757544,0.54570085,0.0013468825,0.10271547],"study_design_scores_gemma":[0.000018164994,0.000079086545,0.00010716156,0.000022456585,0.000011569343,0.00012082373,0.000015665566,0.9306507,0.021508275,0.043229386,0.0042154053,0.00002127246],"about_ca_topic_score_codex":0.0006864079,"about_ca_topic_score_gemma":0.0006931346,"teacher_disagreement_score":0.0009910582,"about_ca_system_score_codex":0.00055389677,"about_ca_system_score_gemma":0.00070241274,"threshold_uncertainty_score":0.0040187836},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63757926,0.0023368173,0.34862056,0.0003082107,0.000031196763,0.00006295888,0.00020339334,0.0003822951,0.010475291],"genre_scores_gemma":[0.9953237,0.00035291928,0.0037873853,0.000016631084,0.000008772008,0.000016825583,0.000042286403,0.00000907686,0.00044236073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899226,0.0003492952,0.00003201624,0.000097389806,0.00032853012,0.00020046746],"domain_scores_gemma":[0.9931378,0.0049049864,0.00046434515,0.00025674727,0.0011381521,0.00009808691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015614369,0.0009976617,0.00067685544,0.0007279245,0.00042657836,0.00078634184,0.000730558,0.0006658314,0.00084841903],"category_scores_gemma":[0.007630112,0.00023927906,0.00027841982,0.0006197474,0.0009413124,0.0008258759,0.0007489046,0.00043313473,0.0001889608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015580455,0.000023209486,0.0013789709,0.000046735167,0.000033478183,0.00015676499,0.0000978369,0.9737104,0.004099053,0.009939311,0.0002569295,0.010101399],"study_design_scores_gemma":[0.000004915568,0.000085564076,0.0005479617,0.0000054826974,0.000016338521,0.00006913111,0.000023840614,0.99549294,0.0014948741,0.0021525715,0.000096133306,0.000010285482],"about_ca_topic_score_codex":0.0045107817,"about_ca_topic_score_gemma":0.0029123707,"teacher_disagreement_score":0.0045107817,"about_ca_system_score_codex":0.001481161,"about_ca_system_score_gemma":0.00062755315,"threshold_uncertainty_score":0.010746598},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27505594,0.004406775,0.68478537,0.001177676,0.00023226699,0.00012821222,0.00015850952,0.0008378166,0.03321742],"genre_scores_gemma":[0.9843072,0.0008626203,0.013532907,0.00008918903,0.000049578626,0.000058531215,0.000048267837,0.000054316,0.0009973539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956728,0.0020544643,0.00012705429,0.00034673832,0.0011958588,0.00060319144],"domain_scores_gemma":[0.9810643,0.015109783,0.0011198597,0.0009074173,0.0015825708,0.00021614567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053180894,0.0017592382,0.0012396035,0.0011748854,0.00078984676,0.0014827584,0.00127285,0.001279241,0.0014238763],"category_scores_gemma":[0.023813823,0.00043488186,0.0005524486,0.0011412231,0.002330466,0.0021250865,0.0017098149,0.0012449702,0.00035436574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026436432,0.00006757436,0.0008758686,0.00010530439,0.00006036434,0.00008939896,0.000115442555,0.93927664,0.004618257,0.04083361,0.0005179066,0.013175293],"study_design_scores_gemma":[0.000012277427,0.000132735,0.00032901613,0.00001745522,0.000020322444,0.000051949995,0.000024229157,0.98830706,0.001788759,0.009055762,0.00023970587,0.000020764834],"about_ca_topic_score_codex":0.0035182508,"about_ca_topic_score_gemma":0.0022001152,"teacher_disagreement_score":0.0053180894,"about_ca_system_score_codex":0.0019527689,"about_ca_system_score_gemma":0.0012691469,"threshold_uncertainty_score":0.028125107},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36729872,0.0034945356,0.5986037,0.0006435067,0.000046838013,0.000086365464,0.00015762834,0.00044096212,0.02922763],"genre_scores_gemma":[0.98415864,0.0007169071,0.01352956,0.00005816383,0.00003213359,0.000035929996,0.00005984042,0.00002123538,0.0013875258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968058,0.0012397706,0.00008657342,0.00020027666,0.0012888758,0.000378646],"domain_scores_gemma":[0.9904109,0.0069529065,0.00074677647,0.0004901675,0.0012726643,0.00012666399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032981231,0.0012539728,0.00081741036,0.0010649068,0.0005052005,0.0011720369,0.00070987776,0.0010370205,0.0011069246],"category_scores_gemma":[0.010442071,0.00037285016,0.00046404736,0.0015500276,0.0014071915,0.0011253207,0.0012090103,0.0005790857,0.00045471409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047883432,0.000082932835,0.0032174787,0.00018518543,0.00011758301,0.0003882079,0.00039368196,0.88906956,0.025585335,0.04583173,0.0005997462,0.034049712],"study_design_scores_gemma":[0.000013259647,0.00021067445,0.0010019403,0.000024481178,0.00004166522,0.00021818775,0.00005136653,0.98466945,0.0056873723,0.007539929,0.0005161557,0.000025545041],"about_ca_topic_score_codex":0.0018129357,"about_ca_topic_score_gemma":0.001173545,"teacher_disagreement_score":0.0032981231,"about_ca_system_score_codex":0.0015205344,"about_ca_system_score_gemma":0.0007778654,"threshold_uncertainty_score":0.017442346},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054888353,0.001264534,0.9335333,0.0003330598,0.000051093815,0.00004618645,0.00010451237,0.00015766846,0.009621243],"genre_scores_gemma":[0.9579418,0.00139689,0.035157748,0.000108342676,0.00007237145,0.000083415885,0.00011400252,0.00007617874,0.005049288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933904,0.00012758258,0.000027776267,0.000052228224,0.00033737996,0.00011600208],"domain_scores_gemma":[0.9977991,0.0013041736,0.00022572868,0.00019541525,0.0004226379,0.000052906147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013147045,0.0007726976,0.0008080628,0.0008963934,0.00040258057,0.0010734714,0.0010343884,0.0010022197,0.0020732682],"category_scores_gemma":[0.006455451,0.00039905615,0.0005685548,0.0009592308,0.0011525325,0.0026139165,0.00091026985,0.0010604686,0.0003590822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035862475,0.000015401769,0.00034351286,0.000097299584,0.00002087143,0.0001693275,0.00015212952,0.84856105,0.0025056277,0.13482314,0.00061049906,0.01266531],"study_design_scores_gemma":[0.0000036720992,0.0000085292595,0.000087340624,0.0000066075477,0.0000032391117,0.00006020807,0.00001628388,0.9744305,0.0002757106,0.024886921,0.00021492441,0.00000611395],"about_ca_topic_score_codex":0.0027365661,"about_ca_topic_score_gemma":0.0016511416,"teacher_disagreement_score":0.0027365661,"about_ca_system_score_codex":0.0018056845,"about_ca_system_score_gemma":0.0012953244,"threshold_uncertainty_score":0.0131011605},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093877333,0.0007029639,0.99616635,0.00008717591,0.000048743692,0.000024428986,0.000040925293,0.00005957185,0.0019310632],"genre_scores_gemma":[0.35422298,0.011794958,0.6197549,0.0005136941,0.0011113626,0.00072657206,0.00040059278,0.00034916573,0.011125732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860257,0.00045566497,0.000078462566,0.00012941843,0.00064801855,0.000085857144],"domain_scores_gemma":[0.9972881,0.0017553197,0.00019592204,0.0002778383,0.000439328,0.00004359289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026304289,0.001984418,0.0012053462,0.0017869668,0.0005357422,0.0017416095,0.0017524519,0.0017121172,0.002458867],"category_scores_gemma":[0.00879376,0.00054712506,0.0013798684,0.0019556298,0.0014530863,0.002507131,0.0012078137,0.002689595,0.0012128137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022359714,0.00003780919,0.00022892415,0.00020671105,0.000057424033,0.00030966068,0.0001582729,0.50556827,0.004175055,0.46174902,0.0024789704,0.025007458],"study_design_scores_gemma":[0.0000045974275,0.000033385033,0.000118749354,0.000036914233,0.00001468603,0.00017488301,0.000026551761,0.89570606,0.00065194233,0.09945485,0.0037546055,0.000022823655],"about_ca_topic_score_codex":0.0017312057,"about_ca_topic_score_gemma":0.0010678768,"teacher_disagreement_score":0.0026304289,"about_ca_system_score_codex":0.0013236778,"about_ca_system_score_gemma":0.0010372788,"threshold_uncertainty_score":0.013911188},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28975564,0.0017260207,0.70608395,0.0003349351,0.00004678729,0.000016979642,0.00006784386,0.00033537953,0.0016324797],"genre_scores_gemma":[0.9793788,0.00030221522,0.01977733,0.0000279252,0.000017876884,0.000011857767,0.00003494607,0.000016160373,0.0004328189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982135,0.0007844756,0.00011058976,0.00025773654,0.00048802514,0.00014575273],"domain_scores_gemma":[0.99257916,0.0052946177,0.0007445979,0.0005075453,0.00078078336,0.000093287126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023372176,0.00080146245,0.00085132587,0.0004792193,0.00033959755,0.0009844069,0.0005940702,0.001053201,0.00033538882],"category_scores_gemma":[0.01892357,0.00043346226,0.00015372677,0.00049112487,0.0012154562,0.002297645,0.0012262359,0.0005967376,0.00014184878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002845938,0.000022044776,0.0016572529,0.000070687944,0.000041913903,0.00012605177,0.00010908935,0.96002126,0.0073026405,0.00991975,0.00018329636,0.02026142],"study_design_scores_gemma":[0.000011552141,0.000064546686,0.00039210546,0.000007277677,0.0000126342,0.00008353122,0.000016831427,0.9902,0.005852618,0.0032324835,0.00010922614,0.000017152173],"about_ca_topic_score_codex":0.0019905951,"about_ca_topic_score_gemma":0.0010311818,"teacher_disagreement_score":0.0023372176,"about_ca_system_score_codex":0.0007023829,"about_ca_system_score_gemma":0.0006885979,"threshold_uncertainty_score":0.012360513},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010258486,0.0020769967,0.9730907,0.0007205528,0.000087427645,0.00011480295,0.00022861446,0.00030377385,0.013118588],"genre_scores_gemma":[0.6881001,0.0055173743,0.2978564,0.0006034394,0.0002817741,0.001087373,0.00045561747,0.00019492977,0.005903029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964206,0.0015039546,0.0001505849,0.00047843644,0.00082963123,0.00061686605],"domain_scores_gemma":[0.98925906,0.0077414657,0.00080396846,0.00077710004,0.0011658992,0.00025266575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047798133,0.0026233455,0.0020419087,0.0011810119,0.001072151,0.0030605115,0.0024327764,0.001923431,0.003676007],"category_scores_gemma":[0.013285159,0.00076389516,0.0013538426,0.0016049485,0.0027006175,0.0037999968,0.0030432104,0.0032290632,0.0014156691],"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.00036130595,0.00011031175,0.0002571452,0.0006978589,0.00011004527,0.00051935605,0.0006339297,0.2639197,0.010627797,0.6912462,0.005689689,0.025826644],"study_design_scores_gemma":[0.00012515127,0.0002371084,0.00015269092,0.00021201401,0.000076046184,0.0006364768,0.00012680452,0.65899867,0.0076930057,0.32347876,0.008146188,0.000117119984],"about_ca_topic_score_codex":0.0011895564,"about_ca_topic_score_gemma":0.0006187983,"teacher_disagreement_score":0.0047798133,"about_ca_system_score_codex":0.0024447108,"about_ca_system_score_gemma":0.002146657,"threshold_uncertainty_score":0.02527839},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014153561,0.0003166642,0.97663397,0.00016231694,0.00002261387,0.000107483414,0.000053989905,0.00008789222,0.008461489],"genre_scores_gemma":[0.78045017,0.0012903863,0.20599261,0.00022876765,0.00020078481,0.0013150277,0.00023611846,0.00021729239,0.010068869],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971571,0.0012159008,0.0001075086,0.00021911097,0.0010656728,0.00023470593],"domain_scores_gemma":[0.9922522,0.0050574215,0.00051131996,0.00029763853,0.0017131534,0.0001683097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004542458,0.0018825307,0.0007554938,0.0015309986,0.0005619729,0.002008833,0.001231118,0.0013812943,0.0031262033],"category_scores_gemma":[0.016597396,0.00062675006,0.00041452787,0.0013794433,0.0015216534,0.0018238584,0.0016871121,0.0011524941,0.0010120242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001970206,0.00008903051,0.0005112751,0.00023375731,0.000041957966,0.00023336663,0.00037080218,0.5716922,0.01184523,0.33315855,0.0027527208,0.078874044],"study_design_scores_gemma":[0.00004551618,0.00015875636,0.00012951609,0.00004624839,0.000017837043,0.00013444673,0.0000619824,0.87620366,0.0031413564,0.11754498,0.0024845374,0.00003128741],"about_ca_topic_score_codex":0.0011521226,"about_ca_topic_score_gemma":0.0006268621,"teacher_disagreement_score":0.004542458,"about_ca_system_score_codex":0.0020478424,"about_ca_system_score_gemma":0.0010530495,"threshold_uncertainty_score":0.024023056},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07447813,0.0006370889,0.92258596,0.00015294479,0.0000308894,0.00003426124,0.000030981806,0.00023225011,0.0018174193],"genre_scores_gemma":[0.965424,0.00016153995,0.033649053,0.000033372013,0.000019552124,0.000036885696,0.0000152627,0.0000072682687,0.0006530008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940395,0.00024287515,0.000025568672,0.000101652644,0.00013005204,0.00009578121],"domain_scores_gemma":[0.99922824,0.0004366197,0.00009290737,0.00007134129,0.00013242268,0.000038483722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073254074,0.0005067038,0.0005926303,0.00035302018,0.00042317135,0.00058539404,0.0007712458,0.0005232949,0.00043904077],"category_scores_gemma":[0.0016164298,0.00024151149,0.00022677121,0.00050738844,0.0005976056,0.0005255405,0.00069319573,0.00033031864,0.00016126216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030206476,0.00005923446,0.00081135385,0.00007846386,0.00004852905,0.0003668633,0.00025250207,0.8942927,0.017921468,0.016884157,0.0013025474,0.06768005],"study_design_scores_gemma":[0.000016090702,0.00004646693,0.00007482241,0.0000028242366,0.0000085328575,0.000055414464,0.000021958302,0.99460995,0.0019837094,0.0028435306,0.00033035304,0.0000063262405],"about_ca_topic_score_codex":0.0025532173,"about_ca_topic_score_gemma":0.0027856855,"teacher_disagreement_score":0.0025532173,"about_ca_system_score_codex":0.0006566838,"about_ca_system_score_gemma":0.0006048503,"threshold_uncertainty_score":0.0050767064},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11904096,0.0007412775,0.8723409,0.0002635648,0.000030597577,0.00009023342,0.00008969625,0.0002139526,0.007188824],"genre_scores_gemma":[0.95867866,0.00026510155,0.03939736,0.00002676366,0.00002327024,0.000056834822,0.000029682898,0.000010272369,0.0015119234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994123,0.00021398667,0.000044934444,0.000101049875,0.00015915686,0.00006853357],"domain_scores_gemma":[0.999106,0.00038217218,0.00023982963,0.00007774828,0.0001691416,0.000025055802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007009382,0.0007288782,0.0009055492,0.0002908885,0.00036795295,0.0008129211,0.00069956976,0.0005462663,0.00088946027],"category_scores_gemma":[0.0015537854,0.0003199766,0.0002055193,0.0004603603,0.00059493823,0.0010239835,0.0006432695,0.00038347524,0.00024943007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016282218,0.00005203712,0.0005297147,0.000110171415,0.000042159998,0.00018476334,0.00013792458,0.9138691,0.013079655,0.023543132,0.00073488493,0.0475537],"study_design_scores_gemma":[0.00003223904,0.00009562046,0.00018266575,0.000006041278,0.000019611487,0.00007128886,0.000023383445,0.9871406,0.0034275171,0.0084582,0.000528639,0.000014232394],"about_ca_topic_score_codex":0.00083280646,"about_ca_topic_score_gemma":0.0013095826,"teacher_disagreement_score":0.0009055492,"about_ca_system_score_codex":0.0006553012,"about_ca_system_score_gemma":0.00050705817,"threshold_uncertainty_score":0.004754603},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53513235,0.0020294765,0.40508634,0.0013902392,0.00011479409,0.00019099361,0.0017726496,0.0006385346,0.053644754],"genre_scores_gemma":[0.9909251,0.0006176458,0.006118454,0.00008065741,0.000078348705,0.00011531405,0.0002277062,0.000033620447,0.0018032286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998326,0.00041591315,0.000052573367,0.00024888775,0.00048218115,0.00047436124],"domain_scores_gemma":[0.99424344,0.004041765,0.0005248288,0.00048579712,0.00049204996,0.00021211209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015560974,0.00076547207,0.0009551435,0.0015220925,0.0009057809,0.0028812413,0.0013263386,0.0009344572,0.0039258897],"category_scores_gemma":[0.0069955927,0.00027642187,0.00056237157,0.0012776727,0.0023649253,0.0026173599,0.0015540444,0.0011337785,0.00053763215],"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.0003540509,0.00006229655,0.0008608275,0.00016664556,0.00005169395,0.0003113848,0.00035238045,0.19449621,0.0059985085,0.7757963,0.0033496115,0.018200038],"study_design_scores_gemma":[0.000058952588,0.00007172118,0.0004622692,0.000056662582,0.00003126273,0.00033856902,0.000103286766,0.6219763,0.004009386,0.36875638,0.004082769,0.000052355666],"about_ca_topic_score_codex":0.0012905949,"about_ca_topic_score_gemma":0.00046734698,"teacher_disagreement_score":0.0039258897,"about_ca_system_score_codex":0.0019163259,"about_ca_system_score_gemma":0.0010841582,"threshold_uncertainty_score":0.013903916},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06959992,0.0007349377,0.9245744,0.00013784238,0.000031318516,0.000037416572,0.000019861258,0.00008049511,0.004783866],"genre_scores_gemma":[0.9499201,0.00051555183,0.0479267,0.000053471686,0.00003645291,0.00005869525,0.000017500357,0.0000148415575,0.0014567481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993923,0.00029711117,0.000014181667,0.000054284417,0.00018088886,0.00006130189],"domain_scores_gemma":[0.9982253,0.0012296312,0.00015578358,0.00011669564,0.00024647542,0.00002620018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012381343,0.00073222315,0.0004477139,0.00033420528,0.000335526,0.00065043266,0.0007201655,0.0006651398,0.00063764444],"category_scores_gemma":[0.0035846839,0.00021828411,0.0003582228,0.0005377639,0.0009102265,0.0008297406,0.00053020474,0.0005046346,0.00018678718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007872424,0.00002889322,0.00041135022,0.0000679324,0.00002479605,0.00035269142,0.0001329698,0.9295697,0.008067072,0.04746857,0.0004842612,0.013313032],"study_design_scores_gemma":[0.0000050267677,0.00003590094,0.000060003043,0.0000044238172,0.000008218375,0.00007234899,0.00001784268,0.9939359,0.00068501255,0.0049098106,0.00026039238,0.000005210269],"about_ca_topic_score_codex":0.0012723276,"about_ca_topic_score_gemma":0.001384879,"teacher_disagreement_score":0.0012723276,"about_ca_system_score_codex":0.00077158393,"about_ca_system_score_gemma":0.00047391013,"threshold_uncertainty_score":0.0065479875},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22687541,0.0007313083,0.76305753,0.00031191445,0.000022535378,0.000064958265,0.000080024794,0.00016794782,0.008688424],"genre_scores_gemma":[0.97609544,0.0002907265,0.022557529,0.000032845604,0.00001606436,0.00003709528,0.000023309954,0.000022970813,0.0009240361],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915254,0.00038294776,0.00002713817,0.0000863506,0.00022247642,0.00012846976],"domain_scores_gemma":[0.9974011,0.0019811234,0.00025519927,0.00013699924,0.00018951419,0.000036067013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010137932,0.000682417,0.00065988494,0.00029429983,0.00025773572,0.0008759158,0.00037940682,0.00054472964,0.001316297],"category_scores_gemma":[0.006802527,0.00033123413,0.00016733972,0.00041477868,0.00093895034,0.0012457264,0.00057600805,0.00031885016,0.0003803315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017920152,0.00005616243,0.00046571862,0.000097151926,0.000022029102,0.00014728674,0.00009902613,0.94050354,0.012559153,0.027077043,0.00033507796,0.018458646],"study_design_scores_gemma":[0.000026999653,0.000078175784,0.00026294755,0.000011377565,0.000011329059,0.00006442278,0.000040058996,0.97975916,0.005261377,0.014205345,0.00026733355,0.000011432154],"about_ca_topic_score_codex":0.00044188747,"about_ca_topic_score_gemma":0.00057911745,"teacher_disagreement_score":0.001316297,"about_ca_system_score_codex":0.0005866611,"about_ca_system_score_gemma":0.00049174274,"threshold_uncertainty_score":0.005361557},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047863375,0.00044220558,0.94945943,0.00009257525,0.00004456222,0.000079215606,0.000020156902,0.00020789423,0.0017905219],"genre_scores_gemma":[0.91099125,0.00026428365,0.08766737,0.00006966085,0.000023993898,0.000109127366,0.000028190198,0.000017692617,0.0008284332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910575,0.00035237707,0.00006011886,0.00018288249,0.00017541839,0.00012336955],"domain_scores_gemma":[0.99902296,0.00031372352,0.00016725776,0.00011902298,0.0003179178,0.00005928301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016688125,0.0007027689,0.0005463715,0.00036273387,0.00035911388,0.00091213174,0.0011617834,0.0005742925,0.0010765371],"category_scores_gemma":[0.0018224317,0.0004196301,0.00033112738,0.00029190225,0.00049040583,0.0008015343,0.00089690555,0.0005207453,0.00025403211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004401379,0.00019567461,0.0014562445,0.00021319036,0.00021068753,0.00032781422,0.000233269,0.7822586,0.0845778,0.016632555,0.0011323313,0.11232172],"study_design_scores_gemma":[0.000020521209,0.00017177382,0.00019906624,0.000008902015,0.000031785505,0.00007539823,0.00001724572,0.9885727,0.00925748,0.0010946001,0.00053660484,0.00001388663],"about_ca_topic_score_codex":0.000832774,"about_ca_topic_score_gemma":0.000977322,"teacher_disagreement_score":0.0016688125,"about_ca_system_score_codex":0.00051311165,"about_ca_system_score_gemma":0.0005754144,"threshold_uncertainty_score":0.0088256},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06960057,0.00021911274,0.9266633,0.00020606167,0.000020728652,0.000050608032,0.0000335411,0.00025556577,0.0029505193],"genre_scores_gemma":[0.9086032,0.00022755482,0.08976618,0.000083319675,0.000024631388,0.00010302893,0.000049775084,0.000052240564,0.0010900658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979964,0.00079759746,0.00008567419,0.00019762189,0.00071112043,0.00021163271],"domain_scores_gemma":[0.98755324,0.0073361285,0.0015551073,0.0022506847,0.0010911037,0.00021377741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022796958,0.0006176988,0.0005497896,0.00074855133,0.00049818173,0.0010193542,0.00093696057,0.0007818621,0.0010563029],"category_scores_gemma":[0.016346797,0.00028184804,0.00033334742,0.0005962529,0.0025204062,0.003451924,0.0024224909,0.000884394,0.0002988965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056571246,0.00010243827,0.0018347177,0.0001818036,0.00006427558,0.00021082668,0.00036483037,0.5799062,0.04154765,0.27704728,0.0011785795,0.09699564],"study_design_scores_gemma":[0.0000379569,0.00018091842,0.00028273682,0.000021436037,0.000019647867,0.00023441939,0.000067222136,0.9062273,0.025766565,0.06593341,0.0011982007,0.00003025423],"about_ca_topic_score_codex":0.0006504296,"about_ca_topic_score_gemma":0.0004196009,"teacher_disagreement_score":0.0022796958,"about_ca_system_score_codex":0.0006776597,"about_ca_system_score_gemma":0.0010375911,"threshold_uncertainty_score":0.012056351},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02641811,0.00030106807,0.96691895,0.00023060101,0.000044002583,0.00011603555,0.000024130151,0.00018496439,0.005762124],"genre_scores_gemma":[0.82998115,0.00067096454,0.16577896,0.0000982556,0.000052281885,0.00031116675,0.000044199674,0.000026843352,0.003036124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888736,0.0004594964,0.000040314066,0.00011225875,0.00040416082,0.00009637568],"domain_scores_gemma":[0.9972746,0.0018130238,0.00024094176,0.0003224335,0.00028904408,0.000060029397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013896326,0.0005096916,0.0006808865,0.0006732181,0.0008079646,0.00067345524,0.0016186907,0.00096572784,0.00091803697],"category_scores_gemma":[0.0055251447,0.00022952532,0.0003913564,0.0010631679,0.0013476728,0.0016697524,0.0015124492,0.00068338774,0.00019695445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012419242,0.00010360735,0.00056213,0.00021288835,0.00006123401,0.00053392444,0.0005367249,0.47940356,0.024034642,0.4129186,0.0022095516,0.0792989],"study_design_scores_gemma":[0.000043978904,0.00008706628,0.00012524577,0.00001570346,0.000021894293,0.00017824968,0.000055512264,0.8949591,0.006077453,0.0942952,0.004113979,0.000026700387],"about_ca_topic_score_codex":0.0012845063,"about_ca_topic_score_gemma":0.0009779247,"teacher_disagreement_score":0.0016186907,"about_ca_system_score_codex":0.00061424094,"about_ca_system_score_gemma":0.000880785,"threshold_uncertainty_score":0.007349193},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12915574,0.0009777739,0.863055,0.0003773647,0.000037398102,0.00006400138,0.000053836215,0.00017654135,0.0061024386],"genre_scores_gemma":[0.9647241,0.00034217947,0.03367826,0.000037874914,0.000033490283,0.00007283327,0.000025467301,0.000026447782,0.0010594131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993242,0.00033838113,0.00001534824,0.000060226816,0.00015873161,0.00010321891],"domain_scores_gemma":[0.9991737,0.00056343206,0.00010759982,0.000026965581,0.000103290506,0.000025018604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012489972,0.0011444995,0.0008596375,0.00044107693,0.00041277116,0.0008418463,0.0005512662,0.00074384565,0.0008470337],"category_scores_gemma":[0.0020306325,0.00043902965,0.00035071114,0.0006708641,0.00063247106,0.0007218262,0.00096825213,0.0004390144,0.00016405573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000437795,0.000021601832,0.00023952278,0.000023821349,0.000022082302,0.00003816237,0.000021160471,0.98558587,0.002634197,0.004976068,0.00019933315,0.006194482],"study_design_scores_gemma":[0.000006169632,0.000030203102,0.000069512505,0.0000013589705,0.0000048082006,0.000008590072,0.0000081305825,0.9981652,0.00035133952,0.0012727695,0.00007888826,0.0000032056905],"about_ca_topic_score_codex":0.0012695754,"about_ca_topic_score_gemma":0.0012416253,"teacher_disagreement_score":0.0012695754,"about_ca_system_score_codex":0.0009939593,"about_ca_system_score_gemma":0.0005642925,"threshold_uncertainty_score":0.007211685},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07550205,0.00067011046,0.92092294,0.00030399946,0.00009226748,0.00006377172,0.000016092094,0.0000754198,0.002353322],"genre_scores_gemma":[0.94990337,0.00034492015,0.04819252,0.00011035349,0.00014893907,0.0000671768,0.000009283992,0.000030212672,0.001193216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723405,0.0012160108,0.00008829982,0.0003816599,0.0006124425,0.00046744646],"domain_scores_gemma":[0.9921625,0.005864123,0.00068443205,0.00039379002,0.0006203475,0.0002747501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004891648,0.00093078293,0.0012575669,0.00044341836,0.0015251406,0.0017920365,0.0015713463,0.0009196514,0.0013036111],"category_scores_gemma":[0.011320071,0.00042939448,0.0005657244,0.00061967416,0.0020921524,0.002863845,0.0012748076,0.0014008991,0.00015520582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005490939,0.00020404591,0.0014817301,0.00018313892,0.00014275,0.0004760423,0.0007153596,0.8010957,0.010334658,0.14792447,0.0009062417,0.035986807],"study_design_scores_gemma":[0.000035426307,0.000084488165,0.0001865448,0.000006757961,0.000027730688,0.00008094443,0.000057812642,0.97020954,0.0010963194,0.027583975,0.000614608,0.000015944377],"about_ca_topic_score_codex":0.0057812827,"about_ca_topic_score_gemma":0.0038583444,"teacher_disagreement_score":0.0057812827,"about_ca_system_score_codex":0.0022861832,"about_ca_system_score_gemma":0.0028249035,"threshold_uncertainty_score":0.025869846},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15544426,0.0045493226,0.82563454,0.00092431885,0.00010779481,0.000049024307,0.00013461983,0.00017914262,0.012977005],"genre_scores_gemma":[0.96111435,0.0014640482,0.033938665,0.00006323732,0.00006446637,0.00007097566,0.000056409943,0.00004697732,0.0031807446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991799,0.00045184052,0.00001933307,0.00008969273,0.00014108818,0.000118103235],"domain_scores_gemma":[0.9987985,0.0008684756,0.00011144982,0.0000562366,0.00011428041,0.000050975494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012266284,0.0009993641,0.0007565132,0.0007252679,0.0004690255,0.0011753226,0.00064143626,0.0009492908,0.0009637985],"category_scores_gemma":[0.0040556747,0.00036549402,0.0002648134,0.0011012387,0.0010473427,0.0015759869,0.00082733185,0.0004991407,0.0001794537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045079058,0.000012914431,0.00015143094,0.000033331522,0.000015567752,0.000034816956,0.000024182731,0.968238,0.0012799902,0.021902705,0.00034580374,0.007916165],"study_design_scores_gemma":[0.0000075751545,0.00002664876,0.00009820876,0.0000063910866,0.000009358959,0.00002147124,0.000021736416,0.9805698,0.0004952218,0.018171288,0.00056648976,0.0000057955517],"about_ca_topic_score_codex":0.00251941,"about_ca_topic_score_gemma":0.0016916334,"teacher_disagreement_score":0.00251941,"about_ca_system_score_codex":0.0016455632,"about_ca_system_score_gemma":0.00073355366,"threshold_uncertainty_score":0.011939466},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04838986,0.00024829523,0.94525707,0.00030996234,0.000044369175,0.000054365046,0.000056568024,0.00027245254,0.0053670174],"genre_scores_gemma":[0.82980293,0.00031958128,0.16538742,0.0001066415,0.00002161629,0.00012082716,0.00006225791,0.00002398467,0.004154686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997975,0.00007283718,0.000008198184,0.000025482688,0.00006632457,0.000029682415],"domain_scores_gemma":[0.99933237,0.00028180805,0.00012359067,0.00013263997,0.00011124884,0.000018338256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005573967,0.00029991756,0.00026842218,0.00032239407,0.00030423453,0.00046147563,0.0005557537,0.00049664127,0.0011635188],"category_scores_gemma":[0.0016188502,0.000101869584,0.00023929754,0.0004039461,0.0006073545,0.0007307164,0.0005287961,0.00046379285,0.0002480924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033358447,0.000054730783,0.00036072213,0.00020666915,0.000044022658,0.00027766742,0.00027043986,0.40491638,0.059668534,0.4569433,0.0024429117,0.074481085],"study_design_scores_gemma":[0.000018099856,0.0000696263,0.000086027365,0.000014547901,0.000010868828,0.000101260855,0.000018179864,0.95054334,0.0095751155,0.037211515,0.0023370062,0.000014298486],"about_ca_topic_score_codex":0.0013677672,"about_ca_topic_score_gemma":0.0013615438,"teacher_disagreement_score":0.0013677672,"about_ca_system_score_codex":0.000739678,"about_ca_system_score_gemma":0.0007004014,"threshold_uncertainty_score":0.0053667426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008251147,0.00045283817,0.9899013,0.00016703793,0.0000144953765,0.000016048805,0.000023238641,0.000072490286,0.0011013922],"genre_scores_gemma":[0.6661401,0.0014865889,0.3264215,0.00015017437,0.00016950999,0.0002671808,0.00020311287,0.0000633244,0.0050984183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988896,0.0005700064,0.000027150958,0.00010056462,0.00032768224,0.00008492183],"domain_scores_gemma":[0.9945673,0.0046063177,0.00027360444,0.00019535622,0.00030836897,0.000049086768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019677372,0.0005574474,0.00078168855,0.00040480032,0.00023024467,0.0007681172,0.0009921759,0.0011073896,0.00092623476],"category_scores_gemma":[0.011926963,0.00044977825,0.0003152442,0.00084166456,0.0008602545,0.001303718,0.0010365103,0.0008024651,0.0004006863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007625664,0.00003449477,0.00039228538,0.00012827465,0.000031179658,0.0001330126,0.00012568495,0.8387881,0.0036678144,0.1134043,0.0009821928,0.042236503],"study_design_scores_gemma":[0.000008971409,0.00001475755,0.000041275052,0.0000044278563,0.0000024222747,0.000016832624,0.0000036035037,0.98133355,0.00047070277,0.017759284,0.00033976696,0.0000044459794],"about_ca_topic_score_codex":0.0009188588,"about_ca_topic_score_gemma":0.0008303437,"teacher_disagreement_score":0.0019677372,"about_ca_system_score_codex":0.00081612973,"about_ca_system_score_gemma":0.0007094311,"threshold_uncertainty_score":0.010406554},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07674948,0.00072589674,0.91726834,0.00024740415,0.000022707572,0.00004928599,0.000053418175,0.00012837509,0.0047549754],"genre_scores_gemma":[0.96858066,0.00036275954,0.028648756,0.00004466397,0.000017454518,0.00009887358,0.000030856678,0.000026188996,0.0021897268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897134,0.00055274833,0.000027638602,0.00013881753,0.00015356265,0.0001558034],"domain_scores_gemma":[0.9988403,0.0007459843,0.00013846139,0.00006718307,0.00015354397,0.000054466676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015856337,0.0011723974,0.0009872937,0.0005533179,0.00036298676,0.001205053,0.0010563753,0.0012002937,0.00074824115],"category_scores_gemma":[0.0036301888,0.00051596336,0.00032025584,0.0010601388,0.0010568006,0.0011033787,0.00097225676,0.00043458826,0.0002366224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043977772,0.000021530304,0.00019218156,0.000022545324,0.00002443198,0.00006781388,0.000040752384,0.9799009,0.0011353196,0.009286179,0.00021925544,0.009045059],"study_design_scores_gemma":[0.000016249523,0.000043408203,0.0000710186,0.0000037034918,0.000011656894,0.000019466373,0.000020082443,0.99077386,0.00051716354,0.0082297195,0.00028787152,0.000005774148],"about_ca_topic_score_codex":0.0022277175,"about_ca_topic_score_gemma":0.0019011036,"teacher_disagreement_score":0.0022277175,"about_ca_system_score_codex":0.0010585443,"about_ca_system_score_gemma":0.00067629095,"threshold_uncertainty_score":0.008385718},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8750319,0.00077558233,0.11772647,0.00032297662,0.00006505785,0.00009471947,0.00009885742,0.00032586773,0.0055585774],"genre_scores_gemma":[0.99552083,0.000064753876,0.004008124,0.000020041363,0.0000064306573,0.000020856342,0.000014510739,0.00000424861,0.00034019456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988182,0.0004414576,0.00009961345,0.00016122372,0.00018050434,0.00029890318],"domain_scores_gemma":[0.995027,0.0033247794,0.0003731932,0.0003546898,0.00075944694,0.00016080396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016982622,0.001042597,0.00090949127,0.0006000232,0.0007169614,0.001053222,0.0007184185,0.0011393549,0.0012395823],"category_scores_gemma":[0.0072634374,0.00025341066,0.00032128062,0.0005485558,0.0010331229,0.000952926,0.0010135382,0.0005788782,0.000303337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005348988,0.00045960041,0.009554467,0.00035821102,0.0002538077,0.00077383104,0.0010338002,0.82366,0.051280178,0.010854879,0.0008694219,0.09555285],"study_design_scores_gemma":[0.00020254715,0.0012875724,0.0025506474,0.00002699766,0.00009021836,0.0004562727,0.00022061121,0.97968686,0.011741249,0.003400751,0.0002893854,0.000046802263],"about_ca_topic_score_codex":0.0030574633,"about_ca_topic_score_gemma":0.002063408,"teacher_disagreement_score":0.0030574633,"about_ca_system_score_codex":0.00059161475,"about_ca_system_score_gemma":0.00071957347,"threshold_uncertainty_score":0.008981347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14832139,0.0027940504,0.82882875,0.00040090943,0.000039886363,0.000040687326,0.00027864918,0.00036699092,0.018928766],"genre_scores_gemma":[0.9795014,0.0009576422,0.017407877,0.000037761656,0.00003127338,0.000052280833,0.00011108289,0.000037557627,0.0018630917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928206,0.00023185722,0.000024963256,0.000056394907,0.0002941644,0.00011058194],"domain_scores_gemma":[0.99619234,0.0028081343,0.00021735877,0.00028579912,0.00045629774,0.000040094255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015441425,0.0004916,0.0006608703,0.0009312539,0.00028946705,0.00088921667,0.00079895946,0.00054643117,0.0019704679],"category_scores_gemma":[0.008326458,0.00031255264,0.00034335142,0.0007759971,0.0011021469,0.0014236469,0.0006893878,0.0005390715,0.0002958423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002329853,0.000007571136,0.00022075494,0.00004685813,0.000009986362,0.00007614484,0.00005627531,0.9390331,0.0015465855,0.05096664,0.00033457225,0.007678188],"study_design_scores_gemma":[0.0000014631215,0.00000564347,0.0001044957,0.000007794527,0.0000020406283,0.000029467032,0.00001210304,0.98529494,0.0004139512,0.013950957,0.00017187778,0.0000052353344],"about_ca_topic_score_codex":0.0028393487,"about_ca_topic_score_gemma":0.0020866096,"teacher_disagreement_score":0.0028393487,"about_ca_system_score_codex":0.0018622234,"about_ca_system_score_gemma":0.0008897052,"threshold_uncertainty_score":0.013511479},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6775992,0.0015784616,0.31427014,0.0001659104,0.000029412779,0.000046693574,0.00010276903,0.00028268024,0.005924805],"genre_scores_gemma":[0.9958824,0.00028314147,0.0033106066,0.00000799578,0.000009931767,0.000008139117,0.000018981365,0.000008139848,0.00047074008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992828,0.00020835598,0.000031806947,0.000115682466,0.0002567583,0.00010469137],"domain_scores_gemma":[0.99597305,0.0025360603,0.00052951113,0.0002987028,0.0005837351,0.00007884807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088052655,0.0008173535,0.00058054883,0.0005051144,0.00040311573,0.00068109547,0.00058116147,0.0007380736,0.0011351795],"category_scores_gemma":[0.004766501,0.00022540365,0.00034822093,0.00047368946,0.0007266658,0.00093415007,0.00073386583,0.00048054243,0.000222208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002529397,0.000029917104,0.0021377099,0.00014532352,0.00006940092,0.00046981435,0.00026501965,0.9397955,0.028680358,0.017293788,0.00021057214,0.010649698],"study_design_scores_gemma":[0.000007817377,0.00024196533,0.0012063663,0.000010186605,0.000038832004,0.00031632718,0.0000405326,0.98608774,0.008496996,0.003324742,0.00020602989,0.000022508044],"about_ca_topic_score_codex":0.0014922133,"about_ca_topic_score_gemma":0.0008898727,"teacher_disagreement_score":0.0014922133,"about_ca_system_score_codex":0.00076154567,"about_ca_system_score_gemma":0.0003934145,"threshold_uncertainty_score":0.0055253506},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005614789,0.00023596888,0.99092615,0.0001625226,0.000023828534,0.000042848314,0.000029934175,0.00013689978,0.0028271517],"genre_scores_gemma":[0.44980192,0.0009063529,0.54408705,0.0001872072,0.00007897287,0.00027625507,0.00017804946,0.00018693048,0.004297188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957997,0.00013421473,0.000015236691,0.000069670066,0.00013815581,0.000062816565],"domain_scores_gemma":[0.99894494,0.00077838975,0.00006154402,0.00006136644,0.00011940545,0.00003436651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084490445,0.0010500532,0.00079158624,0.00028179053,0.0003899026,0.0007731174,0.0006375666,0.0007372262,0.0023314941],"category_scores_gemma":[0.002577065,0.00031752393,0.00050931546,0.0007142329,0.0006942886,0.0008584739,0.0008214907,0.0019471935,0.0005451065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015578864,0.00010670937,0.00028006383,0.00022181406,0.000018344357,0.00009846902,0.000107217274,0.86701936,0.005764206,0.047307022,0.0031459115,0.07577514],"study_design_scores_gemma":[0.000015313808,0.000026957612,0.00002415269,0.0000044580306,0.0000026079308,0.000023485485,0.000009016521,0.99300295,0.0011220719,0.00516988,0.00059534726,0.0000036693918],"about_ca_topic_score_codex":0.0036995765,"about_ca_topic_score_gemma":0.0045554866,"teacher_disagreement_score":0.0036995765,"about_ca_system_score_codex":0.0009768793,"about_ca_system_score_gemma":0.0015644075,"threshold_uncertainty_score":0.0077996254},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24761596,0.0007379398,0.7367069,0.00023470752,0.000053201074,0.00005717988,0.00011957201,0.00012385308,0.01435066],"genre_scores_gemma":[0.95943886,0.00038994433,0.03813557,0.00006857407,0.000024599804,0.000043544624,0.00005657002,0.000012599098,0.0018297732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993001,0.00024242022,0.000020629845,0.00004724921,0.0003144417,0.00007512213],"domain_scores_gemma":[0.9971397,0.0015723017,0.0003685536,0.00027029632,0.00057007995,0.00007906942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010271021,0.00037528187,0.00046978076,0.00032605446,0.00033315932,0.0005521165,0.0006489049,0.0006143364,0.0008182797],"category_scores_gemma":[0.0025629986,0.00012699737,0.0003094902,0.00086784543,0.0007781987,0.0007797873,0.00059977104,0.0005088763,0.00016821334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013708012,0.00004549876,0.0013000894,0.000095577496,0.000061564635,0.000411257,0.00013707986,0.80048937,0.017160458,0.15874088,0.00067438075,0.02074679],"study_design_scores_gemma":[0.000010809435,0.0000688313,0.00023969922,0.0000065529284,0.000008417256,0.00020282551,0.000020216285,0.9770678,0.0028407888,0.018832367,0.000688244,0.000013468991],"about_ca_topic_score_codex":0.0011776603,"about_ca_topic_score_gemma":0.0016333588,"teacher_disagreement_score":0.0011776603,"about_ca_system_score_codex":0.00051028514,"about_ca_system_score_gemma":0.00062531483,"threshold_uncertainty_score":0.00543195},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8669815,0.0013977186,0.12627223,0.00023626788,0.00004425017,0.000032931766,0.00011019682,0.00014704342,0.004777859],"genre_scores_gemma":[0.99568486,0.00023131052,0.0036596179,0.00002032802,0.000011290771,0.000011353884,0.000022079097,0.000007072143,0.00035212532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973586,0.0012523321,0.00013123789,0.00030187808,0.0005225406,0.00043336663],"domain_scores_gemma":[0.9853059,0.010937177,0.0012864218,0.00079893495,0.0014173776,0.0002541877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004231571,0.0011809231,0.001211734,0.0007617696,0.00056465156,0.0013425044,0.0007626092,0.00092834904,0.00064956077],"category_scores_gemma":[0.013692324,0.0004695269,0.00035735435,0.00059791945,0.0017143976,0.0022107225,0.0017839916,0.0005828339,0.0001586515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093403365,0.00008958974,0.0037613676,0.00012028538,0.00011667213,0.0002488125,0.00020366616,0.95252913,0.010013248,0.013151797,0.00026024616,0.018571112],"study_design_scores_gemma":[0.000045002165,0.00045769472,0.0008887396,0.000014745294,0.00004791415,0.00023494757,0.00007942145,0.9871831,0.00522487,0.0056272023,0.00016239677,0.000033967248],"about_ca_topic_score_codex":0.0018039063,"about_ca_topic_score_gemma":0.0010477194,"teacher_disagreement_score":0.004231571,"about_ca_system_score_codex":0.0011653628,"about_ca_system_score_gemma":0.0007625943,"threshold_uncertainty_score":0.022378981},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018807486,0.00053204305,0.9740034,0.00035467406,0.00004921925,0.000058606147,0.000031266838,0.0000737998,0.006089561],"genre_scores_gemma":[0.84086525,0.00078148296,0.15334578,0.00016575777,0.00013266061,0.00029090536,0.0000543582,0.00004215991,0.0043215686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966595,0.0019327371,0.0000844904,0.00042302327,0.0005191221,0.0003812178],"domain_scores_gemma":[0.9927857,0.005960742,0.0004382322,0.00037422517,0.00029764982,0.0001434555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034444456,0.001113882,0.0011840949,0.00062966644,0.0008344484,0.0015348631,0.0017481287,0.0018168949,0.0026083803],"category_scores_gemma":[0.011102484,0.0004508078,0.00071907375,0.0011200353,0.00179399,0.0022819194,0.0015856819,0.0010007084,0.00051301136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023425315,0.0001040345,0.00044146765,0.0001697731,0.00007455374,0.00031803333,0.00018005798,0.80214435,0.004329394,0.16446958,0.0017006862,0.025833894],"study_design_scores_gemma":[0.000040172497,0.00007988561,0.00009625087,0.000011494464,0.000020520296,0.00009964868,0.00003509807,0.94641256,0.0013053019,0.05066112,0.0012236937,0.000014316706],"about_ca_topic_score_codex":0.0013457823,"about_ca_topic_score_gemma":0.0009688585,"teacher_disagreement_score":0.0034444456,"about_ca_system_score_codex":0.0015333608,"about_ca_system_score_gemma":0.001113139,"threshold_uncertainty_score":0.018216193},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030606918,0.00070998166,0.96400505,0.00010934675,0.00002518304,0.000025869838,0.00003731543,0.00014807982,0.0043322695],"genre_scores_gemma":[0.89481294,0.00092049484,0.09916244,0.0000537249,0.000072127754,0.000055910896,0.000043653214,0.000015315158,0.004863415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960726,0.00012212066,0.000023061517,0.00006212209,0.00013488616,0.00005049267],"domain_scores_gemma":[0.99950004,0.00025756832,0.000076037075,0.00007861686,0.00007875778,0.000008966301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048068448,0.0005787666,0.0004671786,0.00032909057,0.00031020743,0.00053478894,0.00051346753,0.00048976793,0.00085757213],"category_scores_gemma":[0.0018136504,0.00021720743,0.00027988845,0.00040127253,0.00047211067,0.0007514091,0.0005361369,0.00027271514,0.0003252708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015099613,0.00003837298,0.0008621249,0.00012946819,0.00007343246,0.0003068158,0.0002465331,0.7277581,0.02243182,0.08026307,0.0010867093,0.16665244],"study_design_scores_gemma":[0.000019069923,0.00011691852,0.00027530055,0.0000093981935,0.000030188758,0.0002374849,0.00002906072,0.97190094,0.0077751474,0.016694138,0.002899658,0.000012735512],"about_ca_topic_score_codex":0.0010009435,"about_ca_topic_score_gemma":0.0016858653,"teacher_disagreement_score":0.0010009435,"about_ca_system_score_codex":0.00031462868,"about_ca_system_score_gemma":0.00041847603,"threshold_uncertainty_score":0.0028688312},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00315792,0.00015201082,0.9957846,0.000041484705,0.000008137448,0.000018926741,0.000008101195,0.00007580624,0.00075303944],"genre_scores_gemma":[0.45945618,0.0012675562,0.5353658,0.00013958932,0.00008260784,0.0003757786,0.000080475904,0.00011616502,0.003115779],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993056,0.0003855606,0.000029260937,0.0000920138,0.00014206638,0.000045434124],"domain_scores_gemma":[0.9992269,0.0005394631,0.00008771176,0.000039965733,0.00008784394,0.000018127328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014080155,0.0012587694,0.0010577943,0.0005383729,0.0003431814,0.0008908559,0.00075600116,0.0010557948,0.0016191794],"category_scores_gemma":[0.0028514916,0.00066833885,0.00047843682,0.0007845624,0.0007304452,0.001428375,0.0008620683,0.00072610064,0.0006350393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008757744,0.000031941192,0.00022581038,0.00012231298,0.000038497103,0.00007853858,0.000108683926,0.9102812,0.0071255625,0.026219264,0.0009017636,0.054778922],"study_design_scores_gemma":[0.000010331645,0.000046304147,0.000047372665,0.0000081719445,0.0000065749896,0.000033741773,0.000010530015,0.9913327,0.0015294964,0.0065304115,0.0004365729,0.000007764879],"about_ca_topic_score_codex":0.0004929242,"about_ca_topic_score_gemma":0.00063156086,"teacher_disagreement_score":0.0016191794,"about_ca_system_score_codex":0.00062101096,"about_ca_system_score_gemma":0.0005502095,"threshold_uncertainty_score":0.0074463487},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018515784,0.0008307228,0.97238547,0.00016866281,0.00002244184,0.000040595245,0.00004020848,0.00017969016,0.007816444],"genre_scores_gemma":[0.91135204,0.0015671056,0.082824916,0.00012330542,0.00008987881,0.0002702699,0.00011983596,0.000089273824,0.003563445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983223,0.0006863052,0.000058581576,0.00014314767,0.0006545698,0.00013510376],"domain_scores_gemma":[0.9966139,0.0020556257,0.00030750193,0.00019175783,0.0007437103,0.00008749825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024780498,0.00085508625,0.0008279072,0.0006902796,0.00037895585,0.0012144946,0.00091174146,0.00082190696,0.0016224664],"category_scores_gemma":[0.0109751355,0.00058027834,0.0003979909,0.00062845444,0.0011165348,0.0009554106,0.0013839278,0.0007741016,0.00056385936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006242222,0.000024230225,0.00072466483,0.00013714272,0.00004294531,0.000115249306,0.00013279493,0.92166585,0.0042483215,0.052562807,0.0006182642,0.019665224],"study_design_scores_gemma":[0.0000067944607,0.000027029962,0.00012690993,0.000013750814,0.0000082471015,0.000028331211,0.000015002918,0.98732066,0.0006652022,0.011320922,0.00045944846,0.0000076196375],"about_ca_topic_score_codex":0.002162931,"about_ca_topic_score_gemma":0.001659308,"teacher_disagreement_score":0.0024780498,"about_ca_system_score_codex":0.0016327921,"about_ca_system_score_gemma":0.0011492277,"threshold_uncertainty_score":0.013105333},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4005982,0.0015356229,0.59242123,0.00022524498,0.000036426547,0.000058954392,0.000033581495,0.0003083106,0.004782354],"genre_scores_gemma":[0.99298143,0.00016658718,0.0064995755,0.000017387398,0.000006991371,0.000014396372,0.000007733888,0.000007693941,0.00029823958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991985,0.0002848599,0.000029129453,0.000091053815,0.00026073467,0.00013570821],"domain_scores_gemma":[0.99566734,0.0026352229,0.00043824,0.0002977654,0.0008599972,0.00010135481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016468412,0.000738233,0.00056981365,0.0005447037,0.0002681858,0.00051805406,0.00096418976,0.0005239297,0.0007230121],"category_scores_gemma":[0.0070865005,0.00017574625,0.0002846843,0.0004151503,0.000523365,0.0008319047,0.00047148284,0.00036548337,0.00015689721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044648375,0.00012261172,0.0023726984,0.00016317492,0.00007146766,0.00039319115,0.00032806184,0.8802922,0.04420965,0.021883247,0.0005651441,0.049152095],"study_design_scores_gemma":[0.000009398002,0.00014840416,0.0003710394,0.0000040212985,0.000020182915,0.00011731676,0.00003112254,0.99325246,0.0047846073,0.0011055061,0.00014689426,0.0000089903015],"about_ca_topic_score_codex":0.0018431707,"about_ca_topic_score_gemma":0.0012386764,"teacher_disagreement_score":0.0018431707,"about_ca_system_score_codex":0.00077684794,"about_ca_system_score_gemma":0.0007123835,"threshold_uncertainty_score":0.00870949},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013640579,0.00037125024,0.9837098,0.00014135365,0.000028212955,0.000031252195,0.00001661578,0.00010418134,0.0019567013],"genre_scores_gemma":[0.6375298,0.00097309984,0.35767165,0.00016334352,0.000046291207,0.00033871847,0.000114786526,0.00015030857,0.0030119852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996195,0.00016420691,0.000012683584,0.00004517047,0.000121045094,0.000037460704],"domain_scores_gemma":[0.9988078,0.00090799603,0.00008298074,0.000058959497,0.00011455689,0.000027763142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011315995,0.00065180165,0.00052264635,0.00042572932,0.00031769258,0.0005241977,0.0008025943,0.000539347,0.0009948475],"category_scores_gemma":[0.004119216,0.00029540344,0.0002259696,0.0005684526,0.000603975,0.0011535024,0.00086041726,0.000805963,0.0002540074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072463896,0.000045688026,0.00025406078,0.00008759757,0.000013527912,0.000038633847,0.00008246533,0.9025713,0.0068058404,0.035210393,0.0015567065,0.05326134],"study_design_scores_gemma":[0.000007925337,0.00003644056,0.000063976775,0.000006979886,0.0000040712885,0.000014248571,0.000013017318,0.9885925,0.001147529,0.009513477,0.0005962407,0.0000035190744],"about_ca_topic_score_codex":0.000679726,"about_ca_topic_score_gemma":0.000753262,"teacher_disagreement_score":0.0011315995,"about_ca_system_score_codex":0.0007403465,"about_ca_system_score_gemma":0.0007271071,"threshold_uncertainty_score":0.005984485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03620523,0.00056328846,0.94913906,0.00014592828,0.000052407227,0.00003548158,0.00010254205,0.00012943061,0.013626622],"genre_scores_gemma":[0.84549516,0.0018198581,0.13106419,0.000238667,0.00015538595,0.00016026355,0.00021852223,0.000036957306,0.020810956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967897,0.000113379174,0.000010654131,0.000056221048,0.000076267555,0.00006452946],"domain_scores_gemma":[0.9997272,0.00011862511,0.000050261806,0.000034226938,0.000050958024,0.000018696097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002916752,0.0007936898,0.00028926923,0.00022157162,0.00028191874,0.0007348085,0.0002842037,0.0004577835,0.0030899872],"category_scores_gemma":[0.00057536666,0.0001923001,0.00034732893,0.0003198735,0.0004424329,0.00072104076,0.0005978249,0.0005349434,0.0007364752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040292527,0.00008151533,0.0011761454,0.000318513,0.00006134538,0.000647621,0.00035122337,0.41613007,0.069385424,0.41302758,0.004369779,0.094047815],"study_design_scores_gemma":[0.000027123988,0.00023060886,0.0007408811,0.000028786617,0.000022673164,0.00044117804,0.00012867316,0.91896427,0.0090141455,0.064100996,0.006264855,0.00003585567],"about_ca_topic_score_codex":0.0007567717,"about_ca_topic_score_gemma":0.000676951,"teacher_disagreement_score":0.0030899872,"about_ca_system_score_codex":0.00033936359,"about_ca_system_score_gemma":0.00040959928,"threshold_uncertainty_score":0.010337055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005497258,0.0001791875,0.9902378,0.000112820555,0.000021032805,0.000030705043,0.000011237948,0.00006917952,0.003840815],"genre_scores_gemma":[0.5648688,0.0009451966,0.42405987,0.00017126164,0.00016070693,0.0002125262,0.00005564051,0.000057248668,0.009468661],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999298,0.00028789564,0.000027609696,0.00009855085,0.00023442853,0.00005344231],"domain_scores_gemma":[0.9993401,0.00034008743,0.00007038346,0.0001085918,0.00011466715,0.000026077496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008940085,0.000728227,0.0005092223,0.00048100602,0.00041704712,0.00088821707,0.0012232873,0.0009167779,0.0022685144],"category_scores_gemma":[0.0018151099,0.00021572819,0.0004440854,0.00060658687,0.0008689181,0.0015065998,0.0011641536,0.0009450894,0.0006323954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016625304,0.00013285538,0.00035123044,0.00015929074,0.000053948675,0.00036410344,0.00026904524,0.56784904,0.03708417,0.28868324,0.0016994334,0.10318739],"study_design_scores_gemma":[0.000035267632,0.00014166928,0.000091150025,0.000011502346,0.000018359005,0.00020375314,0.00003350831,0.9199926,0.006464455,0.068546414,0.0044390536,0.000022330054],"about_ca_topic_score_codex":0.000328977,"about_ca_topic_score_gemma":0.00041286522,"teacher_disagreement_score":0.0022685144,"about_ca_system_score_codex":0.00065462576,"about_ca_system_score_gemma":0.0004273466,"threshold_uncertainty_score":0.0075889826},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18681806,0.00025823055,0.8099598,0.0001589532,0.000010320035,0.000037012946,0.000079938356,0.0001011991,0.0025765307],"genre_scores_gemma":[0.93268377,0.00022050328,0.06566958,0.000019121653,0.000009864183,0.00007356297,0.000044714045,0.000018988703,0.0012598117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996252,0.00019776425,0.000015704014,0.000052872518,0.00005828915,0.000050104973],"domain_scores_gemma":[0.99891555,0.00078480464,0.0001193999,0.00007284646,0.00007842692,0.000028915063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087479816,0.0005101884,0.00060851657,0.00036803487,0.00025919458,0.0004603781,0.0005942511,0.0004863335,0.00057217345],"category_scores_gemma":[0.0029660533,0.0002794309,0.00021859027,0.00049302424,0.0007273843,0.0009009874,0.0006198957,0.0002940757,0.00015200317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007549482,0.00001935562,0.0002831176,0.000021534435,0.000008937968,0.000060572766,0.0000749622,0.9740016,0.0031615226,0.010766725,0.00018099441,0.011345222],"study_design_scores_gemma":[0.00001024071,0.000028781871,0.00005574831,0.0000020335876,0.0000039335337,0.000014518149,0.00002016049,0.9916693,0.0012836439,0.0067655765,0.00014260996,0.0000033840881],"about_ca_topic_score_codex":0.0014201332,"about_ca_topic_score_gemma":0.0013872848,"teacher_disagreement_score":0.0014201332,"about_ca_system_score_codex":0.000623854,"about_ca_system_score_gemma":0.000397725,"threshold_uncertainty_score":0.004626453},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05240272,0.00024118621,0.9430283,0.00019092613,0.000017162487,0.00004502328,0.000036678342,0.00008288571,0.00395515],"genre_scores_gemma":[0.8888428,0.0002839976,0.10872749,0.000046091267,0.000025708514,0.00013208413,0.00003133296,0.000027689317,0.0018828028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893993,0.0005292748,0.000034276654,0.000112428264,0.00021076582,0.00017333981],"domain_scores_gemma":[0.9986755,0.0009410132,0.000121516234,0.00009591837,0.000120312725,0.000045597975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020700218,0.00086591946,0.001016169,0.00040246855,0.0004076726,0.0010827983,0.0006940131,0.00070165395,0.0012480131],"category_scores_gemma":[0.0033548544,0.00040277178,0.0005251209,0.00063463574,0.0013662148,0.0010711934,0.00125892,0.0007309975,0.00023712151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015155313,0.00006650958,0.00028014882,0.00006760072,0.000027312326,0.00022589623,0.00016209349,0.9211427,0.005047505,0.054222696,0.00056951196,0.01803648],"study_design_scores_gemma":[0.000016329566,0.000034886114,0.00004492317,0.0000035139965,0.0000064857168,0.000032132495,0.000018078614,0.9881813,0.0010682126,0.010377394,0.00020966191,0.000007130683],"about_ca_topic_score_codex":0.0014245822,"about_ca_topic_score_gemma":0.0012184648,"teacher_disagreement_score":0.0020700218,"about_ca_system_score_codex":0.000907711,"about_ca_system_score_gemma":0.0013169516,"threshold_uncertainty_score":0.010947466},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026623294,0.004581178,0.95466393,0.0003159581,0.0002689269,0.00016751084,0.00014229996,0.0008742722,0.012362677],"genre_scores_gemma":[0.6476452,0.00387514,0.33709854,0.00020858938,0.00029050693,0.00030106877,0.00026027986,0.000040794406,0.010279867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992029,0.00022601652,0.000051294104,0.00013935076,0.0002983458,0.000081996914],"domain_scores_gemma":[0.99937916,0.00017166362,0.00010426223,0.00012868455,0.00018374066,0.000032487747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000581559,0.0008169627,0.00074450736,0.00072680117,0.00068411237,0.0007383898,0.0008435003,0.0006749256,0.0011446308],"category_scores_gemma":[0.000747838,0.00023919648,0.00038242203,0.0006512319,0.00068059587,0.00091810705,0.0006947109,0.00074086984,0.0005579133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007309508,0.00018961709,0.001708583,0.0011106177,0.00028503008,0.0019672345,0.00093874027,0.13654599,0.23062411,0.30470178,0.009959786,0.31123757],"study_design_scores_gemma":[0.00022245062,0.0010576455,0.0011234597,0.0001398182,0.00019969406,0.003966599,0.000111773625,0.78797686,0.11075359,0.035657823,0.05845999,0.00033030944],"about_ca_topic_score_codex":0.0013125902,"about_ca_topic_score_gemma":0.001520811,"teacher_disagreement_score":0.0013125902,"about_ca_system_score_codex":0.00055689405,"about_ca_system_score_gemma":0.0007046403,"threshold_uncertainty_score":0.004040599},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044531535,0.0057907403,0.00028286927,0.045076508,0.94673663,0.000021595659,0.00007493488,0.00007476628,0.001897401],"genre_scores_gemma":[0.00050671044,0.0042011617,0.00015331019,0.033931494,0.95053864,0.000028662593,0.000062366016,0.000049818023,0.0105279],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963142,0.0005968775,0.00044519457,0.00054997,0.0016919789,0.00040174593],"domain_scores_gemma":[0.9824709,0.0060578045,0.0014061015,0.0004659389,0.0077323536,0.001866825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004530311,0.0035964602,0.0034739708,0.0035541838,0.0024074283,0.006027057,0.002783477,0.014950014,0.017747885],"category_scores_gemma":[0.017471667,0.0010308498,0.0022185799,0.0018348546,0.0024327394,0.0037379744,0.0014927768,0.020753063,0.012266531],"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.000039937822,0.000008570551,0.000019441302,0.00010724847,0.00001239889,0.0000585736,0.0000041663056,0.000018979665,0.0000737335,0.00024825372,0.99532133,0.004087291],"study_design_scores_gemma":[0.000048195347,0.000036852038,0.0003023301,0.00023011163,0.00005021067,0.00014312027,0.000017094288,0.0001470431,0.00013358647,0.0007380287,0.998135,0.00001837456],"about_ca_topic_score_codex":0.0020999438,"about_ca_topic_score_gemma":0.0054724817,"teacher_disagreement_score":0.017747885,"about_ca_system_score_codex":0.002563318,"about_ca_system_score_gemma":0.0019158372,"threshold_uncertainty_score":0.059372544},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058452837,0.001312244,0.9293237,0.0001874732,0.00002489807,0.00004257545,0.00011551551,0.00022166534,0.0103191035],"genre_scores_gemma":[0.95393527,0.0016045696,0.0415049,0.00005866787,0.000043823275,0.00008087916,0.00009790131,0.000032251777,0.0026417708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935323,0.0002038678,0.000025769448,0.00006035828,0.00027102584,0.0000857766],"domain_scores_gemma":[0.99799573,0.0012756105,0.00017456102,0.0001055995,0.0004085377,0.000039964558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011953082,0.0011128776,0.00065225153,0.0006900007,0.0003983363,0.00097527093,0.0005709167,0.0007895225,0.0018494151],"category_scores_gemma":[0.0037328675,0.00031041275,0.00042919684,0.00068692485,0.000520007,0.00087130093,0.00073410926,0.0005734857,0.0005826631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000599356,0.000017651997,0.0005185631,0.000063286556,0.00002373814,0.000109553745,0.00005015721,0.9593461,0.008028603,0.017749282,0.0003404522,0.013692653],"study_design_scores_gemma":[0.0000024156482,0.00004789472,0.00020853702,0.0000068647087,0.0000090501535,0.00007965894,0.000016442644,0.99489504,0.0012434857,0.003250928,0.00023015638,0.0000094637435],"about_ca_topic_score_codex":0.0019330824,"about_ca_topic_score_gemma":0.0016052336,"teacher_disagreement_score":0.0019330824,"about_ca_system_score_codex":0.0009824033,"about_ca_system_score_gemma":0.0006408738,"threshold_uncertainty_score":0.007127881},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38036916,0.00074255484,0.6101558,0.00035336716,0.000032156317,0.00006299986,0.00012818968,0.00014785123,0.008008002],"genre_scores_gemma":[0.9906178,0.00014202831,0.008284949,0.000019005423,0.000008016511,0.000024718225,0.000020569842,0.000006179597,0.0008767459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934834,0.00028466198,0.000019100853,0.000074189644,0.00013761195,0.0001361338],"domain_scores_gemma":[0.99877185,0.0006407687,0.00022220233,0.000088682085,0.00020664855,0.00006985742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014344335,0.00065569195,0.0008490248,0.00039895135,0.00037164256,0.0007324252,0.000870411,0.0006129774,0.0007829686],"category_scores_gemma":[0.0018275029,0.00029844462,0.00044889163,0.0004889379,0.0012338937,0.0007601652,0.00068172213,0.00032602958,0.00017626582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025824623,0.000062851344,0.00059571385,0.00009070129,0.00007280183,0.00038166283,0.0002405917,0.94327664,0.013041171,0.03480066,0.0005339659,0.0066450317],"study_design_scores_gemma":[0.00001864893,0.00006772246,0.00011786083,0.000003179321,0.00001485034,0.00005079201,0.000027685675,0.9950885,0.00072457246,0.0037739915,0.00010432515,0.000007907359],"about_ca_topic_score_codex":0.0028903247,"about_ca_topic_score_gemma":0.0018609937,"teacher_disagreement_score":0.0028903247,"about_ca_system_score_codex":0.0012693378,"about_ca_system_score_gemma":0.0009430912,"threshold_uncertainty_score":0.009209752},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24638732,0.0023182489,0.7355071,0.001101937,0.0000801144,0.00004213145,0.00023034943,0.00032381355,0.014008988],"genre_scores_gemma":[0.97055155,0.0013403842,0.025876064,0.00014673389,0.000063613596,0.0000436281,0.000098316596,0.000053384472,0.0018263254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752134,0.00078314816,0.000083656494,0.00024719088,0.0010784768,0.0002861738],"domain_scores_gemma":[0.9885415,0.008370876,0.0009489204,0.00087121193,0.0010902078,0.00017739726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020248785,0.0011630306,0.0011653301,0.0005986494,0.00057319197,0.0009890675,0.0009021947,0.0010637768,0.00083659723],"category_scores_gemma":[0.014203432,0.0006474433,0.0005125893,0.0010897601,0.0017748795,0.0016145917,0.0011008501,0.0013516202,0.00035001108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000367988,0.000054996402,0.0024458014,0.00024285575,0.00007814418,0.0006751802,0.00022566057,0.75757146,0.02615669,0.18862997,0.000963867,0.022587286],"study_design_scores_gemma":[0.000021250577,0.00004353525,0.0004901056,0.000025691923,0.00002494377,0.00020375091,0.0000215299,0.9733907,0.010760814,0.014564978,0.0004215925,0.00003122027],"about_ca_topic_score_codex":0.002367146,"about_ca_topic_score_gemma":0.0018926555,"teacher_disagreement_score":0.002367146,"about_ca_system_score_codex":0.0013303877,"about_ca_system_score_gemma":0.0014365695,"threshold_uncertainty_score":0.01070869},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5513376,0.0010362057,0.44418287,0.00032407301,0.000055000044,0.00005777835,0.00015119973,0.00022087702,0.0026345204],"genre_scores_gemma":[0.98590404,0.00033388083,0.013226027,0.000025448262,0.000024224752,0.00001694717,0.000031686464,0.000010024247,0.00042771772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976897,0.001039661,0.000105239225,0.00025095957,0.00055562815,0.00035872168],"domain_scores_gemma":[0.9581918,0.03429748,0.003742408,0.0019022062,0.0015593495,0.00030672163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004387043,0.0015026368,0.0011391622,0.0005638844,0.0005495431,0.0010470962,0.0011988888,0.00091898435,0.0005084533],"category_scores_gemma":[0.02630306,0.0005347696,0.00043120855,0.0009707439,0.0016181875,0.0020335694,0.0011272904,0.0008859514,0.00015531287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004615542,0.00005615968,0.004363952,0.000104017454,0.000097228076,0.0007315251,0.00023247967,0.9664606,0.005519855,0.008192971,0.00021218871,0.013567463],"study_design_scores_gemma":[0.000024620223,0.00024384417,0.0010577507,0.00001103677,0.00007011964,0.00030591298,0.00006227678,0.9888626,0.0051653525,0.004019358,0.00015651231,0.00002068471],"about_ca_topic_score_codex":0.003050228,"about_ca_topic_score_gemma":0.0032604248,"teacher_disagreement_score":0.004387043,"about_ca_system_score_codex":0.00094478246,"about_ca_system_score_gemma":0.0007880717,"threshold_uncertainty_score":0.023201168},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015339339,0.0002097244,0.9835982,0.000093176,0.000016820975,0.000019968944,0.000024897918,0.00014078377,0.00055721856],"genre_scores_gemma":[0.70570564,0.00062591454,0.2910658,0.00007161983,0.00006849122,0.00010707768,0.000078471756,0.00004610711,0.0022308307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993755,0.00028871643,0.000025602176,0.00007674023,0.00019060074,0.00004287263],"domain_scores_gemma":[0.99684286,0.0025497118,0.00023351405,0.00014231732,0.00018759248,0.000043963864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013666644,0.0006686641,0.0007987307,0.00034469774,0.00035576968,0.0006658511,0.00050864666,0.00089470175,0.00081814715],"category_scores_gemma":[0.007376795,0.00034064963,0.00036335795,0.0004279528,0.00088802486,0.0009866942,0.00088059576,0.00084518985,0.00027632748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017723608,0.000043528653,0.00046406128,0.00014843016,0.000042198637,0.00011137407,0.000094831645,0.92338353,0.008432411,0.020870505,0.0007137957,0.045518115],"study_design_scores_gemma":[0.000009507588,0.000028783712,0.00008210993,0.0000030619026,0.0000067963547,0.00003362709,0.000008230854,0.99218583,0.002202999,0.005243666,0.00018528744,0.000010011081],"about_ca_topic_score_codex":0.001195565,"about_ca_topic_score_gemma":0.0012686967,"teacher_disagreement_score":0.0013666644,"about_ca_system_score_codex":0.0005567157,"about_ca_system_score_gemma":0.00078515214,"threshold_uncertainty_score":0.007227659},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050198035,0.013630011,0.9684059,0.0024226496,0.00023199494,0.000087086264,0.000063212305,0.00021697517,0.009922292],"genre_scores_gemma":[0.57637507,0.04874819,0.36659983,0.0011857888,0.0014614684,0.00068961416,0.00027760668,0.0002152065,0.0044471873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99425226,0.0025994673,0.0002239159,0.000653841,0.0020137771,0.00025681977],"domain_scores_gemma":[0.979705,0.016206507,0.0007022408,0.0019087993,0.0012546866,0.00022283808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053221867,0.00088286167,0.0015004362,0.0015560708,0.0008100707,0.0031849092,0.002784818,0.002721517,0.0015889021],"category_scores_gemma":[0.026491065,0.00081088283,0.00055141334,0.002666304,0.006492497,0.006541762,0.00236529,0.0032846075,0.00071535277],"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.0000474202,0.00004146205,0.00067239534,0.0006592285,0.00004659468,0.00023267342,0.00034571716,0.22361203,0.001188361,0.6907118,0.0048369733,0.07760526],"study_design_scores_gemma":[0.00002813289,0.00005819145,0.00016884622,0.00023454084,0.000018771849,0.00032201243,0.000095907904,0.49222398,0.0011866465,0.48799655,0.017618274,0.000048149195],"about_ca_topic_score_codex":0.0029419956,"about_ca_topic_score_gemma":0.001151405,"teacher_disagreement_score":0.0053221867,"about_ca_system_score_codex":0.0025627278,"about_ca_system_score_gemma":0.0020643224,"threshold_uncertainty_score":0.028146744},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017585581,0.0004385449,0.978,0.00018197014,0.000032710814,0.00003871343,0.000058516667,0.00012922863,0.0035347345],"genre_scores_gemma":[0.7428632,0.0010619139,0.25148284,0.00016773725,0.00008734295,0.00017433999,0.00014134702,0.000080840604,0.0039405106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993793,0.00026634813,0.000029135444,0.0001026509,0.00013676447,0.00008569119],"domain_scores_gemma":[0.99892235,0.0007280907,0.00009313278,0.00008142584,0.00013135218,0.000043666983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011548173,0.0011498512,0.0012112719,0.00041787207,0.00031452102,0.0012796774,0.0011041379,0.0010413115,0.0017522958],"category_scores_gemma":[0.002135277,0.0003959004,0.0006383482,0.0013388034,0.00065236405,0.0013741264,0.0011783419,0.0010085934,0.0005200466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113577604,0.00006179349,0.0002063621,0.0001852996,0.000035356043,0.00020310988,0.000091722875,0.9251425,0.005157575,0.025873909,0.0014293918,0.04149935],"study_design_scores_gemma":[0.0000107316255,0.000034904857,0.000028661943,0.000004592861,0.000005216871,0.00006232756,0.000012441284,0.99375457,0.0010304247,0.004739642,0.00031210002,0.0000044542667],"about_ca_topic_score_codex":0.0013883534,"about_ca_topic_score_gemma":0.0010859655,"teacher_disagreement_score":0.0017522958,"about_ca_system_score_codex":0.00069846166,"about_ca_system_score_gemma":0.00074786047,"threshold_uncertainty_score":0.0061072707},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3584965,0.001378105,0.5818619,0.002165018,0.00012511088,0.00012439158,0.0011094797,0.0012469362,0.053492527],"genre_scores_gemma":[0.98675936,0.00069387496,0.008364571,0.00020311831,0.000115846946,0.00011040938,0.00025315367,0.00022750969,0.0032721602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682367,0.0010158885,0.000121689,0.00048042243,0.00086427265,0.00069404545],"domain_scores_gemma":[0.9573204,0.032537207,0.0026485967,0.002806537,0.003458268,0.0012289509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041852975,0.0009342142,0.001537161,0.0015995031,0.0009730662,0.0025448787,0.0018378795,0.0013767849,0.0058494117],"category_scores_gemma":[0.054157976,0.0007108505,0.00070066506,0.0012957675,0.0035889496,0.0051959646,0.0029404338,0.0026434225,0.0009478922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012628175,0.00014628186,0.0074311974,0.00052458764,0.000103981045,0.0022970545,0.0009432772,0.30162632,0.029907377,0.61974335,0.004309909,0.03170379],"study_design_scores_gemma":[0.000057729423,0.00023877528,0.0035335007,0.00017654625,0.00004665437,0.0023629963,0.00040139706,0.73730606,0.017268447,0.23603226,0.002461903,0.00011372449],"about_ca_topic_score_codex":0.0010688335,"about_ca_topic_score_gemma":0.0005597114,"teacher_disagreement_score":0.0058494117,"about_ca_system_score_codex":0.0016623084,"about_ca_system_score_gemma":0.00080996036,"threshold_uncertainty_score":0.022134244},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011866661,0.000113248825,0.9868776,0.00006997047,0.000017610826,0.00002065812,0.000013565121,0.000081314305,0.0009393502],"genre_scores_gemma":[0.85141474,0.00020954596,0.1464486,0.00007403372,0.0000582013,0.00013438621,0.00004374939,0.00003708193,0.0015797693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943227,0.00020230212,0.000017986868,0.00010333508,0.00015364567,0.00009038292],"domain_scores_gemma":[0.99886405,0.00071859406,0.00017639782,0.000065778906,0.00012146664,0.0000537545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009504175,0.00087762845,0.00068672886,0.0003516092,0.00037469968,0.00079416984,0.0009311453,0.00057674834,0.0008467944],"category_scores_gemma":[0.0023288946,0.00034555417,0.0004000867,0.00057997287,0.0009394698,0.0006175808,0.000722439,0.00069151184,0.00016031071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005022865,0.00003246954,0.00012480271,0.000028588596,0.000016474844,0.00003597665,0.000033252374,0.97104186,0.0018167644,0.010419296,0.00024686064,0.016153444],"study_design_scores_gemma":[0.000009747085,0.000017087817,0.000020617743,7.550148e-7,0.00000252896,0.0000046205823,0.0000034567638,0.9969554,0.0003263296,0.0025778522,0.00007948942,0.0000021410362],"about_ca_topic_score_codex":0.004467447,"about_ca_topic_score_gemma":0.0035630795,"teacher_disagreement_score":0.004467447,"about_ca_system_score_codex":0.0010622957,"about_ca_system_score_gemma":0.0012112539,"threshold_uncertainty_score":0.00888288},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098468706,0.00079582504,0.8932284,0.0009646111,0.00010512903,0.00021841507,0.00008148199,0.0023526787,0.0037847892],"genre_scores_gemma":[0.8693764,0.000531156,0.12661843,0.00029836013,0.00022314604,0.0003726494,0.00016922536,0.00019523878,0.0022153517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968362,0.0011041354,0.00013543825,0.00052268914,0.0011744809,0.00022690986],"domain_scores_gemma":[0.98215646,0.008580161,0.0016575058,0.005207852,0.0019911334,0.00040696433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003991728,0.00093977596,0.0011176127,0.0009688631,0.0013790164,0.0022812213,0.003048381,0.001137014,0.0008380173],"category_scores_gemma":[0.018013738,0.00057642604,0.0004371281,0.0019631989,0.001785557,0.0054351543,0.00395795,0.0016364058,0.0004590479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010773801,0.0008602879,0.023190163,0.0009143083,0.00042878682,0.0016400776,0.00487542,0.27044177,0.087232016,0.13316044,0.01808243,0.4580969],"study_design_scores_gemma":[0.0001269546,0.0004166895,0.0030635416,0.000059912054,0.00011578214,0.0008340866,0.0005493869,0.8978013,0.031111304,0.053258922,0.0125501985,0.000112022506],"about_ca_topic_score_codex":0.0014774519,"about_ca_topic_score_gemma":0.0009960984,"teacher_disagreement_score":0.003991728,"about_ca_system_score_codex":0.0007139311,"about_ca_system_score_gemma":0.0016994752,"threshold_uncertainty_score":0.021110475},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030565713,0.0023684637,0.9537344,0.00028192045,0.00005095739,0.00008721828,0.0009061801,0.0004879816,0.011517196],"genre_scores_gemma":[0.81564647,0.005068157,0.16794737,0.00022079144,0.00015731383,0.0006001422,0.0014944535,0.0002667684,0.008598519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983393,0.0003597153,0.00011312707,0.00016109049,0.00077530555,0.0002513786],"domain_scores_gemma":[0.9923367,0.005497506,0.0005666446,0.00046882994,0.0010569236,0.0000733861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003281997,0.0014802846,0.0015511216,0.0019495821,0.00058826746,0.0022407435,0.0015652769,0.0011371033,0.004681467],"category_scores_gemma":[0.016629836,0.0007177455,0.0007362973,0.0020972416,0.0017249049,0.003084456,0.0011694094,0.00094297435,0.0010577751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050690636,0.000036518097,0.0007066048,0.0002734752,0.000038484817,0.00026635837,0.00019127874,0.82598317,0.0021370049,0.13771315,0.0021025569,0.030500745],"study_design_scores_gemma":[0.000006630789,0.000021320247,0.0003946329,0.000066447436,0.000015015411,0.00021367888,0.000060990424,0.9362741,0.0012987588,0.06054776,0.0010649659,0.00003572595],"about_ca_topic_score_codex":0.0033808483,"about_ca_topic_score_gemma":0.005474018,"teacher_disagreement_score":0.004681467,"about_ca_system_score_codex":0.0028019955,"about_ca_system_score_gemma":0.0021672135,"threshold_uncertainty_score":0.020330012},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1383091,0.0052585737,0.82745206,0.0007250627,0.00013988477,0.000038235543,0.00026936174,0.00030816044,0.02749957],"genre_scores_gemma":[0.9860194,0.0025962878,0.008970904,0.000062148145,0.0001248677,0.000055635275,0.00012170487,0.00004183717,0.002007292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906176,0.000292597,0.000035929566,0.00007689597,0.00031711554,0.00021557721],"domain_scores_gemma":[0.9925263,0.00597278,0.00038101716,0.00035788235,0.00066401635,0.00009809806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016326343,0.00076391257,0.00080164423,0.0010319557,0.0005086399,0.0013520934,0.0007737782,0.00060144166,0.0020632863],"category_scores_gemma":[0.008618709,0.00029534433,0.00035924846,0.0012326392,0.0018259544,0.0017492531,0.0010472853,0.00096437306,0.00040957273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056640518,0.000017763728,0.00043102968,0.00013158318,0.000031468033,0.0002209776,0.0001517972,0.79981524,0.003149366,0.1786091,0.0011090157,0.016275918],"study_design_scores_gemma":[0.0000043150885,0.00001852658,0.00026272365,0.000033287502,0.00001120959,0.000083018334,0.000034978482,0.94348836,0.0012165257,0.05406465,0.000762463,0.000019901874],"about_ca_topic_score_codex":0.0025417663,"about_ca_topic_score_gemma":0.0011869011,"teacher_disagreement_score":0.0025417663,"about_ca_system_score_codex":0.0014933307,"about_ca_system_score_gemma":0.00084601855,"threshold_uncertainty_score":0.010834932},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79054177,0.0013019622,0.19547188,0.001111429,0.00007128482,0.00010427011,0.00013704428,0.00029423911,0.01096611],"genre_scores_gemma":[0.9894917,0.00042587562,0.009471167,0.00002690993,0.0000138275755,0.00003642775,0.00005729086,0.00005769809,0.00041911492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971722,0.0017666222,0.00011585503,0.00018221114,0.00052628847,0.00023682574],"domain_scores_gemma":[0.9199544,0.06814442,0.0030969956,0.0041412874,0.0040339967,0.0006288563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004089994,0.0004336443,0.0006965499,0.0011575293,0.0009518085,0.0012452198,0.0010432553,0.0011266067,0.0010420976],"category_scores_gemma":[0.05951517,0.00037326862,0.0002856481,0.0013326736,0.0018130541,0.0039078863,0.0009916453,0.0007560408,0.00032117128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002708138,0.0001156816,0.006669615,0.00019083917,0.00006318718,0.0003138298,0.00052143855,0.8827392,0.011893419,0.06085436,0.0011138958,0.035253655],"study_design_scores_gemma":[0.0000626328,0.00028747114,0.004164175,0.000045843026,0.00007192819,0.00061724463,0.00049476675,0.9125414,0.013326204,0.06682963,0.0014906973,0.00006809024],"about_ca_topic_score_codex":0.0014894649,"about_ca_topic_score_gemma":0.0011655699,"teacher_disagreement_score":0.004089994,"about_ca_system_score_codex":0.00087904313,"about_ca_system_score_gemma":0.00071961596,"threshold_uncertainty_score":0.021630228},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031094002,0.00087084435,0.9570921,0.0004023375,0.00007304275,0.000070521404,0.00006156574,0.000062549276,0.010272985],"genre_scores_gemma":[0.9258331,0.0012597699,0.06928418,0.00011711664,0.00012641597,0.00020385609,0.000059005637,0.000019039071,0.0030976287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873465,0.000681698,0.000035484252,0.00010748487,0.0002798086,0.00016085563],"domain_scores_gemma":[0.9970716,0.0021593072,0.00027035087,0.00020972159,0.0002447406,0.000044219632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016382415,0.0008505142,0.00058396877,0.0005048304,0.00039580115,0.000968624,0.0011488721,0.0009139011,0.0009334107],"category_scores_gemma":[0.0053453194,0.00029834363,0.00054085173,0.0011041741,0.0015005269,0.0016452859,0.0011722053,0.00077665475,0.00022629107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006956916,0.000037619946,0.0006290625,0.0000963731,0.000032039177,0.0002961289,0.00009864865,0.7525709,0.0023887758,0.23082218,0.0010711842,0.011887493],"study_design_scores_gemma":[0.00001756341,0.000030160725,0.000080276805,0.0000075888265,0.0000108783215,0.000069102156,0.000010336671,0.9705856,0.00050150853,0.02797264,0.000706124,0.0000082890365],"about_ca_topic_score_codex":0.0021193407,"about_ca_topic_score_gemma":0.0014772811,"teacher_disagreement_score":0.0021193407,"about_ca_system_score_codex":0.0011261249,"about_ca_system_score_gemma":0.00094669405,"threshold_uncertainty_score":0.008664012},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045718253,0.0011231297,0.9468008,0.00041891093,0.000083496234,0.000034174685,0.00004226632,0.0003549333,0.005424079],"genre_scores_gemma":[0.8028333,0.0011356263,0.1911606,0.00016632059,0.00006318516,0.00008492897,0.00007230492,0.000051432504,0.004432205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948716,0.0001373916,0.000020984338,0.000050639654,0.0002494585,0.00005429237],"domain_scores_gemma":[0.9986994,0.0007074788,0.00013393392,0.00020743122,0.00022914736,0.000022539189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010078144,0.00043362673,0.0003640087,0.00052625756,0.00031723012,0.00046781029,0.00066385174,0.0005707891,0.0010934768],"category_scores_gemma":[0.0032357387,0.00015741766,0.00023854559,0.0005949453,0.00056001404,0.0012028385,0.0008866041,0.00078892906,0.00019809465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004145361,0.00009512152,0.0007130822,0.00020654211,0.00005292422,0.0002866078,0.0003059937,0.5423874,0.07709562,0.19610266,0.0032941706,0.17904536],"study_design_scores_gemma":[0.000016838652,0.000075847645,0.00019425721,0.00002036527,0.000017207763,0.0001404349,0.000020764683,0.9641666,0.017866744,0.013848206,0.0036183181,0.000014457786],"about_ca_topic_score_codex":0.001289542,"about_ca_topic_score_gemma":0.0012042945,"teacher_disagreement_score":0.001289542,"about_ca_system_score_codex":0.0006618611,"about_ca_system_score_gemma":0.00064478593,"threshold_uncertainty_score":0.0053298473},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015358731,0.008992617,0.9628016,0.0009717637,0.00035193638,0.000101044294,0.000025236657,0.0004541665,0.010942887],"genre_scores_gemma":[0.65682757,0.014556835,0.31408203,0.00039612746,0.0007525843,0.00024304715,0.000088733075,0.000087710345,0.012965281],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920374,0.0002417336,0.000046037567,0.00008882253,0.00035948746,0.00006024471],"domain_scores_gemma":[0.99895465,0.00048429763,0.00013921506,0.00022161483,0.00015605285,0.000044212986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012746837,0.00043096795,0.00047161675,0.0006511391,0.000876195,0.0012693603,0.00093897176,0.0011816572,0.0011634551],"category_scores_gemma":[0.0025042277,0.0003368672,0.00032001562,0.00072054926,0.0018051577,0.0025569738,0.0012155372,0.00096992933,0.00042959876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012474928,0.000091085654,0.00084638956,0.00059254264,0.00005041091,0.0005457439,0.00063389586,0.10867464,0.01569303,0.38721147,0.006196897,0.47933912],"study_design_scores_gemma":[0.00008224778,0.00025551603,0.0005875711,0.00017565864,0.00006322523,0.0014967425,0.0003273705,0.43718603,0.013109948,0.45792726,0.088727154,0.000061327824],"about_ca_topic_score_codex":0.0005350982,"about_ca_topic_score_gemma":0.00037399735,"teacher_disagreement_score":0.0012746837,"about_ca_system_score_codex":0.00042816292,"about_ca_system_score_gemma":0.0005197087,"threshold_uncertainty_score":0.0067412853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011974938,0.0005357524,0.98078454,0.00029961666,0.00009389695,0.000116411604,0.00008327985,0.0004607564,0.005650832],"genre_scores_gemma":[0.61680704,0.00071819837,0.3733737,0.00041790228,0.00020620496,0.00040172675,0.00026765084,0.00013304428,0.007674515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982894,0.0006392808,0.00009528249,0.00014316097,0.00062708947,0.00020573661],"domain_scores_gemma":[0.99634796,0.0012506229,0.00056508835,0.000693879,0.0009991953,0.00014316573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017026083,0.0007195844,0.0006387365,0.0008353521,0.0007863996,0.0011936101,0.0008675676,0.00078799104,0.0025097486],"category_scores_gemma":[0.006452741,0.00024612935,0.00021372059,0.0011861287,0.0009987031,0.0012612249,0.0015061708,0.0013011168,0.0009878846],"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.0009108712,0.00014291017,0.00045816903,0.0003487358,0.000037834685,0.00044675215,0.00043778997,0.10434999,0.04553467,0.5555281,0.008896046,0.28290808],"study_design_scores_gemma":[0.00013547606,0.00043655123,0.0001866233,0.000085954896,0.000034456847,0.0006506638,0.00008373433,0.7859096,0.032814413,0.16016091,0.019387178,0.00011444787],"about_ca_topic_score_codex":0.0013924469,"about_ca_topic_score_gemma":0.0016628276,"teacher_disagreement_score":0.0025097486,"about_ca_system_score_codex":0.0009453398,"about_ca_system_score_gemma":0.0014083708,"threshold_uncertainty_score":0.0090043545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21482377,0.00089830323,0.7751666,0.00035944278,0.00002338302,0.000079772835,0.000054247717,0.000092707436,0.008501842],"genre_scores_gemma":[0.97392625,0.00026502117,0.023892377,0.000024422008,0.000011496044,0.000053066902,0.000016791824,0.000018870625,0.0017916667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995295,0.0002483669,0.000015566946,0.00006168577,0.000076533,0.000068367044],"domain_scores_gemma":[0.9980135,0.0015351428,0.00026110286,0.000046312798,0.000108753586,0.000035102723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010026667,0.0009874918,0.0009913462,0.00041190267,0.00030267806,0.0010963874,0.000606462,0.0011452629,0.0009881755],"category_scores_gemma":[0.003931919,0.00046257116,0.0004610309,0.0005852601,0.0010527626,0.0007632265,0.0008220409,0.0006009532,0.00016658526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000305187,0.000010448381,0.00020556351,0.000027722743,0.000014842779,0.000046525034,0.000026817197,0.99373806,0.0011184803,0.0020953596,0.000059035123,0.0026265394],"study_design_scores_gemma":[0.000013984121,0.000044335746,0.0001671443,0.000005112874,0.000015743835,0.000022624212,0.000018542814,0.9972434,0.0007450396,0.0016049045,0.00011307986,0.000006204534],"about_ca_topic_score_codex":0.0029201435,"about_ca_topic_score_gemma":0.0017193255,"teacher_disagreement_score":0.0029201435,"about_ca_system_score_codex":0.00093597954,"about_ca_system_score_gemma":0.0007111873,"threshold_uncertainty_score":0.006791115},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014666945,0.0015030634,0.96267515,0.0007122117,0.00006561468,0.00005880781,0.00021809491,0.00012531078,0.019974839],"genre_scores_gemma":[0.8501976,0.0067759124,0.11779331,0.0004052709,0.00035762985,0.0010101598,0.00081028556,0.00014140226,0.022508407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991903,0.0003401209,0.000029092595,0.000109264816,0.00023491103,0.00009642164],"domain_scores_gemma":[0.99841666,0.0010407161,0.00018844477,0.000089519584,0.00021389706,0.00005075096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009632055,0.0012351178,0.0007362089,0.00090796524,0.0005278196,0.0014201095,0.0019603306,0.0015495613,0.00343118],"category_scores_gemma":[0.003552185,0.00040912905,0.00062539376,0.0016627279,0.0011394655,0.002786381,0.000996647,0.0013503013,0.0006840146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016294858,0.000021315813,0.00015151249,0.00006791008,0.000016620463,0.00015031232,0.00018418285,0.55391145,0.0006021335,0.43391696,0.002389015,0.0085723875],"study_design_scores_gemma":[0.000011279068,0.000027423446,0.00007053668,0.000020824333,0.000010302404,0.00007475823,0.000051896433,0.7888879,0.0001122573,0.20643695,0.004284521,0.000011381818],"about_ca_topic_score_codex":0.0034660085,"about_ca_topic_score_gemma":0.0029050356,"teacher_disagreement_score":0.0034660085,"about_ca_system_score_codex":0.0013841992,"about_ca_system_score_gemma":0.00059101824,"threshold_uncertainty_score":0.011478424},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021973465,0.00023658013,0.9756588,0.00022785302,0.000021551417,0.000020138501,0.000012301863,0.00005281495,0.0017965349],"genre_scores_gemma":[0.83075666,0.00029687444,0.16641004,0.00013915113,0.000030285062,0.00015934127,0.000041430434,0.000037902348,0.0021283152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996288,0.00018944145,0.000012316195,0.00005823946,0.00007151181,0.000039704955],"domain_scores_gemma":[0.9993149,0.00047364866,0.000089971734,0.000033387056,0.000058501693,0.000029585528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081705296,0.0006489408,0.00076004746,0.00040077706,0.00042315,0.00072922424,0.0008051582,0.0008754753,0.00081959815],"category_scores_gemma":[0.002681099,0.00039616236,0.00037188444,0.00041958128,0.0011510738,0.001085528,0.0009147771,0.00069582637,0.00012758643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019952804,0.000015504904,0.00021130721,0.000028908133,0.000016562877,0.000018365807,0.000030772022,0.9747114,0.0008917764,0.0140879555,0.00018380956,0.009783778],"study_design_scores_gemma":[0.0000074864556,0.000010669827,0.00005021418,0.0000024612318,0.0000024339618,0.0000053507215,0.0000045306256,0.99527514,0.0001377165,0.0043626428,0.00013896417,0.0000023659934],"about_ca_topic_score_codex":0.00267031,"about_ca_topic_score_gemma":0.0016595853,"teacher_disagreement_score":0.00267031,"about_ca_system_score_codex":0.00092554407,"about_ca_system_score_gemma":0.00082311156,"threshold_uncertainty_score":0.0067152977},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008562463,0.00038628565,0.98901355,0.00009529017,0.00002414564,0.000029435629,0.00004567792,0.000049375245,0.0017938059],"genre_scores_gemma":[0.6524839,0.0022285273,0.3387182,0.00012736594,0.00012540915,0.00019745175,0.000189453,0.00004567925,0.0058840956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954456,0.00016924087,0.0000254846,0.00007269226,0.00014762633,0.000040388095],"domain_scores_gemma":[0.9992956,0.0004036585,0.00008743733,0.000053166856,0.00013099685,0.000029048999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000794596,0.000589256,0.00056822563,0.00029815795,0.00023463731,0.0007368027,0.00056930963,0.00055685104,0.0015722376],"category_scores_gemma":[0.0022795778,0.00021656265,0.000249778,0.0006265416,0.0005838895,0.00094546814,0.00047203345,0.00044054684,0.00044808706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006758274,0.00002864869,0.00028946932,0.00012841265,0.000021716514,0.00014287877,0.000115376526,0.7938726,0.008915794,0.1163844,0.0017561706,0.07827688],"study_design_scores_gemma":[0.000008844335,0.00004287122,0.00007872037,0.000006142913,0.0000043822565,0.00003446902,0.000019281286,0.9708802,0.0012549439,0.026599456,0.0010609565,0.000009693937],"about_ca_topic_score_codex":0.0021137805,"about_ca_topic_score_gemma":0.0021409967,"teacher_disagreement_score":0.0021137805,"about_ca_system_score_codex":0.0008200907,"about_ca_system_score_gemma":0.0008244688,"threshold_uncertainty_score":0.005950153},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13926284,0.0033509,0.8247712,0.0023730085,0.00015278811,0.000048846407,0.00046691092,0.00087608816,0.028697344],"genre_scores_gemma":[0.983083,0.0014509325,0.012523642,0.00027490765,0.0003013166,0.00006787519,0.0001555965,0.000098981945,0.002043871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962877,0.0011284642,0.00015394819,0.0003717999,0.0014278478,0.00063032313],"domain_scores_gemma":[0.98069465,0.015322168,0.0013827352,0.0012481242,0.0010783067,0.00027389842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003977769,0.0012610729,0.0015749638,0.0009918478,0.000974905,0.0022434015,0.0012668576,0.0017588974,0.0017267287],"category_scores_gemma":[0.023806676,0.00077157846,0.0005357351,0.0017934948,0.0035054819,0.0033975597,0.0024171718,0.0021783859,0.00058820663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037147076,0.00009758762,0.002530418,0.00035989902,0.000066831046,0.001097663,0.00079558167,0.6756257,0.007977698,0.27249417,0.0050647063,0.03351829],"study_design_scores_gemma":[0.000050270348,0.000097923665,0.0012023086,0.00007600853,0.0000534193,0.00069369405,0.00015571683,0.7724955,0.003951242,0.21931978,0.0018428718,0.00006129402],"about_ca_topic_score_codex":0.0014848639,"about_ca_topic_score_gemma":0.0008172305,"teacher_disagreement_score":0.003977769,"about_ca_system_score_codex":0.0020571249,"about_ca_system_score_gemma":0.0010528227,"threshold_uncertainty_score":0.021036744},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38862315,0.0061364993,0.5972983,0.0010812049,0.0002555831,0.0001039321,0.00016028674,0.00028528622,0.006055696],"genre_scores_gemma":[0.97718036,0.002227469,0.017896444,0.00010170228,0.00014615338,0.000077875804,0.00009837995,0.00009050885,0.0021809982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982734,0.0006326488,0.00012796231,0.00014922876,0.0005621929,0.00025459265],"domain_scores_gemma":[0.9474183,0.04044708,0.0058584833,0.0018163627,0.0038172486,0.00064248365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004439001,0.0012035886,0.0010424575,0.0017296548,0.0005164975,0.0015330535,0.00073884206,0.001044002,0.0011960588],"category_scores_gemma":[0.03642102,0.00037380224,0.00039611914,0.0010926172,0.0021109318,0.00295639,0.0012481457,0.0012609138,0.00020923291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035670807,0.000053421852,0.004199883,0.00028399812,0.00008409006,0.0010308488,0.0005798592,0.77304465,0.0083550615,0.19122411,0.0011592942,0.019628126],"study_design_scores_gemma":[0.000022836426,0.0001060931,0.0013201197,0.00008438579,0.000028605407,0.00048368092,0.00012967535,0.9522515,0.0035032753,0.04140866,0.00057770865,0.00008346592],"about_ca_topic_score_codex":0.0011389615,"about_ca_topic_score_gemma":0.00082679593,"teacher_disagreement_score":0.004439001,"about_ca_system_score_codex":0.0010929268,"about_ca_system_score_gemma":0.0008197465,"threshold_uncertainty_score":0.023475945},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037784208,0.0020049692,0.9387447,0.00091756764,0.00019998493,0.00012930247,0.000045053395,0.00019813611,0.01997597],"genre_scores_gemma":[0.885723,0.0014899778,0.1046592,0.00034131168,0.00019642095,0.00026613646,0.00005852518,0.000038538583,0.0072268774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942774,0.0002646428,0.000021873548,0.0000727606,0.0001620561,0.000050927312],"domain_scores_gemma":[0.9995453,0.00022663387,0.000051568448,0.00005903179,0.0000848735,0.00003259697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008615535,0.0006014079,0.0004803968,0.00051747984,0.0006883433,0.00087677164,0.0010183525,0.0012305358,0.000963015],"category_scores_gemma":[0.0018481726,0.00017696571,0.00033097208,0.0006502235,0.0007660876,0.0013324408,0.00088520965,0.0005157657,0.00030234753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014355073,0.000118334574,0.00049706886,0.00028601175,0.000080803904,0.0004751594,0.0005241471,0.16252068,0.022954162,0.6836752,0.007664053,0.12106083],"study_design_scores_gemma":[0.000035509187,0.0001731964,0.0001565944,0.00003714502,0.0000315762,0.00030790336,0.00008680454,0.77679425,0.0026555958,0.2084358,0.011266076,0.000019635823],"about_ca_topic_score_codex":0.00039127225,"about_ca_topic_score_gemma":0.00040622673,"teacher_disagreement_score":0.0012305358,"about_ca_system_score_codex":0.0005327003,"about_ca_system_score_gemma":0.0004369371,"threshold_uncertainty_score":0.0045564175},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023155525,0.0010928065,0.9520088,0.00087715563,0.00016403176,0.000069287256,0.00031203282,0.00013165575,0.02218885],"genre_scores_gemma":[0.8801765,0.004154365,0.10636972,0.00064774614,0.00055392267,0.0003434864,0.0003298636,0.00009609636,0.00732835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990314,0.0001912358,0.00002433139,0.00010010665,0.0005337583,0.000119193246],"domain_scores_gemma":[0.9973465,0.0017458668,0.00025445016,0.00024353643,0.00034407608,0.00006557864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008351408,0.00066261156,0.0005902003,0.0008774507,0.000665846,0.0016422614,0.0012294569,0.0014027775,0.0033624156],"category_scores_gemma":[0.005256111,0.00033131684,0.00045053387,0.0007681696,0.0021294237,0.002787163,0.0010751929,0.0014185417,0.00072170654],"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.000037735972,0.00004480112,0.00030776492,0.00017320266,0.000016638438,0.00025124216,0.00012713768,0.29480854,0.005056474,0.6833859,0.0022269725,0.013563498],"study_design_scores_gemma":[0.000016504651,0.000114442126,0.00029748987,0.00006619418,0.000019561645,0.00086564955,0.00009233445,0.7338134,0.0032827628,0.25029638,0.01107959,0.000055638637],"about_ca_topic_score_codex":0.0009088576,"about_ca_topic_score_gemma":0.0005611053,"teacher_disagreement_score":0.0033624156,"about_ca_system_score_codex":0.0013045501,"about_ca_system_score_gemma":0.0012685553,"threshold_uncertainty_score":0.01124841},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6842567,0.0020055845,0.3038276,0.00042497294,0.000024412604,0.000066641354,0.00016503381,0.00022396083,0.009005034],"genre_scores_gemma":[0.99213034,0.00025379888,0.0069299014,0.00002280261,0.000011585848,0.00001592462,0.000036856956,0.000012868273,0.0005858592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805164,0.00072188716,0.0000894146,0.00019012293,0.0007474009,0.00019951121],"domain_scores_gemma":[0.9871656,0.010062237,0.0010329951,0.00058594195,0.0010311898,0.0001221181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003303284,0.0010357669,0.0009004419,0.0005508641,0.00033036683,0.00089568604,0.0007726714,0.0010064878,0.00080062164],"category_scores_gemma":[0.013922103,0.00030695045,0.00041571364,0.0004937346,0.0009417914,0.0013788496,0.0009661953,0.00054834486,0.0002157854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023355195,0.000037786085,0.0021612623,0.00008759167,0.000066664004,0.00019503967,0.00012170077,0.96032447,0.012279163,0.016788285,0.00012090728,0.0075836927],"study_design_scores_gemma":[0.000011644547,0.00018257502,0.00081963703,0.000010069282,0.00003181031,0.0001864178,0.000036748086,0.98648095,0.00867035,0.0034033426,0.00014629477,0.0000201951],"about_ca_topic_score_codex":0.0013955482,"about_ca_topic_score_gemma":0.0007703237,"teacher_disagreement_score":0.003303284,"about_ca_system_score_codex":0.0011045575,"about_ca_system_score_gemma":0.0006648353,"threshold_uncertainty_score":0.017469645},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061365996,0.009746058,0.90248567,0.0004172581,0.00015772608,0.000046510806,0.00025681828,0.00082672003,0.0246972],"genre_scores_gemma":[0.9398728,0.005097918,0.051373612,0.000172902,0.00027074773,0.00012824062,0.00023756237,0.00013313058,0.0027131585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971113,0.0006936667,0.0001148673,0.00023996542,0.0013546033,0.0004855809],"domain_scores_gemma":[0.98769903,0.008442526,0.00079428003,0.0013672145,0.0015435775,0.00015333417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038339419,0.0019366799,0.0014278698,0.0016728888,0.00064574095,0.002320431,0.0012721956,0.0010951088,0.0030386152],"category_scores_gemma":[0.022995317,0.00045386425,0.0007029732,0.0013103412,0.0016642555,0.0030904703,0.0019834852,0.001970647,0.00087039894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002303202,0.000049336104,0.00078139897,0.0002860559,0.000061446684,0.00019737941,0.00024179467,0.84792006,0.008338154,0.08670449,0.0014871719,0.053702388],"study_design_scores_gemma":[0.000013299331,0.00013507807,0.0006510266,0.00010385398,0.00003684569,0.0002643419,0.000073186384,0.9407434,0.005442274,0.050702453,0.0017833094,0.00005099497],"about_ca_topic_score_codex":0.0021056843,"about_ca_topic_score_gemma":0.0017923726,"teacher_disagreement_score":0.0038339419,"about_ca_system_score_codex":0.0021647473,"about_ca_system_score_gemma":0.0010186436,"threshold_uncertainty_score":0.02027601},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3882631,0.0014892835,0.59901255,0.000857835,0.000072800976,0.00017780985,0.00018056156,0.00030540905,0.009640545],"genre_scores_gemma":[0.9897625,0.0003829466,0.009099675,0.000025743322,0.000018910529,0.000057194775,0.000040738436,0.000027773383,0.00058459607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990237,0.00042013233,0.000022369595,0.00010913102,0.000331122,0.000093536124],"domain_scores_gemma":[0.9871701,0.010824414,0.00062999694,0.00041675614,0.00084404065,0.00011480195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019844435,0.0005734163,0.0007102391,0.00056081446,0.0004972203,0.0005490279,0.00059532106,0.0008158544,0.0008494925],"category_scores_gemma":[0.021034077,0.00027007924,0.00018954763,0.00058676256,0.0015211145,0.0018843416,0.000728763,0.0010565318,0.00012352466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046232937,0.000019763693,0.00043538093,0.000063940206,0.000014712504,0.00008269705,0.000082940955,0.95740724,0.006378105,0.030743126,0.00022938347,0.0044964356],"study_design_scores_gemma":[0.0000059552135,0.000017406264,0.00015874763,0.0000062419203,0.000005843416,0.000035118825,0.00001712729,0.99171174,0.0015646148,0.006305939,0.00016224216,0.000009125446],"about_ca_topic_score_codex":0.002588542,"about_ca_topic_score_gemma":0.0013747633,"teacher_disagreement_score":0.002588542,"about_ca_system_score_codex":0.001078456,"about_ca_system_score_gemma":0.00091575284,"threshold_uncertainty_score":0.010494888},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047282603,0.0009059111,0.9452356,0.00011189443,0.000016570828,0.000027062031,0.00006343167,0.00013630185,0.0062206807],"genre_scores_gemma":[0.9269385,0.0013552778,0.06954146,0.000042059746,0.00003152041,0.00006386771,0.00005977302,0.00002007679,0.0019476014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996074,0.00015849127,0.000015913427,0.000034942746,0.00014203474,0.000041195395],"domain_scores_gemma":[0.99860615,0.0009961134,0.000107264,0.00007658096,0.00018969161,0.000024275754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008113632,0.0007925814,0.00045803643,0.0004639171,0.0003290548,0.0006593585,0.00035943923,0.0004879834,0.0015162887],"category_scores_gemma":[0.0029465242,0.00028114757,0.00027227658,0.0005873417,0.00039090132,0.00078520336,0.0004849679,0.0003910178,0.00039836555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005488293,0.000020367606,0.0006271532,0.00008299564,0.000026063683,0.00013110726,0.000050075098,0.93538696,0.008408159,0.0268553,0.0003666496,0.027990462],"study_design_scores_gemma":[0.0000025172756,0.000053986845,0.00016691719,0.000006634124,0.000008076327,0.00008905621,0.000014036299,0.991738,0.0012900274,0.006322202,0.00030129077,0.00000732526],"about_ca_topic_score_codex":0.0008708793,"about_ca_topic_score_gemma":0.0013615381,"teacher_disagreement_score":0.0015162887,"about_ca_system_score_codex":0.000568639,"about_ca_system_score_gemma":0.00040435581,"threshold_uncertainty_score":0.0050724745},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041721754,0.0010116367,0.9546046,0.0001432617,0.00003088513,0.00003792023,0.000031044536,0.000106145126,0.0023127263],"genre_scores_gemma":[0.92733043,0.00054917065,0.070467524,0.000041384075,0.0000369379,0.00010837588,0.000032532924,0.000019139881,0.0014144751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941206,0.0003085683,0.000019672943,0.00008748906,0.00009507142,0.000077145385],"domain_scores_gemma":[0.9993673,0.0004334411,0.000064817374,0.000042386146,0.00006205465,0.000029977467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007786849,0.0007311692,0.00086442207,0.0003526379,0.0005616318,0.0007230386,0.00084776,0.0007887528,0.0008012665],"category_scores_gemma":[0.0018371983,0.00032930556,0.000375137,0.0006434936,0.0005626801,0.00091191445,0.00076529523,0.00042066505,0.00023564932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013083829,0.000060273986,0.00040217832,0.00010445464,0.0000385478,0.00030716037,0.00015859875,0.92820036,0.008265191,0.017348342,0.0012799077,0.04370409],"study_design_scores_gemma":[0.0000070704136,0.00002462647,0.000056852725,0.0000023049784,0.000006418693,0.000036004418,0.000015243326,0.9962239,0.00055495923,0.002791668,0.0002761383,0.0000047314848],"about_ca_topic_score_codex":0.0021437714,"about_ca_topic_score_gemma":0.0021295769,"teacher_disagreement_score":0.0021437714,"about_ca_system_score_codex":0.0006128881,"about_ca_system_score_gemma":0.00058960094,"threshold_uncertainty_score":0.0044468045},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008266857,0.00027775866,0.9871863,0.00014767924,0.000083390645,0.000055727043,0.00012713419,0.0002992523,0.0035558909],"genre_scores_gemma":[0.7520578,0.00081952097,0.23584525,0.0002876645,0.00026824637,0.0003380284,0.00062995683,0.00010245839,0.00965112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998231,0.0004618172,0.00006763456,0.00035300705,0.0006886327,0.00019799023],"domain_scores_gemma":[0.9976197,0.00085837,0.00026185196,0.0006615148,0.00051452394,0.00008410033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010991347,0.0004774914,0.00093840074,0.0005282392,0.0004993858,0.0011102384,0.0014046317,0.0008110416,0.0016222293],"category_scores_gemma":[0.003268482,0.0002867425,0.00047614967,0.0010677538,0.00096620683,0.0013962553,0.0009651741,0.001030058,0.0006199476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002153764,0.000071950366,0.0006471045,0.00013107804,0.000060765116,0.00020824611,0.00008284406,0.689929,0.013145924,0.21221617,0.004448123,0.07884338],"study_design_scores_gemma":[0.000029361347,0.00005055051,0.00009566015,0.000006745289,0.000007983141,0.00010282695,0.000009462925,0.9710944,0.0021344756,0.022226254,0.004228397,0.000013814219],"about_ca_topic_score_codex":0.0024672095,"about_ca_topic_score_gemma":0.002600604,"teacher_disagreement_score":0.0024672095,"about_ca_system_score_codex":0.0013775267,"about_ca_system_score_gemma":0.0019800465,"threshold_uncertainty_score":0.009994686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036546897,0.0008391792,0.9568026,0.0002985245,0.000030368006,0.00005096424,0.000060239316,0.00016959218,0.005201717],"genre_scores_gemma":[0.9425826,0.00063393346,0.055237558,0.000069967726,0.00004914045,0.00013774789,0.00004706056,0.000040787807,0.0012012643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998686,0.0007893744,0.000031685922,0.00012697042,0.00019353568,0.00017241151],"domain_scores_gemma":[0.9970521,0.0022022703,0.00022999091,0.00017494199,0.00024228233,0.00009843669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019737694,0.0009395812,0.00097476103,0.0006691461,0.0004239603,0.0010044264,0.0013767265,0.00086819567,0.0006994632],"category_scores_gemma":[0.005352788,0.00040963735,0.0003978725,0.0015191401,0.0012278255,0.001120972,0.001324,0.0006632345,0.00015780449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055760167,0.00003424258,0.00017266144,0.00010043945,0.00002738594,0.000084607454,0.000099295336,0.9583206,0.0017586199,0.0258904,0.0009830866,0.012472802],"study_design_scores_gemma":[0.000010005881,0.00001863732,0.000039931678,0.000007597967,0.000007698351,0.000027358195,0.000024031306,0.9864223,0.00063456746,0.01242868,0.00037307892,0.000005996648],"about_ca_topic_score_codex":0.003135946,"about_ca_topic_score_gemma":0.0022220078,"teacher_disagreement_score":0.003135946,"about_ca_system_score_codex":0.0010558959,"about_ca_system_score_gemma":0.0011307094,"threshold_uncertainty_score":0.010438383},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30606323,0.0025247056,0.6765261,0.00046238425,0.00003951647,0.00003128963,0.00021990904,0.00026890577,0.013863905],"genre_scores_gemma":[0.97750527,0.000677356,0.020158246,0.000038121758,0.000028684215,0.000024060135,0.00009369606,0.000026604037,0.0014480107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989681,0.00021817426,0.00003270943,0.00012528371,0.000545784,0.00010988627],"domain_scores_gemma":[0.9947238,0.0030863702,0.000522737,0.0005142437,0.0010558148,0.00009705241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011448949,0.0006824762,0.0006224568,0.0008970633,0.0004246277,0.00063057605,0.0006550174,0.00066695333,0.0007098537],"category_scores_gemma":[0.0058010635,0.00024921139,0.00033246382,0.00078231486,0.0011081182,0.0011712288,0.00058969954,0.00076262414,0.00021799542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017680245,0.00004895689,0.0021580216,0.00012156148,0.00004603919,0.00021129288,0.00021985885,0.86754227,0.02247244,0.08739174,0.0007254011,0.018885612],"study_design_scores_gemma":[0.000009035165,0.000051595613,0.0008789135,0.000011126232,0.000012149543,0.00016250453,0.00003131131,0.96742624,0.005481796,0.025550203,0.00036085368,0.000024264686],"about_ca_topic_score_codex":0.0021878893,"about_ca_topic_score_gemma":0.0012160063,"teacher_disagreement_score":0.0021878893,"about_ca_system_score_codex":0.0014678843,"about_ca_system_score_gemma":0.0009598781,"threshold_uncertainty_score":0.010650277},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5388689,0.0034057996,0.4443495,0.00033794096,0.000041625626,0.00008314037,0.0002430392,0.00044620506,0.012223926],"genre_scores_gemma":[0.99408937,0.00058564264,0.0046673142,0.000020800233,0.00001812762,0.000024649353,0.000049640388,0.000013714498,0.00053073507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986971,0.0004648225,0.000037079895,0.00013529789,0.00042414936,0.00024161633],"domain_scores_gemma":[0.99006104,0.0070436457,0.00084137515,0.0003455459,0.0015651135,0.00014322165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015736236,0.0012098921,0.00071077194,0.00088930817,0.0004882558,0.0009194113,0.0011245721,0.0008406194,0.0010148189],"category_scores_gemma":[0.008204166,0.00027157608,0.00030118637,0.0009321971,0.0012555855,0.0010190712,0.0008286937,0.00051708857,0.00022164176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001321229,0.000021174146,0.0011651749,0.000057508798,0.000032257143,0.00016705565,0.000098766075,0.9752295,0.0041508516,0.009007238,0.00025433017,0.009684137],"study_design_scores_gemma":[0.000004193347,0.00011082807,0.0005439782,0.000006892292,0.000019682737,0.00007094701,0.000023374474,0.9958812,0.0011403201,0.00208681,0.00010006277,0.000011707893],"about_ca_topic_score_codex":0.0039734114,"about_ca_topic_score_gemma":0.0020709145,"teacher_disagreement_score":0.0039734114,"about_ca_system_score_codex":0.0017593104,"about_ca_system_score_gemma":0.0005592656,"threshold_uncertainty_score":0.012764692},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2007609,0.0034576193,0.78202146,0.0008912883,0.00014354342,0.00008385976,0.000104517145,0.00028304494,0.012253766],"genre_scores_gemma":[0.9427376,0.0007529197,0.053209405,0.00007038296,0.00008603563,0.000065642555,0.000041065487,0.000019976818,0.00301697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990119,0.00039879186,0.000051771527,0.00009319923,0.00028661074,0.00015764772],"domain_scores_gemma":[0.9977246,0.001104352,0.00024058818,0.00049648766,0.00036957266,0.00006436769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018294872,0.00041951932,0.0007213036,0.0006229612,0.0006430804,0.0011661862,0.0012427535,0.00073519716,0.0011286954],"category_scores_gemma":[0.0042202785,0.00042509608,0.00037947914,0.0007907335,0.0008560756,0.002079184,0.0010902622,0.0007206674,0.00030777827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008504557,0.00017937213,0.0021281769,0.00024222756,0.000081492784,0.00069810386,0.0008194086,0.37768757,0.028903693,0.40090996,0.0038586007,0.18364099],"study_design_scores_gemma":[0.00010395474,0.00025186565,0.00081860524,0.000050317092,0.00006664642,0.00080974324,0.00014443827,0.8653591,0.007041591,0.12195982,0.0033137186,0.00008017823],"about_ca_topic_score_codex":0.001215271,"about_ca_topic_score_gemma":0.0020425743,"teacher_disagreement_score":0.0018294872,"about_ca_system_score_codex":0.00079650566,"about_ca_system_score_gemma":0.0007422694,"threshold_uncertainty_score":0.009675384},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65013087,0.0016606983,0.31889644,0.0012674922,0.00005925054,0.000038640384,0.0004982449,0.00066577,0.026782515],"genre_scores_gemma":[0.99619126,0.00025638955,0.0026372573,0.000058390222,0.000019175284,0.000016160704,0.00008037222,0.000020962225,0.00072014175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998621,0.00051112485,0.00004687231,0.00013262192,0.00040433113,0.0002841159],"domain_scores_gemma":[0.98596245,0.011416461,0.0009825479,0.0006378494,0.00074722926,0.00025345292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002804728,0.00044437507,0.0008240608,0.000612714,0.0005378046,0.00091425644,0.0006494636,0.0009602183,0.0017656023],"category_scores_gemma":[0.015123809,0.0002702562,0.00031447125,0.00078646594,0.0026853203,0.0013715992,0.0010543328,0.0008832041,0.00033367428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049947936,0.000059573114,0.009407386,0.00015531413,0.00005018943,0.0007330579,0.00050737936,0.8728677,0.0057450975,0.09788826,0.0017517572,0.010334796],"study_design_scores_gemma":[0.00004787748,0.000113369286,0.0054152817,0.00005904912,0.00003776211,0.0007682316,0.00022099595,0.94512635,0.0049874303,0.042341083,0.0008302295,0.00005238112],"about_ca_topic_score_codex":0.0019025799,"about_ca_topic_score_gemma":0.0009042275,"teacher_disagreement_score":0.002804728,"about_ca_system_score_codex":0.0010577041,"about_ca_system_score_gemma":0.0007900948,"threshold_uncertainty_score":0.0148329735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38984558,0.00060509116,0.593846,0.00042922795,0.00005310058,0.00017103861,0.000106281455,0.0005963501,0.014347365],"genre_scores_gemma":[0.9817191,0.0000905624,0.017325163,0.000013351509,0.0000085907795,0.000045846144,0.000023901906,0.000012488227,0.00076109223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988951,0.0004387689,0.00003512087,0.00011178389,0.00033193867,0.00018726583],"domain_scores_gemma":[0.99729127,0.0016986307,0.00021654753,0.0002706782,0.00044412122,0.00007873332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017883333,0.00073807535,0.00039924012,0.0007719241,0.00040944666,0.0008694354,0.0007610712,0.0005813409,0.00060270843],"category_scores_gemma":[0.0045077703,0.00016295069,0.0002744939,0.0009407059,0.0009723902,0.00067841157,0.00082914426,0.00049044954,0.00009469873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030894444,0.00010634905,0.00080329814,0.00005673415,0.00004226466,0.00024357311,0.00011372575,0.90863997,0.026746606,0.029738173,0.00080515235,0.0323951],"study_design_scores_gemma":[0.0000126223385,0.00009994528,0.00018368871,0.0000031313916,0.000014536163,0.00005506973,0.000014755502,0.99101627,0.005320691,0.0030258603,0.00024192977,0.0000115420535],"about_ca_topic_score_codex":0.0027020795,"about_ca_topic_score_gemma":0.002191414,"teacher_disagreement_score":0.0027020795,"about_ca_system_score_codex":0.0013951535,"about_ca_system_score_gemma":0.0013121563,"threshold_uncertainty_score":0.010122597},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009203063,0.00026908962,0.9891122,0.000080317666,0.000018112323,0.0000147816345,0.000028600452,0.00024178893,0.0010320239],"genre_scores_gemma":[0.54697496,0.00065247575,0.44809282,0.00020003387,0.00009901234,0.00008100881,0.00018040265,0.000076923214,0.0036423076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882454,0.00035556435,0.00006111499,0.000117697,0.000570666,0.00007042165],"domain_scores_gemma":[0.9979274,0.0013002373,0.00015318961,0.00024612568,0.0003288733,0.000044030425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085229654,0.00067153317,0.00059411995,0.0005081369,0.0002098679,0.000874559,0.00060224015,0.00056962494,0.0013560995],"category_scores_gemma":[0.0053037032,0.00029420078,0.00030436335,0.0004522042,0.0005572158,0.0010690296,0.0009813968,0.0006885444,0.00052798016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003365928,0.00008135602,0.0011786815,0.0003053312,0.00009514294,0.00030466245,0.0002330801,0.49360037,0.06568442,0.13639845,0.0038190102,0.2979629],"study_design_scores_gemma":[0.000018478151,0.00007620656,0.00017133533,0.000010329226,0.000010988464,0.00020475044,0.00000919441,0.9653593,0.016172351,0.015604813,0.0023428034,0.000019437724],"about_ca_topic_score_codex":0.0005997819,"about_ca_topic_score_gemma":0.000908253,"teacher_disagreement_score":0.0013560995,"about_ca_system_score_codex":0.0005940288,"about_ca_system_score_gemma":0.0006935896,"threshold_uncertainty_score":0.004536569},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29599783,0.0005411484,0.70038074,0.00020275482,0.00002361929,0.00004379356,0.000022002838,0.0002907613,0.002497346],"genre_scores_gemma":[0.9850247,0.00013788098,0.014337654,0.000018907744,0.000004693095,0.000017946228,0.000005694926,0.000009942845,0.00044256132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930394,0.00023767698,0.000025123296,0.000062549865,0.0002834266,0.00008724864],"domain_scores_gemma":[0.9957165,0.003115239,0.0004371044,0.00022538927,0.0004581114,0.000047723533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012252668,0.0005585002,0.000319647,0.00035574997,0.00028012472,0.0005077157,0.00058822485,0.0004521906,0.00032478495],"category_scores_gemma":[0.0060553406,0.00020658235,0.000101283964,0.00045058524,0.0010176378,0.0007488125,0.0006466059,0.0004116318,0.00008599876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010899081,0.000033704066,0.0007215689,0.000061822415,0.000017069544,0.00009506329,0.00018240204,0.9500277,0.02280501,0.007434091,0.00014661449,0.018365882],"study_design_scores_gemma":[0.000008585654,0.00005480879,0.00013080335,0.000007048761,0.000007039168,0.00003438919,0.000018560566,0.9895879,0.0070731277,0.0028992868,0.00016896824,0.000009482666],"about_ca_topic_score_codex":0.0024474172,"about_ca_topic_score_gemma":0.0021265582,"teacher_disagreement_score":0.0024474172,"about_ca_system_score_codex":0.0006473585,"about_ca_system_score_gemma":0.00051629345,"threshold_uncertainty_score":0.0064798594},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03365418,0.00040778294,0.90405977,0.00044484605,0.0003801818,0.0011527266,0.0009639882,0.04252012,0.016416315],"genre_scores_gemma":[0.61585814,0.000757919,0.3329142,0.0006263064,0.00043168492,0.0024576932,0.0031316788,0.002397695,0.041424684],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999519,0.00008716054,0.00004244055,0.0000863443,0.00018994432,0.0000752186],"domain_scores_gemma":[0.99902785,0.00032273866,0.00007040979,0.00022113597,0.00020867962,0.0001491935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010818044,0.0010431614,0.00047966288,0.0005963083,0.00070057926,0.00094363495,0.001468917,0.000927814,0.010797883],"category_scores_gemma":[0.0034018704,0.00041444687,0.000333757,0.00035229215,0.00066430075,0.0018003149,0.0020275444,0.0011750343,0.0017115867],"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.0034284794,0.0005192343,0.0025361932,0.00055388996,0.00013227743,0.0008899789,0.0011636376,0.025735706,0.17340729,0.046526454,0.06399308,0.6811139],"study_design_scores_gemma":[0.000677017,0.0012104054,0.003002167,0.00019033479,0.00010558757,0.001118328,0.00026016228,0.5558077,0.19471209,0.046222884,0.1964428,0.00025053776],"about_ca_topic_score_codex":0.0021598304,"about_ca_topic_score_gemma":0.0023398576,"teacher_disagreement_score":0.010797883,"about_ca_system_score_codex":0.0005405897,"about_ca_system_score_gemma":0.0007564036,"threshold_uncertainty_score":0.03612256},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025083419,0.0016339435,0.95933163,0.0004712781,0.00017199677,0.00005293815,0.00009881249,0.00023486222,0.012921077],"genre_scores_gemma":[0.9284416,0.0028028458,0.059928562,0.00029367013,0.00039601995,0.00010197672,0.00013456642,0.0000356656,0.007865191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986572,0.00042241925,0.000048649494,0.00018378066,0.00043513055,0.00025273024],"domain_scores_gemma":[0.9978466,0.0012614015,0.00024639204,0.00023865086,0.00030623947,0.00010076647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013297645,0.0009777183,0.0008287387,0.0005744436,0.0005738189,0.0015998238,0.00084120396,0.00092187483,0.0016202712],"category_scores_gemma":[0.0025582048,0.00043845372,0.0006570936,0.0010383877,0.00084593275,0.0012696746,0.0009505968,0.0011203688,0.00065405015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034215915,0.00011838228,0.001282525,0.0003871243,0.00015060934,0.00066472753,0.00025356258,0.5913634,0.029122604,0.3005885,0.0030947449,0.07263166],"study_design_scores_gemma":[0.000024075487,0.00016367834,0.00032703296,0.000037195437,0.00007774999,0.0002718751,0.00004783136,0.95712334,0.0042171497,0.034600552,0.0030747505,0.000034755136],"about_ca_topic_score_codex":0.0013271518,"about_ca_topic_score_gemma":0.0020282664,"teacher_disagreement_score":0.0016202712,"about_ca_system_score_codex":0.0012409047,"about_ca_system_score_gemma":0.0009211794,"threshold_uncertainty_score":0.00900346},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023200732,0.00034574128,0.9718455,0.0002040607,0.000021461985,0.00004955565,0.00002745433,0.00007119889,0.0042342953],"genre_scores_gemma":[0.889408,0.0005652614,0.10661387,0.00011076039,0.000052985477,0.0003194181,0.000061395156,0.00005027594,0.0028179006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971035,0.0017792638,0.000066759254,0.00022286936,0.0005529247,0.00027457203],"domain_scores_gemma":[0.99661,0.0024218103,0.0003044131,0.00026380183,0.0003096903,0.000090311034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003676676,0.0012176944,0.0011817844,0.0007110989,0.0005987116,0.0012214438,0.0011007205,0.0010771126,0.00086914044],"category_scores_gemma":[0.0070897457,0.0005457438,0.00040012712,0.001586604,0.0022237466,0.0019761473,0.0022754287,0.00090694334,0.00025777725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057949324,0.000032573622,0.00019823837,0.00004355824,0.000014908357,0.00008649621,0.000096592565,0.91079503,0.001197211,0.077544436,0.0003367286,0.009596261],"study_design_scores_gemma":[0.000009493461,0.000035364712,0.000036189896,0.0000069715256,0.0000047361114,0.000028698709,0.000017577717,0.96793807,0.0006042488,0.030937377,0.00037364318,0.000007651],"about_ca_topic_score_codex":0.0013205758,"about_ca_topic_score_gemma":0.0012044521,"teacher_disagreement_score":0.003676676,"about_ca_system_score_codex":0.0014415199,"about_ca_system_score_gemma":0.0013933411,"threshold_uncertainty_score":0.019444406},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37665334,0.0014559971,0.5948905,0.00090119004,0.000052531544,0.00006726567,0.00027605053,0.00017899115,0.025524162],"genre_scores_gemma":[0.9906221,0.00044527935,0.0065990495,0.000052432715,0.000039326245,0.000042361564,0.000054057396,0.000020151325,0.0021251752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993963,0.00018031898,0.000019905972,0.000057998805,0.00025601452,0.000089416455],"domain_scores_gemma":[0.9943388,0.0041211043,0.0005586595,0.00016439495,0.0007064927,0.00011058785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001362775,0.0005336117,0.0005187414,0.0007867714,0.00044897443,0.0007695826,0.0006652904,0.0007295551,0.0016298657],"category_scores_gemma":[0.008557898,0.00027823835,0.0002871786,0.00064392027,0.0009516716,0.0009674725,0.00062126666,0.00056394644,0.0001876798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010828092,0.00003610078,0.0014238505,0.00008768689,0.000030124034,0.00036248108,0.00025417772,0.8352521,0.0088150175,0.1430006,0.0009370303,0.009692503],"study_design_scores_gemma":[0.0000039347146,0.00001845447,0.00020046732,0.000004821856,0.0000056949552,0.00007707953,0.000019665225,0.9898947,0.0005515075,0.009046746,0.00017227011,0.000004604018],"about_ca_topic_score_codex":0.0019149354,"about_ca_topic_score_gemma":0.0010923205,"teacher_disagreement_score":0.0019149354,"about_ca_system_score_codex":0.0015517761,"about_ca_system_score_gemma":0.00052525534,"threshold_uncertainty_score":0.01125896},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005434233,0.00019619055,0.99329776,0.000082603285,0.000022479686,0.000009324633,0.00001319943,0.00007869344,0.0008656209],"genre_scores_gemma":[0.55120003,0.0005138897,0.4449674,0.00022901727,0.00014417377,0.000087462075,0.00006847264,0.000036653735,0.0027529711],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904376,0.00025008325,0.000042636544,0.00021540624,0.00036044008,0.00008771609],"domain_scores_gemma":[0.9993399,0.00027842712,0.00010555986,0.00008298576,0.00016335062,0.000029851719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009760542,0.0004367235,0.00087038404,0.00033328164,0.00040858242,0.0009780728,0.0006411664,0.0010304693,0.0008048218],"category_scores_gemma":[0.002225743,0.0003490131,0.00038621915,0.0002467306,0.0007380437,0.0008171456,0.00082617416,0.00081832526,0.00057152484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004344194,0.000115482355,0.0016155699,0.0005201588,0.00017893637,0.00041931454,0.00041009363,0.40776435,0.1278237,0.23495078,0.0033418369,0.22242533],"study_design_scores_gemma":[0.00003983137,0.00020810186,0.00021793252,0.000034211633,0.000049221733,0.00038455657,0.00004098593,0.9453563,0.021701975,0.026304258,0.005624136,0.000038531736],"about_ca_topic_score_codex":0.00027263144,"about_ca_topic_score_gemma":0.0003375391,"teacher_disagreement_score":0.0010304693,"about_ca_system_score_codex":0.00039870117,"about_ca_system_score_gemma":0.0009831383,"threshold_uncertainty_score":0.005161941},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12278388,0.0030268484,0.86459816,0.0008392308,0.00024576375,0.00013504694,0.00013732584,0.00048224186,0.0077515817],"genre_scores_gemma":[0.9790015,0.0007203694,0.018348392,0.000076709584,0.000089171896,0.00008468551,0.000051253777,0.00002654544,0.0016012789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987851,0.00060697197,0.000036062196,0.00014897514,0.000258253,0.00016466675],"domain_scores_gemma":[0.99548197,0.0033386801,0.00040579648,0.00032940638,0.00024900376,0.00019512384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021233773,0.00053276453,0.0007891825,0.0004675582,0.0010116015,0.0011913463,0.001197287,0.00074214843,0.0007446819],"category_scores_gemma":[0.0054801144,0.00044126637,0.00027607812,0.0009570286,0.0012916999,0.0017837257,0.0010722976,0.00057075074,0.00013160027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010267393,0.000039525745,0.00091627805,0.00010438972,0.000044499106,0.00047705052,0.00010347754,0.93026525,0.0015357626,0.051122624,0.0013371878,0.013951356],"study_design_scores_gemma":[0.000019891304,0.000022165119,0.00019083245,0.0000053590916,0.000010131232,0.000075199765,0.000048437454,0.97253585,0.0002275241,0.025691064,0.0011663206,0.0000073158226],"about_ca_topic_score_codex":0.0034994788,"about_ca_topic_score_gemma":0.0038736665,"teacher_disagreement_score":0.0034994788,"about_ca_system_score_codex":0.0012325506,"about_ca_system_score_gemma":0.0010681526,"threshold_uncertainty_score":0.011229575},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11463846,0.001084718,0.8797025,0.00016785355,0.000025308982,0.00016123701,0.00005028873,0.00029506255,0.003874622],"genre_scores_gemma":[0.9291521,0.0004838724,0.069388755,0.00004067802,0.000019403502,0.00011353999,0.000045496217,0.00001329347,0.00074294134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984189,0.0007316697,0.000055873166,0.00015200188,0.00050519797,0.00013628493],"domain_scores_gemma":[0.99782264,0.0009536005,0.0001991353,0.00022135211,0.0007464857,0.000056810146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015981778,0.00077371066,0.00065387134,0.00036895683,0.00025444006,0.00077961193,0.00066047173,0.0008790759,0.00078143424],"category_scores_gemma":[0.0036282316,0.00025572052,0.00030784783,0.0006153062,0.00056064344,0.0007195028,0.0006506735,0.0003904594,0.00024307102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000336188,0.00011520338,0.0019671307,0.0002031932,0.0001410963,0.00029084686,0.00013442615,0.89779216,0.021996688,0.010804881,0.0005914523,0.06562683],"study_design_scores_gemma":[0.000024873749,0.00037689225,0.00027646645,0.0000071601835,0.000047856094,0.00016427058,0.00002494599,0.99207073,0.005733443,0.00081674755,0.00044418307,0.000012510908],"about_ca_topic_score_codex":0.0025692864,"about_ca_topic_score_gemma":0.0025148343,"teacher_disagreement_score":0.0025692864,"about_ca_system_score_codex":0.0006772775,"about_ca_system_score_gemma":0.0010214502,"threshold_uncertainty_score":0.008452058},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037539005,0.00069756404,0.95713556,0.00010599737,0.000017382656,0.00002722479,0.00003185728,0.00012225335,0.0043231156],"genre_scores_gemma":[0.9583499,0.0007298904,0.03903057,0.000052528554,0.000028167502,0.000053550237,0.00002137523,0.000014730584,0.0017192952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935216,0.00022379629,0.00002661681,0.000077136785,0.00022794904,0.00009249319],"domain_scores_gemma":[0.9987722,0.0007889925,0.00018721742,0.00006863798,0.00015977617,0.000023250008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009786815,0.00073813304,0.0004681558,0.0004645641,0.00033745947,0.00080116163,0.0006532211,0.0004969313,0.0009859895],"category_scores_gemma":[0.003543246,0.00026118633,0.00031852082,0.00059948326,0.0007323665,0.00077961525,0.0004313892,0.00031152094,0.0002561153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004869842,0.00001788316,0.00047891214,0.000051691397,0.000026020414,0.0001386933,0.00012123516,0.9194948,0.0045676185,0.05183431,0.0004001373,0.022819987],"study_design_scores_gemma":[0.000005959065,0.00004314045,0.00012777511,0.0000056788695,0.000009991107,0.000103655984,0.000024161482,0.98696494,0.00086300325,0.011328277,0.0005155544,0.000007817618],"about_ca_topic_score_codex":0.0016734224,"about_ca_topic_score_gemma":0.0015518359,"teacher_disagreement_score":0.0016734224,"about_ca_system_score_codex":0.0008980634,"about_ca_system_score_gemma":0.0005496392,"threshold_uncertainty_score":0.00651592},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71124077,0.006367773,0.25944763,0.0018856152,0.0002505787,0.00012971746,0.00013947983,0.0006499508,0.019888524],"genre_scores_gemma":[0.9880954,0.0007273632,0.0104585895,0.000046176006,0.000044542507,0.000029100382,0.000050865692,0.000039608723,0.0005084229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979693,0.0008267653,0.00006322062,0.0000955695,0.0008680344,0.00017717307],"domain_scores_gemma":[0.96135247,0.03460431,0.000786195,0.0010331529,0.0019952687,0.0002286638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00433202,0.0004924745,0.0004840128,0.00086975476,0.0007138998,0.0006839288,0.0005663732,0.0007791411,0.0007073349],"category_scores_gemma":[0.036137126,0.00018267342,0.00015367549,0.00082973193,0.0011593639,0.0018122663,0.00086153904,0.00064768153,0.00012965543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010616259,0.00014670283,0.002590888,0.00016930379,0.0000493343,0.00013033567,0.00022667128,0.87159866,0.0138446605,0.024130076,0.0019989284,0.08405275],"study_design_scores_gemma":[0.000022866878,0.00021286191,0.00070698006,0.00001634007,0.000017043858,0.000058783004,0.000049118273,0.9864499,0.005429814,0.0066789766,0.00034432218,0.000013070347],"about_ca_topic_score_codex":0.0032732966,"about_ca_topic_score_gemma":0.0021565424,"teacher_disagreement_score":0.00433202,"about_ca_system_score_codex":0.0013232519,"about_ca_system_score_gemma":0.00081119355,"threshold_uncertainty_score":0.022910178},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01385485,0.00013133636,0.98421496,0.00011333365,0.000023480556,0.0000845156,0.000013350509,0.00014837336,0.0014157881],"genre_scores_gemma":[0.7737488,0.00039540022,0.22339116,0.00012183902,0.00005091785,0.00034839282,0.000048683134,0.00006637691,0.0018284797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987135,0.0004722429,0.000069238784,0.00022404501,0.00041035353,0.000110566456],"domain_scores_gemma":[0.9977456,0.0007680334,0.00038213035,0.00040283578,0.00051054,0.00019085403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015139335,0.0007194665,0.0006786386,0.0006528187,0.00058525987,0.00084072276,0.0012411647,0.0006333777,0.0008579714],"category_scores_gemma":[0.004329598,0.00046060723,0.00042699435,0.00063534355,0.0009698198,0.0014783583,0.0015782146,0.0007154772,0.00033886006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019329124,0.00016286691,0.0013407376,0.00021019217,0.000098236815,0.00038331206,0.0005124371,0.70680594,0.073113956,0.09068256,0.0018223261,0.12467417],"study_design_scores_gemma":[0.000033145334,0.000353532,0.00025659244,0.000018476081,0.000042291686,0.000303084,0.0000730236,0.9727289,0.007133337,0.015587953,0.0034441461,0.00002550025],"about_ca_topic_score_codex":0.00048904435,"about_ca_topic_score_gemma":0.0009167255,"teacher_disagreement_score":0.0015139335,"about_ca_system_score_codex":0.00054225913,"about_ca_system_score_gemma":0.0009254378,"threshold_uncertainty_score":0.008006513},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002978977,0.71698767,0.19602688,0.003425435,0.0029506236,0.00032058527,0.00042410986,0.00037739464,0.07650836],"genre_scores_gemma":[0.04927239,0.84805197,0.07319377,0.0030846512,0.004742974,0.0008153228,0.0010675637,0.00012238084,0.019648938],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976866,0.0005015489,0.00025257756,0.0002616983,0.0011406979,0.00015676975],"domain_scores_gemma":[0.9969885,0.0017928589,0.00012192242,0.0002236576,0.0008090371,0.00006407862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018839702,0.0011992725,0.001205976,0.0029974054,0.0009623262,0.0021151265,0.0019884715,0.0020639296,0.006085232],"category_scores_gemma":[0.005087931,0.0007804199,0.00069059746,0.0053677014,0.0007316094,0.0038087254,0.0016953384,0.0020222417,0.0027789965],"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.00009189781,0.00013768485,0.0006897096,0.003680162,0.000080159276,0.00025038084,0.00031085336,0.008794133,0.0020021203,0.11682232,0.03802712,0.8291136],"study_design_scores_gemma":[0.000027887569,0.00019736392,0.0006912444,0.002246323,0.00010403879,0.0014065035,0.00017032388,0.020927442,0.0015243541,0.07336793,0.89925927,0.00007738432],"about_ca_topic_score_codex":0.0018608909,"about_ca_topic_score_gemma":0.0009301711,"teacher_disagreement_score":0.006085232,"about_ca_system_score_codex":0.0009890293,"about_ca_system_score_gemma":0.0018717564,"threshold_uncertainty_score":0.020357192},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07456221,0.00035602163,0.9187728,0.00081562705,0.000063713545,0.00010388227,0.000052854397,0.00018653194,0.0050862576],"genre_scores_gemma":[0.9640375,0.00015727822,0.03369706,0.00010987226,0.000043695247,0.000114980096,0.000020164929,0.000041963798,0.0017774592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706763,0.0015486428,0.00007306941,0.0002684176,0.00062154926,0.00042069683],"domain_scores_gemma":[0.9956999,0.0026347737,0.00040587815,0.0004974028,0.00042080923,0.00034135886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038712644,0.0012408887,0.001507175,0.0006621479,0.0011079753,0.0021942318,0.002923657,0.0023311768,0.001946392],"category_scores_gemma":[0.010880573,0.0006677372,0.0009854378,0.000862008,0.0021469789,0.005293324,0.0022691134,0.0017893745,0.00036718012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019914193,0.00019742585,0.0010062378,0.00010722266,0.00006246827,0.00038362152,0.00024082941,0.6585167,0.0036726182,0.30468497,0.0019101386,0.029018575],"study_design_scores_gemma":[0.00001944816,0.00005348915,0.0000937395,0.0000065022946,0.0000085214515,0.0001056406,0.000023540062,0.9184766,0.0004606871,0.08027716,0.00045858804,0.00001617621],"about_ca_topic_score_codex":0.0012882284,"about_ca_topic_score_gemma":0.0009295643,"teacher_disagreement_score":0.0038712644,"about_ca_system_score_codex":0.0019620536,"about_ca_system_score_gemma":0.0016781291,"threshold_uncertainty_score":0},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010575624,0.0005565014,0.9869899,0.00018620136,0.00005891831,0.000084692816,0.000037530168,0.00017204216,0.0013386133],"genre_scores_gemma":[0.75519365,0.0014220757,0.24000676,0.00021852291,0.00009359358,0.0003210033,0.00013491041,0.000030375797,0.0025790413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999141,0.000232951,0.000084995794,0.00014016779,0.00032460765,0.00007623916],"domain_scores_gemma":[0.9983228,0.0008784485,0.00018652793,0.00019508477,0.00037613334,0.00004094842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011203778,0.00062762515,0.0007032097,0.0006581236,0.0005764057,0.00081773766,0.0015174313,0.0008678127,0.0007085966],"category_scores_gemma":[0.0034705983,0.00021911653,0.00040377473,0.00077796547,0.0007972547,0.0014811476,0.00089987845,0.00084806746,0.00024578767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044472987,0.00014095742,0.0017419559,0.0007501643,0.00023757467,0.0011977929,0.0011891014,0.32951394,0.10417421,0.25313583,0.005185504,0.30228835],"study_design_scores_gemma":[0.00006810188,0.000255581,0.00023922486,0.00003128678,0.00010524965,0.00081991457,0.0000746967,0.9307005,0.015213529,0.044211753,0.008221344,0.000058812057],"about_ca_topic_score_codex":0.0010840048,"about_ca_topic_score_gemma":0.0010769038,"teacher_disagreement_score":0.0015174313,"about_ca_system_score_codex":0.0006052153,"about_ca_system_score_gemma":0.0008134751,"threshold_uncertainty_score":0.0059251785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09856321,0.008101884,0.8743542,0.0006332012,0.0000774781,0.00005896702,0.00030264913,0.0005540293,0.017354414],"genre_scores_gemma":[0.97825086,0.0034444425,0.016247345,0.000105355306,0.00012807777,0.00007747734,0.00012614673,0.00008390899,0.0015364146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841666,0.0004649925,0.00005976031,0.00015119756,0.00056320196,0.00034419706],"domain_scores_gemma":[0.988641,0.008549115,0.0010361475,0.0006103466,0.0010040224,0.00015938524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021868881,0.0015838697,0.0013551415,0.0017874567,0.00072574714,0.0018338854,0.0010946159,0.0011552772,0.0018898947],"category_scores_gemma":[0.015271093,0.00047524873,0.00070337794,0.0015698232,0.001671748,0.0021595745,0.0015652574,0.0011205134,0.00045740945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060925744,0.000028188375,0.00083375594,0.00015220176,0.000048740596,0.00026672558,0.00017604012,0.93413305,0.003125756,0.05027517,0.00076891354,0.010130618],"study_design_scores_gemma":[0.0000034731913,0.00003514811,0.0005361367,0.00003507113,0.000023622384,0.00016724784,0.000043764852,0.98214716,0.0016062333,0.014928057,0.00044698382,0.000027073178],"about_ca_topic_score_codex":0.0042795027,"about_ca_topic_score_gemma":0.0024113217,"teacher_disagreement_score":0.0042795027,"about_ca_system_score_codex":0.0024738547,"about_ca_system_score_gemma":0.0009799196,"threshold_uncertainty_score":0.017949224},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85265905,0.0016332812,0.1421371,0.00019693308,0.000033661476,0.000045057262,0.00005157212,0.00015224791,0.0030910769],"genre_scores_gemma":[0.9956104,0.0003120391,0.0037691656,0.00001032479,0.000008598872,0.0000060877346,0.00000626845,0.0000038841376,0.00027330642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864906,0.00068753824,0.000054097225,0.00011318516,0.00027318482,0.00022300759],"domain_scores_gemma":[0.98714966,0.010773059,0.0009668352,0.00038819364,0.00058691646,0.00013528296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018803495,0.0012606957,0.00088910316,0.00052326097,0.00050267583,0.000983039,0.00076536555,0.0008519678,0.0003601721],"category_scores_gemma":[0.008588031,0.00028663484,0.00028150567,0.00062206364,0.0012101706,0.0014031029,0.00085260114,0.00043495564,0.00007903743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029396295,0.00004098607,0.0015869194,0.00008767316,0.000044647437,0.00031841104,0.00007775958,0.9814091,0.0057110307,0.0028238064,0.00006279447,0.0075429655],"study_design_scores_gemma":[0.000028996305,0.00053412665,0.0007090849,0.000013715133,0.000066081724,0.000230768,0.00005674343,0.98867327,0.0074646436,0.0020833,0.000121431076,0.000017923576],"about_ca_topic_score_codex":0.0034888247,"about_ca_topic_score_gemma":0.0033229364,"teacher_disagreement_score":0.0034888247,"about_ca_system_score_codex":0.001346547,"about_ca_system_score_gemma":0.00047292025,"threshold_uncertainty_score":0.00994432},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01256815,0.2453156,0.6537238,0.012382206,0.0025401812,0.000046459332,0.000091384936,0.00018961726,0.07314255],"genre_scores_gemma":[0.5214774,0.3005247,0.13506983,0.0073892684,0.010771841,0.00021625892,0.00012569274,0.00010958507,0.024315432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958307,0.000117705305,0.00001493652,0.00006193,0.00016099028,0.00006147736],"domain_scores_gemma":[0.99942255,0.000350661,0.00004094496,0.000056282577,0.0000969176,0.000032633117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005903066,0.00058452063,0.001059697,0.0005606806,0.0006993462,0.0022603623,0.0011709846,0.0016824693,0.0016428549],"category_scores_gemma":[0.0009108043,0.00034064314,0.00046855226,0.000837613,0.0016748633,0.004334485,0.0013025816,0.002287381,0.00043069647],"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.000046335626,0.00003275926,0.0004109318,0.0005312616,0.0000451092,0.00038900823,0.0003658504,0.023729997,0.0037364275,0.8954968,0.0069368095,0.068278745],"study_design_scores_gemma":[0.000015177046,0.00014064283,0.00041851113,0.00034949076,0.00005393816,0.0012667155,0.0005100778,0.10061845,0.0019477885,0.76156396,0.1330412,0.000074029864],"about_ca_topic_score_codex":0.00045834237,"about_ca_topic_score_gemma":0.00066341873,"teacher_disagreement_score":0.0022603623,"about_ca_system_score_codex":0.00087968627,"about_ca_system_score_gemma":0.00041210983,"threshold_uncertainty_score":0.006382644},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09147303,0.0006387981,0.88121164,0.00075653323,0.00015826705,0.000032633416,0.00005809563,0.0013182075,0.024352718],"genre_scores_gemma":[0.6860149,0.00046125732,0.306035,0.00027647187,0.00006177386,0.00006514232,0.00010324399,0.00027053474,0.0067115934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997365,0.00007202409,0.00000818147,0.00002447003,0.00011662358,0.000042160467],"domain_scores_gemma":[0.99952006,0.00019505293,0.000025954281,0.00011240197,0.000112552785,0.00003395011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040120727,0.00031118732,0.00035878384,0.00034912257,0.00035695432,0.000852615,0.00066050387,0.00048639564,0.0019048696],"category_scores_gemma":[0.0020607195,0.00016849315,0.00021070881,0.0004676201,0.0008198481,0.001154539,0.0011338994,0.0009911999,0.00046510488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005436752,0.00009281737,0.002081678,0.00009020274,0.00004107057,0.00033566216,0.00049092446,0.46044794,0.06266391,0.23037574,0.010817621,0.23201872],"study_design_scores_gemma":[0.00001860837,0.000024069817,0.00012609974,0.000011457169,0.0000040066157,0.000057835776,0.000030613846,0.96012187,0.0069871093,0.026733603,0.0058752215,0.000009483293],"about_ca_topic_score_codex":0.0026298435,"about_ca_topic_score_gemma":0.0026389216,"teacher_disagreement_score":0.0026298435,"about_ca_system_score_codex":0.00058814697,"about_ca_system_score_gemma":0.0004335439,"threshold_uncertainty_score":0.006372452},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034689523,0.00028827917,0.96103936,0.0001936903,0.000078605175,0.00019687657,0.00007557179,0.00041686202,0.0030212016],"genre_scores_gemma":[0.71654165,0.00020990787,0.28002256,0.00022101362,0.000053213204,0.00019299297,0.000090109424,0.000017690272,0.0026509876],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991918,0.00023397616,0.00004805494,0.00013621377,0.00027835643,0.0001116184],"domain_scores_gemma":[0.9991283,0.00020324581,0.00009837554,0.00031232476,0.00018429219,0.00007350196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009876419,0.00087606313,0.0008121093,0.000575226,0.0005187174,0.00068280153,0.0019100651,0.0010350001,0.0011412824],"category_scores_gemma":[0.0010249224,0.00025595128,0.0005039556,0.00053640496,0.00084849744,0.00087350875,0.0014271642,0.0007420697,0.00056959264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060944987,0.0005379181,0.0016100045,0.00033351427,0.0002532889,0.0007539555,0.0004830078,0.14443822,0.47143242,0.12023881,0.004047489,0.25526196],"study_design_scores_gemma":[0.00015192949,0.00054652145,0.0007106894,0.00001985799,0.00009763219,0.0011613226,0.000045487526,0.90376186,0.06883184,0.01766218,0.0068689194,0.00014183388],"about_ca_topic_score_codex":0.0007320003,"about_ca_topic_score_gemma":0.0010662179,"teacher_disagreement_score":0.0019100651,"about_ca_system_score_codex":0.00042274073,"about_ca_system_score_gemma":0.00072573783,"threshold_uncertainty_score":0.005223274},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2131162,0.00085563405,0.77767533,0.000334897,0.00012679596,0.00016146693,0.00007090186,0.0009949829,0.0066638566],"genre_scores_gemma":[0.932935,0.00012086528,0.06575951,0.00006690429,0.000030510319,0.000044348748,0.000041568648,0.000014454875,0.0009869245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949574,0.00013340091,0.000027374244,0.00007816781,0.00016354618,0.00010164162],"domain_scores_gemma":[0.9994442,0.00010041233,0.000111589216,0.0001231677,0.00015723355,0.00006333676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008223746,0.00043898425,0.0004911066,0.00050639285,0.0006100482,0.00084533443,0.0016697373,0.00050261524,0.00074648694],"category_scores_gemma":[0.00087887404,0.000116573785,0.00028926015,0.00039697916,0.00073416275,0.0005960248,0.0006749076,0.0004260373,0.00019944937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076552154,0.00031455918,0.0043694857,0.00027763654,0.00019593482,0.0012802773,0.00044423455,0.4694969,0.12571242,0.05256185,0.0050528888,0.33952832],"study_design_scores_gemma":[0.000081049984,0.0006073803,0.001021817,0.00001398378,0.000066898356,0.00038593175,0.000053444724,0.95863956,0.02978145,0.0038521695,0.0054568104,0.000039517487],"about_ca_topic_score_codex":0.003782585,"about_ca_topic_score_gemma":0.0045522074,"teacher_disagreement_score":0.003782585,"about_ca_system_score_codex":0.0007768991,"about_ca_system_score_gemma":0.0009872438,"threshold_uncertainty_score":0.007521093},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07856089,0.0015438215,0.91260386,0.00031428516,0.000074430434,0.000056204528,0.00009365183,0.00019450969,0.0065584043],"genre_scores_gemma":[0.93460935,0.0010954771,0.060148507,0.00009795049,0.00006551884,0.00009313713,0.000062354586,0.0000083313125,0.0038194326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950194,0.0002110711,0.000018794486,0.00008254801,0.00010967166,0.00007593728],"domain_scores_gemma":[0.9995115,0.00025961793,0.00007485779,0.000033981047,0.00009939713,0.000020694648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005192903,0.00088211626,0.00090595306,0.00025292934,0.00037788512,0.0005802471,0.0005846655,0.0008031685,0.00076726935],"category_scores_gemma":[0.00094224105,0.00021808024,0.00039545397,0.00094004377,0.00044516707,0.0009915304,0.00048003197,0.00033810805,0.0003318109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024182678,0.00008446683,0.0022863941,0.00028879847,0.00015148758,0.0011009468,0.00022674885,0.84937143,0.026738478,0.060407165,0.001842057,0.057260178],"study_design_scores_gemma":[0.000023665922,0.00016479562,0.00028757812,0.000008575913,0.000029939076,0.00024273431,0.00003654713,0.98889613,0.0017451622,0.0074547115,0.0010934448,0.000016682336],"about_ca_topic_score_codex":0.0019128607,"about_ca_topic_score_gemma":0.0018610627,"teacher_disagreement_score":0.0019128607,"about_ca_system_score_codex":0.000457295,"about_ca_system_score_gemma":0.00047173566,"threshold_uncertainty_score":0.0038033724},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0504791,0.0008812867,0.94289356,0.00027738404,0.00011086809,0.0003099617,0.00008812241,0.0007838879,0.0041758525],"genre_scores_gemma":[0.7711059,0.0006822493,0.22273895,0.00016019167,0.0000781263,0.00050769094,0.00016407638,0.00004625882,0.00451658],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996779,0.000085330925,0.000017775836,0.000029258637,0.00016525449,0.000024510073],"domain_scores_gemma":[0.99935275,0.00024337138,0.00006321595,0.000065030465,0.0002441285,0.000031442272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007799348,0.00026316053,0.00028404282,0.00043941505,0.00048704143,0.00050132954,0.00073798216,0.00040457133,0.00081308844],"category_scores_gemma":[0.0013731237,0.0001249622,0.00014819328,0.00038019195,0.00055329496,0.00055166223,0.0005808577,0.0005931731,0.0001509973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010776939,0.00021390569,0.0013222275,0.0007740231,0.00014552336,0.0013393748,0.0009495303,0.23308922,0.23589146,0.1144041,0.007922698,0.4028702],"study_design_scores_gemma":[0.0001322892,0.00041834725,0.0006563167,0.000039073668,0.00007211209,0.00056802673,0.00008658619,0.9514733,0.02385547,0.008631894,0.013997653,0.00006892543],"about_ca_topic_score_codex":0.0029313276,"about_ca_topic_score_gemma":0.0029034133,"teacher_disagreement_score":0.0029313276,"about_ca_system_score_codex":0.00053906353,"about_ca_system_score_gemma":0.0007020821,"threshold_uncertainty_score":0.0058285},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74852216,0.00044524565,0.24626972,0.000105382285,0.000033160453,0.00010272595,0.00007291144,0.00019090532,0.0042576636],"genre_scores_gemma":[0.98195446,0.00011543631,0.01745842,0.000014211203,0.000004293546,0.000020676014,0.000018041648,0.000002275224,0.00041220328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995455,0.00015065519,0.000023743569,0.000045903613,0.00016873305,0.00006543049],"domain_scores_gemma":[0.9982322,0.0011480128,0.00018229615,0.00013221902,0.000265821,0.00003947585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010151515,0.0006002051,0.0007056554,0.00042583322,0.00039425262,0.0004544803,0.0006338717,0.0006791701,0.00041033287],"category_scores_gemma":[0.0023832119,0.00011467786,0.00023922452,0.00030513213,0.00067820307,0.0005612123,0.00049370877,0.00018333616,0.000085839325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075186585,0.00017958993,0.0043488443,0.0002129941,0.00016497301,0.0006565165,0.00023984327,0.835018,0.085317984,0.01652828,0.0004173003,0.056163885],"study_design_scores_gemma":[0.000057185323,0.00088935206,0.0007030049,0.00001319339,0.00009093208,0.00040932655,0.00003923616,0.9592756,0.0356017,0.002332338,0.00055629533,0.000031833402],"about_ca_topic_score_codex":0.0012642738,"about_ca_topic_score_gemma":0.0016422864,"teacher_disagreement_score":0.0012642738,"about_ca_system_score_codex":0.00045977,"about_ca_system_score_gemma":0.00053945807,"threshold_uncertainty_score":0.0053687096},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06649122,0.000774555,0.93006563,0.00022680275,0.000016051272,0.000019926072,0.000024228957,0.00008556495,0.0022960121],"genre_scores_gemma":[0.83757263,0.00074931333,0.16041249,0.0000920311,0.00005041792,0.000052404346,0.00004661446,0.000034730405,0.0009894082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983359,0.000720712,0.00005935161,0.00016656241,0.0005480826,0.00016945442],"domain_scores_gemma":[0.99169344,0.006680572,0.0006268295,0.00035915466,0.00055331783,0.0000867336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024349922,0.00052586774,0.0008362214,0.0005169104,0.00031891646,0.0009780718,0.00071152113,0.0009384258,0.00065474526],"category_scores_gemma":[0.011655718,0.00052512443,0.0003690847,0.0006321776,0.0011980799,0.0017572741,0.0009110725,0.00088728394,0.00026765018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021841533,0.000062378625,0.0011856437,0.00015784374,0.000049958657,0.0002738941,0.00022739753,0.8782062,0.01151663,0.06089756,0.0006178265,0.046586275],"study_design_scores_gemma":[0.000010735066,0.00003876837,0.0001578962,0.0000077229515,0.0000067273086,0.00010421651,0.000014975146,0.9833956,0.0023283495,0.013734572,0.00019195351,0.000008562187],"about_ca_topic_score_codex":0.00048781364,"about_ca_topic_score_gemma":0.00053169613,"teacher_disagreement_score":0.0024349922,"about_ca_system_score_codex":0.0006017046,"about_ca_system_score_gemma":0.00057225797,"threshold_uncertainty_score":0.012877643},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06040562,0.00088584766,0.93284017,0.00038587087,0.000098212695,0.00005420454,0.000021258185,0.00018847767,0.005120453],"genre_scores_gemma":[0.8876693,0.00068788714,0.10688797,0.00021872747,0.00015764944,0.000088988985,0.000031898846,0.00000971257,0.0042479034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993255,0.0002427989,0.000025493406,0.00009437847,0.00023667782,0.00007510599],"domain_scores_gemma":[0.9988219,0.0005943926,0.00011407446,0.00019642932,0.0002366865,0.00003648397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092851365,0.00061971013,0.00048862805,0.00030250754,0.00032321733,0.0005517135,0.00074321544,0.0008629658,0.00054765516],"category_scores_gemma":[0.002165284,0.00021964237,0.00029534518,0.00057593477,0.00072087237,0.0010050423,0.0007517145,0.00064268033,0.0002664192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000712346,0.00020432805,0.0019700795,0.00039158415,0.00013192951,0.0013938701,0.0009355493,0.29339746,0.13210925,0.21993619,0.0027077603,0.34610963],"study_design_scores_gemma":[0.00012001494,0.0007615374,0.00062721985,0.00003347628,0.00007779224,0.001189849,0.00006653504,0.9145386,0.030681487,0.039648265,0.012205678,0.000049652084],"about_ca_topic_score_codex":0.00037864043,"about_ca_topic_score_gemma":0.00054502516,"teacher_disagreement_score":0.00092851365,"about_ca_system_score_codex":0.00029880533,"about_ca_system_score_gemma":0.00039214303,"threshold_uncertainty_score":0.004910469},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024131209,0.00037578156,0.9723828,0.00012217039,0.0000471344,0.000038970025,0.00005355145,0.00013268934,0.0027156651],"genre_scores_gemma":[0.8269833,0.00067690003,0.16801275,0.00014317632,0.00007852122,0.00012826204,0.00011326374,0.00002086608,0.0038430972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995863,0.00012265757,0.000024277691,0.00010011735,0.00011507668,0.000051543866],"domain_scores_gemma":[0.99974066,0.00010233676,0.000034824337,0.000028445738,0.000080839854,0.000013004134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003471803,0.0005203898,0.0004994855,0.0002052279,0.00035801402,0.0006363067,0.000375191,0.0005616356,0.0013800623],"category_scores_gemma":[0.0006973047,0.00023897558,0.00020075517,0.00026511578,0.00037800227,0.00059397076,0.00037655208,0.00044101177,0.0003601635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004786495,0.00014478064,0.0013302714,0.00047072634,0.00012909037,0.00045659707,0.00044027876,0.47305736,0.1310443,0.095181495,0.0041217194,0.2931447],"study_design_scores_gemma":[0.00007095365,0.00025625626,0.00040774193,0.000027603633,0.000043660697,0.0002650941,0.000046768466,0.96649307,0.020306772,0.008746212,0.0033056308,0.000030221428],"about_ca_topic_score_codex":0.0013556469,"about_ca_topic_score_gemma":0.0023883292,"teacher_disagreement_score":0.0013800623,"about_ca_system_score_codex":0.00038919423,"about_ca_system_score_gemma":0.00083281123,"threshold_uncertainty_score":0.0046167374},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053859204,0.00018353995,0.99120283,0.00013754387,0.000038992064,0.00008360162,0.00003113507,0.00042639876,0.002509987],"genre_scores_gemma":[0.34088683,0.00074575376,0.6486137,0.00037948604,0.00016039629,0.00058475515,0.00019577562,0.0003530797,0.008080213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984005,0.0006978584,0.000064517044,0.0002475957,0.00048341384,0.00010606612],"domain_scores_gemma":[0.99748105,0.0016311458,0.00016319114,0.00027683002,0.0003453302,0.00010257667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002675953,0.00072150846,0.00068386627,0.00078537065,0.00056199596,0.0010149287,0.0016951833,0.0012788634,0.0019898962],"category_scores_gemma":[0.007955136,0.00037198604,0.0006274075,0.0007620121,0.0019474966,0.002360233,0.0021011203,0.0015838055,0.00080617424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002524796,0.000074319396,0.00049578,0.00021163894,0.00004231313,0.00028985602,0.00028545858,0.432656,0.011236455,0.43985784,0.0034643766,0.11113345],"study_design_scores_gemma":[0.000030070465,0.00006199089,0.000050306564,0.000019655727,0.000007963397,0.00008988537,0.000018802923,0.9419728,0.00351056,0.05132828,0.0028878346,0.000021864382],"about_ca_topic_score_codex":0.0023871604,"about_ca_topic_score_gemma":0.001430645,"teacher_disagreement_score":0.002675953,"about_ca_system_score_codex":0.0010432533,"about_ca_system_score_gemma":0.0014473895,"threshold_uncertainty_score":0.014151931},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027013598,0.0018936971,0.9689066,0.00012806663,0.00007658104,0.00004209249,0.000010327434,0.00019923583,0.0017298942],"genre_scores_gemma":[0.8766444,0.0013042971,0.118981,0.00026433813,0.00011153133,0.00014595619,0.00003893856,0.000020000165,0.0024896557],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951816,0.00014946017,0.000021367965,0.000077411976,0.00017622202,0.00005747461],"domain_scores_gemma":[0.99927694,0.0003005598,0.00009494658,0.00010506322,0.00018656132,0.000035926543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007205368,0.00047062116,0.0003265248,0.00032430413,0.00051071873,0.00071598706,0.000805839,0.0005875262,0.0008915815],"category_scores_gemma":[0.0014398702,0.00020157879,0.00030267143,0.00043668706,0.00060826546,0.00073787954,0.00071331183,0.0005876771,0.00023750639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004534265,0.00019941363,0.0027712348,0.0007315222,0.00023862906,0.0013417478,0.0009814298,0.14623591,0.2045404,0.18019108,0.0042478302,0.4580674],"study_design_scores_gemma":[0.00007239216,0.0007575945,0.0008869585,0.000062004205,0.00013916625,0.001740105,0.00012318057,0.9151421,0.035861973,0.027901936,0.017240489,0.000072043535],"about_ca_topic_score_codex":0.00047565883,"about_ca_topic_score_gemma":0.00072070886,"teacher_disagreement_score":0.0008915815,"about_ca_system_score_codex":0.00035582494,"about_ca_system_score_gemma":0.00039710294,"threshold_uncertainty_score":0.0038105845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062291004,0.0068126493,0.894829,0.0010759918,0.00014196911,0.00006422409,0.0003751369,0.0005657553,0.033844266],"genre_scores_gemma":[0.9325492,0.00744301,0.052623603,0.0002952314,0.00038753147,0.00021088334,0.00044577083,0.0002380455,0.005806794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976077,0.00053773,0.000080810445,0.00019076996,0.001253574,0.0003293337],"domain_scores_gemma":[0.96985304,0.024683982,0.0012660393,0.0017011444,0.0020549884,0.00044090295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029594572,0.0013302946,0.0010998322,0.0017789367,0.0009500758,0.0025076165,0.0013567932,0.0010664358,0.003148675],"category_scores_gemma":[0.021397995,0.000676398,0.00063398527,0.001496855,0.0024557016,0.0036102931,0.0017019388,0.002646742,0.00082251173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021779168,0.00005375882,0.0012038568,0.00025063156,0.00005780144,0.00024774356,0.00034545115,0.5128696,0.006859988,0.4482907,0.0027691943,0.026833516],"study_design_scores_gemma":[0.000026041651,0.00009644362,0.0006742279,0.000082023485,0.000025016083,0.00030412417,0.00006303802,0.60434556,0.003794844,0.38735273,0.003185002,0.000050914095],"about_ca_topic_score_codex":0.0015950303,"about_ca_topic_score_gemma":0.0011996484,"teacher_disagreement_score":0.00339081,"about_ca_system_score_codex":0.00339081,"about_ca_system_score_gemma":0.0012118465,"threshold_uncertainty_score":0.024602115},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03734611,0.0015306382,0.95695347,0.00020015023,0.000047473477,0.000044642482,0.00002898057,0.0000948138,0.0037538195],"genre_scores_gemma":[0.93316704,0.0005397396,0.065143116,0.000058674763,0.000029556692,0.000056011722,0.000012613488,0.000008621921,0.0009845924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941814,0.00025884737,0.000026288513,0.00008301553,0.00012285692,0.000090864836],"domain_scores_gemma":[0.99950445,0.00028402254,0.000075162716,0.00005824688,0.000058552585,0.000019591516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085218536,0.0005443663,0.0006227606,0.00027990286,0.00036969906,0.0007448324,0.0008761174,0.00068006676,0.0012161598],"category_scores_gemma":[0.002265792,0.0001763514,0.00031760053,0.0004999778,0.00058948743,0.00076968124,0.00061471155,0.00048366896,0.00022292443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023567092,0.00011337178,0.00049801735,0.00017176651,0.00008550932,0.0002839813,0.00017710018,0.79863703,0.010704308,0.08120875,0.0015040314,0.10638043],"study_design_scores_gemma":[0.000032170363,0.00007207638,0.00012605674,0.000007862004,0.000021645135,0.00011711309,0.000026241969,0.98025674,0.0016888692,0.016581437,0.0010583136,0.000011394911],"about_ca_topic_score_codex":0.0010303619,"about_ca_topic_score_gemma":0.001084665,"teacher_disagreement_score":0.0012161598,"about_ca_system_score_codex":0.00056423864,"about_ca_system_score_gemma":0.00053913135,"threshold_uncertainty_score":0.0045068264},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08323719,0.0012671729,0.9089437,0.00016188872,0.000025915686,0.000040243827,0.0001200799,0.00026669996,0.0059370724],"genre_scores_gemma":[0.95592576,0.0011248061,0.04114355,0.000040306906,0.00003443249,0.000039784125,0.000082485654,0.000031502645,0.0015773164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941194,0.00017207049,0.000030105068,0.00005643204,0.00024579914,0.000083621126],"domain_scores_gemma":[0.9973815,0.0017006599,0.00024266282,0.00025326363,0.00038441495,0.0000375305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011475546,0.0009526527,0.00085626077,0.0006863846,0.0003572212,0.00091790716,0.00062619057,0.0008034693,0.0013567229],"category_scores_gemma":[0.0065519195,0.0002830078,0.0004957143,0.0006371414,0.00089643523,0.0015221584,0.0007269796,0.0006718753,0.00040954718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095475596,0.00002439121,0.00050318136,0.000113458176,0.000027419617,0.000112307906,0.00009794502,0.94789016,0.0075226654,0.026773943,0.0002971795,0.01654192],"study_design_scores_gemma":[0.0000034456905,0.000031488908,0.00018029875,0.000006731681,0.0000063250172,0.00008420072,0.000011917468,0.9921556,0.001461819,0.005929066,0.00012013831,0.000008976837],"about_ca_topic_score_codex":0.0020943326,"about_ca_topic_score_gemma":0.0015357739,"teacher_disagreement_score":0.0020943326,"about_ca_system_score_codex":0.0009706236,"about_ca_system_score_gemma":0.00103685,"threshold_uncertainty_score":0.0070423484},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004466037,0.0002987294,0.99285513,0.00014751343,0.000050140694,0.000023786128,0.000034083398,0.00010749664,0.0020171534],"genre_scores_gemma":[0.52857745,0.002103758,0.46179292,0.00043759446,0.0003467343,0.0003223167,0.00018395357,0.00013227061,0.006102949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991454,0.00030399745,0.00003406521,0.00008560694,0.00033347457,0.00009737974],"domain_scores_gemma":[0.99871457,0.0005690278,0.00013562039,0.000306391,0.00023714658,0.00003721133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011742478,0.0007520768,0.0005853594,0.00047565636,0.0003527766,0.00095996226,0.0014518469,0.0010067812,0.0009816465],"category_scores_gemma":[0.0035729613,0.0002802342,0.0005809723,0.00051226304,0.001298253,0.0017569428,0.0011339854,0.0017820124,0.0005129363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067980196,0.00002427946,0.000106095256,0.00009696226,0.00002182391,0.00021106059,0.00014881413,0.1325144,0.011764715,0.82255673,0.0016209586,0.03086617],"study_design_scores_gemma":[0.000032948305,0.00008472018,0.00007579718,0.00003779181,0.000021327543,0.00029160987,0.0000157664,0.6935161,0.0076151085,0.290832,0.0074326666,0.00004422842],"about_ca_topic_score_codex":0.0007381573,"about_ca_topic_score_gemma":0.00049485837,"teacher_disagreement_score":0.0014518469,"about_ca_system_score_codex":0.00067525473,"about_ca_system_score_gemma":0.0005911055,"threshold_uncertainty_score":0.006210029},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091576666,0.0011032819,0.90248996,0.00017448333,0.000024590152,0.00003713675,0.00007333489,0.00018361851,0.004336868],"genre_scores_gemma":[0.88721895,0.0010878101,0.10987898,0.000060820665,0.000035837584,0.000049120015,0.00008686059,0.000029557055,0.0015520678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989988,0.00028895077,0.00004204335,0.000117752345,0.00045890454,0.00009365215],"domain_scores_gemma":[0.9980768,0.0010913957,0.00025604348,0.00018072211,0.00037060294,0.000024407935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009554847,0.0007010912,0.00045991162,0.00031927176,0.00024388214,0.0008561351,0.00055520865,0.0007333125,0.00079759856],"category_scores_gemma":[0.004472183,0.00023047859,0.00017303143,0.0003974415,0.0005610944,0.00093792565,0.00045567148,0.00050125335,0.00036158404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046228388,0.000080778154,0.0026928517,0.00036822402,0.00009633293,0.00026698643,0.00030993394,0.74566233,0.0950091,0.04962534,0.00064360484,0.10478225],"study_design_scores_gemma":[0.00001092627,0.000118337186,0.00044803304,0.000028577251,0.000020739519,0.00017547308,0.000027550623,0.96434,0.03031391,0.0036606311,0.0008339921,0.000021844655],"about_ca_topic_score_codex":0.002190313,"about_ca_topic_score_gemma":0.002924626,"teacher_disagreement_score":0.002190313,"about_ca_system_score_codex":0.0006764544,"about_ca_system_score_gemma":0.0007577701,"threshold_uncertainty_score":0.005053103},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16490105,0.0009175257,0.82265824,0.0002879267,0.000050485334,0.00006781407,0.00005004208,0.0005795745,0.010487426],"genre_scores_gemma":[0.92966425,0.00029387663,0.06689749,0.000052260053,0.000024380763,0.000049613533,0.00003288891,0.000016549324,0.002968643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994205,0.00017944194,0.000022188538,0.000079750374,0.00022773279,0.00007043096],"domain_scores_gemma":[0.9989236,0.0005193793,0.00015500782,0.00023814682,0.00013901014,0.00002480572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007153619,0.0004808719,0.0005186356,0.00058401754,0.00051063916,0.00060039473,0.0008278299,0.0006280946,0.00067679904],"category_scores_gemma":[0.002124299,0.00020123179,0.00024993715,0.0007206701,0.0005516357,0.0011313952,0.0011402864,0.00023851237,0.00025707774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039892274,0.00013637608,0.001414697,0.00016171754,0.00011194254,0.0009706362,0.0008396299,0.55822796,0.12422671,0.10485183,0.0026709442,0.20598863],"study_design_scores_gemma":[0.0000957687,0.0005041607,0.0008346099,0.000020018579,0.00006701769,0.00068951555,0.00017525969,0.92134315,0.03171655,0.035956293,0.0085222535,0.00007545003],"about_ca_topic_score_codex":0.00087696593,"about_ca_topic_score_gemma":0.0014726804,"teacher_disagreement_score":0.00087696593,"about_ca_system_score_codex":0.00035646392,"about_ca_system_score_gemma":0.00032993627,"threshold_uncertainty_score":0.003783226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040999394,0.0012713341,0.94139194,0.00030237072,0.000050807528,0.00014590658,0.00025931853,0.00049411133,0.01508476],"genre_scores_gemma":[0.9228952,0.0015507074,0.06735054,0.00011845833,0.00011824693,0.00031719176,0.00027277824,0.00014657047,0.0072302064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998917,0.0004670232,0.000027994787,0.00011867533,0.00034208773,0.0001272596],"domain_scores_gemma":[0.99867755,0.00077357824,0.00012195857,0.00008376066,0.00031945607,0.000023812485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097329984,0.0008192811,0.0006249755,0.0008441629,0.0006485008,0.0012631225,0.0005158608,0.0006428705,0.0054314956],"category_scores_gemma":[0.0028212308,0.00031470487,0.0006453463,0.00090330094,0.00050109497,0.0010000898,0.0004814195,0.00066135416,0.00081373134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005001645,0.000026972177,0.0005423032,0.00008538893,0.000031148553,0.0001098734,0.00007421195,0.9563929,0.0037337241,0.025939314,0.0011976437,0.01181656],"study_design_scores_gemma":[0.0000035996595,0.000030702275,0.00020909465,0.000006442559,0.000011349252,0.000030913932,0.000016447242,0.99524826,0.0007263293,0.002899439,0.0008124512,0.000004909183],"about_ca_topic_score_codex":0.006131992,"about_ca_topic_score_gemma":0.004878898,"teacher_disagreement_score":0.006131992,"about_ca_system_score_codex":0.0024765804,"about_ca_system_score_gemma":0.0008793611,"threshold_uncertainty_score":0.018170178},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30206206,0.0048826337,0.62815636,0.0018478902,0.00029664204,0.0001342323,0.0002541695,0.0006170531,0.06174902],"genre_scores_gemma":[0.9789493,0.0021702186,0.014683852,0.00016067254,0.00018079688,0.00014552633,0.00006568193,0.000047210706,0.0035966488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959916,0.00010850358,0.000013386889,0.000060570885,0.00013356736,0.00008485331],"domain_scores_gemma":[0.9969656,0.0018678997,0.00040256523,0.00020931628,0.0003652581,0.00018945528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096165395,0.00050510257,0.0005038007,0.0008793079,0.0006383151,0.0015563123,0.00091753376,0.00073091494,0.0024324534],"category_scores_gemma":[0.0071425317,0.0003169798,0.00033406005,0.00057138375,0.0015308165,0.0020647498,0.0006584765,0.00082386134,0.00036681312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051905547,0.000044586108,0.0010310375,0.00012979758,0.000037308586,0.00031290273,0.0003608041,0.23174745,0.0030856766,0.7497037,0.0027743427,0.0107204355],"study_design_scores_gemma":[0.000014432809,0.000022702528,0.0004770082,0.00002739869,0.000007950071,0.00010267462,0.00007430659,0.6319354,0.0003007337,0.36548913,0.0015306602,0.000017673297],"about_ca_topic_score_codex":0.0016049034,"about_ca_topic_score_gemma":0.0006147265,"teacher_disagreement_score":0.0024324534,"about_ca_system_score_codex":0.0011592,"about_ca_system_score_gemma":0.0003744699,"threshold_uncertainty_score":0.008410692},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26288876,0.0026898093,0.71705824,0.00038862362,0.000069384885,0.000034480272,0.00019274921,0.00033246877,0.01634551],"genre_scores_gemma":[0.9930276,0.000715404,0.0051381825,0.000021025466,0.000029208402,0.000022983577,0.000054315893,0.00001613538,0.0009750811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993081,0.00018882829,0.000028997823,0.000053968597,0.00024262731,0.00017748692],"domain_scores_gemma":[0.9956696,0.0033231056,0.00029380684,0.000215309,0.0004321882,0.000066104985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010944533,0.0005643925,0.0006313015,0.0007227444,0.0003930589,0.00093115185,0.00060579006,0.0004415479,0.0011129439],"category_scores_gemma":[0.0052744146,0.00021567738,0.00027433093,0.00080613774,0.0013076116,0.0011107662,0.0007351034,0.0005256725,0.0002496411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045391545,0.000012303703,0.0004841557,0.00007348422,0.00002265554,0.00017661585,0.00010090648,0.92483515,0.003525082,0.058908068,0.0005039633,0.0113122845],"study_design_scores_gemma":[0.0000026375453,0.000016816894,0.00028250756,0.000011215347,0.0000088330235,0.000058842557,0.000025079187,0.98220944,0.0014602134,0.015610704,0.000301106,0.000012510132],"about_ca_topic_score_codex":0.0023671035,"about_ca_topic_score_gemma":0.0013062478,"teacher_disagreement_score":0.0023671035,"about_ca_system_score_codex":0.0012654014,"about_ca_system_score_gemma":0.0006685258,"threshold_uncertainty_score":0.009181201},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77969766,0.002211582,0.20337896,0.0006121498,0.00006934271,0.00008884873,0.0003885739,0.00048415127,0.013068764],"genre_scores_gemma":[0.9971655,0.00021048936,0.0019624867,0.000022773602,0.000015782261,0.000017632263,0.000038168226,0.000009953501,0.000557223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803585,0.00083453243,0.000100929945,0.0002117388,0.0003656935,0.00045127328],"domain_scores_gemma":[0.9890104,0.008169309,0.00084805273,0.00044670596,0.0013359783,0.00018951934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028786042,0.0013679555,0.0014778803,0.0006792211,0.00095421606,0.0017748821,0.0007107181,0.0013895088,0.0016561829],"category_scores_gemma":[0.007893836,0.00042763245,0.00043684838,0.00072214677,0.0014883066,0.0013085346,0.001336406,0.0006922243,0.00037355837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012890871,0.00007358922,0.0026818335,0.00019312791,0.00012817283,0.00030043285,0.00034068446,0.95788705,0.01437718,0.009879537,0.00042242996,0.012426782],"study_design_scores_gemma":[0.000038753737,0.00037658127,0.0010755184,0.000018241733,0.000067586494,0.0001562759,0.000098981334,0.9905406,0.0039682896,0.0034812852,0.00014467168,0.000033147637],"about_ca_topic_score_codex":0.005563139,"about_ca_topic_score_gemma":0.0027609724,"teacher_disagreement_score":0.005563139,"about_ca_system_score_codex":0.0010885451,"about_ca_system_score_gemma":0.0011799363,"threshold_uncertainty_score":0.015223682},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43354264,0.000682291,0.5547847,0.00024953965,0.000050645973,0.000109438304,0.00025852575,0.00022192356,0.010100283],"genre_scores_gemma":[0.9625252,0.00024326547,0.035886947,0.000017616412,0.000012098556,0.00004105046,0.000044676017,0.000005739959,0.0012234512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958926,0.00015377214,0.00002330903,0.00006063369,0.00011016955,0.00006275231],"domain_scores_gemma":[0.99823785,0.0011084629,0.00021396727,0.00022842915,0.00017772513,0.00003358935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00098862,0.0007996034,0.0008240768,0.00044318466,0.00040048736,0.0007374693,0.00095320964,0.0008310803,0.0007853351],"category_scores_gemma":[0.002724007,0.00026756802,0.00040504502,0.0005689923,0.00075608364,0.0008949178,0.000749047,0.000544434,0.00021543898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043522293,0.00008920214,0.0016932411,0.0002066068,0.0000834291,0.00083956396,0.000195575,0.9266777,0.022633051,0.03471985,0.00036462126,0.012061921],"study_design_scores_gemma":[0.000017934171,0.00010373877,0.00022212554,0.0000057678753,0.00002749231,0.00020064767,0.000028641676,0.98936623,0.0059862104,0.003811986,0.00021262077,0.000016558013],"about_ca_topic_score_codex":0.0015052274,"about_ca_topic_score_gemma":0.0016108135,"teacher_disagreement_score":0.0015052274,"about_ca_system_score_codex":0.00055001624,"about_ca_system_score_gemma":0.00047822658,"threshold_uncertainty_score":0.0052284},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05240021,0.0006819518,0.93427026,0.00030553067,0.000100931145,0.000060281563,0.000052069532,0.000112908994,0.012015862],"genre_scores_gemma":[0.9332745,0.00052363705,0.06326707,0.00009118733,0.000044121305,0.00008761499,0.000035017554,0.000018593602,0.0026582445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947923,0.00020100905,0.00001627418,0.000060110255,0.00017533492,0.00006795722],"domain_scores_gemma":[0.9981633,0.0010181713,0.0001729197,0.00023409579,0.0003687504,0.000042767246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010671071,0.00072925625,0.00039429156,0.00048121263,0.00037245746,0.0007744879,0.0008180977,0.0006893904,0.0013042717],"category_scores_gemma":[0.0027496768,0.000177157,0.00043452962,0.0005839435,0.0012677726,0.0009852997,0.0009161304,0.00075373164,0.00025937182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000143805,0.00007953202,0.00047862186,0.00016315519,0.00003982254,0.00042383294,0.00024976864,0.7061647,0.0153085245,0.25267556,0.0015189626,0.022753626],"study_design_scores_gemma":[0.000021265765,0.00010289482,0.00008999122,0.000013183579,0.000017104316,0.00016650758,0.000030048226,0.9701427,0.002956545,0.02533155,0.0011095289,0.000018663328],"about_ca_topic_score_codex":0.001049519,"about_ca_topic_score_gemma":0.0014271757,"teacher_disagreement_score":0.0013042717,"about_ca_system_score_codex":0.0010768905,"about_ca_system_score_gemma":0.00086226925,"threshold_uncertainty_score":0.007813454},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09203095,0.0021857608,0.89059633,0.0006804337,0.000029853834,0.00006897869,0.00016334206,0.00019341122,0.014050899],"genre_scores_gemma":[0.9576402,0.0025013727,0.036032464,0.00009481184,0.00008361411,0.00014597115,0.0001188055,0.000045172856,0.003337679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842083,0.0006605136,0.000039855648,0.00015327193,0.000485425,0.00024010213],"domain_scores_gemma":[0.99458575,0.0039832206,0.00047251303,0.00025221863,0.000612953,0.00009327393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002402181,0.0014300566,0.0010884923,0.00087382295,0.00043987416,0.001804919,0.000987552,0.0011943267,0.0012611203],"category_scores_gemma":[0.007955053,0.00047358137,0.00043965178,0.001953532,0.0018624256,0.0016300397,0.001217354,0.00086545554,0.0004041645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047310106,0.000036804064,0.00039405603,0.000059834503,0.000019808384,0.00006943824,0.00006296195,0.9630246,0.0013469058,0.024658598,0.0003758413,0.009903767],"study_design_scores_gemma":[0.000006538831,0.000035504538,0.00015260972,0.000009085291,0.000006957005,0.000049718597,0.000028574168,0.98380154,0.00043204075,0.015264466,0.000203889,0.000009068835],"about_ca_topic_score_codex":0.0028946442,"about_ca_topic_score_gemma":0.0019960762,"teacher_disagreement_score":0.0028946442,"about_ca_system_score_codex":0.0017912297,"about_ca_system_score_gemma":0.0013317018,"threshold_uncertainty_score":0.012996316},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16405874,0.00077954895,0.8313929,0.00024360693,0.00004257709,0.00006948043,0.00005269013,0.00020788833,0.0031525006],"genre_scores_gemma":[0.92458713,0.00025844027,0.07357293,0.000042839627,0.000011498086,0.000046083274,0.00003331387,0.000008306899,0.0014394296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942625,0.00022503368,0.000024544248,0.00008301494,0.00015110252,0.00009013],"domain_scores_gemma":[0.99922335,0.00039644382,0.00009785862,0.00010334018,0.00015712327,0.0000218093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008162409,0.00055170245,0.0005276876,0.00039702834,0.00053076824,0.0007289905,0.0006397725,0.0005561941,0.00073523255],"category_scores_gemma":[0.0014852951,0.00020015941,0.00031965735,0.0003543661,0.00042843688,0.0006728791,0.0004978001,0.0003155419,0.00018429576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008451895,0.00018555766,0.0035690404,0.00025945815,0.00014495703,0.0010804294,0.0006349325,0.66871643,0.08995402,0.038795132,0.0017143864,0.19410053],"study_design_scores_gemma":[0.000029365197,0.00021410313,0.00029449037,0.000008749718,0.000031928983,0.00033610052,0.0000691648,0.98600465,0.008285027,0.0035476668,0.0011606532,0.000018208138],"about_ca_topic_score_codex":0.0022554938,"about_ca_topic_score_gemma":0.0044967807,"teacher_disagreement_score":0.0022554938,"about_ca_system_score_codex":0.0008573719,"about_ca_system_score_gemma":0.00078230107,"threshold_uncertainty_score":0.0062206984},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05237869,0.0008526503,0.94239897,0.00032731544,0.0000440421,0.000041945386,0.000021597793,0.00012133921,0.0038135045],"genre_scores_gemma":[0.90765494,0.0009255526,0.08760768,0.00011219847,0.00008451595,0.00008081013,0.000034883982,0.000029378063,0.003470093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993305,0.0002592194,0.00001977494,0.00009260434,0.00023859013,0.000059308728],"domain_scores_gemma":[0.998185,0.0013412196,0.00011518086,0.00018590198,0.0001482007,0.000024590729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009951139,0.0004220194,0.00039411866,0.000309693,0.00028675783,0.00069244567,0.0008041564,0.00065126136,0.00084986165],"category_scores_gemma":[0.0028543074,0.00016980844,0.00019448518,0.0006410998,0.0012092919,0.0016924798,0.00081741426,0.000684826,0.00013524879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014368868,0.000049593727,0.0005075531,0.000114164344,0.000023501963,0.00021292451,0.00022073391,0.750514,0.015218276,0.17022163,0.0008243238,0.06194966],"study_design_scores_gemma":[0.000011068027,0.000044810935,0.00014625095,0.000007221084,0.000005197646,0.00007518904,0.00003208873,0.9683744,0.0023672092,0.028165625,0.0007632413,0.000007678342],"about_ca_topic_score_codex":0.00093373854,"about_ca_topic_score_gemma":0.0008191351,"teacher_disagreement_score":0.0009951139,"about_ca_system_score_codex":0.00091713865,"about_ca_system_score_gemma":0.00041592712,"threshold_uncertainty_score":0.006654322},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03603454,0.0011390714,0.9599059,0.00028269948,0.000053516243,0.00004341228,0.000030585514,0.00022476132,0.002285635],"genre_scores_gemma":[0.966729,0.00045764414,0.03120735,0.00005343592,0.00005817366,0.000068441856,0.000027607,0.000012436902,0.0013859278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904877,0.00036816704,0.0000520917,0.0001369928,0.0002363926,0.00015760527],"domain_scores_gemma":[0.9991667,0.00050882733,0.00009518251,0.00007681096,0.000105323685,0.000047220743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008040239,0.0006634282,0.0008629083,0.00044305835,0.0005500923,0.0011280086,0.0012220459,0.0009765741,0.0005907093],"category_scores_gemma":[0.0026975654,0.000281862,0.00037701277,0.00070112664,0.0009221138,0.0012337527,0.0010822673,0.0006638391,0.00013968136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015970228,0.000062065694,0.0007292737,0.00007749301,0.000038101713,0.00012899308,0.00015447494,0.8422561,0.009352493,0.0463068,0.0011343812,0.09960011],"study_design_scores_gemma":[0.000008821121,0.000032301385,0.00006913639,0.0000031757031,0.0000073341134,0.00003520103,0.00001286907,0.9910522,0.0010095108,0.007364979,0.0003955673,0.000008877164],"about_ca_topic_score_codex":0.0034305332,"about_ca_topic_score_gemma":0.0024943408,"teacher_disagreement_score":0.0034305332,"about_ca_system_score_codex":0.00090156787,"about_ca_system_score_gemma":0.0009226552,"threshold_uncertainty_score":0.0068211555},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044896483,0.0002160685,0.95050806,0.00038294218,0.000049213602,0.00012789883,0.00008027509,0.00035117398,0.003387851],"genre_scores_gemma":[0.89343715,0.0002028072,0.10305648,0.00015181678,0.0000543996,0.00016183115,0.00011331516,0.000031177457,0.002790987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969228,0.0010425479,0.00016430425,0.00038343391,0.0010895997,0.00039732046],"domain_scores_gemma":[0.99449784,0.0018677149,0.00080811884,0.0019621928,0.00068941293,0.00017484165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021092934,0.0006861158,0.0008432934,0.0008628449,0.0010004235,0.0012160909,0.0014448954,0.001255671,0.0008685163],"category_scores_gemma":[0.0070566647,0.00030412406,0.0005591329,0.0012273297,0.0016727512,0.003211278,0.003266617,0.0014455321,0.00032577172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009914816,0.000232021,0.0011815355,0.00027792895,0.0001253079,0.00058474694,0.0009681072,0.20905395,0.10173867,0.46718702,0.0035021815,0.21415709],"study_design_scores_gemma":[0.00011860121,0.00035012994,0.00034755698,0.000050682625,0.000075975455,0.0008385774,0.000118511896,0.81585217,0.06332818,0.11294837,0.005874818,0.00009649201],"about_ca_topic_score_codex":0.00048954994,"about_ca_topic_score_gemma":0.0003056562,"teacher_disagreement_score":0.0021092934,"about_ca_system_score_codex":0.0008792493,"about_ca_system_score_gemma":0.0014487298,"threshold_uncertainty_score":0.0111551285},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012957814,0.0005412147,0.9794869,0.00025830488,0.0001509908,0.00003486118,0.000076729455,0.0007673901,0.0057258303],"genre_scores_gemma":[0.6846155,0.0012681278,0.29866186,0.00042975965,0.00023661807,0.00012971042,0.0003901373,0.00011501299,0.014153289],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996762,0.000084800304,0.000016000446,0.000052737134,0.00013498285,0.000035269342],"domain_scores_gemma":[0.9996816,0.00012395474,0.000024736724,0.00004576722,0.00011763185,0.000006288143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005117569,0.00038390813,0.00030535154,0.0004782239,0.00025158777,0.0005334052,0.00038210445,0.00063967105,0.004173186],"category_scores_gemma":[0.0017483,0.00017586962,0.0002434707,0.00054209196,0.0001979338,0.000686752,0.00032566272,0.00049079326,0.0018248344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028923107,0.00010155222,0.0010866463,0.00022294931,0.000071973205,0.00013001815,0.0000794191,0.2164261,0.09146094,0.044104464,0.0069956225,0.6390311],"study_design_scores_gemma":[0.000026136682,0.00010841497,0.000805827,0.000028154287,0.000027106562,0.0001589605,0.00002244557,0.9607034,0.015784731,0.0103307245,0.011977738,0.000026416492],"about_ca_topic_score_codex":0.0012882211,"about_ca_topic_score_gemma":0.0015175093,"teacher_disagreement_score":0.004173186,"about_ca_system_score_codex":0.00040119182,"about_ca_system_score_gemma":0.00037761757,"threshold_uncertainty_score":0.013960719},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036612038,0.0012509219,0.9579347,0.00008342896,0.000050462848,0.000034148026,0.000016196562,0.00016389118,0.0038542429],"genre_scores_gemma":[0.8531511,0.0015167987,0.14163598,0.00010842486,0.00009066427,0.00009154937,0.000039940493,0.000023769131,0.0033417442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895537,0.000481698,0.000045096873,0.00012101222,0.00026260494,0.0001341581],"domain_scores_gemma":[0.99869615,0.00077023247,0.00013126759,0.00018802965,0.0001733405,0.000040950687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010634728,0.00063583814,0.00069659704,0.0003469093,0.00047553916,0.0008499868,0.0010367943,0.0007914595,0.000646854],"category_scores_gemma":[0.0021190997,0.00030122112,0.0004452789,0.00052308745,0.0010040551,0.0011754065,0.00090115087,0.0006025364,0.0003637752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008047257,0.00015484718,0.0015433715,0.00074272085,0.0001761385,0.00092769135,0.0008411854,0.5199698,0.121958874,0.13946281,0.0018189618,0.21159887],"study_design_scores_gemma":[0.000051303905,0.00035900762,0.0002625824,0.000031533356,0.00006694699,0.0007298709,0.00006376125,0.9344889,0.04400964,0.015649114,0.0042323447,0.000054921402],"about_ca_topic_score_codex":0.0006964022,"about_ca_topic_score_gemma":0.0006872952,"teacher_disagreement_score":0.0010634728,"about_ca_system_score_codex":0.00049967313,"about_ca_system_score_gemma":0.0004482968,"threshold_uncertainty_score":0.0056242347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03707644,0.00096672185,0.9592657,0.00018214532,0.00002119234,0.000025728663,0.000026797292,0.00021031642,0.002224996],"genre_scores_gemma":[0.88547796,0.0014555458,0.11082447,0.00008568474,0.00005964249,0.00009967169,0.00003184873,0.000024250085,0.0019409053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992355,0.00042144148,0.000028025355,0.000067269226,0.00021377199,0.000033924818],"domain_scores_gemma":[0.99824286,0.0013607935,0.00014668475,0.00009811032,0.00012675345,0.00002472653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011630184,0.0003630631,0.00032287824,0.00030549627,0.00021876165,0.0004150575,0.0004388644,0.00047105356,0.0006011772],"category_scores_gemma":[0.0035302858,0.00027661692,0.00011538778,0.00051359675,0.00078790315,0.00081415795,0.0004109588,0.0003253037,0.00021994015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001047591,0.000036752834,0.00058773527,0.00013499644,0.000019439141,0.00013242778,0.00013060491,0.82957244,0.01940039,0.076737866,0.00082413096,0.072318584],"study_design_scores_gemma":[0.00001816734,0.000087107976,0.00020509271,0.000016737637,0.0000068696695,0.00006098842,0.000020287125,0.95900977,0.0035636676,0.036116987,0.00088033424,0.000014069109],"about_ca_topic_score_codex":0.0010372921,"about_ca_topic_score_gemma":0.0010796876,"teacher_disagreement_score":0.0011630184,"about_ca_system_score_codex":0.0005687778,"about_ca_system_score_gemma":0.00042712223,"threshold_uncertainty_score":0.0061507225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031085374,0.0003045097,0.9659077,0.00017444482,0.000042150677,0.000049456958,0.00005840016,0.00013651351,0.0022414287],"genre_scores_gemma":[0.668388,0.0005536696,0.32820868,0.00014892366,0.000058215825,0.00019981798,0.00015254618,0.000089184156,0.0022008715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993011,0.00021917243,0.000027981552,0.00015776811,0.00019202821,0.00010196723],"domain_scores_gemma":[0.9978721,0.0014518736,0.00020741877,0.00019806859,0.00019909638,0.00007130653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009977121,0.00071377563,0.00082859735,0.00051500445,0.00047796065,0.0007649886,0.0010291262,0.00063086604,0.0010221433],"category_scores_gemma":[0.004636986,0.00024131467,0.00027528856,0.00073835015,0.0011195808,0.0012323915,0.00090957014,0.00090648147,0.00012890014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024364328,0.000051647134,0.00036087932,0.00017100743,0.000032075437,0.00006930483,0.00012697895,0.7906969,0.011925971,0.14131351,0.0017685198,0.05323948],"study_design_scores_gemma":[0.000037393074,0.00010256893,0.00012232756,0.00001650196,0.000013076501,0.00007452931,0.000035132365,0.9525829,0.004859247,0.040891666,0.0012471416,0.000017428292],"about_ca_topic_score_codex":0.0015369831,"about_ca_topic_score_gemma":0.0021103716,"teacher_disagreement_score":0.0015982655,"about_ca_system_score_codex":0.0015982655,"about_ca_system_score_gemma":0.002209405,"threshold_uncertainty_score":0.011596322},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045037717,0.00035558044,0.99175453,0.00013926909,0.0000772228,0.000056008957,0.00003815278,0.00012187518,0.0029535922],"genre_scores_gemma":[0.42208892,0.0010991604,0.56881267,0.00028095415,0.00020227309,0.0004001808,0.00033820915,0.000055349145,0.006722302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987179,0.00037366382,0.000047919457,0.00017875727,0.0005883537,0.000093421026],"domain_scores_gemma":[0.99868387,0.00038674564,0.00013257652,0.00017034546,0.0005815079,0.000044935707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000694992,0.0005630197,0.00046566917,0.0005320404,0.00032756588,0.0009752064,0.00088685635,0.0008032439,0.0017751203],"category_scores_gemma":[0.0027110456,0.00020929058,0.00026312767,0.0009090045,0.000512015,0.00075158454,0.0006273516,0.00079177145,0.0007863475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029732552,0.00010095242,0.00079218025,0.00035635263,0.00006692565,0.00018926378,0.00015427214,0.36328098,0.036105722,0.1825972,0.004638082,0.4114207],"study_design_scores_gemma":[0.000056081506,0.00020361404,0.00016391613,0.00004060879,0.00001989545,0.00023651266,0.000022574404,0.94727457,0.014016667,0.023865638,0.014077984,0.00002195553],"about_ca_topic_score_codex":0.0008786998,"about_ca_topic_score_gemma":0.0011291713,"teacher_disagreement_score":0.0017751203,"about_ca_system_score_codex":0.00075423747,"about_ca_system_score_gemma":0.0012894566,"threshold_uncertainty_score":0.005938351},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051063202,0.0020927207,0.9382798,0.00031457952,0.00007321727,0.000030033238,0.000025578536,0.00011859099,0.0080022635],"genre_scores_gemma":[0.85361487,0.0021575105,0.13880575,0.00015952428,0.00011027648,0.000050350733,0.00004298372,0.000016584445,0.005042178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978524,0.000065033804,0.0000055001497,0.000029930745,0.00008502749,0.000029317143],"domain_scores_gemma":[0.9995983,0.00026579338,0.000034768418,0.000030294621,0.000063201405,0.0000076046535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040847668,0.00028370722,0.00028558244,0.00019145502,0.00017812451,0.00033363642,0.00023393834,0.0006608895,0.0011281117],"category_scores_gemma":[0.001207061,0.000118716285,0.0002418101,0.00032847433,0.00043053553,0.0005467534,0.0002977148,0.00037890152,0.00037872093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013931072,0.000106663196,0.0012064534,0.00024893903,0.00007402238,0.00031074867,0.0002169452,0.688227,0.06383596,0.116261415,0.0015139647,0.12785856],"study_design_scores_gemma":[0.000008221666,0.0000724616,0.00022218545,0.000014734402,0.000010999035,0.00012394537,0.00002368401,0.9797055,0.0065747304,0.010577019,0.0026553941,0.0000110683795],"about_ca_topic_score_codex":0.00096757535,"about_ca_topic_score_gemma":0.0010559523,"teacher_disagreement_score":0.0011281117,"about_ca_system_score_codex":0.00044858342,"about_ca_system_score_gemma":0.0004274625,"threshold_uncertainty_score":0.003773868},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01519931,0.0004742834,0.97856253,0.00018431841,0.000033250813,0.000111926514,0.00008179672,0.00062811526,0.004724497],"genre_scores_gemma":[0.45013386,0.0005264802,0.5442146,0.00022355476,0.000047517053,0.00048527218,0.0003088541,0.00023541824,0.0038243635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995215,0.00023931626,0.000013367644,0.00006561488,0.00008706082,0.00007316029],"domain_scores_gemma":[0.9990582,0.00071461406,0.000059567392,0.00004843215,0.00007643945,0.000042749536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011578066,0.000844712,0.0009269684,0.0009644355,0.00064229575,0.00075605704,0.0010852303,0.0008207682,0.004177133],"category_scores_gemma":[0.0026299974,0.0004687439,0.0006023309,0.0010205786,0.0010020011,0.0012735692,0.0008585197,0.00086869375,0.0006470744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007387813,0.0000362827,0.00021686403,0.00006519636,0.000024922685,0.00006753903,0.00006954599,0.9520482,0.0005650362,0.010754045,0.0019351457,0.03414329],"study_design_scores_gemma":[0.00003881544,0.00004207209,0.000064450614,0.000014971695,0.00001449643,0.000019407214,0.000036177662,0.9921888,0.00051209057,0.0058725555,0.0011880108,0.000008168525],"about_ca_topic_score_codex":0.005667263,"about_ca_topic_score_gemma":0.0073969234,"teacher_disagreement_score":0.005667263,"about_ca_system_score_codex":0.0011564558,"about_ca_system_score_gemma":0.001525089,"threshold_uncertainty_score":0.013973892},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05442088,0.0008269904,0.93228954,0.0005022793,0.0001468777,0.000121706915,0.00011224577,0.00038263178,0.011196801],"genre_scores_gemma":[0.7839252,0.00094284,0.2091984,0.0003038897,0.00016633928,0.00028021607,0.00012950525,0.000048823036,0.005004748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836856,0.0006671292,0.00010654529,0.0002260021,0.00041324584,0.00021863364],"domain_scores_gemma":[0.99776196,0.0011011193,0.00028768016,0.00038954595,0.00036875124,0.00009096393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019580612,0.00072041363,0.00071455556,0.0007829025,0.00056600024,0.0009905952,0.00096833706,0.0007806516,0.0014105097],"category_scores_gemma":[0.0035714493,0.00027843151,0.00039272764,0.0010972902,0.0009443941,0.0025311017,0.0023349773,0.0009680732,0.00037200892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006422818,0.00016652427,0.0005452888,0.0002837938,0.000112957634,0.00068157294,0.0005636703,0.11320672,0.088787824,0.62662876,0.0052736737,0.16310705],"study_design_scores_gemma":[0.00026398987,0.00064689957,0.00024360417,0.000037060752,0.0001368179,0.0012570842,0.000086100736,0.8203484,0.038457982,0.12297812,0.015404003,0.00013990625],"about_ca_topic_score_codex":0.0004922225,"about_ca_topic_score_gemma":0.000603376,"teacher_disagreement_score":0.0019580612,"about_ca_system_score_codex":0.00072849006,"about_ca_system_score_gemma":0.001094679,"threshold_uncertainty_score":0.010355294},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015207408,0.928649,0.03659312,0.0013883229,0.0019648934,0.000046462363,0.00016017786,0.00018325154,0.029494042],"genre_scores_gemma":[0.010561529,0.96089524,0.014434948,0.0007003686,0.0020366316,0.000049642305,0.0003692304,0.00006493958,0.010887558],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995577,0.00009370802,0.00004253016,0.000060935876,0.00020876758,0.0000363364],"domain_scores_gemma":[0.9991523,0.00046870357,0.000048448954,0.000053753913,0.00024505914,0.000031700747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005869209,0.0008242944,0.0007452009,0.002076147,0.00039614332,0.001325377,0.00079668366,0.0009707211,0.008595793],"category_scores_gemma":[0.0014344724,0.00033947697,0.0004224815,0.0054324255,0.0003918953,0.0024093988,0.00065449515,0.001370174,0.006243238],"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.00003346898,0.000078431556,0.00042641297,0.005220193,0.000039893534,0.00013783058,0.00014579511,0.0028628611,0.0021441309,0.03905274,0.06391147,0.88594675],"study_design_scores_gemma":[0.0000051179686,0.000083837964,0.0006973194,0.0018683308,0.000040046907,0.000836358,0.00015144625,0.0025713535,0.00090176944,0.019105582,0.97370875,0.000030135041],"about_ca_topic_score_codex":0.00075742067,"about_ca_topic_score_gemma":0.0007456548,"teacher_disagreement_score":0.008595793,"about_ca_system_score_codex":0.00044283964,"about_ca_system_score_gemma":0.0009289764,"threshold_uncertainty_score":0.028755784},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03627027,0.002206673,0.95256454,0.00051345525,0.00009869761,0.00009106456,0.0000836965,0.0003125102,0.007859114],"genre_scores_gemma":[0.85432607,0.0026716446,0.13593341,0.0003037758,0.00015537723,0.00028744695,0.00010718079,0.000016797921,0.0061981524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989742,0.00042509488,0.00004511394,0.00018971121,0.00026633134,0.000099599085],"domain_scores_gemma":[0.9990233,0.0005258095,0.00011763928,0.0001312247,0.00017501343,0.000026970627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010352288,0.0009559268,0.0009277893,0.00056003325,0.0005816488,0.00070932356,0.0008662731,0.0010668549,0.0004979629],"category_scores_gemma":[0.002516178,0.00035123713,0.00034779115,0.0009132652,0.00070865126,0.0012834143,0.001219144,0.00049349375,0.0003543485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053536,0.00015804188,0.001962255,0.0006097321,0.00020018265,0.0019818705,0.00070808013,0.503878,0.039427843,0.20448878,0.0059826486,0.24006718],"study_design_scores_gemma":[0.0000774147,0.00026371432,0.0002754735,0.00003316356,0.00009287274,0.00084946613,0.00007144111,0.9285726,0.01025897,0.04995281,0.009504389,0.00004759362],"about_ca_topic_score_codex":0.0014354816,"about_ca_topic_score_gemma":0.0016944185,"teacher_disagreement_score":0.0014354816,"about_ca_system_score_codex":0.0005547387,"about_ca_system_score_gemma":0.00066693046,"threshold_uncertainty_score":0.0054748654},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025242144,0.0010483214,0.9691085,0.00036592397,0.000056303554,0.000031714004,0.00007269058,0.00018003053,0.00389434],"genre_scores_gemma":[0.86072123,0.0015181479,0.13250476,0.000094492956,0.00016665873,0.00015973792,0.00014272869,0.0001328215,0.0045594955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920183,0.00034495295,0.000032474425,0.00011668333,0.00021658758,0.00008744781],"domain_scores_gemma":[0.998601,0.0009745668,0.00013350589,0.000121245095,0.00013011982,0.000039593535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010484757,0.0007944673,0.0008868741,0.0005510618,0.00046467167,0.0012493136,0.0011725745,0.00105616,0.000991095],"category_scores_gemma":[0.003984209,0.00049889385,0.00029773044,0.0009471334,0.00077680213,0.0016827048,0.0008825491,0.0007712245,0.00026702826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058843296,0.000021450714,0.00011469454,0.00007020444,0.0000168314,0.00005760163,0.000058066635,0.9180748,0.0020646213,0.050558016,0.0011990789,0.027705785],"study_design_scores_gemma":[0.0000100022635,0.00002000881,0.000052147665,0.0000047797266,0.000004296184,0.000016971608,0.000012089024,0.9635203,0.00047857547,0.03528121,0.0005940761,0.000005677879],"about_ca_topic_score_codex":0.0013445395,"about_ca_topic_score_gemma":0.0015020008,"teacher_disagreement_score":0.0013445395,"about_ca_system_score_codex":0.0009805878,"about_ca_system_score_gemma":0.0007048314,"threshold_uncertainty_score":0.0071147084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061314754,0.0015552286,0.9279034,0.00030694704,0.000032251002,0.000029294104,0.000117000556,0.0002621964,0.008478867],"genre_scores_gemma":[0.8585315,0.0019573765,0.13351186,0.00017657025,0.000048137936,0.00012989213,0.00018806598,0.00014137762,0.0053152945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905926,0.0003217181,0.000038144957,0.00010103846,0.00039761607,0.00008218663],"domain_scores_gemma":[0.9969394,0.0018633618,0.00027397837,0.00023066669,0.0006562665,0.000036328493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001754739,0.00076725835,0.00061771733,0.0008586871,0.0003526727,0.0008357964,0.0007586787,0.00096483383,0.0010539221],"category_scores_gemma":[0.0066441526,0.00027410738,0.00039039727,0.00076144154,0.0011093403,0.0014512575,0.0006814474,0.0007468751,0.00038780927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005139034,0.000011242107,0.00042072215,0.00008831553,0.000017191296,0.00010138828,0.00018502172,0.9193249,0.0038466472,0.0650255,0.0005549689,0.010372703],"study_design_scores_gemma":[0.000003488412,0.000011754509,0.0001277465,0.000012061385,0.0000039062247,0.000051528623,0.000021334212,0.98535776,0.00080341625,0.013324331,0.00027318002,0.000009543853],"about_ca_topic_score_codex":0.0030713023,"about_ca_topic_score_gemma":0.0022773382,"teacher_disagreement_score":0.0030713023,"about_ca_system_score_codex":0.0015740381,"about_ca_system_score_gemma":0.00085610175,"threshold_uncertainty_score":0.011420488},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71011364,0.001521812,0.28238058,0.00021476664,0.00004776578,0.000066771994,0.00006826321,0.0002954591,0.005291019],"genre_scores_gemma":[0.99141425,0.0001478127,0.008034759,0.000021124773,0.0000104817445,0.000013572434,0.00001593317,0.000005017593,0.00033700667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990043,0.00038597314,0.000047645935,0.00011685034,0.00030414847,0.00014115355],"domain_scores_gemma":[0.9933836,0.0048749843,0.00040648878,0.00042125344,0.00082192704,0.00009170216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018866443,0.00071715174,0.00043325426,0.0005503666,0.00049895805,0.0008246994,0.0006491789,0.0008887368,0.00070518616],"category_scores_gemma":[0.0071107154,0.00022396832,0.00018347711,0.0005217897,0.000821596,0.0009594763,0.0006111996,0.00038022312,0.00017189643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095101725,0.00013914972,0.0050438307,0.0001707495,0.00012826557,0.00056411076,0.0005499171,0.837763,0.04699043,0.023708312,0.0005951553,0.083396055],"study_design_scores_gemma":[0.00007682437,0.00094462204,0.0018833284,0.00002094209,0.000062335064,0.0003660225,0.00012723728,0.9767949,0.010914947,0.008061797,0.0007032305,0.00004381877],"about_ca_topic_score_codex":0.0018629762,"about_ca_topic_score_gemma":0.001469282,"teacher_disagreement_score":0.0018866443,"about_ca_system_score_codex":0.00062681607,"about_ca_system_score_gemma":0.0004546077,"threshold_uncertainty_score":0.009977698},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11763323,0.0018204423,0.8714598,0.00044871756,0.00004961413,0.0000840107,0.000050301376,0.00037325328,0.008080761],"genre_scores_gemma":[0.9060046,0.0015251443,0.09097641,0.00006491269,0.00011362584,0.000099811725,0.000045615627,0.0000824843,0.0010873831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988927,0.0006061384,0.000030955285,0.00006609295,0.00025640463,0.00014778449],"domain_scores_gemma":[0.9967253,0.002564536,0.00015686566,0.00018329205,0.0002970242,0.00007291015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023123182,0.00096287095,0.0008913624,0.0012698506,0.0007260757,0.00094426365,0.0009836096,0.0008046658,0.00077124947],"category_scores_gemma":[0.0077642896,0.00034869433,0.0003281995,0.0017800285,0.0008826787,0.0019358229,0.0011017146,0.0005479478,0.00024246967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016878427,0.00007185772,0.0007150712,0.00010727793,0.000024149771,0.00013647127,0.00010551014,0.9301867,0.005194496,0.023002367,0.0010282749,0.03925902],"study_design_scores_gemma":[0.000005223736,0.00003593148,0.00009634185,0.0000052035493,0.0000055709993,0.000030559746,0.000016886002,0.99027586,0.0015665464,0.0076773516,0.00028134882,0.000003203002],"about_ca_topic_score_codex":0.0010885171,"about_ca_topic_score_gemma":0.000805796,"teacher_disagreement_score":0.0023123182,"about_ca_system_score_codex":0.0010199362,"about_ca_system_score_gemma":0.0005259795,"threshold_uncertainty_score":0.012228847},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80835754,0.0016527245,0.15948956,0.0007816535,0.0001517704,0.00009735756,0.00033850197,0.00038202875,0.02874895],"genre_scores_gemma":[0.99535865,0.00017731782,0.003279637,0.00003313847,0.00000955386,0.000017159562,0.00005686774,0.000009671918,0.0010579209],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875474,0.00042098167,0.00004376676,0.00014786673,0.00024037399,0.00039223683],"domain_scores_gemma":[0.99679273,0.0016306912,0.00030883096,0.0002492479,0.0009040184,0.0001145045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014415282,0.001332265,0.00096167414,0.00063087535,0.0007374774,0.0011797795,0.0011188489,0.0017083968,0.0016772889],"category_scores_gemma":[0.003265285,0.00025855753,0.00044608949,0.0007092127,0.0013923032,0.0010513214,0.001124909,0.00049120677,0.00026502227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006692696,0.00006748305,0.0014857631,0.00014025456,0.000084433734,0.0005725429,0.00017838962,0.94929427,0.018098332,0.017514713,0.00092071283,0.010973781],"study_design_scores_gemma":[0.000030943393,0.00020631282,0.00044699304,0.000014300434,0.000032432574,0.00016837347,0.00005409645,0.9930315,0.0029527717,0.0027787231,0.00024378658,0.000039825805],"about_ca_topic_score_codex":0.009489405,"about_ca_topic_score_gemma":0.0065058414,"teacher_disagreement_score":0.009489405,"about_ca_system_score_codex":0.0014905405,"about_ca_system_score_gemma":0.0016596437,"threshold_uncertainty_score":0.018868387},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08366507,0.014200451,0.8217072,0.0062971204,0.0009184292,0.00014437108,0.00054682,0.0023319041,0.07018869],"genre_scores_gemma":[0.90283555,0.0075901933,0.079740226,0.0017613696,0.0010239929,0.00037750413,0.00031488092,0.00078743056,0.0055688717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935516,0.002068109,0.0001635963,0.0009869009,0.0017068094,0.0015230024],"domain_scores_gemma":[0.9586095,0.034475528,0.0017750815,0.0029429062,0.0015277006,0.00066926633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056725647,0.0024863451,0.0015989572,0.002106488,0.0014668237,0.0032300856,0.002650264,0.0020463208,0.0060444362],"category_scores_gemma":[0.045055974,0.0007452158,0.0012008135,0.0025448932,0.003915657,0.0058859773,0.004159059,0.0050198114,0.0014740475],"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.0012792555,0.00023455756,0.0012793007,0.0009638037,0.00020420465,0.00054136483,0.000569923,0.37551576,0.035070613,0.44278988,0.014243951,0.12730749],"study_design_scores_gemma":[0.000086916574,0.00040598583,0.0009556946,0.0003677245,0.00023753491,0.0007765615,0.00016324128,0.59981287,0.026030147,0.35867637,0.0123796845,0.00010726032],"about_ca_topic_score_codex":0.0012622926,"about_ca_topic_score_gemma":0.0008530542,"teacher_disagreement_score":0.0060444362,"about_ca_system_score_codex":0.0037275478,"about_ca_system_score_gemma":0.0017056233,"threshold_uncertainty_score":0.029999733},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1350029,0.0021374843,0.8588455,0.00023291462,0.000043236552,0.000043898086,0.000031131665,0.00008171762,0.0035812997],"genre_scores_gemma":[0.960812,0.0010459995,0.036243122,0.00006725611,0.00005250894,0.00004613315,0.000020089105,0.000007710631,0.0017052395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993395,0.0003348972,0.000021325348,0.0001013382,0.00014737087,0.000055571025],"domain_scores_gemma":[0.9988984,0.00075779436,0.00012366747,0.00007326616,0.00012410818,0.000022723609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095167477,0.0005135537,0.0004092861,0.00033126315,0.00034795434,0.00062098517,0.0007046732,0.000726256,0.00044236876],"category_scores_gemma":[0.0021609026,0.00022344918,0.00022667523,0.0005245756,0.0006471194,0.0010318672,0.0006006878,0.00031364604,0.000115764255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012940471,0.000064272244,0.0012523108,0.0001733305,0.00005520356,0.0005216253,0.000254493,0.8661135,0.0143860355,0.06638056,0.0004931251,0.050176155],"study_design_scores_gemma":[0.000014928635,0.0000966914,0.00031625346,0.0000073165984,0.000016989987,0.00010315888,0.000033030035,0.9806892,0.0016759892,0.016312543,0.00072341104,0.000010368927],"about_ca_topic_score_codex":0.0010371257,"about_ca_topic_score_gemma":0.0010200118,"teacher_disagreement_score":0.0010371257,"about_ca_system_score_codex":0.00057401316,"about_ca_system_score_gemma":0.00030157887,"threshold_uncertainty_score":0.005033016},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05223806,0.00039341455,0.94313633,0.00012697591,0.00001857946,0.000044342516,0.000038692793,0.00010256565,0.0039010441],"genre_scores_gemma":[0.8715151,0.00041308775,0.12508908,0.00007878634,0.00002180527,0.00015417144,0.000054151278,0.000037419173,0.0026364108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935704,0.00024729082,0.000027236762,0.000101411235,0.00017328771,0.000093642055],"domain_scores_gemma":[0.9987417,0.0008470532,0.00012897413,0.00010324358,0.0001353389,0.000043761094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011382276,0.00048747478,0.00057733053,0.00045212856,0.00035475075,0.00080773025,0.00076872687,0.0005371709,0.001578008],"category_scores_gemma":[0.0038517541,0.00036997529,0.00020179515,0.0005243699,0.0009713832,0.0015157589,0.00090358756,0.0004302178,0.00040274407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034308943,0.00013201743,0.00054239377,0.00013329797,0.00004748292,0.00016693756,0.00028745888,0.75620043,0.016942898,0.09845829,0.0017448817,0.12500077],"study_design_scores_gemma":[0.000026823442,0.00004665732,0.000117646014,0.000006705624,0.0000064829896,0.00005352069,0.000039080765,0.96781117,0.0023101862,0.028819244,0.0007517295,0.000010738933],"about_ca_topic_score_codex":0.00060592697,"about_ca_topic_score_gemma":0.00069589034,"teacher_disagreement_score":0.001578008,"about_ca_system_score_codex":0.0007139759,"about_ca_system_score_gemma":0.00070291664,"threshold_uncertainty_score":0.0060195923},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013332212,0.0016052542,0.98173344,0.00014818147,0.00006176981,0.000030398322,0.0000075130342,0.00008405822,0.0029971227],"genre_scores_gemma":[0.8487736,0.0024613875,0.14485167,0.0001890853,0.00025899473,0.00015622056,0.000030334513,0.000029390227,0.0032492022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924445,0.00032486735,0.000021350425,0.000099277946,0.00026553715,0.00004461343],"domain_scores_gemma":[0.9987708,0.0007641819,0.00013867256,0.00013264308,0.00017467259,0.000018971155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084922946,0.00049141614,0.0005493019,0.0003356156,0.00033852327,0.0004629699,0.0009095888,0.0010624288,0.00066053274],"category_scores_gemma":[0.0024180722,0.00022559782,0.00032386382,0.0006158759,0.0009867948,0.00091802696,0.0006432907,0.00059999514,0.00024796728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011226792,0.00008927803,0.0009479623,0.0004590127,0.00009344148,0.00060653995,0.00060684053,0.66824096,0.03810931,0.16126925,0.0021844916,0.12728061],"study_design_scores_gemma":[0.000022992512,0.00015833409,0.0001880402,0.000019298608,0.000025525525,0.00027075334,0.00004448891,0.9697518,0.002845922,0.022661893,0.0039846795,0.000026232818],"about_ca_topic_score_codex":0.0005941146,"about_ca_topic_score_gemma":0.00043969392,"teacher_disagreement_score":0.0010624288,"about_ca_system_score_codex":0.00037917212,"about_ca_system_score_gemma":0.00026423205,"threshold_uncertainty_score":0.00449121},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26936305,0.0016478426,0.7186521,0.00031864346,0.000039271243,0.00004791273,0.00006397659,0.00034866383,0.009518523],"genre_scores_gemma":[0.9915223,0.00027785444,0.0073303264,0.000032393014,0.00001726863,0.000019838802,0.000019441584,0.000015324566,0.00076536404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982881,0.0006927925,0.00004796045,0.00017090105,0.0005790193,0.00022123221],"domain_scores_gemma":[0.99307525,0.004790862,0.000512996,0.00042806618,0.001094996,0.0000978551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023137773,0.0010072648,0.0009352334,0.0007409842,0.0004232012,0.0010625053,0.0007268497,0.00091638963,0.0009833289],"category_scores_gemma":[0.008081898,0.0003093713,0.0005462814,0.000866821,0.0010079463,0.0008501188,0.0008677991,0.00052120315,0.00026864288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013934037,0.000034645676,0.0013614488,0.000087266024,0.00007582902,0.00025635117,0.00018460602,0.9534186,0.012845557,0.014051214,0.00036369375,0.01718143],"study_design_scores_gemma":[0.000005448247,0.00014439847,0.00049515965,0.0000073358865,0.000024126964,0.00014240103,0.000032920554,0.9940646,0.0024909342,0.0024009263,0.00017930621,0.000012419355],"about_ca_topic_score_codex":0.0017280657,"about_ca_topic_score_gemma":0.00091476575,"teacher_disagreement_score":0.0023137773,"about_ca_system_score_codex":0.0013346468,"about_ca_system_score_gemma":0.0006533366,"threshold_uncertainty_score":0.012236595},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28759432,0.0017076727,0.6967319,0.0003530877,0.00008724826,0.00007162125,0.0000833975,0.0006481734,0.012722544],"genre_scores_gemma":[0.98684907,0.00032335965,0.012194188,0.0000297613,0.000011387004,0.0000129958,0.000019281717,0.0000068060754,0.00055309973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99964774,0.00009773916,0.000013835471,0.000037285834,0.00008947077,0.00011388441],"domain_scores_gemma":[0.999243,0.00041284645,0.000116822324,0.00008495439,0.00011009023,0.00003231117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005958927,0.00061085017,0.00039893825,0.0003339126,0.00052229373,0.0008417492,0.00065121177,0.0005211239,0.0005496292],"category_scores_gemma":[0.0016214395,0.00015969465,0.00025257946,0.00045987542,0.00046718545,0.0009080808,0.0014264141,0.00039207315,0.00015126447],"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.00019321448,0.00006702963,0.0018210508,0.000113151706,0.000046669433,0.00073589315,0.0002983676,0.85359055,0.03618814,0.04059396,0.0012098996,0.06514206],"study_design_scores_gemma":[0.000011495971,0.0001012703,0.00027399807,0.00001340132,0.000025563224,0.00017275782,0.00012422247,0.9836521,0.0072352467,0.0063357623,0.0020390693,0.00001506166],"about_ca_topic_score_codex":0.0054442715,"about_ca_topic_score_gemma":0.0075813015,"teacher_disagreement_score":0.0054442715,"about_ca_system_score_codex":0.0006353066,"about_ca_system_score_gemma":0.00050567003,"threshold_uncertainty_score":0.010825157},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15695103,0.0031037917,0.81032145,0.0006119762,0.00006668268,0.000081942046,0.00012927638,0.00046699238,0.028266901],"genre_scores_gemma":[0.96655965,0.0018111527,0.028521903,0.000085663625,0.000098662844,0.00018783259,0.00008035189,0.00008904745,0.0025657322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809724,0.00074353017,0.00008407016,0.00019426549,0.0006060526,0.0002747505],"domain_scores_gemma":[0.9885434,0.0088714035,0.0008891244,0.00056840637,0.00094642694,0.00018129419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028389923,0.0011539228,0.0010391264,0.001051659,0.0008058855,0.0020250268,0.001311661,0.0012556142,0.0013062572],"category_scores_gemma":[0.019051345,0.0006656789,0.00037226558,0.0014874048,0.0025165014,0.0028752978,0.0013924887,0.0011157629,0.00059253036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014210428,0.00007475056,0.00093850755,0.00020778384,0.000056286346,0.0002243564,0.00022914236,0.79817975,0.0041983463,0.17330205,0.0011494466,0.021297572],"study_design_scores_gemma":[0.000017815164,0.000061326915,0.0003148026,0.000031155945,0.000012994967,0.00009683457,0.00006074733,0.88730085,0.0011178649,0.11050337,0.0004686199,0.000013668729],"about_ca_topic_score_codex":0.0010605494,"about_ca_topic_score_gemma":0.00068960694,"teacher_disagreement_score":0.0028389923,"about_ca_system_score_codex":0.0015634581,"about_ca_system_score_gemma":0.0008353557,"threshold_uncertainty_score":0.015014231},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008450443,0.00014621977,0.989368,0.00014647757,0.000018327699,0.00002863146,0.000012941321,0.00012186062,0.0017069948],"genre_scores_gemma":[0.7322485,0.000552899,0.26388118,0.00016394477,0.00011212875,0.00031532903,0.000050341714,0.000114692935,0.0025610095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998968,0.0004983218,0.000034603174,0.00013989436,0.00026650043,0.00009264043],"domain_scores_gemma":[0.99849856,0.001037995,0.00017674509,0.0001223318,0.00012929048,0.000035078243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018465522,0.00079012976,0.0008730395,0.0004940223,0.0004884006,0.0008726378,0.0009434143,0.0007661183,0.0009814879],"category_scores_gemma":[0.004475806,0.00039307837,0.0005304362,0.0008271312,0.0015029444,0.0012853128,0.0009433284,0.0007936376,0.00034294114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042953543,0.000029388952,0.00013037046,0.000047028618,0.000018765872,0.000049075214,0.000047062,0.92978173,0.003264133,0.05100329,0.0006726717,0.01491356],"study_design_scores_gemma":[0.000014365946,0.000022692575,0.000027815484,0.0000032314208,0.0000048785605,0.000014323209,0.0000039814076,0.9821868,0.0006951259,0.016674735,0.00034775276,0.0000043061523],"about_ca_topic_score_codex":0.00050728273,"about_ca_topic_score_gemma":0.00053102354,"teacher_disagreement_score":0.0018465522,"about_ca_system_score_codex":0.00094583444,"about_ca_system_score_gemma":0.00085346197,"threshold_uncertainty_score":0.009765625},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048981167,0.0004944896,0.93528575,0.00040383014,0.00009277487,0.00007456633,0.00014767752,0.00048600006,0.014033694],"genre_scores_gemma":[0.9064638,0.00037611488,0.08684512,0.00014249036,0.000058850983,0.00008916564,0.00010527675,0.00004632382,0.0058728764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990396,0.0002364673,0.000043184806,0.00018253968,0.00031598675,0.00018222292],"domain_scores_gemma":[0.99796486,0.0009855625,0.00016641892,0.00044298798,0.000361064,0.000079090794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012943071,0.0010828355,0.0007395684,0.00044970965,0.000940166,0.0014772803,0.0011102543,0.00082360976,0.003367611],"category_scores_gemma":[0.0041613034,0.0002503266,0.000256681,0.00060272537,0.0008013165,0.0019640052,0.0012588312,0.0007771068,0.0008153349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008247554,0.0001544761,0.0009483091,0.00020498336,0.000052666128,0.00039359563,0.0002563409,0.52909493,0.029662661,0.33451596,0.005229335,0.098661974],"study_design_scores_gemma":[0.000035509634,0.000090348934,0.000099306235,0.0000101831065,0.00001803819,0.00013127827,0.00003161505,0.9427627,0.013292914,0.041430682,0.0020790275,0.000018469917],"about_ca_topic_score_codex":0.0019827858,"about_ca_topic_score_gemma":0.0030990338,"teacher_disagreement_score":0.003367611,"about_ca_system_score_codex":0.00083325536,"about_ca_system_score_gemma":0.0015357418,"threshold_uncertainty_score":0.011265755},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03122369,0.00039281131,0.9633265,0.00010496343,0.000029335275,0.00007934163,0.00004978073,0.00033035848,0.0044632372],"genre_scores_gemma":[0.68385464,0.00035433337,0.3105417,0.00008794978,0.000030416846,0.0002733372,0.0000926084,0.000040481118,0.0047244993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957937,0.0001552235,0.00001897113,0.000082042745,0.00009993465,0.00006443571],"domain_scores_gemma":[0.9995808,0.00022556657,0.000052242507,0.000051531148,0.00006842731,0.000021545964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058660266,0.00054227875,0.0007310737,0.00041108066,0.00042246783,0.00077187666,0.0010240474,0.00050609175,0.0016396545],"category_scores_gemma":[0.0013017463,0.00021278061,0.00024389724,0.00066169054,0.00037196386,0.0008525764,0.0008047394,0.00034995252,0.00045349903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027337202,0.00021260593,0.00037376222,0.00016141954,0.000056611454,0.00025299698,0.00018147017,0.7115671,0.018403325,0.024162956,0.0034556754,0.24089867],"study_design_scores_gemma":[0.000024787876,0.00005213126,0.00010102824,0.0000044599856,0.000012011121,0.00007636136,0.000021981627,0.9905049,0.003898591,0.0038169539,0.001477351,0.000009525831],"about_ca_topic_score_codex":0.0014284232,"about_ca_topic_score_gemma":0.0017660873,"teacher_disagreement_score":0.0016396545,"about_ca_system_score_codex":0.00054728886,"about_ca_system_score_gemma":0.0006935866,"threshold_uncertainty_score":0.0054852366},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07174599,0.0010183988,0.9214403,0.0004791363,0.00002312411,0.000049764407,0.0000616175,0.00018038289,0.005001384],"genre_scores_gemma":[0.9589077,0.0006398539,0.03731988,0.00007470936,0.000042407934,0.00008507027,0.000039397684,0.000032884327,0.0028581615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939597,0.0002769449,0.000026426604,0.000081692706,0.00012985308,0.000089065616],"domain_scores_gemma":[0.9982522,0.0013087614,0.00016795879,0.00006190473,0.00017839094,0.00003077498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011195996,0.00086078054,0.0007356629,0.00038402766,0.00031454198,0.0006556551,0.00050771376,0.0006706761,0.0011808246],"category_scores_gemma":[0.0038012338,0.00038324064,0.00022109912,0.00071289256,0.00083061866,0.00087844033,0.0006270192,0.0004765315,0.00023968823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006546062,0.00002559156,0.00022552072,0.000055458415,0.000018173874,0.000060680024,0.000089476795,0.9683593,0.0027496682,0.009418628,0.0003781695,0.018553916],"study_design_scores_gemma":[0.000014183087,0.000045438843,0.00013229974,0.0000054705656,0.000007819456,0.000019558462,0.000016090115,0.9919081,0.00090626784,0.0066675395,0.0002721644,0.0000052104506],"about_ca_topic_score_codex":0.0023906913,"about_ca_topic_score_gemma":0.0015372956,"teacher_disagreement_score":0.0023906913,"about_ca_system_score_codex":0.0009881684,"about_ca_system_score_gemma":0.00069493137,"threshold_uncertainty_score":0.0071697235},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17203493,0.0035685808,0.8113012,0.0006868698,0.000105417654,0.00006529682,0.0001610994,0.0001860939,0.011890636],"genre_scores_gemma":[0.9872809,0.000902869,0.010179008,0.00008770394,0.00008853151,0.00004424514,0.000024535644,0.000019064091,0.0013732464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838316,0.0006804943,0.000053199226,0.00021725359,0.000351179,0.0003146278],"domain_scores_gemma":[0.99049544,0.007933365,0.00068629824,0.00021617163,0.00053455355,0.00013426742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018848995,0.0010763884,0.0013066579,0.0005332047,0.000593795,0.0019099204,0.0012842629,0.001096915,0.0011010079],"category_scores_gemma":[0.010763426,0.0005865339,0.00041468674,0.0011470891,0.0012676971,0.0018514073,0.0011250644,0.0007960746,0.00017388005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020595526,0.000046465328,0.0012821759,0.00020615985,0.00012459185,0.0010667902,0.00024279892,0.9109287,0.0025093528,0.061383743,0.0010645371,0.020938592],"study_design_scores_gemma":[0.000032030628,0.000092781156,0.0005632377,0.00002391468,0.000044524186,0.00033383493,0.000079186946,0.97034854,0.0009816822,0.026614215,0.00086491444,0.00002116199],"about_ca_topic_score_codex":0.0026616026,"about_ca_topic_score_gemma":0.0019189779,"teacher_disagreement_score":0.0026616026,"about_ca_system_score_codex":0.0011638569,"about_ca_system_score_gemma":0.0008107921,"threshold_uncertainty_score":0.0099684},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026294677,0.17115343,0.72554106,0.05075036,0.0022928356,0.00013579744,0.00010657805,0.0006353712,0.02308987],"genre_scores_gemma":[0.7802195,0.07670684,0.12242008,0.0026453335,0.009454431,0.00018408417,0.00014675631,0.000076448305,0.008146502],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988452,0.00027457174,0.00007305462,0.00018487395,0.00048622728,0.00013607825],"domain_scores_gemma":[0.99732685,0.0011950801,0.00028901678,0.00022959687,0.0008038112,0.00015564426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027538368,0.0006803167,0.00061206706,0.0009697825,0.0011071824,0.0032593932,0.002538747,0.0039052574,0.0014526754],"category_scores_gemma":[0.0051017953,0.0004945846,0.00029276067,0.0012301701,0.0018815194,0.00462063,0.0018490031,0.0020776421,0.0003543931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001832515,0.00021347626,0.0016105707,0.0010829336,0.000052031148,0.0004174703,0.0004722316,0.061324053,0.0052854856,0.40775082,0.01666822,0.5049395],"study_design_scores_gemma":[0.000045542885,0.00017782913,0.000905925,0.00038737708,0.00004672225,0.00092832954,0.00071901875,0.42106888,0.005373192,0.51437443,0.055872455,0.000100250225],"about_ca_topic_score_codex":0.001087346,"about_ca_topic_score_gemma":0.0006972798,"teacher_disagreement_score":0.0039052574,"about_ca_system_score_codex":0.0015867354,"about_ca_system_score_gemma":0.0010560523,"threshold_uncertainty_score":0.0145638585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07801508,0.00049795327,0.91702867,0.00028310702,0.000037921123,0.00008206624,0.000031625565,0.00009254177,0.003931073],"genre_scores_gemma":[0.9583931,0.0002320719,0.039692897,0.000060122442,0.000041688196,0.00009930303,0.000015182702,0.000014896015,0.0014507581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825305,0.0009360018,0.000045230114,0.00017835674,0.00033413805,0.0002532136],"domain_scores_gemma":[0.99577713,0.003049144,0.00042493184,0.00027532224,0.00031711435,0.00015630043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028628688,0.0007019252,0.00090369344,0.00066488056,0.0007713744,0.0011091998,0.0013518526,0.0008376361,0.0008427114],"category_scores_gemma":[0.007070427,0.0003716764,0.0002462427,0.00089165586,0.0016356177,0.0014912714,0.0010196883,0.00046452798,0.00017250246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013134458,0.00007117657,0.00055199285,0.000035969675,0.00003386814,0.00015236659,0.00017141183,0.9144294,0.00230825,0.06102627,0.00047830623,0.020609586],"study_design_scores_gemma":[0.000022580414,0.000040294886,0.00009042707,0.0000034926416,0.0000073974916,0.000033022683,0.000024975656,0.9777854,0.00052090385,0.021043064,0.0004213479,0.0000071563004],"about_ca_topic_score_codex":0.0028535856,"about_ca_topic_score_gemma":0.002811959,"teacher_disagreement_score":0.0028628688,"about_ca_system_score_codex":0.0015344591,"about_ca_system_score_gemma":0.0013440229,"threshold_uncertainty_score":0.015140474},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10442788,0.0008887076,0.88826793,0.00038578868,0.00006387637,0.00010623258,0.0000596745,0.0003417092,0.0054581626],"genre_scores_gemma":[0.94147205,0.0003386809,0.056941364,0.000074201336,0.000038878996,0.0001316571,0.00003565714,0.000023300128,0.0009441806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863523,0.00072317844,0.000038779654,0.00009733049,0.00031747302,0.00018791473],"domain_scores_gemma":[0.9975241,0.0016447157,0.0003166571,0.00018476242,0.0002754969,0.000054269927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023288834,0.00049888174,0.0006730796,0.0007659011,0.00059166324,0.0006035322,0.0010303481,0.0006691572,0.0004661632],"category_scores_gemma":[0.0053691166,0.00029176616,0.00037769353,0.00077289646,0.0009797319,0.0010048772,0.0007760899,0.00045197387,0.00010504202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015830003,0.00005098166,0.0003254704,0.00005130728,0.00002478329,0.00011506143,0.0001010854,0.93657213,0.0037733198,0.040254783,0.0005742719,0.017998464],"study_design_scores_gemma":[0.000020270469,0.00003873115,0.000067640634,0.000005618314,0.000009924932,0.000023821256,0.000012975673,0.990053,0.0008501174,0.008569591,0.00033973303,0.00000865412],"about_ca_topic_score_codex":0.005721345,"about_ca_topic_score_gemma":0.0048793936,"teacher_disagreement_score":0.005721345,"about_ca_system_score_codex":0.0014673496,"about_ca_system_score_gemma":0.0014099206,"threshold_uncertainty_score":0.012316465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032136557,0.00031447504,0.99543273,0.000081359045,0.000033382967,0.000032842974,0.000018378212,0.00016713385,0.0007061],"genre_scores_gemma":[0.37651384,0.00081923965,0.61486304,0.00033113486,0.00027883807,0.00023232428,0.00014320033,0.000052248568,0.006766202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902296,0.0002506903,0.000055913366,0.00011062688,0.00050900306,0.00005080639],"domain_scores_gemma":[0.9991522,0.00036507123,0.00012676767,0.00012809144,0.00020496438,0.000022887518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013499227,0.0007864183,0.0008137546,0.00038212157,0.0005038468,0.00094534154,0.0015129008,0.0011079082,0.0018944172],"category_scores_gemma":[0.0018017697,0.0004570183,0.00033771645,0.0003953416,0.00039401726,0.00093777373,0.0009141854,0.0012828326,0.0013968518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047554332,0.0002191662,0.001817774,0.0006802742,0.00017815741,0.0005502371,0.00035530276,0.11288969,0.30014738,0.14406979,0.0051417984,0.43347496],"study_design_scores_gemma":[0.00009670031,0.00067147135,0.0006039857,0.000051610787,0.0000773595,0.00076597603,0.000038094953,0.912104,0.062087078,0.010167466,0.0132639725,0.00007221813],"about_ca_topic_score_codex":0.00018461286,"about_ca_topic_score_gemma":0.0005192398,"teacher_disagreement_score":0.0018944172,"about_ca_system_score_codex":0.00039371537,"about_ca_system_score_gemma":0.00061416987,"threshold_uncertainty_score":0.007139206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095923185,0.004516848,0.8881722,0.00050372054,0.00008398609,0.00007186821,0.000119695236,0.00011184691,0.010496755],"genre_scores_gemma":[0.94968164,0.0033765724,0.042651244,0.000088414665,0.00007608988,0.000069144444,0.0000843246,0.000071747265,0.0039008784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933916,0.00020296172,0.00003983543,0.000064216714,0.00028329363,0.00007053417],"domain_scores_gemma":[0.9949881,0.0036389802,0.0005206735,0.0002459891,0.0004959497,0.00011030046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018583932,0.0009813617,0.0006754749,0.0007105695,0.0003487502,0.0010528127,0.0006187019,0.0005721235,0.0014093757],"category_scores_gemma":[0.009062125,0.00035907363,0.000405979,0.00046571798,0.0011060543,0.0015654818,0.0008409539,0.000985578,0.00038347673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022362464,0.000048177397,0.001584245,0.00025955812,0.000060862043,0.0008531369,0.00053810724,0.70343953,0.019529138,0.24683926,0.001175901,0.025448391],"study_design_scores_gemma":[0.0000128396605,0.00006113407,0.00039157333,0.000027014821,0.000017662062,0.0005058126,0.000088760586,0.9446689,0.004664697,0.048191845,0.0013352949,0.000034428544],"about_ca_topic_score_codex":0.0008468759,"about_ca_topic_score_gemma":0.000490057,"teacher_disagreement_score":0.0018583932,"about_ca_system_score_codex":0.0018436603,"about_ca_system_score_gemma":0.00046495727,"threshold_uncertainty_score":0.013376772},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03518075,0.0004827536,0.9593427,0.00011020303,0.000018267478,0.000027497685,0.000049283168,0.00017080957,0.004617688],"genre_scores_gemma":[0.8866139,0.0007074181,0.109417945,0.00007675242,0.000030749503,0.00007321784,0.00006601862,0.00008033296,0.002933755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917275,0.0003881313,0.00003428026,0.00010353815,0.00020342803,0.0000978142],"domain_scores_gemma":[0.9992661,0.0003728655,0.00012637304,0.00012226925,0.00009213995,0.00002030829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010823652,0.000897841,0.00089901715,0.00041198495,0.00022878638,0.0007552426,0.0006071493,0.00053851894,0.001186084],"category_scores_gemma":[0.0029156627,0.00035237276,0.00026665503,0.0007684547,0.0010503222,0.0011197755,0.0007960469,0.00041910418,0.00040511048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007534947,0.000027343225,0.00016602996,0.000056680637,0.000029187546,0.00005696731,0.000043589134,0.9436011,0.0069398275,0.030222036,0.00045992283,0.01832194],"study_design_scores_gemma":[0.00002380632,0.000058642312,0.0001927423,0.000009861551,0.000015228925,0.0000778756,0.000021677079,0.9595102,0.0039405352,0.035341267,0.0007947724,0.000013410264],"about_ca_topic_score_codex":0.00046615617,"about_ca_topic_score_gemma":0.0006033487,"teacher_disagreement_score":0.001186084,"about_ca_system_score_codex":0.0007166765,"about_ca_system_score_gemma":0.00060415256,"threshold_uncertainty_score":0.005724132},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9535332,0.0010848823,0.03698074,0.00012775998,0.000030381156,0.000014197529,0.000047736496,0.000114011666,0.008067136],"genre_scores_gemma":[0.9986401,0.000110264555,0.00087427866,0.000009501661,0.000008710936,0.00000400949,0.000006922811,0.0000059362474,0.0003401874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995499,0.00016338416,0.00000593254,0.000047700927,0.00008601066,0.00014693102],"domain_scores_gemma":[0.99693954,0.0022896226,0.00018050999,0.00020540316,0.00027789242,0.000107107655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007140927,0.00045077232,0.00048659643,0.00060928316,0.00039398775,0.0008517316,0.00049801054,0.000608596,0.0010840327],"category_scores_gemma":[0.0035944872,0.00022496824,0.00026227883,0.000554552,0.0011585976,0.0010912977,0.00082562526,0.00042493586,0.00013662483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014582332,0.000028606702,0.001469523,0.000064153835,0.00003033475,0.00038743476,0.000071662354,0.97297734,0.0079619,0.008857216,0.00022529042,0.0077806595],"study_design_scores_gemma":[0.000021795164,0.00025573504,0.0024865284,0.000015185931,0.000061069055,0.0003114981,0.0001516238,0.97509956,0.009257315,0.011495091,0.00082110974,0.000023505363],"about_ca_topic_score_codex":0.0020242909,"about_ca_topic_score_gemma":0.0016336248,"teacher_disagreement_score":0.0020242909,"about_ca_system_score_codex":0.0006727813,"about_ca_system_score_gemma":0.00033819553,"threshold_uncertainty_score":0.0048814416},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049002707,0.0003960219,0.94722956,0.00016753981,0.00005648909,0.00013478415,0.000026253738,0.00025659578,0.0027300466],"genre_scores_gemma":[0.9222268,0.00028118503,0.07621082,0.00008289823,0.00002626416,0.00024357474,0.000036393303,0.000016168788,0.0008759419],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995454,0.00016431535,0.000024714867,0.00004510264,0.00017372896,0.000046788446],"domain_scores_gemma":[0.9982673,0.0010708756,0.00021142607,0.0001616037,0.00024649265,0.00004225808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008503485,0.00030789213,0.00025589077,0.00036186178,0.00038073852,0.00046873832,0.000547969,0.0004011941,0.0005188739],"category_scores_gemma":[0.0041233534,0.00016888851,0.00017281328,0.0003183502,0.0008969141,0.000845266,0.00054234365,0.0004974882,0.00010446964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042464506,0.0001355603,0.0019832882,0.00032316355,0.00007397615,0.00088054483,0.00082126225,0.6308026,0.059634294,0.16384387,0.0024473555,0.13862947],"study_design_scores_gemma":[0.000065333625,0.00036894972,0.00028930075,0.000018891566,0.000025957283,0.00022638563,0.00004980474,0.95945895,0.007051683,0.029521786,0.0028987795,0.000024196417],"about_ca_topic_score_codex":0.0011659885,"about_ca_topic_score_gemma":0.00085526926,"teacher_disagreement_score":0.0011659885,"about_ca_system_score_codex":0.00038907476,"about_ca_system_score_gemma":0.0005300905,"threshold_uncertainty_score":0.004497111},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12400089,0.0007277476,0.8559036,0.0013846515,0.00022970834,0.00013343489,0.00027003762,0.0010094077,0.016340509],"genre_scores_gemma":[0.9543598,0.00066137995,0.038583472,0.00017274728,0.0002021343,0.00013834103,0.00012913348,0.000038226935,0.005714745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825484,0.0006633117,0.000064276486,0.00023529552,0.0004883217,0.0002938752],"domain_scores_gemma":[0.9936054,0.0042210566,0.00058187556,0.00089985755,0.00047075682,0.0002210601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013809451,0.0004347343,0.000561642,0.0006124361,0.0008490717,0.0013602375,0.000875499,0.00095826125,0.003046188],"category_scores_gemma":[0.0056696045,0.00021570126,0.00031194714,0.0010588488,0.0011341895,0.002763929,0.0012609042,0.0011444902,0.0005192153],"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.00056281267,0.00010890709,0.0005726221,0.00025948163,0.00003091577,0.00045867712,0.00033207485,0.2103698,0.013745907,0.7226115,0.0039976365,0.0469497],"study_design_scores_gemma":[0.00006535882,0.00013584366,0.00018139978,0.000040887087,0.000011545431,0.0002176615,0.000066257264,0.72415626,0.008346695,0.26014787,0.0065814676,0.000048813505],"about_ca_topic_score_codex":0.0011837527,"about_ca_topic_score_gemma":0.0008550688,"teacher_disagreement_score":0.003046188,"about_ca_system_score_codex":0.0010085434,"about_ca_system_score_gemma":0.00090205384,"threshold_uncertainty_score":0.010190487},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009688532,0.0011663832,0.9782833,0.00038071902,0.000051299325,0.000053220243,0.00008568339,0.00005743515,0.010233452],"genre_scores_gemma":[0.742457,0.0054518124,0.2395036,0.00042742718,0.0003094855,0.0005914876,0.00030048002,0.00018814448,0.010770527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919635,0.00034224344,0.000030849504,0.0001225916,0.00021870037,0.000089260044],"domain_scores_gemma":[0.999041,0.0006893457,0.000088233595,0.000042369476,0.000121276775,0.000017782493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012799255,0.0018076521,0.0012240292,0.00064757443,0.0004680855,0.0021201759,0.0009063308,0.0013838862,0.0019792693],"category_scores_gemma":[0.002735948,0.0006582638,0.00074175186,0.0013770078,0.00096584694,0.0016680364,0.0011859658,0.0012331406,0.00050402235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056543886,0.00005878714,0.00025858253,0.00029858504,0.000056723624,0.0001701262,0.00009237057,0.9044172,0.005248683,0.066245966,0.0021735902,0.020922896],"study_design_scores_gemma":[0.000013461687,0.00005598487,0.00016774483,0.000024161556,0.000018247982,0.00010432831,0.000028348466,0.97477573,0.0015991067,0.021840664,0.001357563,0.000014620343],"about_ca_topic_score_codex":0.0012934764,"about_ca_topic_score_gemma":0.0010493072,"teacher_disagreement_score":0.0021201759,"about_ca_system_score_codex":0.0016479415,"about_ca_system_score_gemma":0.0010554248,"threshold_uncertainty_score":0.011956632},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061906166,0.0035597559,0.9003654,0.0032336456,0.0004945286,0.00024995767,0.00009197946,0.00018863405,0.029909948],"genre_scores_gemma":[0.88984793,0.0015348622,0.09920972,0.00042854028,0.00033018403,0.0004196698,0.00004588781,0.000026197653,0.008156974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979778,0.0012104776,0.00008608406,0.00016212853,0.00041108576,0.00015250551],"domain_scores_gemma":[0.9981583,0.0010737655,0.00026542315,0.00015816314,0.00024618782,0.00009818419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033498202,0.0003754198,0.0006325545,0.0007591003,0.0009999669,0.0010879174,0.001614963,0.0019886987,0.0016413259],"category_scores_gemma":[0.006871281,0.00028585485,0.0005791169,0.00074184686,0.0012988664,0.0023794228,0.0012334015,0.0012183168,0.00020624048],"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.000073902076,0.00008386543,0.0005513287,0.00014810747,0.000031927862,0.00029339432,0.00025033223,0.046201617,0.0027680278,0.91098654,0.0021410764,0.03646991],"study_design_scores_gemma":[0.00014568027,0.00017956596,0.00043249468,0.00009137955,0.00003933534,0.0003965393,0.00008121825,0.41229445,0.0014974789,0.56226176,0.022530934,0.000049231585],"about_ca_topic_score_codex":0.0006192098,"about_ca_topic_score_gemma":0.00029649257,"teacher_disagreement_score":0.0033498202,"about_ca_system_score_codex":0.0011747177,"about_ca_system_score_gemma":0.0010392957,"threshold_uncertainty_score":0.017715812},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011965985,0.000071979164,0.9854689,0.00011148691,0.000018529834,0.000027326932,0.000025283261,0.00020181012,0.0021086794],"genre_scores_gemma":[0.5461103,0.00017917811,0.4510588,0.000057401958,0.00005965593,0.0002270086,0.0001199738,0.00014518148,0.0020426176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888366,0.00043714652,0.000041676445,0.00019066653,0.00032378428,0.00012311952],"domain_scores_gemma":[0.9973978,0.0017151849,0.00021536126,0.0002965598,0.00028647284,0.0000887449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024973846,0.0006611777,0.001158856,0.0007007765,0.0005358464,0.0015191582,0.0013999436,0.0008949874,0.0017345729],"category_scores_gemma":[0.011618665,0.0005631448,0.0004845497,0.0006312486,0.0010095898,0.0016866045,0.0016720704,0.0013418142,0.00037995644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010703114,0.00003558043,0.00029313992,0.00006925525,0.000023435821,0.000052067833,0.00008909128,0.8857909,0.0038225453,0.06717041,0.0011434824,0.041402988],"study_design_scores_gemma":[0.00001194247,0.000006822686,0.00003102922,0.0000036181245,0.0000017320594,0.000005321815,0.0000062306317,0.98281324,0.0008091018,0.016033664,0.0002750753,0.0000020995549],"about_ca_topic_score_codex":0.0014728697,"about_ca_topic_score_gemma":0.0019908026,"teacher_disagreement_score":0.0024973846,"about_ca_system_score_codex":0.0013423914,"about_ca_system_score_gemma":0.0016733627,"threshold_uncertainty_score":0.013207614},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2010755,0.004179673,0.78251106,0.00043053884,0.00004872112,0.000053253916,0.00019314191,0.0003762143,0.011131782],"genre_scores_gemma":[0.9829159,0.0013440932,0.013870273,0.000080545215,0.000037312075,0.000046316964,0.00006879969,0.000028917102,0.0016078217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987606,0.00039109314,0.000046306024,0.00013819958,0.00042273663,0.00024105351],"domain_scores_gemma":[0.9927872,0.0053992216,0.0006451088,0.00042027605,0.0006582941,0.00008998624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023324115,0.0012977424,0.0011071571,0.0013837683,0.00051157724,0.0011783359,0.00093803916,0.00083485956,0.0016900726],"category_scores_gemma":[0.008491087,0.00034211157,0.00049687334,0.0011597589,0.0011244258,0.0013286542,0.0012477475,0.00068063376,0.00045741053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015060927,0.000021710382,0.0009219674,0.00015041321,0.000052794105,0.00019231922,0.00013135046,0.9431606,0.006711419,0.034907136,0.00036325006,0.013236406],"study_design_scores_gemma":[0.000006062651,0.00006186659,0.00049466256,0.000020209569,0.000021698148,0.00014577627,0.000038732218,0.9887716,0.0018977541,0.00822807,0.00028969266,0.000023887274],"about_ca_topic_score_codex":0.0014820752,"about_ca_topic_score_gemma":0.0010182788,"teacher_disagreement_score":0.0023324115,"about_ca_system_score_codex":0.0015335813,"about_ca_system_score_gemma":0.00066206016,"threshold_uncertainty_score":0.012335062},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01202808,0.0002041542,0.9833128,0.00012909803,0.0000336146,0.00005367399,0.00009632072,0.0002239133,0.0039182715],"genre_scores_gemma":[0.38627493,0.0007682892,0.608578,0.00014142224,0.000037712074,0.00020192568,0.00018421908,0.000084367945,0.0037290817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996972,0.000077961915,0.00001408164,0.000038212725,0.00014408602,0.000028504026],"domain_scores_gemma":[0.9994154,0.00020620726,0.00006665215,0.00014867319,0.00014434643,0.000018745068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003555698,0.00032684903,0.00025190075,0.0003741668,0.0003291047,0.0004927849,0.00041046864,0.0005192635,0.0016070304],"category_scores_gemma":[0.0018883143,0.00015862941,0.00025681758,0.00041424186,0.0005570305,0.00064809434,0.0005571839,0.00081976416,0.0006328184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011585583,0.000038743463,0.00033596295,0.0001684606,0.000015696332,0.00014151295,0.00015229979,0.21313103,0.048588656,0.65569335,0.0019602117,0.07965817],"study_design_scores_gemma":[0.000020445199,0.00005906099,0.0001612627,0.00002898981,0.000010837621,0.00018559399,0.000015795857,0.87793916,0.019408,0.08974302,0.012399465,0.000028395716],"about_ca_topic_score_codex":0.0011508391,"about_ca_topic_score_gemma":0.0010985887,"teacher_disagreement_score":0.0016070304,"about_ca_system_score_codex":0.00049516745,"about_ca_system_score_gemma":0.0008215569,"threshold_uncertainty_score":0.005376041},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08639502,0.0010832999,0.9083938,0.0001304387,0.000016300335,0.00003456288,0.00003662106,0.000102684855,0.0038072926],"genre_scores_gemma":[0.9713208,0.00059594103,0.027306663,0.00003162261,0.000018691644,0.000060292838,0.000020629945,0.0000078739,0.0006375966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898976,0.0004877793,0.00003306776,0.00010406608,0.0002627553,0.00012255667],"domain_scores_gemma":[0.9987865,0.0008052617,0.00015153857,0.00008873187,0.000134678,0.000033316584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012082971,0.00051772676,0.0005150104,0.00039428798,0.0003593072,0.0005838833,0.00064214086,0.00050775416,0.00037470987],"category_scores_gemma":[0.0024135925,0.0003014452,0.0002916324,0.0006486134,0.0006504116,0.00070266175,0.00093313644,0.0002753224,0.00011328362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016306092,0.00004677881,0.0018684019,0.0001495662,0.000077201534,0.0004936868,0.00033290128,0.86463034,0.014712778,0.05033274,0.0005395841,0.066652946],"study_design_scores_gemma":[0.000013211105,0.00008995313,0.00035634945,0.000011374335,0.000022248916,0.00017012395,0.000043631568,0.97893757,0.002390382,0.017029895,0.0009196511,0.000015675474],"about_ca_topic_score_codex":0.0010681786,"about_ca_topic_score_gemma":0.0012232605,"teacher_disagreement_score":0.0012082971,"about_ca_system_score_codex":0.0004467821,"about_ca_system_score_gemma":0.00048522867,"threshold_uncertainty_score":0.0063901544},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10161713,0.0005101681,0.8919848,0.00021452071,0.00003899179,0.00003795746,0.000017543527,0.00013324164,0.005445614],"genre_scores_gemma":[0.9685976,0.00019276752,0.02992288,0.000044360804,0.000016690841,0.00007269557,0.000013005028,0.000010911144,0.0011290379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967897,0.00013948351,0.000011914687,0.00004306734,0.000076773715,0.00004979968],"domain_scores_gemma":[0.9995065,0.00031727366,0.00006928807,0.00002961785,0.00005433237,0.000022910619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007875335,0.00052765117,0.00057221047,0.00034403586,0.000389688,0.00083595334,0.0006119664,0.00064835564,0.00047105225],"category_scores_gemma":[0.0014155667,0.00031231195,0.00033382414,0.00037354784,0.0007053366,0.00074692845,0.00084403774,0.0003628352,0.00009996024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032151904,0.000025900254,0.0002289886,0.000023815237,0.00002367556,0.000069936286,0.000053159383,0.97971284,0.0012658708,0.0071759145,0.00017573718,0.011212009],"study_design_scores_gemma":[0.0000056327435,0.000011105845,0.000029570096,0.0000011419606,0.0000028091254,0.0000046589525,0.000008303944,0.99737155,0.00013183344,0.002334035,0.00009744587,0.0000019068715],"about_ca_topic_score_codex":0.003002784,"about_ca_topic_score_gemma":0.0018989643,"teacher_disagreement_score":0.003002784,"about_ca_system_score_codex":0.0005271487,"about_ca_system_score_gemma":0.00049974676,"threshold_uncertainty_score":0.005970657},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33150473,0.0050101276,0.61288214,0.0011722363,0.00008793123,0.00012676728,0.0004822985,0.00093219953,0.047801543],"genre_scores_gemma":[0.985607,0.0011187283,0.010935417,0.00006132766,0.00007475796,0.000043472435,0.00013620728,0.00004842357,0.001974623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673516,0.0011763022,0.00010470507,0.00026174908,0.0012158268,0.0005062504],"domain_scores_gemma":[0.9903654,0.0068898518,0.0007816318,0.0004497978,0.0013953454,0.000117842304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025757034,0.0017106639,0.0012822114,0.0011266501,0.0007016791,0.0015468842,0.0008724973,0.0014070309,0.0017554866],"category_scores_gemma":[0.0100960275,0.00044630453,0.00051734515,0.0015582808,0.0013233948,0.0013051933,0.001216888,0.00069760915,0.0006729208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049342366,0.000050394243,0.0027743797,0.00018219318,0.00012572689,0.0004143363,0.00023542116,0.92125386,0.014527452,0.03406304,0.0008597001,0.025019966],"study_design_scores_gemma":[0.000021467053,0.0002224853,0.00118281,0.00002245396,0.000067871595,0.00032340997,0.00004797063,0.9853511,0.0052326103,0.0068719015,0.00062210736,0.00003375316],"about_ca_topic_score_codex":0.003658494,"about_ca_topic_score_gemma":0.0024780475,"teacher_disagreement_score":0.003658494,"about_ca_system_score_codex":0.00218404,"about_ca_system_score_gemma":0.001139211,"threshold_uncertainty_score":0.015846372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00808367,0.00085475,0.9865911,0.00038648114,0.00007098345,0.00005179697,0.000058230573,0.00018253639,0.003720551],"genre_scores_gemma":[0.5323041,0.0028079182,0.45586148,0.00043714308,0.0002895833,0.00032121484,0.00028199996,0.000132452,0.0075641223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763644,0.0012301289,0.000093037816,0.0002005885,0.00064146344,0.00019834349],"domain_scores_gemma":[0.9961075,0.0020561516,0.00042766175,0.0007577096,0.0005638466,0.00008703794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020547495,0.0009149702,0.0009553454,0.0009826921,0.0005910179,0.0015258763,0.00090306124,0.0011865693,0.0015485185],"category_scores_gemma":[0.009896035,0.00023875672,0.000475405,0.0015735982,0.0018315598,0.0022808057,0.001663062,0.0013223623,0.00052804506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007002441,0.000022115546,0.0001927859,0.0001555564,0.000024107901,0.00012710609,0.0001428231,0.24687338,0.0027712565,0.6818842,0.0025460485,0.065190546],"study_design_scores_gemma":[0.000021628854,0.0000634153,0.000062401064,0.000044044704,0.000013729295,0.00015450334,0.000036038586,0.6323396,0.003990196,0.356713,0.0065253777,0.000036177946],"about_ca_topic_score_codex":0.0015215288,"about_ca_topic_score_gemma":0.0017204088,"teacher_disagreement_score":0.0020547495,"about_ca_system_score_codex":0.0012839229,"about_ca_system_score_gemma":0.0013678559,"threshold_uncertainty_score":0.010866702},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64501125,0.0017043859,0.34175107,0.00023428346,0.00005840253,0.00003987807,0.00012193766,0.00038367612,0.010695012],"genre_scores_gemma":[0.9834005,0.0002950813,0.015722202,0.000019457932,0.000013185976,0.000013005723,0.000037806298,0.000009336037,0.0004894155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994178,0.00021303346,0.000022796912,0.000059752667,0.00021824185,0.00006847522],"domain_scores_gemma":[0.99820995,0.0011993771,0.00017616467,0.00013053846,0.00024793638,0.00003607238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089570903,0.00071651366,0.0004053989,0.00038748462,0.0003546113,0.00051081827,0.0003213033,0.0004956878,0.0006671597],"category_scores_gemma":[0.001964155,0.00013155323,0.00026485304,0.00046896486,0.00045565522,0.00046487837,0.00046729328,0.00027047194,0.00019269252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017133864,0.00013456073,0.0076825786,0.00038527156,0.000284488,0.0005841179,0.00043852252,0.54944104,0.24283539,0.016258184,0.00081388175,0.17942858],"study_design_scores_gemma":[0.00004196386,0.00085445715,0.004869881,0.000026107193,0.00011199769,0.0006548721,0.000075967895,0.914321,0.073782586,0.0039537456,0.0012529755,0.000054421977],"about_ca_topic_score_codex":0.00062997045,"about_ca_topic_score_gemma":0.0009772428,"teacher_disagreement_score":0.00089570903,"about_ca_system_score_codex":0.00034049328,"about_ca_system_score_gemma":0.00030750668,"threshold_uncertainty_score":0.0047370195},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07628219,0.0017536505,0.91334677,0.0008743098,0.000037464404,0.0000644355,0.00017337728,0.00056993373,0.0068978337],"genre_scores_gemma":[0.9382002,0.0011933473,0.057333753,0.00018526768,0.000095909316,0.00016211245,0.00017453505,0.00011835645,0.0025366042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650145,0.0017309976,0.00010349055,0.0002372325,0.0010536443,0.0003731173],"domain_scores_gemma":[0.974759,0.021832876,0.0009892902,0.0006650749,0.0015941283,0.00015964173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057793832,0.0012801248,0.001411758,0.0011724527,0.00058733637,0.0019090298,0.0010168639,0.0014417288,0.0023864985],"category_scores_gemma":[0.027083423,0.00066644565,0.0004599859,0.0008687224,0.0021984119,0.002931931,0.0020440794,0.0012770334,0.00062221836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030149368,0.00003396358,0.00079758884,0.0001238567,0.000053975713,0.00013731331,0.0002323523,0.92393774,0.0038729967,0.053635206,0.00056545,0.016308133],"study_design_scores_gemma":[0.000012680802,0.000059748872,0.00014537937,0.000016350003,0.000012098385,0.0000619427,0.000023290555,0.98690367,0.0015369635,0.011022858,0.00018931812,0.000015700314],"about_ca_topic_score_codex":0.0016533147,"about_ca_topic_score_gemma":0.0009182264,"teacher_disagreement_score":0.0057793832,"about_ca_system_score_codex":0.0019689465,"about_ca_system_score_gemma":0.0011554704,"threshold_uncertainty_score":0.030564666},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014908264,0.00032185717,0.9829421,0.00012036698,0.000015456379,0.000038806593,0.000030301739,0.00007255816,0.0015502386],"genre_scores_gemma":[0.8027231,0.00097340683,0.19259933,0.00017085491,0.000080670674,0.00025972186,0.00008789021,0.000026842912,0.0030782653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990615,0.00037841644,0.000035785182,0.00015491068,0.00031005268,0.000059393275],"domain_scores_gemma":[0.9985922,0.00079662737,0.00014551809,0.00014014932,0.00029479005,0.000030736614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011444679,0.00068685936,0.0006270112,0.0002913648,0.00034243998,0.0007971605,0.0008518659,0.0010772543,0.0009891745],"category_scores_gemma":[0.0034404134,0.0003568473,0.00025358712,0.00043517898,0.0008247262,0.0010919231,0.0007989987,0.0006452408,0.000388778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018375822,0.000056618654,0.0012927162,0.00027270237,0.00010361518,0.00048860867,0.00032550233,0.76673174,0.028536705,0.10818178,0.0011025126,0.09272376],"study_design_scores_gemma":[0.000019621148,0.00009746498,0.00026362416,0.000016177315,0.000028242679,0.0003963749,0.000030981413,0.97173023,0.007733305,0.018393917,0.0012663968,0.000023712013],"about_ca_topic_score_codex":0.0009501437,"about_ca_topic_score_gemma":0.0010004686,"teacher_disagreement_score":0.0011444679,"about_ca_system_score_codex":0.00062519533,"about_ca_system_score_gemma":0.0009703846,"threshold_uncertainty_score":0.0060526133},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8454166,0.0002874095,0.15123215,0.00015532943,0.000015504475,0.000040585775,0.000092293325,0.00026479893,0.0024953836],"genre_scores_gemma":[0.99626607,0.000036433914,0.0034333104,0.000017563734,0.0000033328788,0.000011947057,0.00003578231,0.000007473904,0.00018814504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795675,0.0006725477,0.00011670321,0.00027255868,0.0005795535,0.0004018142],"domain_scores_gemma":[0.98720413,0.00894697,0.0012048222,0.00076553586,0.0016018348,0.0002767605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040867636,0.00093592156,0.0011029326,0.00057960424,0.0005803088,0.0013373615,0.0008743652,0.001218477,0.00047932944],"category_scores_gemma":[0.0120421,0.00027996104,0.00034850225,0.00054968265,0.0014781463,0.0012603728,0.0012990123,0.00064995245,0.00014215209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005031072,0.00011870517,0.0031460607,0.00005383792,0.000071697046,0.00028514804,0.00014492196,0.9718399,0.011249733,0.0039447933,0.0001669738,0.008475075],"study_design_scores_gemma":[0.000008492566,0.00018613503,0.0012132478,0.0000038294293,0.000017800612,0.00007315407,0.000042111857,0.99288225,0.004004325,0.0015075133,0.000045417153,0.000015664107],"about_ca_topic_score_codex":0.0042420123,"about_ca_topic_score_gemma":0.0029027632,"teacher_disagreement_score":0.0042420123,"about_ca_system_score_codex":0.0013687009,"about_ca_system_score_gemma":0.0013548242,"threshold_uncertainty_score":0.021613121},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13394703,0.0005926518,0.8623967,0.00018149304,0.000059542508,0.000052058567,0.000056815265,0.00034423397,0.002369347],"genre_scores_gemma":[0.92106086,0.00028509015,0.07710024,0.000053511456,0.00003709827,0.000035513538,0.000041962947,0.0000400516,0.001345634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915814,0.0003249883,0.000050740626,0.00010235978,0.00025689232,0.00010686492],"domain_scores_gemma":[0.998069,0.0009788284,0.00028982383,0.00021498006,0.00039212714,0.000055272456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012814995,0.00069589633,0.0006540518,0.0003031702,0.0003228345,0.00062437414,0.0009907405,0.0005276421,0.00092423236],"category_scores_gemma":[0.003043646,0.00017818532,0.00022311068,0.0003877209,0.0005492713,0.0010236108,0.0006116617,0.0005108453,0.00018554604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002616483,0.000043511922,0.0003931996,0.00008099405,0.00003778579,0.00013659713,0.00008436486,0.9193011,0.026780702,0.013177487,0.00066444604,0.03903813],"study_design_scores_gemma":[0.000016077676,0.00006490795,0.000087760585,0.000002807364,0.000009384978,0.000040146173,0.0000097997945,0.9957125,0.0021930619,0.0016812906,0.00017431902,0.000007957197],"about_ca_topic_score_codex":0.0018506215,"about_ca_topic_score_gemma":0.0013543603,"teacher_disagreement_score":0.0018506215,"about_ca_system_score_codex":0.0008501124,"about_ca_system_score_gemma":0.0008982688,"threshold_uncertainty_score":0.0067772865},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054037113,0.00061603443,0.9393347,0.00025168742,0.00011887262,0.000121430996,0.00005784048,0.00020612031,0.005256266],"genre_scores_gemma":[0.84595156,0.00042022235,0.14983498,0.00023401412,0.00007118063,0.00014343014,0.00008014113,0.000011737017,0.0032527857],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993278,0.00015595282,0.000033187018,0.00010761857,0.00026998937,0.000105507555],"domain_scores_gemma":[0.9993692,0.00013357,0.000102758495,0.00011076215,0.00022793272,0.000055783003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073124794,0.00049900776,0.0005669846,0.0005615654,0.0006066973,0.00070056226,0.0011117073,0.0007127913,0.00082833605],"category_scores_gemma":[0.0009906981,0.0001933066,0.000381999,0.00067194476,0.0006270665,0.0005906921,0.0010629507,0.0005301155,0.00039147915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005632382,0.00030513524,0.0013589222,0.00023020369,0.00011496849,0.00054334285,0.0005169797,0.06811348,0.48666343,0.21967158,0.002509808,0.21940899],"study_design_scores_gemma":[0.00028696234,0.0016826311,0.0010583962,0.00007119591,0.00017712441,0.0018735186,0.00010905483,0.8226665,0.109721765,0.042609848,0.019593427,0.00014957007],"about_ca_topic_score_codex":0.0004997956,"about_ca_topic_score_gemma":0.0004984725,"teacher_disagreement_score":0.0011117073,"about_ca_system_score_codex":0.0003612429,"about_ca_system_score_gemma":0.00052244635,"threshold_uncertainty_score":0.003867209},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020030307,0.0009505919,0.9760825,0.00019775047,0.000055631564,0.000017950117,0.000024144621,0.00006743969,0.002573596],"genre_scores_gemma":[0.84052557,0.00134134,0.1555012,0.00015415651,0.00015063431,0.00009507303,0.00006315039,0.000019515486,0.0021494809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997002,0.00010735735,0.000008378554,0.000043406086,0.00011039035,0.000030340907],"domain_scores_gemma":[0.999569,0.00021325232,0.000047066354,0.00006228575,0.00009250841,0.000015958789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000423109,0.00039412337,0.0003136529,0.00020770637,0.00028805365,0.00044935764,0.00043996266,0.0004825502,0.0007902804],"category_scores_gemma":[0.0011366507,0.00013729703,0.00022023836,0.00041060385,0.00048303572,0.00047071246,0.000511179,0.00044518407,0.00016442046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010017092,0.000030511677,0.0005312095,0.00016557105,0.000047472517,0.0002525272,0.00015820414,0.6669591,0.02202687,0.21272482,0.0020595826,0.094943926],"study_design_scores_gemma":[0.000016990873,0.00007937755,0.00010660534,0.000013213842,0.000012963974,0.00011468725,0.00001808693,0.9666557,0.0018134629,0.027510956,0.0036425816,0.000015480873],"about_ca_topic_score_codex":0.0008905097,"about_ca_topic_score_gemma":0.0013556133,"teacher_disagreement_score":0.0008905097,"about_ca_system_score_codex":0.00067846524,"about_ca_system_score_gemma":0.00058771466,"threshold_uncertainty_score":0.0049226284},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38791478,0.0020828168,0.58227646,0.00085152406,0.000067378925,0.00012450454,0.00022889736,0.00041895997,0.026034636],"genre_scores_gemma":[0.97200453,0.000852366,0.025274256,0.00008925485,0.0000757871,0.000057139714,0.00008766241,0.000039414237,0.0015195964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658704,0.0011347602,0.0000814617,0.00025429326,0.0013957776,0.00054654275],"domain_scores_gemma":[0.990952,0.006607776,0.0006288888,0.0007806826,0.0009055532,0.00012503554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023344306,0.0014382907,0.0010108708,0.00093974685,0.0005751627,0.0016421777,0.0010846205,0.0010485442,0.0022655914],"category_scores_gemma":[0.007814418,0.0004247194,0.0006755779,0.001555233,0.0013944317,0.0018466595,0.001455345,0.0012547594,0.00036296324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006653132,0.00007413531,0.002919974,0.00014169571,0.0001279,0.0005317602,0.00021872943,0.83723044,0.031730484,0.082653895,0.001011508,0.042694163],"study_design_scores_gemma":[0.000021764003,0.0001704248,0.0010701003,0.000016637685,0.000054159987,0.00031034046,0.00004729232,0.9787385,0.007064754,0.011884223,0.00058158714,0.000040256615],"about_ca_topic_score_codex":0.0017786032,"about_ca_topic_score_gemma":0.0018214474,"teacher_disagreement_score":0.0023344306,"about_ca_system_score_codex":0.0022788828,"about_ca_system_score_gemma":0.0010013197,"threshold_uncertainty_score":0.016534507},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02124482,0.00049211323,0.97671676,0.00010657894,0.000040410967,0.000049954353,0.00002617989,0.00021458798,0.0011085559],"genre_scores_gemma":[0.80131084,0.00080684444,0.19526137,0.00013947053,0.00009547479,0.00014960962,0.00008238883,0.000027361784,0.002126696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917126,0.00030937576,0.000044682412,0.00013931404,0.00026130327,0.00007408014],"domain_scores_gemma":[0.9988716,0.0004897447,0.00015834984,0.00019749497,0.00024728107,0.000035409164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010553427,0.00081801193,0.00072234025,0.000505268,0.0005505723,0.0004597744,0.0014901494,0.00053786335,0.00072035874],"category_scores_gemma":[0.0021960647,0.00027160766,0.00032793113,0.00054186,0.0006611345,0.0009821034,0.0007800856,0.00060130673,0.00035018995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005462863,0.00024102375,0.0021089646,0.0003817234,0.00017344361,0.0010096367,0.00092907425,0.39689267,0.12477104,0.111890145,0.0044994415,0.35655665],"study_design_scores_gemma":[0.00008260179,0.00037618954,0.00034505624,0.00002116802,0.000086227956,0.0009631683,0.000060002854,0.95799124,0.020875955,0.01367512,0.005439177,0.0000841599],"about_ca_topic_score_codex":0.0007157104,"about_ca_topic_score_gemma":0.0011308484,"teacher_disagreement_score":0.0014901494,"about_ca_system_score_codex":0.00040116557,"about_ca_system_score_gemma":0.00041083642,"threshold_uncertainty_score":0.0055812597},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5409473,0.0014151634,0.43725437,0.0005718205,0.000089796486,0.0000628893,0.00026387573,0.000853635,0.018541213],"genre_scores_gemma":[0.99206114,0.0001228258,0.006905069,0.00003867762,0.000013452898,0.00002371926,0.000062698826,0.000020043899,0.0007522766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694306,0.0008163833,0.00014357154,0.0004228657,0.000979091,0.0006951196],"domain_scores_gemma":[0.9854708,0.009040647,0.0018348885,0.0016997909,0.0016533152,0.00030062566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030133992,0.0011064084,0.0010889745,0.0007146363,0.0008528336,0.0015789774,0.0010701504,0.0016538901,0.00201945],"category_scores_gemma":[0.012436369,0.00025188277,0.0004745848,0.0010467566,0.00140125,0.0018950821,0.002625767,0.0007438949,0.00037200362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022631714,0.00012357405,0.003068565,0.00018961061,0.00016717686,0.00038402065,0.00034383754,0.8814746,0.030808631,0.034076218,0.0010683336,0.046032272],"study_design_scores_gemma":[0.000056350047,0.0005093765,0.0014536944,0.000024809644,0.00006226535,0.00045426824,0.00010547141,0.9488505,0.03705457,0.010695502,0.0006595183,0.00007373371],"about_ca_topic_score_codex":0.001828331,"about_ca_topic_score_gemma":0.00064011867,"teacher_disagreement_score":0.0030133992,"about_ca_system_score_codex":0.00093646266,"about_ca_system_score_gemma":0.0012524966,"threshold_uncertainty_score":0.015936613},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9741275,0.0002932769,0.023563694,0.00007994801,0.00004167739,0.00011775996,0.00012994428,0.00030087584,0.0013453409],"genre_scores_gemma":[0.98485065,0.00023882334,0.0135875605,0.000015878362,0.000010985893,0.00012347597,0.00013902334,0.000027821667,0.0010057657],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990759,0.0002123382,0.00008774887,0.00014713091,0.00037775986,0.00009908122],"domain_scores_gemma":[0.99349594,0.0039025415,0.00065013097,0.00083977554,0.000909967,0.0002017063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001574209,0.0005721623,0.00052096846,0.00088469696,0.0003612779,0.00031183267,0.00090074184,0.00062629976,0.0010751791],"category_scores_gemma":[0.0044489373,0.00017791385,0.00023567134,0.00090729457,0.00062743947,0.0008143519,0.0006649823,0.0004440067,0.00016083449],"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.002595829,0.002542599,0.0037061132,0.0012273861,0.0001414447,0.00042888938,0.000434417,0.13938561,0.774615,0.00214958,0.0005677322,0.07220535],"study_design_scores_gemma":[0.00029362264,0.015644997,0.0057523157,0.000048715643,0.000103985,0.00046501224,0.0003666601,0.2569638,0.7176578,0.0011580442,0.0014907535,0.000054350377],"about_ca_topic_score_codex":0.00048701128,"about_ca_topic_score_gemma":0.0003273411,"teacher_disagreement_score":0.001574209,"about_ca_system_score_codex":0.00025293563,"about_ca_system_score_gemma":0.00024770357,"threshold_uncertainty_score":0.008325279},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09959703,0.0016447277,0.8870632,0.0006102643,0.00006524134,0.00007733811,0.00008831363,0.0001282473,0.01072559],"genre_scores_gemma":[0.9744022,0.0006138585,0.023152692,0.000042903728,0.000031096155,0.000051983123,0.00002416089,0.000022084463,0.0016590145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936885,0.0003083396,0.000021846827,0.000063205756,0.00013280277,0.000105013576],"domain_scores_gemma":[0.9988894,0.00074434315,0.00013590165,0.00006456538,0.0001297932,0.000036099136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011925327,0.0010204619,0.00086679007,0.00051770604,0.00040316148,0.0010710107,0.0005620431,0.0007974621,0.0020960076],"category_scores_gemma":[0.003611944,0.00042785896,0.00032274745,0.00064040394,0.0010703574,0.001406935,0.0008398748,0.0006048601,0.0004000644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007522385,0.000016372018,0.00014566124,0.000046855137,0.000018029532,0.00010084262,0.00004873446,0.96419466,0.0015535473,0.026632816,0.00041037804,0.0067569083],"study_design_scores_gemma":[0.000017813458,0.000020721342,0.000042187887,0.0000036425415,0.000005289924,0.000017368464,0.000016136688,0.98795694,0.00029981654,0.011456215,0.00015918126,0.0000046490773],"about_ca_topic_score_codex":0.0017316706,"about_ca_topic_score_gemma":0.0014961233,"teacher_disagreement_score":0.0020960076,"about_ca_system_score_codex":0.0010866811,"about_ca_system_score_gemma":0.00070816017,"threshold_uncertainty_score":0.007884443},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021563537,0.001743973,0.9597417,0.00031045784,0.00016853436,0.00006722797,0.000037739574,0.00013145662,0.016235344],"genre_scores_gemma":[0.8739057,0.002127165,0.111109115,0.00035752574,0.00019133688,0.0001770426,0.00010148605,0.000018743443,0.012011746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994161,0.00020737686,0.000026288735,0.00010456323,0.00017455824,0.00007112228],"domain_scores_gemma":[0.99924904,0.00033279115,0.000093218616,0.0001429384,0.00015504604,0.000026783537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053032604,0.0005752775,0.0005842419,0.0004597617,0.00050713046,0.0007926996,0.0007827083,0.0009899886,0.0022329171],"category_scores_gemma":[0.0013456137,0.00015333093,0.0003692128,0.00074019446,0.0007560383,0.0012142209,0.0015432164,0.00047818123,0.00057447754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024177288,0.000090674344,0.0008535871,0.00065022946,0.00015637059,0.0013583829,0.00079615106,0.29915547,0.042469762,0.44968474,0.0056979796,0.19884484],"study_design_scores_gemma":[0.000053700707,0.00044234563,0.0003292172,0.00006090475,0.0000690531,0.0014546149,0.00021410192,0.823011,0.012680736,0.12274664,0.03887431,0.00006339073],"about_ca_topic_score_codex":0.00037060207,"about_ca_topic_score_gemma":0.0003956063,"teacher_disagreement_score":0.0022329171,"about_ca_system_score_codex":0.00038311133,"about_ca_system_score_gemma":0.00038930424,"threshold_uncertainty_score":0.007469833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097289756,0.0005133362,0.8979636,0.00021790763,0.00006741065,0.0001410366,0.00007118001,0.0005574096,0.0031783434],"genre_scores_gemma":[0.9206421,0.00022740343,0.0776651,0.00009157015,0.00003559791,0.000089293986,0.000059824408,0.000020755562,0.0011683961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995572,0.00014749114,0.000018971507,0.00005682836,0.00016172722,0.0000578203],"domain_scores_gemma":[0.99879515,0.0005057849,0.00018839508,0.00019196981,0.000275814,0.00004297837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074594654,0.00044824617,0.00034855874,0.0006155698,0.00044134402,0.00028092493,0.0011461753,0.00043336724,0.00053541956],"category_scores_gemma":[0.003554373,0.00011633626,0.00021262423,0.00045269672,0.0004309519,0.00072321604,0.00065581105,0.00044682936,0.00011990964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085096137,0.00025000426,0.0018598196,0.00026645575,0.00009277988,0.00056645396,0.00038914883,0.42648765,0.07390434,0.06021141,0.0033115556,0.4318095],"study_design_scores_gemma":[0.000030424559,0.00021425786,0.00048217629,0.000011485378,0.000027276845,0.00029396356,0.000028303339,0.9834451,0.008243827,0.0056475326,0.0015461995,0.00002944081],"about_ca_topic_score_codex":0.0018997118,"about_ca_topic_score_gemma":0.0031860296,"teacher_disagreement_score":0.0018997118,"about_ca_system_score_codex":0.00051054737,"about_ca_system_score_gemma":0.0006034404,"threshold_uncertainty_score":0.003944993},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06453639,0.0007669768,0.92695993,0.00016884194,0.00007389528,0.00015678612,0.0000543039,0.00097260094,0.006310324],"genre_scores_gemma":[0.7194293,0.00084539753,0.27566668,0.00007410625,0.000054321157,0.0001125684,0.00010824286,0.000049414153,0.0036600092],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998585,0.000031998497,0.000011038892,0.00002666318,0.000048893897,0.00002292262],"domain_scores_gemma":[0.9997751,0.00007614552,0.00003567739,0.00003532508,0.00006939618,0.000008464592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019300198,0.00037291134,0.00017558446,0.00025983344,0.0002252829,0.00063071784,0.00082347717,0.0003462541,0.0027041207],"category_scores_gemma":[0.000574113,0.00018447843,0.00018504675,0.00023074224,0.00018033347,0.00055782264,0.00015334132,0.0003364389,0.0006031799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004928176,0.00010244529,0.0024311596,0.00069194677,0.00009059028,0.00083733065,0.00022094432,0.12323346,0.4289217,0.032070253,0.0035938472,0.40731344],"study_design_scores_gemma":[0.0002311567,0.002679155,0.0044434536,0.00014269525,0.00024006712,0.0030322822,0.00017071559,0.5754325,0.36297452,0.009799362,0.040773936,0.00008021373],"about_ca_topic_score_codex":0.00090422103,"about_ca_topic_score_gemma":0.0013729394,"teacher_disagreement_score":0.0027041207,"about_ca_system_score_codex":0.00037297053,"about_ca_system_score_gemma":0.0005135706,"threshold_uncertainty_score":0.009046137},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73023725,0.00085601927,0.25858417,0.00035246284,0.00007453487,0.0000844098,0.000107922766,0.00027086757,0.009432355],"genre_scores_gemma":[0.9928999,0.00020535292,0.006431417,0.00001934679,0.000007699313,0.00001619716,0.000018711626,0.000013300861,0.00038803404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998862,0.0006079022,0.000025630909,0.000051236184,0.00030994407,0.0001433479],"domain_scores_gemma":[0.98182124,0.01572786,0.00083633064,0.0004946388,0.0010203916,0.00009948109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013677087,0.00040187314,0.0002984432,0.0006445527,0.00030654922,0.00045559029,0.00038283222,0.00041145468,0.00078300847],"category_scores_gemma":[0.010663929,0.0001705508,0.00022252412,0.00057386217,0.0008522308,0.0006957283,0.00044959434,0.0002582274,0.00007635653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014232626,0.00002239214,0.0008048212,0.00006351829,0.000015840202,0.00014761825,0.000038436243,0.9730768,0.008500253,0.010002826,0.0001540404,0.007031132],"study_design_scores_gemma":[0.000011491306,0.0000948571,0.00039560994,0.000008855176,0.000017873197,0.00007645658,0.000022656823,0.98995787,0.0062337294,0.0029557114,0.00021219898,0.00001275874],"about_ca_topic_score_codex":0.0025350077,"about_ca_topic_score_gemma":0.0019154779,"teacher_disagreement_score":0.0025350077,"about_ca_system_score_codex":0.0009715793,"about_ca_system_score_gemma":0.0003815939,"threshold_uncertainty_score":0.0072332025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13985594,0.0006730882,0.8539887,0.00024409719,0.000033286444,0.00006915309,0.000071332455,0.00016640143,0.004897965],"genre_scores_gemma":[0.95474225,0.00022645872,0.043829642,0.0000385441,0.000013831393,0.000038037837,0.000018450397,0.0000128310685,0.0010799615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993986,0.00032064944,0.00001668863,0.00009332454,0.00006409265,0.00010661392],"domain_scores_gemma":[0.99921536,0.00056271534,0.00007961774,0.000037398706,0.00006693166,0.000037988913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008419854,0.00056651677,0.0007263608,0.00048242352,0.00038710376,0.00061465614,0.00073938235,0.0006687957,0.0010439195],"category_scores_gemma":[0.0020363978,0.0003767043,0.00026033854,0.00062928547,0.0006409245,0.00081113825,0.00053147064,0.00036668443,0.0001626503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023385753,0.00004647715,0.00054295803,0.00004620161,0.000025964302,0.00016169589,0.0000887364,0.9583703,0.0052154977,0.012463722,0.0007075018,0.022097085],"study_design_scores_gemma":[0.000017032498,0.000042115895,0.00015568706,0.0000032260023,0.000010497802,0.00003830405,0.000023999453,0.9919619,0.0011134067,0.006428464,0.00019972927,0.0000056326207],"about_ca_topic_score_codex":0.0016907791,"about_ca_topic_score_gemma":0.0022320356,"teacher_disagreement_score":0.0016907791,"about_ca_system_score_codex":0.00075012806,"about_ca_system_score_gemma":0.00046143518,"threshold_uncertainty_score":0.0054425597},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039374046,0.00086398737,0.95304155,0.00038559915,0.00006527415,0.000033640783,0.000051576942,0.000054747878,0.006129583],"genre_scores_gemma":[0.9106307,0.00091942184,0.08513791,0.00016442263,0.0000489042,0.00009323179,0.000059694125,0.000011977131,0.0029338717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994549,0.00021296195,0.000019356881,0.00006001176,0.00017830328,0.00007440475],"domain_scores_gemma":[0.99906844,0.00055874756,0.00010086455,0.00012358856,0.00012794984,0.000020492931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007315051,0.0004889272,0.00035566842,0.00026875304,0.0002870311,0.0007038333,0.0006595204,0.00069365767,0.00086267147],"category_scores_gemma":[0.0019633456,0.00017867956,0.0002906897,0.00050217035,0.0008571383,0.0011598605,0.00087078137,0.00062050985,0.0001535542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010780572,0.000057175956,0.0007338588,0.00018107754,0.00003205091,0.0004692908,0.00030514397,0.5199957,0.0138608115,0.42428154,0.001200277,0.038775325],"study_design_scores_gemma":[0.000013824112,0.00003661445,0.00010843993,0.000012443558,0.000009712129,0.00010825951,0.000019336938,0.9532865,0.0021472715,0.042882774,0.0013620665,0.000012713915],"about_ca_topic_score_codex":0.0010483764,"about_ca_topic_score_gemma":0.0011537683,"teacher_disagreement_score":0.0010483764,"about_ca_system_score_codex":0.0010306633,"about_ca_system_score_gemma":0.00055484235,"threshold_uncertainty_score":0.0074780583},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039275054,0.0003184342,0.9577402,0.00034075277,0.00003319458,0.000054626245,0.000012252315,0.00007325509,0.0021522501],"genre_scores_gemma":[0.90121585,0.00022119103,0.09733028,0.00007430504,0.000031020976,0.00009641001,0.000017978578,0.000020580133,0.0009925221],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900573,0.0005650362,0.000036379006,0.00009338773,0.00021422381,0.00008528144],"domain_scores_gemma":[0.9985682,0.00096960895,0.000151136,0.00012791321,0.00013308151,0.000050043833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022450704,0.00041807172,0.0004664128,0.0003217551,0.0004885782,0.0006210169,0.0009879576,0.00054128416,0.00067004777],"category_scores_gemma":[0.0051262523,0.00029128088,0.00036176987,0.00036966716,0.0011523833,0.0011582971,0.0010423249,0.0006770916,0.0001423531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017137927,0.00007119836,0.000587531,0.000118330165,0.000040095587,0.00012256233,0.00024757988,0.8471352,0.009018784,0.093995556,0.0009456352,0.047546115],"study_design_scores_gemma":[0.000008009108,0.000016061267,0.000051485633,0.0000021737164,0.000003503167,0.000018076675,0.000013630267,0.98833346,0.00046556507,0.010904708,0.00017983504,0.000003540441],"about_ca_topic_score_codex":0.00089846185,"about_ca_topic_score_gemma":0.0011295204,"teacher_disagreement_score":0.0022450704,"about_ca_system_score_codex":0.0011036667,"about_ca_system_score_gemma":0.0009892032,"threshold_uncertainty_score":0.011873186},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013120946,0.00072248565,0.9847921,0.000117202166,0.000025168114,0.000022939357,0.000015717469,0.00010199184,0.0010814024],"genre_scores_gemma":[0.7730131,0.0012191096,0.22144237,0.00007212925,0.00009681766,0.00021698218,0.00008623747,0.000080093756,0.003773087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989353,0.0005242598,0.000048126934,0.00010451352,0.00029621867,0.0000915494],"domain_scores_gemma":[0.99869066,0.0008308298,0.00018756402,0.00010974401,0.00014529447,0.0000360047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015764161,0.0009850026,0.000999099,0.0005603157,0.00042878356,0.0010124929,0.00081035023,0.0007940888,0.0008992656],"category_scores_gemma":[0.0033784634,0.00055242074,0.00042600074,0.0009832511,0.00095549296,0.001528836,0.0010894175,0.0006643631,0.00021370144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044469023,0.000031086925,0.0001526415,0.00005422266,0.000032793905,0.00003148821,0.00004993711,0.93936825,0.0022065365,0.020912137,0.00057962764,0.036536854],"study_design_scores_gemma":[0.000006795255,0.000027849783,0.00004436513,0.0000023644923,0.0000059988274,0.000015982647,0.0000070974593,0.9908585,0.0004315257,0.00825559,0.00033939388,0.0000044584604],"about_ca_topic_score_codex":0.00071992393,"about_ca_topic_score_gemma":0.0009573199,"teacher_disagreement_score":0.0015764161,"about_ca_system_score_codex":0.0007138477,"about_ca_system_score_gemma":0.00071386714,"threshold_uncertainty_score":0.008336961},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056506783,0.00075368385,0.9317638,0.00057082804,0.000057244008,0.000032521293,0.000079733385,0.00025547287,0.009979952],"genre_scores_gemma":[0.9334094,0.0008632537,0.062060717,0.00008086292,0.0000811918,0.000100514,0.00007879817,0.00004348031,0.0032817328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899715,0.00040561485,0.00003467646,0.000118181,0.0002946791,0.0001498234],"domain_scores_gemma":[0.99540675,0.0028039285,0.0006333471,0.0006602042,0.00041501227,0.00008088369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016127671,0.0005848006,0.0006254361,0.000758532,0.000427133,0.0009805574,0.00092336186,0.0008822271,0.0005677073],"category_scores_gemma":[0.006399317,0.00028852062,0.0003068899,0.0007648315,0.0017598631,0.001728092,0.001426743,0.0010451777,0.00025492354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087503584,0.000014425299,0.0001882082,0.000061761115,0.000018278099,0.00020101489,0.00013073056,0.73814833,0.008069612,0.23684153,0.00088862877,0.015349868],"study_design_scores_gemma":[0.0000065422587,0.00002196855,0.00004963946,0.000009806335,0.000005409868,0.000047972884,0.000014148985,0.9393067,0.0016433338,0.058052376,0.0008332424,0.000008882015],"about_ca_topic_score_codex":0.0017743895,"about_ca_topic_score_gemma":0.001137715,"teacher_disagreement_score":0.0017743895,"about_ca_system_score_codex":0.001076047,"about_ca_system_score_gemma":0.00084906036,"threshold_uncertainty_score":0.008529246},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37003458,0.0028682002,0.61255276,0.0004906898,0.000041974643,0.000069121845,0.00015058127,0.00040281,0.013389251],"genre_scores_gemma":[0.98915076,0.0008472615,0.00885502,0.000044647695,0.000038582064,0.000034989374,0.000055741642,0.000019177021,0.00095385173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888366,0.00049526215,0.000024825697,0.000081610815,0.0003417196,0.00017289439],"domain_scores_gemma":[0.9967906,0.0022596521,0.00030626715,0.000135256,0.00044647043,0.000061806364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018118583,0.0015059923,0.0009905084,0.0008070048,0.00051425764,0.001146853,0.00068551186,0.0006863045,0.0011775779],"category_scores_gemma":[0.0048081162,0.0002938039,0.0005077423,0.0010709281,0.0010369784,0.00089361257,0.0009576,0.00043424556,0.0002316016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006688906,0.000012586109,0.0006787975,0.000055962995,0.000048928585,0.000171827,0.00011329648,0.97566503,0.0032760785,0.0107758455,0.00024634594,0.008888416],"study_design_scores_gemma":[0.000004527937,0.000056254143,0.00036162266,0.000007223116,0.00002116957,0.00007140765,0.000028298557,0.99379796,0.00057345495,0.0048838737,0.00018509888,0.000009146422],"about_ca_topic_score_codex":0.0043068123,"about_ca_topic_score_gemma":0.0028142557,"teacher_disagreement_score":0.0043068123,"about_ca_system_score_codex":0.0016073762,"about_ca_system_score_gemma":0.00081617053,"threshold_uncertainty_score":0.011662364},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016475603,0.0005754613,0.98183274,0.000096807926,0.000019295558,0.000009790569,0.000009564318,0.000075581556,0.0009052086],"genre_scores_gemma":[0.8089471,0.0014605926,0.18786637,0.00005433349,0.00010179121,0.00006527503,0.000052461764,0.000030314743,0.001421685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940276,0.00019752895,0.000020548645,0.00011307695,0.00022325189,0.000042877975],"domain_scores_gemma":[0.9985353,0.00086066057,0.00024206887,0.00014357555,0.00019304235,0.00002529401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011403657,0.0005911416,0.0005768286,0.0006789329,0.00043405994,0.0006077761,0.00059761864,0.00086580735,0.0003759726],"category_scores_gemma":[0.005857236,0.00025461917,0.00021073573,0.001018634,0.00076351635,0.0011918973,0.0008704897,0.0005253076,0.00016987661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013213289,0.000042944095,0.002090067,0.00014260548,0.000044985412,0.00013322015,0.00028346968,0.7084804,0.017367058,0.034938067,0.0009586222,0.23538639],"study_design_scores_gemma":[0.000017488166,0.00008111331,0.0005736758,0.000021854246,0.000016457967,0.00012459366,0.000047768168,0.9750797,0.006581756,0.015589324,0.0018456992,0.000020411235],"about_ca_topic_score_codex":0.0019470378,"about_ca_topic_score_gemma":0.0014501819,"teacher_disagreement_score":0.0019470378,"about_ca_system_score_codex":0.00048158842,"about_ca_system_score_gemma":0.0007702117,"threshold_uncertainty_score":0.006030917},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020572504,0.00073675934,0.9759393,0.00034952187,0.00007177851,0.00009382606,0.0001041898,0.0001660974,0.0019660082],"genre_scores_gemma":[0.84845334,0.00089968386,0.14897335,0.00012232602,0.000069447,0.00012668213,0.00014609224,0.000033367272,0.0011757368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909747,0.00036702666,0.000059341965,0.000100859594,0.00031976143,0.00005550757],"domain_scores_gemma":[0.9972595,0.0017781935,0.00022753072,0.00039887044,0.00029915367,0.000036798057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015506919,0.00060158334,0.0006336681,0.0003396628,0.0005225121,0.0007877515,0.0007556609,0.0005051849,0.0012244945],"category_scores_gemma":[0.0074623246,0.00026608235,0.00017624868,0.00046434207,0.0010700291,0.0017363771,0.0008003169,0.00094252126,0.0002406011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003232866,0.00010251403,0.00053634576,0.00030465837,0.000028322622,0.0002008982,0.00027733404,0.59165704,0.02232283,0.23957571,0.0018967141,0.14277442],"study_design_scores_gemma":[0.00003470399,0.00014166716,0.00015719936,0.000035057892,0.000014736427,0.00010342147,0.000039595303,0.93743247,0.007869234,0.051625237,0.0025060473,0.000040542327],"about_ca_topic_score_codex":0.0008862102,"about_ca_topic_score_gemma":0.001194023,"teacher_disagreement_score":0.0015506919,"about_ca_system_score_codex":0.00095487596,"about_ca_system_score_gemma":0.0009799924,"threshold_uncertainty_score":0.0082009435},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004814516,0.00016516534,0.9933308,0.00007215388,0.00003066648,0.000050720526,0.00004361234,0.00011876677,0.0013736726],"genre_scores_gemma":[0.5840173,0.00087632536,0.40944368,0.00019455621,0.00011564389,0.0003738423,0.00020176021,0.000046798115,0.004730068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918073,0.00029337374,0.000045932484,0.00019195475,0.0002055087,0.00008253296],"domain_scores_gemma":[0.9993112,0.0002882247,0.00008844393,0.00010396602,0.0001782185,0.00002996101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007786315,0.0012880585,0.0009827745,0.00032270435,0.00030246083,0.0010072083,0.00087142753,0.0010344456,0.0014954852],"category_scores_gemma":[0.0017719446,0.00041141623,0.00051437406,0.0005419434,0.00052235526,0.0009275476,0.00070044975,0.00077095703,0.0007135315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026675488,0.00013924338,0.0006129707,0.0005473228,0.00019792306,0.00044747486,0.00031770294,0.7385231,0.057446215,0.054513548,0.0028105131,0.14417726],"study_design_scores_gemma":[0.00007139995,0.00027464397,0.00017302838,0.000022482724,0.000047259593,0.00028588483,0.00003278156,0.97732633,0.01225858,0.006124443,0.0033489226,0.00003418979],"about_ca_topic_score_codex":0.0009379037,"about_ca_topic_score_gemma":0.0015111695,"teacher_disagreement_score":0.0014954852,"about_ca_system_score_codex":0.00045133708,"about_ca_system_score_gemma":0.0009723637,"threshold_uncertainty_score":0.0050028563},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07795514,0.0025882346,0.89969647,0.0013585275,0.0000746591,0.00020352924,0.00058995595,0.00032880064,0.01720468],"genre_scores_gemma":[0.8528905,0.003894411,0.13504738,0.00029916875,0.00015407866,0.0008557709,0.00044167202,0.00018439058,0.006232718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729234,0.0012258079,0.00012498138,0.00027845326,0.00065789843,0.00042050562],"domain_scores_gemma":[0.9900433,0.007844657,0.0007524097,0.00043391943,0.000764635,0.00016109928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054755886,0.0016412946,0.001704509,0.0015103517,0.0008417147,0.0026089575,0.0014742491,0.0013732165,0.0025635299],"category_scores_gemma":[0.018643726,0.00085352705,0.0006800159,0.0013238613,0.0018910905,0.00281993,0.0020490931,0.0014809833,0.0008609963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021601187,0.00009565826,0.0003643758,0.00025502688,0.00005563782,0.00013019961,0.00044905176,0.7490203,0.0028020607,0.2109163,0.0029112976,0.03278406],"study_design_scores_gemma":[0.000082477476,0.00007180153,0.00023519187,0.00009360149,0.000026452395,0.000099985424,0.0001437503,0.8256272,0.002086491,0.1702589,0.0012320975,0.000042016003],"about_ca_topic_score_codex":0.0018887833,"about_ca_topic_score_gemma":0.0025307334,"teacher_disagreement_score":0.0054755886,"about_ca_system_score_codex":0.0027347277,"about_ca_system_score_gemma":0.0023085491,"threshold_uncertainty_score":0.028958082},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2640703,0.009385774,0.69041437,0.0011389407,0.00023301391,0.00010783958,0.0002430149,0.00038157744,0.03402511],"genre_scores_gemma":[0.98571646,0.0014461275,0.010732859,0.00008825974,0.00006111329,0.000038927337,0.0000262744,0.000012500715,0.0018774386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995233,0.00018098489,0.000013876308,0.000057965364,0.00014881123,0.00007517876],"domain_scores_gemma":[0.99845946,0.0009588961,0.00014565396,0.00017399245,0.0002148102,0.00004718565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070062233,0.00044561116,0.00046960634,0.0004073383,0.0004409857,0.0009656947,0.0004981789,0.0010048934,0.001027544],"category_scores_gemma":[0.003281545,0.00019277245,0.00023967591,0.00074020575,0.00070291356,0.0008212552,0.00059280737,0.00034501846,0.00025751343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113164904,0.00003287002,0.0012143827,0.00013734975,0.000028026496,0.00036438397,0.00021963294,0.8618589,0.005342688,0.09216269,0.001374525,0.03715134],"study_design_scores_gemma":[0.000017148986,0.00013779421,0.00053677027,0.000022789283,0.000024042933,0.00024345411,0.00011257552,0.95543265,0.0011938141,0.039157107,0.003095864,0.000025928543],"about_ca_topic_score_codex":0.0048035416,"about_ca_topic_score_gemma":0.0041700485,"teacher_disagreement_score":0.0048035416,"about_ca_system_score_codex":0.0008675511,"about_ca_system_score_gemma":0.00047815824,"threshold_uncertainty_score":0.0095511675},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057940306,0.00010660416,0.9936318,0.00003608314,0.000008655272,0.00000858446,0.000010480134,0.00017034549,0.00023354898],"genre_scores_gemma":[0.52291113,0.0003649479,0.47410285,0.00014162507,0.000054559165,0.00012780148,0.00010848419,0.000071854345,0.0021168145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998965,0.0005511399,0.000052502866,0.00013372752,0.00023342922,0.00006416041],"domain_scores_gemma":[0.99763095,0.00158264,0.00022817316,0.0001977009,0.00030743523,0.0000530911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001651908,0.0007122095,0.0010384737,0.00039679545,0.00030076256,0.0006371387,0.0011554704,0.00095110375,0.00065324164],"category_scores_gemma":[0.005312573,0.0005372019,0.0004598029,0.00053403835,0.0009149004,0.0014658985,0.0012291248,0.0008989996,0.00040519988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030527703,0.00006151144,0.0004641474,0.00013731349,0.000083172454,0.00009042579,0.000145109,0.8546065,0.008994331,0.0147409765,0.0009403131,0.11943097],"study_design_scores_gemma":[0.000010743341,0.0000261545,0.000055114986,0.0000032157745,0.000004975168,0.000039304177,0.000006536256,0.9945851,0.0022103477,0.0028244206,0.0002256058,0.000008482916],"about_ca_topic_score_codex":0.0011480778,"about_ca_topic_score_gemma":0.0008751829,"teacher_disagreement_score":0.001651908,"about_ca_system_score_codex":0.0003379717,"about_ca_system_score_gemma":0.00063776266,"threshold_uncertainty_score":0.008736253},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15970233,0.001317075,0.8327911,0.00031761747,0.00003765127,0.000034791592,0.000059112765,0.0001516805,0.0055886977],"genre_scores_gemma":[0.9770204,0.0006120643,0.019974582,0.000052669006,0.00005026013,0.000029716382,0.000025825035,0.000023869383,0.002210631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993364,0.00022240343,0.000025138539,0.00013070185,0.00018958861,0.00009574698],"domain_scores_gemma":[0.9987085,0.0007765577,0.00016289392,0.000104735016,0.00021490722,0.00003246037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068655045,0.00063575996,0.00057827303,0.00045797817,0.00045203805,0.0010424004,0.0006733673,0.0006857357,0.0005545475],"category_scores_gemma":[0.0033034363,0.00038564423,0.00022426364,0.0008805252,0.00090985623,0.0012394169,0.0006370686,0.0004554802,0.00020433012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013236607,0.000035254772,0.0013060798,0.000057044446,0.000026793778,0.0002893027,0.00012563387,0.95172477,0.0064455094,0.017746748,0.00039957368,0.0217109],"study_design_scores_gemma":[0.00000995606,0.000032352404,0.00019923653,0.0000037519476,0.000010888744,0.00008513682,0.00002748925,0.9932018,0.0012230367,0.0047839666,0.00041670582,0.000005694028],"about_ca_topic_score_codex":0.0028497402,"about_ca_topic_score_gemma":0.0017463346,"teacher_disagreement_score":0.0028497402,"about_ca_system_score_codex":0.0013379775,"about_ca_system_score_gemma":0.00047377642,"threshold_uncertainty_score":0.009707749},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025451567,0.0006137306,0.96893543,0.00035193507,0.00006181735,0.00010332278,0.000039082082,0.00013328757,0.004309793],"genre_scores_gemma":[0.8463295,0.001048237,0.14834009,0.00014080793,0.00020041605,0.00037672382,0.00007350253,0.000045195797,0.0034456486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951698,0.002669582,0.00015519881,0.00063405617,0.00084674044,0.0005246962],"domain_scores_gemma":[0.989813,0.0076963073,0.0009325397,0.00078680343,0.0005642794,0.00020710251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050586397,0.0016848857,0.0015366707,0.00083833997,0.000857696,0.002091159,0.0027140097,0.0022388264,0.002218522],"category_scores_gemma":[0.011462533,0.0006208532,0.0011483774,0.001390844,0.0016288031,0.0033301946,0.0020425012,0.0010044795,0.00040735948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031925997,0.00014792442,0.0013387564,0.00023545738,0.0001753046,0.0006990964,0.00023781182,0.793192,0.004575042,0.14839768,0.0020077615,0.04867384],"study_design_scores_gemma":[0.00005170569,0.00012111231,0.00008817371,0.000010417117,0.000043878663,0.0001765895,0.000033314052,0.9638143,0.0013369779,0.0333641,0.00094236055,0.000017012135],"about_ca_topic_score_codex":0.0010782604,"about_ca_topic_score_gemma":0.0008381547,"teacher_disagreement_score":0.0050586397,"about_ca_system_score_codex":0.0010319916,"about_ca_system_score_gemma":0.0012006069,"threshold_uncertainty_score":0.026753008},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047952,0.00019003023,0.9907416,0.00022900477,0.00003955129,0.000052901658,0.0000227046,0.000044869746,0.0038841104],"genre_scores_gemma":[0.7488861,0.000782228,0.23955618,0.00023830707,0.00016909787,0.0004278688,0.00008223319,0.000058065,0.0097998595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855906,0.00085178344,0.00004618934,0.00016543706,0.000262954,0.000114541246],"domain_scores_gemma":[0.99898773,0.0006389497,0.00010081293,0.00007197002,0.00012864644,0.00007181644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019367454,0.0010529261,0.00094759965,0.00070359115,0.00055158185,0.0013577362,0.0017351344,0.001305739,0.0026806886],"category_scores_gemma":[0.0028671124,0.00050279754,0.0007274713,0.00084499177,0.0016410485,0.0014524196,0.0012981565,0.001597059,0.00037435978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026467294,0.000034932364,0.00014496832,0.000041013758,0.0000294901,0.00007478045,0.000049818227,0.8675315,0.00066109013,0.122002184,0.0007580079,0.0086456165],"study_design_scores_gemma":[0.00000795605,0.000012080554,0.000020659483,0.0000033678787,0.0000035155786,0.000012564498,0.0000066177613,0.9728702,0.000080701306,0.026355227,0.0006238073,0.0000033648928],"about_ca_topic_score_codex":0.0033631634,"about_ca_topic_score_gemma":0.0027021489,"teacher_disagreement_score":0.0033631634,"about_ca_system_score_codex":0.0018129649,"about_ca_system_score_gemma":0.0013499549,"threshold_uncertainty_score":0.01315403},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061805346,0.000985081,0.9866658,0.00041635637,0.00003104462,0.00004351843,0.00004137031,0.00012979348,0.0055065285],"genre_scores_gemma":[0.60333896,0.0034083298,0.37665996,0.00040971127,0.00017758805,0.00076966645,0.00015721985,0.00023360903,0.014844963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990637,0.0005822911,0.00001907128,0.00008767184,0.00015771693,0.000089635614],"domain_scores_gemma":[0.9984535,0.0012916381,0.00009925113,0.000030163405,0.000086937274,0.000038549348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018141512,0.0013723216,0.0011067631,0.00060413877,0.00052846427,0.0016699122,0.00089861423,0.0012302416,0.0022585252],"category_scores_gemma":[0.0034980974,0.00082030677,0.0004970761,0.0014382333,0.0014371448,0.0013416831,0.001005985,0.0015656285,0.00048284538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025968959,0.000026261396,0.00008471625,0.00006137899,0.000016616614,0.000045881785,0.00004870843,0.9630696,0.00030831742,0.025493195,0.00087011926,0.009949207],"study_design_scores_gemma":[0.000006450989,0.000014414221,0.000017802413,0.000005977569,0.0000035254543,0.000008541642,0.000012760662,0.98434514,0.00012116521,0.014981282,0.0004789191,0.0000041023563],"about_ca_topic_score_codex":0.0037571678,"about_ca_topic_score_gemma":0.0036514977,"teacher_disagreement_score":0.0037571678,"about_ca_system_score_codex":0.0019282106,"about_ca_system_score_gemma":0.001474845,"threshold_uncertainty_score":0.013990223},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019669596,0.00079665123,0.97721213,0.00014457993,0.000025880503,0.000023138591,0.000007836741,0.00008377162,0.0020364632],"genre_scores_gemma":[0.87518334,0.0013728043,0.12147584,0.0001132582,0.00007627937,0.0000761166,0.00002218445,0.000017368508,0.0016627844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906784,0.00039218544,0.000032071835,0.000060730155,0.00038409134,0.0000630902],"domain_scores_gemma":[0.9984781,0.0009999955,0.00017040492,0.00014086235,0.00018951503,0.000021043294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00159673,0.00058287417,0.0004935509,0.0004838908,0.0002866564,0.0008884671,0.0005607471,0.0007082337,0.0006541356],"category_scores_gemma":[0.0037587069,0.0002530116,0.00045618173,0.00067217054,0.0011566344,0.0010481607,0.000841914,0.00085264916,0.00023008074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017563578,0.000060879604,0.00061542075,0.0002130857,0.00008857685,0.0002861054,0.00031500615,0.7211269,0.021253299,0.14822343,0.0007614032,0.10688024],"study_design_scores_gemma":[0.000016481636,0.00010722008,0.00014814458,0.000021152186,0.000020780588,0.000110506364,0.000021978227,0.952581,0.005091407,0.04083837,0.0010131755,0.000029870871],"about_ca_topic_score_codex":0.0005507118,"about_ca_topic_score_gemma":0.0005193123,"teacher_disagreement_score":0.00159673,"about_ca_system_score_codex":0.0006693636,"about_ca_system_score_gemma":0.00050246244,"threshold_uncertainty_score":0.008444428},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19639653,0.0010311882,0.79743016,0.00034069133,0.00004299802,0.000049099755,0.000029514622,0.00020017968,0.0044796043],"genre_scores_gemma":[0.9785729,0.0002979517,0.020230269,0.00005810361,0.000034634224,0.00005101073,0.00001316062,0.00001003333,0.00073205994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982461,0.0010375369,0.00004347476,0.00016668186,0.00034593555,0.00016034622],"domain_scores_gemma":[0.9935074,0.004838049,0.0005137819,0.0005286296,0.00049503526,0.000117125615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024622444,0.0006386422,0.00070040603,0.0005464309,0.00060273113,0.0008422851,0.000854583,0.00096489454,0.00042677237],"category_scores_gemma":[0.004282263,0.00029978808,0.0003557829,0.0009693538,0.0019459178,0.0011808826,0.0012560071,0.0004852506,0.00014147582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027690976,0.00006699254,0.0014382799,0.00012340571,0.0000752107,0.00067495473,0.0006023203,0.8673724,0.011666011,0.09462516,0.001056023,0.02202234],"study_design_scores_gemma":[0.00003553397,0.00015040199,0.00029075218,0.000009548064,0.000024237932,0.00016235292,0.000053589087,0.9624728,0.0023753552,0.033670872,0.0007371185,0.000017382834],"about_ca_topic_score_codex":0.00068890245,"about_ca_topic_score_gemma":0.0007198951,"teacher_disagreement_score":0.0024622444,"about_ca_system_score_codex":0.0007912283,"about_ca_system_score_gemma":0.00051083876,"threshold_uncertainty_score":0.013021708},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2812399,0.0022406606,0.65727246,0.0010485962,0.00015691704,0.00012442328,0.00032809505,0.00035318697,0.057235785],"genre_scores_gemma":[0.9837171,0.0008201887,0.01296555,0.00013534365,0.00006534145,0.00004921895,0.00003660814,0.000032961387,0.00217776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990569,0.00028309456,0.00002474589,0.000099849465,0.00019998243,0.00033547208],"domain_scores_gemma":[0.9958626,0.0030261283,0.00032748716,0.00021973223,0.00039162146,0.00017235865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012777403,0.0011961279,0.0009850467,0.00082014967,0.0012805241,0.0025009497,0.0010331883,0.0018030267,0.0041493718],"category_scores_gemma":[0.0046750456,0.00050245185,0.00058644474,0.0010933711,0.0023578731,0.0026665272,0.0015654818,0.0010839527,0.00061762106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003321206,0.00007383139,0.00092401664,0.00020897668,0.00006850602,0.00092662877,0.00017891367,0.53902847,0.016938237,0.4285723,0.0012090992,0.011538918],"study_design_scores_gemma":[0.00004839742,0.00011026505,0.00039966812,0.000053391726,0.000045557616,0.00079852284,0.000110399524,0.8215645,0.0054663126,0.17053047,0.00080404815,0.00006852888],"about_ca_topic_score_codex":0.0010092686,"about_ca_topic_score_gemma":0.001052729,"teacher_disagreement_score":0.0041493718,"about_ca_system_score_codex":0.001506977,"about_ca_system_score_gemma":0.0006871681,"threshold_uncertainty_score":0.013881028},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011689236,0.0008034235,0.9825562,0.00060041714,0.000030258547,0.000039927232,0.000047682253,0.00010533007,0.004127585],"genre_scores_gemma":[0.56946707,0.0024515653,0.4210191,0.00023371246,0.00015345462,0.00039675433,0.00018029146,0.00009455967,0.0060036005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943775,0.00029182716,0.00001523945,0.00005550191,0.000118013566,0.00008155997],"domain_scores_gemma":[0.9975926,0.001989481,0.00014447187,0.00009706673,0.00012832253,0.00004803878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002408506,0.0009170741,0.0010450727,0.0006000841,0.00042531293,0.0013415125,0.0010457649,0.001234019,0.001624346],"category_scores_gemma":[0.005371409,0.00046261703,0.00046443412,0.0011749611,0.0012010519,0.001710576,0.001158856,0.0017910525,0.00032670103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049629067,0.00005738261,0.00025783823,0.000059500948,0.00001919241,0.000033860615,0.000045398832,0.9087032,0.0003031157,0.06463978,0.0016430675,0.024188016],"study_design_scores_gemma":[0.000008045038,0.0000086590735,0.000021791819,0.00000475383,0.000002722937,0.000007057449,0.000008377612,0.98325276,0.00008463098,0.016306704,0.0002925534,0.000001986641],"about_ca_topic_score_codex":0.003180105,"about_ca_topic_score_gemma":0.002380325,"teacher_disagreement_score":0.003180105,"about_ca_system_score_codex":0.0018712478,"about_ca_system_score_gemma":0.0011493268,"threshold_uncertainty_score":0.013576865},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6352103,0.009933948,0.33221427,0.0018394979,0.00023323891,0.00007522043,0.00038465674,0.0006126811,0.019496193],"genre_scores_gemma":[0.9936464,0.0007718274,0.0046344018,0.000037914848,0.000032951608,0.000021701477,0.00006819845,0.00003479786,0.0007517898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707305,0.0015964154,0.00008788586,0.00026088243,0.0006911513,0.0002906493],"domain_scores_gemma":[0.97181064,0.022502908,0.0015472993,0.0015221968,0.0023635433,0.0002534569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049083624,0.0011633065,0.0011561386,0.0007739161,0.00055378646,0.0012994374,0.0009845791,0.0016323902,0.0015693726],"category_scores_gemma":[0.030716931,0.00039299595,0.00033750015,0.00064192887,0.0013984584,0.0018413767,0.0015280247,0.0008720729,0.00043720353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039587496,0.000027403144,0.0013980055,0.00012402599,0.00007173372,0.00015875832,0.00012200431,0.96258205,0.0044709966,0.019907083,0.00060440804,0.010137672],"study_design_scores_gemma":[0.000025338417,0.00017372864,0.00078351307,0.00003594518,0.000031887845,0.00020507831,0.000054405937,0.98319155,0.0042476864,0.010682579,0.0005387814,0.000029477602],"about_ca_topic_score_codex":0.0016215228,"about_ca_topic_score_gemma":0.00080295315,"teacher_disagreement_score":0.0049083624,"about_ca_system_score_codex":0.001420646,"about_ca_system_score_gemma":0.00050986826,"threshold_uncertainty_score":0.02595824},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67255646,0.0058259685,0.27970353,0.0016116695,0.00020102446,0.00007830286,0.00044142478,0.00036940785,0.039212238],"genre_scores_gemma":[0.99494606,0.0006897634,0.0030258223,0.00005946342,0.000045830337,0.000019510127,0.00006125336,0.000017868517,0.0011344198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984755,0.00065406994,0.000033775614,0.00015407747,0.00032412427,0.00035842706],"domain_scores_gemma":[0.99359846,0.004305086,0.00051695015,0.0003451607,0.0010876216,0.00014682778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025469868,0.0015840598,0.0010564247,0.0009305842,0.0008076505,0.0012210243,0.0011659941,0.0014402439,0.0012909262],"category_scores_gemma":[0.010263137,0.00038893535,0.00056827604,0.0011102279,0.0022051854,0.0016712508,0.00153424,0.00070958247,0.00034876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015036137,0.00002947668,0.0008239985,0.00005756599,0.000036251335,0.0001610552,0.00011142008,0.97512096,0.0020568133,0.016891267,0.00046142362,0.00409941],"study_design_scores_gemma":[0.000010871182,0.000076212615,0.00039123758,0.000017537544,0.000020375519,0.00008549461,0.00005817263,0.9931369,0.0007180792,0.005287186,0.00017838857,0.000019679273],"about_ca_topic_score_codex":0.00918331,"about_ca_topic_score_gemma":0.0064769094,"teacher_disagreement_score":0.00918331,"about_ca_system_score_codex":0.0022901958,"about_ca_system_score_gemma":0.001261202,"threshold_uncertainty_score":0.018259704},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007685904,0.0009940277,0.9878064,0.0002124664,0.00006166571,0.00003497082,0.000030559193,0.00020269278,0.0029712473],"genre_scores_gemma":[0.5065477,0.0034140337,0.48521042,0.000292264,0.00022008189,0.00025582808,0.00019747588,0.00008578857,0.0037763265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995757,0.00014186914,0.000019150255,0.000027375205,0.00019445307,0.00004138858],"domain_scores_gemma":[0.9995426,0.00020479258,0.000044441564,0.00007880878,0.000113463866,0.000015952266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057241425,0.00032706192,0.0002982583,0.00046669724,0.00036089512,0.00047753192,0.0007093935,0.0006277723,0.0010488639],"category_scores_gemma":[0.002048207,0.00014132414,0.0003525549,0.0007700194,0.00039726007,0.0010273786,0.000874559,0.0008374402,0.00026722535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020697445,0.000089707544,0.0006033309,0.00030254823,0.000070261536,0.00040548027,0.00029861592,0.27509418,0.04895677,0.35480756,0.0061117853,0.3130528],"study_design_scores_gemma":[0.00001608203,0.000059986993,0.00015004439,0.000030982195,0.000026863047,0.00014057093,0.000018683308,0.9207842,0.007447785,0.06376581,0.007537291,0.0000217438],"about_ca_topic_score_codex":0.001117552,"about_ca_topic_score_gemma":0.0012221867,"teacher_disagreement_score":0.001117552,"about_ca_system_score_codex":0.0005993225,"about_ca_system_score_gemma":0.0005256365,"threshold_uncertainty_score":0.0043483973},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19112897,0.0008927709,0.8003034,0.00047312438,0.00021593233,0.0001842929,0.000098323486,0.00061653054,0.006086714],"genre_scores_gemma":[0.9457847,0.0001521224,0.052293263,0.00009405477,0.000053888816,0.00013228251,0.00006776825,0.000012863643,0.0014089803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996013,0.0001370219,0.000021235619,0.00004536257,0.00012978009,0.00006537015],"domain_scores_gemma":[0.99945384,0.00015161595,0.00009729682,0.00007607192,0.0001750997,0.00004601836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008553532,0.00032949963,0.00046597686,0.0005497317,0.0009012707,0.0003280953,0.0007958781,0.00042430175,0.00075148325],"category_scores_gemma":[0.0014216135,0.00010194597,0.00027176956,0.0005271037,0.00028526408,0.00043582977,0.00044880068,0.00035407566,0.00014072518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015546182,0.0004927417,0.00358581,0.00029473501,0.00021119718,0.0013267503,0.0013899034,0.34172383,0.18013558,0.08821145,0.0123749,0.36869845],"study_design_scores_gemma":[0.000111610316,0.0004586858,0.00071284256,0.000013287977,0.000069639296,0.00034058755,0.00010786788,0.9660801,0.014059585,0.010026113,0.007985449,0.000034268654],"about_ca_topic_score_codex":0.0022350005,"about_ca_topic_score_gemma":0.0028294607,"teacher_disagreement_score":0.0022350005,"about_ca_system_score_codex":0.0008747773,"about_ca_system_score_gemma":0.0008447877,"threshold_uncertainty_score":0.006346941},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042113993,0.0024829425,0.93679994,0.00027793253,0.000061361534,0.00007699477,0.00024286966,0.0004663567,0.017477589],"genre_scores_gemma":[0.93278676,0.0034555576,0.05520012,0.00015603784,0.00010667325,0.00015232472,0.00028074146,0.00015251427,0.0077093286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866545,0.0003530617,0.000049240734,0.0001086414,0.000599214,0.00022441677],"domain_scores_gemma":[0.9983535,0.0008796438,0.00017034679,0.00020011874,0.00035343226,0.000043039083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020077608,0.0018513359,0.0019007472,0.0013095245,0.0006400363,0.0022097016,0.0015244583,0.001413624,0.0023175462],"category_scores_gemma":[0.0053239972,0.00062967755,0.0010799448,0.0014599451,0.0014187058,0.00240643,0.0015596302,0.001016861,0.0009011539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027689719,0.0000147916435,0.0002058747,0.00005433014,0.000017536788,0.000104794926,0.00006537616,0.96016055,0.001393907,0.03288257,0.00037648232,0.0046961214],"study_design_scores_gemma":[0.0000028272716,0.000015432941,0.000056146877,0.0000066884922,0.000006891443,0.00003649866,0.000011172675,0.99370944,0.00024787415,0.0056887874,0.00021042663,0.000007823773],"about_ca_topic_score_codex":0.00861422,"about_ca_topic_score_gemma":0.005282649,"teacher_disagreement_score":0.00861422,"about_ca_system_score_codex":0.0029579941,"about_ca_system_score_gemma":0.0018785442,"threshold_uncertainty_score":0.021461904},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21054792,0.00080800726,0.7808064,0.00042717773,0.00007976503,0.00009848239,0.00016484645,0.00016392652,0.006903457],"genre_scores_gemma":[0.96308357,0.0006397522,0.029696492,0.000062732,0.000050402774,0.00004785483,0.0000748618,0.000022046152,0.0063222265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911755,0.00034812928,0.00002249085,0.00015434499,0.00016312265,0.00019425462],"domain_scores_gemma":[0.99728,0.0019041662,0.00028486364,0.0001599944,0.00028253038,0.000088316345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012969138,0.0004882856,0.00077353674,0.000333534,0.00054201623,0.00095453893,0.0007734236,0.00088281615,0.0014228881],"category_scores_gemma":[0.0027256864,0.00034859363,0.0004010312,0.00054671144,0.0009876014,0.0013420008,0.0007207254,0.000500812,0.00029088763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003584611,0.000052803072,0.0006334173,0.00012236474,0.00004367004,0.00043859426,0.00019158919,0.90320486,0.0067659584,0.06992696,0.001142391,0.017118936],"study_design_scores_gemma":[0.000025792797,0.00005575874,0.00017326567,0.000003953986,0.000013727758,0.000086387096,0.000045811983,0.98735875,0.0014559831,0.010288586,0.00047817535,0.00001370352],"about_ca_topic_score_codex":0.004191596,"about_ca_topic_score_gemma":0.0034059032,"teacher_disagreement_score":0.004191596,"about_ca_system_score_codex":0.0013741566,"about_ca_system_score_gemma":0.0014976235,"threshold_uncertainty_score":0.009970248},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074431464,0.00046480176,0.9228842,0.00012056207,0.00001930585,0.000032718315,0.000022823187,0.00018878939,0.0018353269],"genre_scores_gemma":[0.79627794,0.00026463735,0.20171629,0.000054935805,0.000020058713,0.00004934431,0.000037629932,0.000024834417,0.0015543532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899775,0.00046962427,0.000042494295,0.00013077735,0.00024922058,0.00011011738],"domain_scores_gemma":[0.9989686,0.00052588596,0.00014033297,0.00016499948,0.00015245761,0.000047819532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010689038,0.0004290029,0.00063636224,0.00043539313,0.00046963902,0.00061093114,0.0006662396,0.0005654419,0.0005407584],"category_scores_gemma":[0.0023516337,0.0003164375,0.0001992496,0.00057912024,0.0005929922,0.0012275523,0.0007079796,0.0004937005,0.00020556142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028463462,0.000046236877,0.00078580313,0.00006652258,0.000021143765,0.00023805686,0.00022720249,0.8640791,0.0156160835,0.032892298,0.0006922428,0.085050605],"study_design_scores_gemma":[0.000020031135,0.00008885148,0.00012228351,0.0000052839796,0.000008405052,0.00008991255,0.000024012777,0.98359585,0.004412121,0.010830197,0.00079263485,0.000010373094],"about_ca_topic_score_codex":0.00094466546,"about_ca_topic_score_gemma":0.0011918753,"teacher_disagreement_score":0.0010689038,"about_ca_system_score_codex":0.00063042337,"about_ca_system_score_gemma":0.00057793804,"threshold_uncertainty_score":0.005652964},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07099739,0.0010207535,0.9209467,0.0003712574,0.000032456337,0.000046265588,0.000085000465,0.00014400072,0.00635628],"genre_scores_gemma":[0.94435936,0.0013099362,0.05010831,0.00011741424,0.0000758811,0.00010320508,0.00006969699,0.00009371852,0.0037625625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900454,0.00039598581,0.000025633857,0.00013553315,0.000265821,0.0001725412],"domain_scores_gemma":[0.9977465,0.0015193603,0.0001976495,0.000096061834,0.0003770098,0.00006325234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012856636,0.0010407473,0.0010213937,0.0007234718,0.0005654136,0.0013560602,0.0006330901,0.0008861312,0.0016048156],"category_scores_gemma":[0.0054843803,0.00065924664,0.00033176917,0.0010816127,0.0012024582,0.0015352161,0.0007917541,0.00061368383,0.00044467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009270751,0.000034707045,0.0005158098,0.000077686025,0.000026626705,0.0000909325,0.00008632831,0.9672021,0.002907488,0.017959885,0.00073032296,0.01027538],"study_design_scores_gemma":[0.000015621219,0.000029842111,0.0001283325,0.000007523144,0.000008890574,0.000032275417,0.000029650655,0.9909045,0.00054654555,0.007986179,0.00030312446,0.0000075037187],"about_ca_topic_score_codex":0.0031342146,"about_ca_topic_score_gemma":0.003015623,"teacher_disagreement_score":0.0031342146,"about_ca_system_score_codex":0.0016296345,"about_ca_system_score_gemma":0.0012825815,"threshold_uncertainty_score":0.011823893},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03417471,0.000988342,0.95832294,0.00039925473,0.00007130064,0.00003798358,0.00005972135,0.00008324234,0.005862491],"genre_scores_gemma":[0.9005654,0.0015693178,0.09129766,0.00013509445,0.00012399138,0.0002182747,0.00009106075,0.000094958945,0.005904196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999456,0.0002303171,0.00001789712,0.0000640846,0.00014400126,0.000087697066],"domain_scores_gemma":[0.99840873,0.0011914645,0.00015380702,0.00004874354,0.00015322622,0.000044180233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012459352,0.0010099101,0.0006453496,0.00062663684,0.0003228188,0.0009153948,0.00081479,0.0008192601,0.0010981032],"category_scores_gemma":[0.004215572,0.00036646044,0.00030991892,0.0012192654,0.0011222087,0.0015101604,0.001165978,0.0008439372,0.00017873324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017542045,0.000008336545,0.000063124775,0.000028321454,0.0000064334054,0.000016676817,0.000017180617,0.9695463,0.0005804578,0.024817422,0.00022385226,0.0046743955],"study_design_scores_gemma":[0.0000064832984,0.0000139411895,0.00002071421,0.0000031826614,0.000002926703,0.0000065106165,0.0000047182252,0.9873853,0.00021679787,0.012057871,0.00027869645,0.0000028096426],"about_ca_topic_score_codex":0.003067643,"about_ca_topic_score_gemma":0.0021219836,"teacher_disagreement_score":0.003067643,"about_ca_system_score_codex":0.0016988437,"about_ca_system_score_gemma":0.0011550274,"threshold_uncertainty_score":0.012326002},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41943917,0.0016315181,0.56544155,0.00038907756,0.000059468523,0.0000538258,0.00010162533,0.00026981605,0.012613995],"genre_scores_gemma":[0.99467176,0.00035789775,0.004403698,0.000026446134,0.000019462199,0.000015711685,0.000010318293,0.0000062910335,0.00048839604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916923,0.00023972591,0.000030320598,0.000096388896,0.00022677082,0.00023747253],"domain_scores_gemma":[0.99651474,0.0024367005,0.00046142522,0.00021425773,0.00030295367,0.00006997247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013317735,0.0011252285,0.0006570594,0.0006068904,0.00066967175,0.0012842751,0.00079383655,0.00082104036,0.0006151159],"category_scores_gemma":[0.005808119,0.00035542692,0.00045301532,0.0008920255,0.0012966068,0.0007934134,0.00093023235,0.00049698935,0.00013529934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001673896,0.00004566381,0.0016955433,0.000118121425,0.00006963311,0.0007609739,0.00024350491,0.94235545,0.007429866,0.030163223,0.00047342252,0.016477184],"study_design_scores_gemma":[0.000009346174,0.00008411709,0.00047448243,0.000009902134,0.000039152717,0.00021906341,0.000053847776,0.9892588,0.0012783988,0.008366963,0.00018908289,0.000016904347],"about_ca_topic_score_codex":0.004851207,"about_ca_topic_score_gemma":0.005562144,"teacher_disagreement_score":0.004851207,"about_ca_system_score_codex":0.0014813205,"about_ca_system_score_gemma":0.0012672318,"threshold_uncertainty_score":0.01074779},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03938115,0.00060825155,0.9437768,0.000733278,0.00009537875,0.00006930334,0.00013458438,0.00017651939,0.015024746],"genre_scores_gemma":[0.9116879,0.0012128369,0.077730715,0.00032344493,0.00017392407,0.00021568549,0.00014935737,0.00007207656,0.008434178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978422,0.0009518111,0.00010600721,0.0002777716,0.00052430533,0.00029785966],"domain_scores_gemma":[0.9961356,0.0020484799,0.00029986535,0.0009394129,0.0004001949,0.00017648193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021376978,0.00059673534,0.0010221978,0.0006663123,0.00078597263,0.0016146055,0.0010484763,0.0010810719,0.0019496202],"category_scores_gemma":[0.008577027,0.00036868663,0.00056368345,0.0007233812,0.0029680661,0.0033890137,0.004736221,0.0016276155,0.0005144052],"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.00009172358,0.000013496534,0.00015618441,0.00009807749,0.000013620756,0.00007996154,0.00015991963,0.04137702,0.0033844835,0.9352483,0.0007812752,0.018595945],"study_design_scores_gemma":[0.000030246412,0.000061320905,0.00009077564,0.0000513428,0.000016143362,0.000106894884,0.000053813,0.28375763,0.0041717766,0.7074788,0.0041590724,0.000022223665],"about_ca_topic_score_codex":0.0006138936,"about_ca_topic_score_gemma":0.00030903847,"teacher_disagreement_score":0.0021376978,"about_ca_system_score_codex":0.0013849424,"about_ca_system_score_gemma":0.0013144948,"threshold_uncertainty_score":0.011305332},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017963896,0.000452947,0.97590417,0.0001654095,0.000021506117,0.00004180644,0.000021575224,0.00015103511,0.005277685],"genre_scores_gemma":[0.94697315,0.00061977,0.050244313,0.00009238779,0.00005648899,0.00016198905,0.000049964347,0.00006062892,0.001741264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853563,0.0007707277,0.000029725605,0.00016670157,0.00039553188,0.00010160743],"domain_scores_gemma":[0.9977829,0.0014269459,0.00019392706,0.00014752518,0.00040585254,0.00004288407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025257824,0.001035693,0.00076535495,0.00041188716,0.00040286372,0.0011531009,0.0012145257,0.001014583,0.0013639755],"category_scores_gemma":[0.0073421006,0.00050742127,0.00034867553,0.0005099769,0.0010431708,0.0012129379,0.00103284,0.00083788246,0.00034236195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013039816,0.000010355331,0.00015876023,0.000034673165,0.000014374005,0.000036913054,0.000038076232,0.9819462,0.0013991421,0.010782114,0.00018211344,0.0053842035],"study_design_scores_gemma":[0.0000017714881,0.000011592065,0.00003517883,0.0000023791872,0.0000026056578,0.000008231373,0.000005140181,0.99683493,0.00022596504,0.0027212626,0.00014863293,0.0000023187292],"about_ca_topic_score_codex":0.0018948663,"about_ca_topic_score_gemma":0.0016531543,"teacher_disagreement_score":0.0025257824,"about_ca_system_score_codex":0.0014322925,"about_ca_system_score_gemma":0.0008889324,"threshold_uncertainty_score":0.0133577585},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7601839,0.0013395321,0.22925246,0.00035150436,0.000070398564,0.00009350927,0.00014960663,0.0006228856,0.007936189],"genre_scores_gemma":[0.9944689,0.00023310196,0.0044651506,0.000018495035,0.000012161563,0.000023182003,0.000047360427,0.000018922043,0.0007127762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934703,0.0002579539,0.000019631407,0.000055568795,0.00021240718,0.00010731902],"domain_scores_gemma":[0.99666446,0.0022330238,0.00021259148,0.00014403288,0.00069073634,0.00005508419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007710511,0.0004390324,0.0003998074,0.00055107626,0.00042995706,0.000720916,0.0003292412,0.0004039998,0.0018285435],"category_scores_gemma":[0.0035433115,0.00014155962,0.0002582311,0.00050102477,0.000493609,0.00076848775,0.00031407306,0.0003843408,0.00022629947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072847377,0.000085985805,0.0034971575,0.00022743343,0.00011787102,0.00027953854,0.0002501622,0.91026807,0.03324599,0.012205575,0.0010013247,0.03809249],"study_design_scores_gemma":[0.000009383157,0.0002608714,0.00092894724,0.0000074299683,0.00002270305,0.00006337978,0.00003724786,0.9928948,0.0044098045,0.0010237318,0.0003311265,0.000010423458],"about_ca_topic_score_codex":0.002430834,"about_ca_topic_score_gemma":0.0008263678,"teacher_disagreement_score":0.002430834,"about_ca_system_score_codex":0.00087972236,"about_ca_system_score_gemma":0.00042318873,"threshold_uncertainty_score":0.006382823},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075836577,0.00013421915,0.9900922,0.000078945755,0.000031419826,0.00003275915,0.0000157921,0.00007179775,0.0019590806],"genre_scores_gemma":[0.83894753,0.00039001822,0.15495698,0.00015092142,0.00009408848,0.00024931924,0.00004492789,0.00004044268,0.005125752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851865,0.00063067605,0.00005995863,0.00023024992,0.00041015362,0.00015027612],"domain_scores_gemma":[0.9980698,0.0010662734,0.0002102389,0.00026293026,0.00030366846,0.00008707692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019134451,0.0007385947,0.00070648,0.0006015922,0.0006044878,0.0009096612,0.002019477,0.00067911536,0.0015864515],"category_scores_gemma":[0.0041695037,0.00029738943,0.00041292465,0.0007797564,0.0010953012,0.0012880149,0.0011779206,0.0006446077,0.00034442852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014090835,0.000089046924,0.00045784417,0.000100793164,0.000054363158,0.00025523675,0.0003034255,0.5759796,0.008973571,0.3464503,0.0021525407,0.06504235],"study_design_scores_gemma":[0.000016701519,0.00007552402,0.000084316154,0.0000060088605,0.000013892656,0.0001170029,0.000020661895,0.9551086,0.0012636742,0.041117907,0.0021583568,0.00001732901],"about_ca_topic_score_codex":0.0012939502,"about_ca_topic_score_gemma":0.0011684641,"teacher_disagreement_score":0.002019477,"about_ca_system_score_codex":0.0009573623,"about_ca_system_score_gemma":0.0010668484,"threshold_uncertainty_score":0.010119379},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041730147,0.00063665357,0.951061,0.00013134845,0.000077016164,0.000056096644,0.000057515343,0.00018875793,0.006061492],"genre_scores_gemma":[0.70047206,0.0006235057,0.2937835,0.00010745984,0.00008530138,0.000084887666,0.00010522934,0.000015533498,0.004722575],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997445,0.000057403475,0.000010614768,0.000040635885,0.000109125845,0.000037707418],"domain_scores_gemma":[0.9997578,0.000059220238,0.000024420195,0.000050093848,0.00009784627,0.000010530315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022941898,0.00044603975,0.00029179984,0.00035466076,0.00045736696,0.0003445305,0.0004985361,0.00045900804,0.0009774221],"category_scores_gemma":[0.00077044143,0.00012281188,0.00022419608,0.00033896475,0.0002931612,0.00037705552,0.0003299891,0.00039631745,0.0004090986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005516411,0.00010587511,0.0015877669,0.00029829505,0.00009259742,0.00068308675,0.00059512764,0.12929212,0.22354269,0.13381909,0.0032362994,0.5061954],"study_design_scores_gemma":[0.0000544238,0.00046108142,0.00083398266,0.000059580827,0.00007555499,0.0010946319,0.00007962576,0.9031701,0.06522997,0.013909723,0.014965011,0.00006639025],"about_ca_topic_score_codex":0.0024555777,"about_ca_topic_score_gemma":0.0036679984,"teacher_disagreement_score":0.0024555777,"about_ca_system_score_codex":0.0004266304,"about_ca_system_score_gemma":0.00062286924,"threshold_uncertainty_score":0.004882574},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108349614,0.0017899849,0.8820094,0.00042524378,0.000026731615,0.000054209708,0.00017517777,0.0001929059,0.0069766985],"genre_scores_gemma":[0.9745427,0.0010439429,0.021089243,0.000047070906,0.000029334333,0.00007249433,0.00009462901,0.00004138828,0.0030392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996433,0.00011737095,0.000014114681,0.0000523619,0.00010210795,0.000070769405],"domain_scores_gemma":[0.997743,0.0015815011,0.00022936259,0.00008332439,0.00030635664,0.000056534795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012412339,0.000719738,0.00055169564,0.00079705386,0.0004346098,0.00060054584,0.00090881134,0.00063802593,0.0012522409],"category_scores_gemma":[0.0042202664,0.00031685806,0.00040629003,0.00060658425,0.00069625356,0.001438956,0.00057670486,0.0005439669,0.00020924608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005576138,0.000015662137,0.00066385494,0.0000709039,0.000019460804,0.00016216775,0.00011206933,0.95724624,0.003847475,0.027893411,0.00056424947,0.00934879],"study_design_scores_gemma":[0.0000013325773,0.000012619436,0.00011218603,0.0000044518783,0.000004582459,0.000045058187,0.000012644566,0.9958878,0.0003145669,0.0034466637,0.00015390386,0.000004207724],"about_ca_topic_score_codex":0.0033322924,"about_ca_topic_score_gemma":0.001684621,"teacher_disagreement_score":0.0033322924,"about_ca_system_score_codex":0.0014918311,"about_ca_system_score_gemma":0.0006251679,"threshold_uncertainty_score":0.010824025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080535896,0.0015427745,0.9068307,0.00024808763,0.00007834892,0.00005116742,0.000023038738,0.00035496603,0.010334984],"genre_scores_gemma":[0.91125363,0.00068244425,0.085439265,0.00014726794,0.000081888116,0.000079116726,0.00002033801,0.00001484546,0.0022812034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913245,0.00038293566,0.000023170283,0.00008702045,0.0002832642,0.00009120292],"domain_scores_gemma":[0.99879813,0.00062086753,0.00009951336,0.00023462612,0.00020489586,0.000041863237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010987049,0.000446711,0.0004515639,0.0004223124,0.00049801724,0.00073304004,0.0006027119,0.0006764573,0.0004955898],"category_scores_gemma":[0.0024157176,0.00021910023,0.00027890125,0.0005615946,0.000614621,0.001151659,0.0011201933,0.00050676876,0.00023768762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025482118,0.00011937256,0.001224411,0.00020477118,0.00014401566,0.0006657854,0.0006784648,0.5483627,0.05694712,0.23416793,0.002432929,0.15479766],"study_design_scores_gemma":[0.00003975595,0.00017255748,0.00022788104,0.000017852988,0.00004292613,0.00027687993,0.000039160946,0.9203128,0.0075900136,0.06457477,0.0066798585,0.000025530215],"about_ca_topic_score_codex":0.0005284648,"about_ca_topic_score_gemma":0.0007659361,"teacher_disagreement_score":0.0010987049,"about_ca_system_score_codex":0.0004846984,"about_ca_system_score_gemma":0.00040314876,"threshold_uncertainty_score":0.0058106184},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011506571,0.00036144396,0.9846299,0.00012068274,0.0000551362,0.000051942483,0.000021143838,0.000119886405,0.003133347],"genre_scores_gemma":[0.8108339,0.00059355877,0.18243395,0.00019085228,0.00015615611,0.00024244635,0.00007686988,0.00004948276,0.005422897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993819,0.0001916153,0.000029898902,0.00014693673,0.00018859546,0.000061055915],"domain_scores_gemma":[0.99962234,0.0001578634,0.00005100295,0.000051545427,0.00008480213,0.000032322107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064147473,0.0005213644,0.00081446674,0.0003879167,0.0004318017,0.00077634805,0.001296542,0.00069219334,0.0011571326],"category_scores_gemma":[0.0011356284,0.0002743516,0.00029797349,0.0005125825,0.00063289196,0.0011385368,0.00063444825,0.00056278205,0.00033818168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016506237,0.00014558843,0.0006154493,0.0002664593,0.00009216617,0.00032132547,0.00018877919,0.67437625,0.027320161,0.114815116,0.00385934,0.17783435],"study_design_scores_gemma":[0.000031072126,0.000093279916,0.00013118496,0.000008278195,0.000012324456,0.00011340592,0.00001642436,0.9732844,0.0016187476,0.022190863,0.0024867104,0.000013341963],"about_ca_topic_score_codex":0.00057185395,"about_ca_topic_score_gemma":0.00068988797,"teacher_disagreement_score":0.001296542,"about_ca_system_score_codex":0.00053390703,"about_ca_system_score_gemma":0.00064088544,"threshold_uncertainty_score":0.003873825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26216263,0.0070906244,0.6973656,0.00059585465,0.000094605006,0.000044742148,0.000074845644,0.00059987087,0.03197122],"genre_scores_gemma":[0.98074764,0.00095006684,0.017212335,0.000048835827,0.000035297784,0.000020313933,0.000014376259,0.00002034503,0.00095070223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890244,0.00038064783,0.000021675085,0.000074852425,0.00045836013,0.00016209856],"domain_scores_gemma":[0.99726105,0.0019351747,0.00019944618,0.00021112374,0.00033576635,0.000057427023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079342135,0.00045445474,0.00033661744,0.00065046677,0.00030376445,0.00087565166,0.00055709895,0.00054519554,0.0007808194],"category_scores_gemma":[0.0040745703,0.00020014434,0.0002238917,0.00068508874,0.001213611,0.0011134688,0.0007438148,0.0005264457,0.00014692612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012471632,0.00006146259,0.0012131847,0.00024018847,0.00004270813,0.00041491585,0.00023702212,0.7762136,0.050190896,0.12055387,0.00087843207,0.049828887],"study_design_scores_gemma":[0.0000082781435,0.00010674129,0.0006176805,0.0000276021,0.000022489712,0.00020054613,0.000049304712,0.9502882,0.014042806,0.032261334,0.0023525562,0.000022593027],"about_ca_topic_score_codex":0.0011224423,"about_ca_topic_score_gemma":0.0009977578,"teacher_disagreement_score":0.0011224423,"about_ca_system_score_codex":0.0010071608,"about_ca_system_score_gemma":0.0005555824,"threshold_uncertainty_score":0.00730747},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34236392,0.0018939915,0.6503272,0.0003576973,0.000036939495,0.000027187727,0.00003715356,0.0001996618,0.0047561866],"genre_scores_gemma":[0.98620564,0.00027643997,0.012915122,0.000025987945,0.00001457401,0.000017160412,0.00001391483,0.000010109314,0.0005210316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842477,0.00084079104,0.00006307455,0.0001554084,0.00039215753,0.00012374921],"domain_scores_gemma":[0.99355644,0.0047845677,0.0005205763,0.0005082617,0.00056813326,0.00006196384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024838757,0.0006702719,0.00069167337,0.0003731615,0.0003446322,0.0008104549,0.00065134396,0.0009202654,0.00038574278],"category_scores_gemma":[0.011583974,0.00025593638,0.00018992012,0.00052153884,0.0012805198,0.0012017448,0.00089096033,0.00047957577,0.00012503765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028870677,0.000035269662,0.0010127905,0.000058889185,0.000033313638,0.000104318344,0.00013948638,0.93767744,0.006835557,0.029385742,0.00023354137,0.024194868],"study_design_scores_gemma":[0.000016031683,0.000056417,0.0001911076,0.0000056284443,0.0000072544385,0.00004427123,0.000015200745,0.9916141,0.0021678999,0.0057839807,0.0000899643,0.000008046828],"about_ca_topic_score_codex":0.0012052836,"about_ca_topic_score_gemma":0.0006162863,"teacher_disagreement_score":0.0024838757,"about_ca_system_score_codex":0.0008231449,"about_ca_system_score_gemma":0.00046426503,"threshold_uncertainty_score":0.013136148},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085296206,0.004476807,0.88345253,0.0009496342,0.000053994474,0.000087128734,0.0002352339,0.00020905325,0.025239402],"genre_scores_gemma":[0.95849466,0.0030278412,0.03152591,0.00011941085,0.000111435285,0.00013601559,0.00017335745,0.00006521614,0.0063463254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895215,0.0004656321,0.000018668406,0.00009977789,0.00030317582,0.00016056847],"domain_scores_gemma":[0.9972184,0.0018771794,0.00032549494,0.00012965013,0.00038805095,0.000061286955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001560034,0.0012638861,0.0008267286,0.0008549466,0.00043668723,0.0014940795,0.0008711951,0.0012635901,0.0022114844],"category_scores_gemma":[0.003743638,0.000398989,0.0005070669,0.0019170895,0.0011890789,0.0010267813,0.0010365394,0.00073576946,0.00066021906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059690658,0.000036882135,0.00036547126,0.00007081204,0.00004281623,0.00007959737,0.00006342509,0.95628786,0.0020332928,0.023978034,0.0012238328,0.015758378],"study_design_scores_gemma":[0.0000055764426,0.000038870137,0.00020931594,0.000009218619,0.000008000694,0.000037481463,0.000024451763,0.98745906,0.0005903301,0.011113046,0.000495573,0.000009036693],"about_ca_topic_score_codex":0.003636614,"about_ca_topic_score_gemma":0.0025896353,"teacher_disagreement_score":0.003636614,"about_ca_system_score_codex":0.001969011,"about_ca_system_score_gemma":0.0009787327,"threshold_uncertainty_score":0.01428622},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06864973,0.00017262391,0.92985904,0.00006305255,0.000009081085,0.000025430334,0.000029558336,0.00003947395,0.0011518928],"genre_scores_gemma":[0.86126876,0.0002522305,0.13768873,0.000033334632,0.000019870859,0.00006696388,0.000043272295,0.000008793505,0.0006179751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952495,0.00020849971,0.000020082558,0.00005389574,0.00013483132,0.000057677833],"domain_scores_gemma":[0.9994838,0.00025803523,0.000106714164,0.000056463396,0.000078127676,0.000016689195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006146063,0.00047341213,0.0004214363,0.0001945067,0.00018836986,0.00038458526,0.00029794368,0.0003866354,0.00037420366],"category_scores_gemma":[0.0017203047,0.00019335249,0.000176591,0.00030216543,0.0005552592,0.0003511504,0.00030076713,0.0002964253,0.00013067244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030099857,0.00006607024,0.0013128177,0.00014926495,0.000047718087,0.00021535023,0.00027493847,0.8246544,0.046845127,0.051434588,0.00063578866,0.074062996],"study_design_scores_gemma":[0.000024435434,0.00011949625,0.00023621683,0.000012646434,0.000013298663,0.000077607896,0.000024115654,0.98412204,0.0068057603,0.007897016,0.00065805856,0.000009274548],"about_ca_topic_score_codex":0.0010229085,"about_ca_topic_score_gemma":0.0014110598,"teacher_disagreement_score":0.0010229085,"about_ca_system_score_codex":0.00040659035,"about_ca_system_score_gemma":0.00065050524,"threshold_uncertainty_score":0.00325042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060820386,0.002698403,0.933853,0.00021428987,0.000037179412,0.00003866526,0.000022961562,0.00007703657,0.002238121],"genre_scores_gemma":[0.9103128,0.0030625917,0.084041014,0.0001192057,0.00011380329,0.00009828137,0.000037326106,0.0000149879415,0.0021999262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993013,0.0002996664,0.000031633288,0.00007693252,0.00023750981,0.00005284193],"domain_scores_gemma":[0.998944,0.0007615053,0.0001277944,0.000060011298,0.0000893039,0.000017459486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011924101,0.0006966946,0.00063722435,0.0003742051,0.0003421543,0.00071772496,0.0005956699,0.0005708103,0.0004711214],"category_scores_gemma":[0.0019929288,0.00030743517,0.00034704708,0.00049820263,0.0006742445,0.00096111814,0.0006409734,0.00042828172,0.0001709184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025496836,0.00012533604,0.0014197722,0.00035161182,0.00016964725,0.0005040485,0.00041426538,0.77118176,0.03391297,0.084599316,0.00087353535,0.106192805],"study_design_scores_gemma":[0.000026383705,0.0002058644,0.00036367282,0.0000134656775,0.00005428821,0.0001828865,0.000029648387,0.9749819,0.0048755924,0.018009406,0.0012398966,0.000016954733],"about_ca_topic_score_codex":0.000492447,"about_ca_topic_score_gemma":0.0010120127,"teacher_disagreement_score":0.0011924101,"about_ca_system_score_codex":0.00062871625,"about_ca_system_score_gemma":0.00037105012,"threshold_uncertainty_score":0.006306112},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027624875,0.00065354066,0.96497524,0.00015067299,0.000025324236,0.00003780425,0.000038211445,0.00014082115,0.0063534724],"genre_scores_gemma":[0.9367967,0.0006408488,0.060834978,0.000058435962,0.000043580916,0.00008992689,0.000032236243,0.000017084576,0.0014862885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920195,0.00025644875,0.000035577417,0.00007570475,0.0003470382,0.00008335993],"domain_scores_gemma":[0.99876475,0.00078482716,0.00013720879,0.00010113379,0.00018446035,0.000027672972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011001204,0.0009297892,0.0007804445,0.0005932359,0.00039224533,0.0009142334,0.00078065495,0.00058197876,0.0010427769],"category_scores_gemma":[0.0031832915,0.00028669168,0.0003394935,0.0006622987,0.0006122975,0.0011671653,0.0007863835,0.0004216774,0.00023608358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009727221,0.00007975834,0.0007772169,0.0001869249,0.000074347634,0.00051561906,0.00031074462,0.66187364,0.023437247,0.2053272,0.001657367,0.10566257],"study_design_scores_gemma":[0.0000070109227,0.000059217236,0.00010599558,0.000007827137,0.000013792358,0.00024126681,0.000020800313,0.97900796,0.0018933566,0.018043898,0.00058550446,0.00001339789],"about_ca_topic_score_codex":0.0006200431,"about_ca_topic_score_gemma":0.0010848014,"teacher_disagreement_score":0.0011001204,"about_ca_system_score_codex":0.0008448891,"about_ca_system_score_gemma":0.0005905159,"threshold_uncertainty_score":0.006130159},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045252223,0.00076947105,0.9505966,0.00021920327,0.00006628143,0.000054365435,0.00006291644,0.00029194716,0.0026869683],"genre_scores_gemma":[0.91270435,0.000551745,0.08451698,0.00010729809,0.00004897552,0.000098674056,0.00011255333,0.000014489262,0.0018449601],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945754,0.00018968737,0.000031933,0.00009370569,0.00014641543,0.000080759026],"domain_scores_gemma":[0.999506,0.00016779023,0.000072511924,0.00007245511,0.00014979938,0.000031371732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006796887,0.00061128294,0.0004917718,0.00034811092,0.00043668746,0.00048009376,0.0010134982,0.00036155144,0.0007210098],"category_scores_gemma":[0.0013854093,0.00016107452,0.00028326776,0.00065796275,0.00041958332,0.00071654096,0.0009292313,0.0003895907,0.00022809854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008254306,0.00016876702,0.0030854477,0.0005807419,0.00018948746,0.0011088707,0.00081155385,0.35268483,0.11178641,0.103937864,0.0067628752,0.4180577],"study_design_scores_gemma":[0.000098089695,0.00039951247,0.00052417506,0.000021302729,0.000090085065,0.000622549,0.00006290193,0.963199,0.012002418,0.016909212,0.0060281483,0.000042677984],"about_ca_topic_score_codex":0.0007367023,"about_ca_topic_score_gemma":0.0011783278,"teacher_disagreement_score":0.0010134982,"about_ca_system_score_codex":0.0003924724,"about_ca_system_score_gemma":0.0005478092,"threshold_uncertainty_score":0.0035945773},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07798395,0.0095974095,0.87957186,0.0021118096,0.00040010206,0.0001475657,0.0001901234,0.0005050048,0.029492239],"genre_scores_gemma":[0.9187344,0.0050763073,0.07171245,0.00021543288,0.0001617505,0.00015403697,0.00018612239,0.000050468137,0.0037090264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899524,0.000342296,0.00003783049,0.00006640211,0.00045654416,0.00010164092],"domain_scores_gemma":[0.9961618,0.002051619,0.00040462686,0.0003076425,0.000997319,0.0000770136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013968905,0.00037243738,0.00034494084,0.0009668363,0.00042507684,0.0012768077,0.0006788724,0.0006423735,0.001915662],"category_scores_gemma":[0.0075408644,0.00012559965,0.00015214164,0.0018875926,0.0009933709,0.0016066793,0.0006883728,0.00064268673,0.00032101915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024966817,0.000096076175,0.0033361265,0.00036662148,0.000046822403,0.000254362,0.0003206657,0.39093918,0.014211709,0.29022494,0.007965914,0.2919879],"study_design_scores_gemma":[0.000021175414,0.00024834,0.0012279403,0.00009878942,0.000023265295,0.0002149263,0.0001695445,0.9050709,0.005242033,0.07365519,0.013991812,0.000036041656],"about_ca_topic_score_codex":0.0037603925,"about_ca_topic_score_gemma":0.0033072678,"teacher_disagreement_score":0.0037603925,"about_ca_system_score_codex":0.0014668229,"about_ca_system_score_gemma":0.0013185147,"threshold_uncertainty_score":0.010642588},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14673269,0.0011911858,0.8432435,0.0004086018,0.00006225387,0.00007946924,0.00009533444,0.00044667674,0.0077403495],"genre_scores_gemma":[0.9054572,0.00044801983,0.09242684,0.000028996503,0.000016328011,0.00004698202,0.000045548175,0.000023936731,0.0015063114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901736,0.0004900094,0.000046067842,0.00015578444,0.00016138419,0.00012931893],"domain_scores_gemma":[0.99911803,0.00047137297,0.00020136805,0.00008046088,0.00009944769,0.000029296209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013642847,0.0008028192,0.00067124714,0.00064634957,0.0004848673,0.0009889978,0.00077798957,0.0011038634,0.0007556828],"category_scores_gemma":[0.0037553993,0.00054392155,0.0002716789,0.0009784568,0.0008007593,0.0013445364,0.0006169301,0.000336629,0.0003204861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116453724,0.000025666139,0.0004985763,0.00004475951,0.00001070132,0.00016622184,0.00007843246,0.9541169,0.0035829386,0.010882356,0.0006367202,0.029840361],"study_design_scores_gemma":[0.000029900866,0.00008068953,0.0002601788,0.000008184957,0.000011095896,0.00008898853,0.00007274928,0.98744375,0.0027237942,0.008429364,0.0008362266,0.000015075559],"about_ca_topic_score_codex":0.0035059315,"about_ca_topic_score_gemma":0.0032552148,"teacher_disagreement_score":0.0035059315,"about_ca_system_score_codex":0.0011277368,"about_ca_system_score_gemma":0.00071096775,"threshold_uncertainty_score":0.008182347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11699604,0.00051328156,0.8764599,0.00018664829,0.00006281027,0.00010796369,0.000074830066,0.0003323422,0.0052662063],"genre_scores_gemma":[0.8464306,0.00027433372,0.14887442,0.00014402153,0.000039916707,0.0001621059,0.00007309055,0.000013737238,0.003987727],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940014,0.00017356512,0.000034404933,0.0001174631,0.00020452861,0.00006984732],"domain_scores_gemma":[0.99934584,0.00018060021,0.00008550147,0.0002101338,0.00012629227,0.00005164797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072644005,0.00038992267,0.0005405729,0.00031236946,0.00040642606,0.0004995524,0.0012007207,0.0006203892,0.0009980258],"category_scores_gemma":[0.0008985004,0.00020438389,0.0003107056,0.00035310804,0.0007626597,0.0011881964,0.0010588756,0.00036198547,0.00030614441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009934108,0.00029138091,0.0016137194,0.00044720116,0.00018984673,0.001343533,0.0011654802,0.24645886,0.26240197,0.22509572,0.003924814,0.25607407],"study_design_scores_gemma":[0.00010619523,0.00059553055,0.00039844657,0.000020114094,0.00007843657,0.0011519147,0.00008247376,0.93042225,0.038844604,0.019060582,0.009167925,0.00007162902],"about_ca_topic_score_codex":0.0004786786,"about_ca_topic_score_gemma":0.0006191384,"teacher_disagreement_score":0.0012007207,"about_ca_system_score_codex":0.0003417758,"about_ca_system_score_gemma":0.0005560902,"threshold_uncertainty_score":0.003841877},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35224664,0.00060566416,0.6411149,0.00021137983,0.000032012278,0.000074255375,0.0000536515,0.00015167843,0.005509859],"genre_scores_gemma":[0.9872227,0.000184106,0.011901422,0.000024267285,0.000018587398,0.000029451872,0.000009306112,0.0000044810413,0.00060560467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988147,0.00062855124,0.000039971805,0.00010895244,0.00025403884,0.00015372143],"domain_scores_gemma":[0.997743,0.0013898317,0.00040633048,0.0002029617,0.00019836091,0.00005958067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016896824,0.00074124837,0.00065852643,0.0004188973,0.0004939213,0.0007944192,0.0006409462,0.0007107374,0.00039979463],"category_scores_gemma":[0.002166606,0.00034250252,0.0006709085,0.0005206307,0.0013960127,0.0008203338,0.0007808387,0.00028099323,0.00015192333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004142281,0.00007459893,0.0018012162,0.00015660177,0.00012972535,0.0020033102,0.0005067208,0.8920937,0.02838652,0.05840202,0.0005495688,0.015481755],"study_design_scores_gemma":[0.00003372718,0.00018396557,0.00035616028,0.00000764832,0.000041793493,0.00029320703,0.000052568274,0.98606527,0.0037359872,0.008970333,0.00024040337,0.000019091693],"about_ca_topic_score_codex":0.0011766225,"about_ca_topic_score_gemma":0.0010064121,"teacher_disagreement_score":0.0016896824,"about_ca_system_score_codex":0.00048645752,"about_ca_system_score_gemma":0.000435708,"threshold_uncertainty_score":0.008936048},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02747655,0.00031036808,0.97009844,0.00008139076,0.000020686024,0.000051588886,0.000029107137,0.00023137519,0.001700462],"genre_scores_gemma":[0.8668675,0.0003272818,0.13109586,0.00011303946,0.000048469014,0.00009667468,0.000049064303,0.00004781182,0.001354353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991757,0.00029002628,0.000042176584,0.00012957894,0.00018742244,0.00017504762],"domain_scores_gemma":[0.9989417,0.00043904662,0.00019597217,0.00013434845,0.00023756771,0.00005136131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009585853,0.00068934937,0.0006022752,0.000511885,0.00043299064,0.00097489,0.0010411711,0.00045532177,0.0013628152],"category_scores_gemma":[0.0016906979,0.00041141352,0.00034930572,0.0004784304,0.000552816,0.0012876636,0.0007467705,0.00062064617,0.0002622808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002558561,0.000100564976,0.001142196,0.00024807977,0.00014117917,0.00022401071,0.00025289893,0.81113845,0.032991387,0.034304317,0.0014784646,0.11772257],"study_design_scores_gemma":[0.00005077981,0.00021521025,0.0003928595,0.000014813325,0.000056958947,0.00013918307,0.00006106113,0.97177505,0.010601807,0.014745818,0.0019231989,0.0000232498],"about_ca_topic_score_codex":0.0008485476,"about_ca_topic_score_gemma":0.0011313505,"teacher_disagreement_score":0.0013628152,"about_ca_system_score_codex":0.0007673896,"about_ca_system_score_gemma":0.0006419078,"threshold_uncertainty_score":0.0055678487},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09046292,0.0016272127,0.8907765,0.00079334993,0.00006386949,0.000052366937,0.00017402406,0.00015608687,0.01589369],"genre_scores_gemma":[0.9743258,0.0013281868,0.021272853,0.000117046475,0.00011735687,0.00011230216,0.000089620175,0.00006621361,0.0025707113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980108,0.0008968281,0.00006948988,0.00018894678,0.00051951525,0.0003144067],"domain_scores_gemma":[0.98748034,0.010517317,0.0008803514,0.00030718945,0.00065814465,0.00015664197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027270566,0.0010362185,0.0011734846,0.0009050795,0.00062720274,0.001354112,0.0009108165,0.0009115822,0.0024154466],"category_scores_gemma":[0.015002686,0.00048205067,0.00037872704,0.0014702542,0.0024869246,0.0017671839,0.0013809359,0.0011288825,0.0002709386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010188152,0.00003584002,0.0005276891,0.00012843522,0.00003061814,0.0001938177,0.00016544166,0.8291913,0.0025833466,0.15644516,0.0010651042,0.009531244],"study_design_scores_gemma":[0.00001702707,0.00002669915,0.00022929709,0.000020018875,0.00001302217,0.00007632009,0.00003539411,0.9395737,0.0006432532,0.05895455,0.00039595057,0.0000146830835],"about_ca_topic_score_codex":0.0017023828,"about_ca_topic_score_gemma":0.0011422085,"teacher_disagreement_score":0.0027270566,"about_ca_system_score_codex":0.0022268943,"about_ca_system_score_gemma":0.0009857655,"threshold_uncertainty_score":0.01615727},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28797463,0.0019426462,0.69610393,0.0016330165,0.00012345238,0.00007912918,0.00030663874,0.00021252056,0.011624007],"genre_scores_gemma":[0.96353966,0.0009876124,0.031899862,0.000115885705,0.00007799424,0.000078605655,0.00010448275,0.000033962013,0.0031619994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922764,0.0002662795,0.000030075415,0.000090854104,0.00021247844,0.0001726968],"domain_scores_gemma":[0.9943071,0.0045402134,0.00043249087,0.00024842212,0.00037444013,0.0000973026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014622291,0.0006508912,0.0007292183,0.00089033024,0.00056700973,0.0011757257,0.0007193132,0.0008883757,0.0012790699],"category_scores_gemma":[0.006923803,0.00033893887,0.00031218902,0.0008213385,0.0018687779,0.0018816127,0.0012290762,0.0009895684,0.00018378353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026939946,0.000047554822,0.00044939,0.00013842985,0.000028831028,0.0002742506,0.0002452723,0.59154844,0.0067324983,0.38519338,0.0013752029,0.013697304],"study_design_scores_gemma":[0.000034432913,0.000043922544,0.0001710416,0.000028916773,0.000014113864,0.0000735553,0.00005127261,0.87856466,0.002071672,0.118142,0.0007800608,0.000024381248],"about_ca_topic_score_codex":0.0020563938,"about_ca_topic_score_gemma":0.0019169087,"teacher_disagreement_score":0.0020563938,"about_ca_system_score_codex":0.0017278716,"about_ca_system_score_gemma":0.0013814304,"threshold_uncertainty_score":0.012536585},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01298892,0.0011748323,0.9809996,0.00009893405,0.000049453793,0.000029405433,0.000064903266,0.00020583044,0.0043881],"genre_scores_gemma":[0.81035393,0.0038089375,0.18182693,0.00013477416,0.00013445386,0.0001956514,0.00019633232,0.000098927834,0.0032500247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829906,0.00057813345,0.00007805858,0.00016086324,0.0006650849,0.00021873957],"domain_scores_gemma":[0.99532,0.003040749,0.00040199314,0.0004537221,0.0007139951,0.00006950507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003370812,0.001572111,0.0009278366,0.0010319488,0.00042698949,0.0017692534,0.0018568372,0.0012835261,0.0015587326],"category_scores_gemma":[0.014550423,0.0004075558,0.00077889167,0.0011242764,0.0013181871,0.002633517,0.0012659583,0.0019609604,0.00075441465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063098996,0.000015945041,0.0003080763,0.00008866356,0.00001981805,0.00009611864,0.000111256755,0.9349106,0.0018453624,0.04719672,0.00053773884,0.01480658],"study_design_scores_gemma":[0.0000020309308,0.000017806038,0.000059207996,0.000013273629,0.0000049321297,0.000057892565,0.000012546778,0.99379975,0.00043697061,0.005199806,0.00038786104,0.0000079751635],"about_ca_topic_score_codex":0.0027495958,"about_ca_topic_score_gemma":0.0017379441,"teacher_disagreement_score":0.003370812,"about_ca_system_score_codex":0.0018692706,"about_ca_system_score_gemma":0.0008881709,"threshold_uncertainty_score":0.017826736},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.283303,0.0018801609,0.70231944,0.00034506174,0.00005567493,0.000039343002,0.00010632797,0.00033856308,0.01161247],"genre_scores_gemma":[0.9716859,0.00046877857,0.026170881,0.000047107897,0.000023002736,0.000037915914,0.0000637509,0.00003036486,0.0014722904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989525,0.00028845167,0.000026165711,0.00006860953,0.00055912865,0.0001051216],"domain_scores_gemma":[0.9966331,0.0020010911,0.00025152476,0.00032539415,0.0007347845,0.000054075103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017151403,0.0007024608,0.00063142634,0.0007192084,0.00045130934,0.00061546895,0.0007396198,0.00085868983,0.0009508419],"category_scores_gemma":[0.0073273587,0.00025438017,0.00030667052,0.00066121266,0.0011113669,0.0011082496,0.0006676017,0.0005136646,0.00022643566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004272813,0.000012468271,0.00045536223,0.000043277338,0.000013206649,0.00008773098,0.000085553664,0.9618142,0.0030398765,0.027154723,0.00025928198,0.006991486],"study_design_scores_gemma":[0.0000033083768,0.000011787166,0.000118902295,0.0000053186764,0.000002598204,0.000029512084,0.000009024217,0.9945192,0.00045947032,0.0047499295,0.000086066146,0.0000050232943],"about_ca_topic_score_codex":0.0036868227,"about_ca_topic_score_gemma":0.0025304265,"teacher_disagreement_score":0.0036868227,"about_ca_system_score_codex":0.001679929,"about_ca_system_score_gemma":0.0010514215,"threshold_uncertainty_score":0.012188792},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006745603,0.0009317209,0.9853365,0.00021152425,0.000038128994,0.00002594096,0.00007428861,0.0003352088,0.0063011535],"genre_scores_gemma":[0.69022936,0.004282258,0.29083347,0.0003325487,0.00019316537,0.00023563228,0.00025676034,0.00008973965,0.013547066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954957,0.00020216942,0.000018425044,0.00009128974,0.00009702444,0.000041538],"domain_scores_gemma":[0.99969745,0.0001328467,0.000034462297,0.00005115234,0.000072276904,0.00001191752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044968264,0.0007257675,0.00056773896,0.00032237134,0.0002876664,0.00074422365,0.00047256448,0.0005804847,0.0027225825],"category_scores_gemma":[0.0010189645,0.00025891597,0.0002653317,0.0006694889,0.00040261014,0.0008424633,0.0006245887,0.0005395259,0.0011485284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002118159,0.000048332313,0.00047178147,0.00027641156,0.00007687203,0.0002598006,0.0001477742,0.53331864,0.037828185,0.11802849,0.0058994065,0.30343255],"study_design_scores_gemma":[0.00009354841,0.00019254218,0.0002737213,0.000055831762,0.00006102523,0.00042468874,0.000068553316,0.90046453,0.018539403,0.05910019,0.020681214,0.000044625216],"about_ca_topic_score_codex":0.00056287914,"about_ca_topic_score_gemma":0.0008655833,"teacher_disagreement_score":0.0027225825,"about_ca_system_score_codex":0.00043773671,"about_ca_system_score_gemma":0.0003958113,"threshold_uncertainty_score":0.009107947},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034781467,0.0024796983,0.957169,0.00073400786,0.00011499134,0.0000901521,0.00004925438,0.00014818135,0.0044331485],"genre_scores_gemma":[0.9163363,0.0055451375,0.073241346,0.00034673905,0.0003609472,0.00070747983,0.00010009864,0.000098935845,0.0032630265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701786,0.0012632274,0.00012345974,0.00027014222,0.0011108622,0.00021453646],"domain_scores_gemma":[0.9855036,0.010670058,0.0016066682,0.0006553083,0.0013846159,0.00017965803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050291466,0.0010072629,0.0013349691,0.0010290409,0.0008305645,0.001557106,0.002214621,0.0015509946,0.0007910768],"category_scores_gemma":[0.022405578,0.0005226317,0.00062876125,0.0022180048,0.0025338999,0.0025683676,0.0018910753,0.001325078,0.00025439713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007264945,0.00008035551,0.0016446798,0.000311639,0.00006358323,0.00047601483,0.00070638745,0.6271047,0.00431869,0.34340394,0.0021272202,0.019690197],"study_design_scores_gemma":[0.000007842614,0.00003767741,0.00014767124,0.000018610412,0.00001971193,0.00018062336,0.000062000465,0.9513547,0.00083326467,0.046343293,0.0009731665,0.000021412878],"about_ca_topic_score_codex":0.0014376568,"about_ca_topic_score_gemma":0.0008649514,"teacher_disagreement_score":0.0050291466,"about_ca_system_score_codex":0.0015594609,"about_ca_system_score_gemma":0.0009193023,"threshold_uncertainty_score":0.026596963},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012247561,0.0004965707,0.9805757,0.00014827133,0.00010928787,0.0000415952,0.00003653668,0.00022631758,0.006118255],"genre_scores_gemma":[0.6810358,0.0011454346,0.3075535,0.00025068398,0.0003167317,0.0002150952,0.00022297208,0.00006631894,0.0091935005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887174,0.00034685718,0.00004053101,0.00017013558,0.00048372318,0.000087080756],"domain_scores_gemma":[0.99894446,0.00041149062,0.0001178539,0.00024124095,0.00024750057,0.000037529957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007360805,0.00055767194,0.00053426676,0.00040557844,0.0003235947,0.00085058075,0.00062863244,0.0007947425,0.0016246383],"category_scores_gemma":[0.0021210436,0.00019033981,0.00031820245,0.0009807611,0.0005934912,0.0010269138,0.00083104504,0.00085980416,0.00067347864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005413131,0.0001236062,0.0008260977,0.00032223604,0.00007227895,0.00036841494,0.00017506377,0.3196187,0.06476573,0.29719064,0.0038851856,0.31211066],"study_design_scores_gemma":[0.00005581157,0.00028441634,0.00019250705,0.000033839744,0.000019135383,0.00043603833,0.000022948183,0.9322912,0.018583344,0.032430954,0.015623765,0.000026109657],"about_ca_topic_score_codex":0.00040804798,"about_ca_topic_score_gemma":0.00038608495,"teacher_disagreement_score":0.0016246383,"about_ca_system_score_codex":0.0005904448,"about_ca_system_score_gemma":0.00066442485,"threshold_uncertainty_score":0.00543499},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18319426,0.000640055,0.80172443,0.0004256387,0.00003938245,0.00007945709,0.00010544438,0.00022287646,0.013568482],"genre_scores_gemma":[0.9915684,0.00012526698,0.007550363,0.000029591536,0.000017213035,0.00003209409,0.000018949206,0.000013509274,0.00064451294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903333,0.00039341048,0.000023970828,0.000114476265,0.00027352094,0.00016129906],"domain_scores_gemma":[0.9968991,0.0018702635,0.00037069555,0.0002406536,0.00054210174,0.000077216784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017147273,0.000836488,0.0009504039,0.00034235202,0.00043143405,0.0012156982,0.00073270896,0.00086322526,0.0019265292],"category_scores_gemma":[0.005751149,0.0003039516,0.00038147424,0.00044526084,0.0010127492,0.0008464576,0.0009402838,0.00056156167,0.00027107474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012989345,0.000023882803,0.0002754348,0.000051781994,0.000027384745,0.000062991305,0.000054353248,0.9779324,0.003978496,0.0103956,0.00033251834,0.006735311],"study_design_scores_gemma":[0.000009618817,0.00005422308,0.00014148289,0.000004307278,0.000007083251,0.000031801985,0.0000102999775,0.99743325,0.00040900504,0.001825035,0.00006790501,0.0000060957],"about_ca_topic_score_codex":0.0024853,"about_ca_topic_score_gemma":0.0013617908,"teacher_disagreement_score":0.0024853,"about_ca_system_score_codex":0.0012453147,"about_ca_system_score_gemma":0.0010047441,"threshold_uncertainty_score":0.0090684295},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015260337,0.0016285019,0.9704771,0.00063061155,0.000084787396,0.000085530504,0.000084269224,0.00024474433,0.011504182],"genre_scores_gemma":[0.7717587,0.0035521467,0.20654474,0.0004798932,0.00047161538,0.00044797582,0.0002013916,0.00015221928,0.016391369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998461,0.0005761735,0.000051493796,0.00020490406,0.0005444906,0.00016182262],"domain_scores_gemma":[0.9970757,0.0021231938,0.0002204405,0.0002713521,0.00026663532,0.000042681637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001415893,0.0012551934,0.0008825555,0.0006075053,0.00073898287,0.0021244325,0.0012742401,0.0011896606,0.004676093],"category_scores_gemma":[0.0057811923,0.00051172863,0.00074434205,0.000978083,0.0013386193,0.0037328056,0.0016683779,0.001827883,0.0010685262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002686367,0.00010746027,0.00046108928,0.0006489339,0.00012224991,0.0004149198,0.00034137515,0.4810062,0.011400232,0.43064588,0.0038214272,0.07076174],"study_design_scores_gemma":[0.0000428087,0.000112462614,0.00013085664,0.000042405096,0.00005076765,0.00022235766,0.00004011737,0.91268563,0.0038896855,0.07849127,0.0042587817,0.000032838165],"about_ca_topic_score_codex":0.0010713903,"about_ca_topic_score_gemma":0.0017080463,"teacher_disagreement_score":0.004676093,"about_ca_system_score_codex":0.002206301,"about_ca_system_score_gemma":0.0009994673,"threshold_uncertainty_score":0.0160079},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59080195,0.002545964,0.3973567,0.00043478055,0.00003414984,0.000036903446,0.00009561187,0.00026995418,0.00842405],"genre_scores_gemma":[0.9952062,0.0004101779,0.0038079591,0.000026305202,0.000021096406,0.000016283859,0.000017372688,0.000011630226,0.00048300682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988555,0.0004964,0.00003351024,0.000094143004,0.00035806646,0.00016249118],"domain_scores_gemma":[0.9934429,0.0048561506,0.00060698146,0.0003076857,0.00070782244,0.000078534584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016489563,0.0008996397,0.0008425624,0.00070178503,0.00048601255,0.00092672993,0.0005067927,0.00084968517,0.00057707826],"category_scores_gemma":[0.009592476,0.00027009854,0.00030897075,0.0008335487,0.0011822787,0.0010569139,0.00086227007,0.00050221867,0.00020523806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008389246,0.00001585435,0.00131038,0.000048761864,0.00003300705,0.00015546357,0.00011984206,0.97241,0.0055964245,0.014158887,0.00014533965,0.0059221215],"study_design_scores_gemma":[0.000004706716,0.00006855534,0.0005282658,0.000009604466,0.0000148427835,0.000093615614,0.000033473876,0.9935867,0.0016942386,0.003833965,0.0001207697,0.000011399649],"about_ca_topic_score_codex":0.0022811682,"about_ca_topic_score_gemma":0.0012329973,"teacher_disagreement_score":0.0022811682,"about_ca_system_score_codex":0.0013918126,"about_ca_system_score_gemma":0.00057259324,"threshold_uncertainty_score":0.010098338},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042069044,0.0067097554,0.94221836,0.00040378515,0.00016325407,0.000055233064,0.0001861531,0.00026572138,0.007928622],"genre_scores_gemma":[0.85264224,0.0058304784,0.13070881,0.00018557551,0.00027827037,0.00018399776,0.0002877368,0.000041100968,0.0098417755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992873,0.0002979516,0.000034822657,0.00013034912,0.00015920997,0.000090358175],"domain_scores_gemma":[0.9989454,0.00059140153,0.00018573125,0.00011036045,0.0001277305,0.000039326296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062352646,0.0010699879,0.0010815396,0.0006244587,0.00073634856,0.0009937921,0.001456889,0.0011187093,0.0009907306],"category_scores_gemma":[0.0016930543,0.00043723086,0.00035557078,0.0012712514,0.0008373441,0.0018225758,0.0010936507,0.00077283167,0.00048059813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057524507,0.0001481624,0.0016273232,0.00094253453,0.00016128326,0.002453905,0.0006131943,0.5120664,0.036920067,0.28752598,0.007307509,0.14965837],"study_design_scores_gemma":[0.000035795816,0.00027436405,0.0003633749,0.000037257134,0.000062272025,0.0014023794,0.00011461512,0.9026462,0.005871194,0.0767988,0.012348649,0.000045090288],"about_ca_topic_score_codex":0.0004643332,"about_ca_topic_score_gemma":0.0011750987,"teacher_disagreement_score":0.001456889,"about_ca_system_score_codex":0.00059862423,"about_ca_system_score_gemma":0.00026135173,"threshold_uncertainty_score":0.004343331},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41471583,0.0014984461,0.5768082,0.00023995401,0.000033883134,0.000042481708,0.000064505926,0.00020340021,0.006393312],"genre_scores_gemma":[0.99229795,0.0002604432,0.0065608714,0.000015501806,0.000012941131,0.00001396308,0.000011942321,0.000005148805,0.0008213374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936634,0.00022301053,0.000026595011,0.000081728,0.000213706,0.00008863829],"domain_scores_gemma":[0.9966305,0.0021209933,0.00040474813,0.00016052884,0.0006291669,0.000053972897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008501371,0.00087309605,0.000679588,0.00040335406,0.00043007266,0.00085844076,0.0005390137,0.0010347038,0.00072189607],"category_scores_gemma":[0.0041792346,0.00024802735,0.00030575445,0.0004633609,0.00096448424,0.0010143159,0.0007235907,0.0005815698,0.00022239661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027633714,0.000038344304,0.00166734,0.00018364379,0.0000799327,0.0005925559,0.0004502838,0.93485403,0.028517755,0.017195124,0.00022824126,0.015916344],"study_design_scores_gemma":[0.000005534057,0.00008215607,0.00028811797,0.00000596634,0.000017480761,0.00013736747,0.000043092397,0.99520326,0.0025369595,0.0015229591,0.00014555534,0.000011615761],"about_ca_topic_score_codex":0.0031537977,"about_ca_topic_score_gemma":0.0019332165,"teacher_disagreement_score":0.0031537977,"about_ca_system_score_codex":0.00073695404,"about_ca_system_score_gemma":0.0005324797,"threshold_uncertainty_score":0.0062708855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4290439,0.0006326976,0.5627362,0.0001906928,0.000019952618,0.00002513243,0.000035519493,0.00017484892,0.0071411254],"genre_scores_gemma":[0.9935022,0.00015965546,0.0058082696,0.000022919488,0.000010677251,0.000016729122,0.0000074298987,0.00000454526,0.00046763316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989563,0.0004496784,0.000033149063,0.000094269315,0.00028425173,0.00018230961],"domain_scores_gemma":[0.9968066,0.0023714711,0.0003228837,0.00022374437,0.0002030129,0.000072380266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017948807,0.00061221054,0.0009162155,0.00058413413,0.00046007975,0.00081521604,0.0006743396,0.0007170779,0.00036798717],"category_scores_gemma":[0.0034948555,0.00028391153,0.0003669259,0.0010822662,0.0015308436,0.00080217456,0.0011407927,0.00039540214,0.000107866115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009115621,0.000022262757,0.0006262121,0.00003732127,0.00003467867,0.0002704929,0.00012990402,0.9588194,0.005438065,0.028062288,0.000084451036,0.006383858],"study_design_scores_gemma":[0.000016306189,0.000055421402,0.00019542093,0.0000065113973,0.000015923308,0.000089768335,0.000037008715,0.9822317,0.0017665125,0.015423901,0.0001474805,0.000014106784],"about_ca_topic_score_codex":0.0010817219,"about_ca_topic_score_gemma":0.00060148066,"teacher_disagreement_score":0.0017948807,"about_ca_system_score_codex":0.00067140226,"about_ca_system_score_gemma":0.00049187656,"threshold_uncertainty_score":0.009492338},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45584658,0.0032266881,0.51789623,0.0005972531,0.000057751302,0.000054240278,0.0002024293,0.0005948375,0.021523952],"genre_scores_gemma":[0.99090564,0.00059920916,0.0076063336,0.00004205773,0.000025340109,0.000014373786,0.00004843429,0.00001593662,0.0007426173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832445,0.0005480099,0.000036013196,0.00013583103,0.00061525306,0.00034035032],"domain_scores_gemma":[0.99704736,0.0018739715,0.00030438643,0.00018697898,0.00053071097,0.000056659403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017446703,0.0011493537,0.0007487212,0.00090401905,0.00045909252,0.00091645296,0.0006971895,0.00093001785,0.00089307665],"category_scores_gemma":[0.004601545,0.00028190287,0.00051028444,0.001234204,0.0010373811,0.0009117502,0.00095833745,0.000589363,0.0002740149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003006578,0.000039336002,0.0025280614,0.00012748828,0.00012839142,0.00031351665,0.0002003875,0.9241535,0.025541354,0.022312643,0.0005830983,0.023771668],"study_design_scores_gemma":[0.000008501659,0.00012062723,0.00091950357,0.000012445949,0.00004137409,0.00017616476,0.000039040777,0.9896171,0.0055837585,0.0031854932,0.0002752228,0.000020768062],"about_ca_topic_score_codex":0.0032930123,"about_ca_topic_score_gemma":0.0023714483,"teacher_disagreement_score":0.0032930123,"about_ca_system_score_codex":0.0012631051,"about_ca_system_score_gemma":0.0009244335,"threshold_uncertainty_score":0.009226799},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81833506,0.0014704434,0.16167642,0.00025008232,0.000025651201,0.00014274749,0.00022990705,0.0004270673,0.017442616],"genre_scores_gemma":[0.9925086,0.00018317263,0.0065714107,0.000013860584,0.0000041473077,0.00006931258,0.000091631,0.000019960573,0.0005378985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966569,0.0012601427,0.0001346143,0.00021938256,0.0012187612,0.0005101896],"domain_scores_gemma":[0.9877457,0.008785299,0.00062357815,0.00088909053,0.001816082,0.00014027159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003248266,0.0012282114,0.0008941137,0.0011645134,0.00037544288,0.0009678551,0.001191414,0.0009466787,0.0007764858],"category_scores_gemma":[0.016049828,0.00021481664,0.00044849576,0.0015909894,0.0009873972,0.0012452311,0.0009793176,0.00048423224,0.00020238264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038033986,0.00007153599,0.0011311419,0.000095949195,0.000045842753,0.000114895854,0.000057763787,0.9764524,0.004613727,0.003857012,0.00014367777,0.013035689],"study_design_scores_gemma":[0.000037183574,0.0006056175,0.0012332529,0.000019399062,0.000047670765,0.00016950954,0.000096554344,0.9811772,0.013353173,0.0028631568,0.0003736312,0.000023669918],"about_ca_topic_score_codex":0.0025692692,"about_ca_topic_score_gemma":0.0021214364,"teacher_disagreement_score":0.003248266,"about_ca_system_score_codex":0.0015278544,"about_ca_system_score_gemma":0.0006709219,"threshold_uncertainty_score":0.017178655},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6793751,0.0013734415,0.31510592,0.00019551384,0.000058416008,0.00005821408,0.00017968567,0.00051373476,0.003140001],"genre_scores_gemma":[0.99262697,0.00015774816,0.00688965,0.000019260977,0.000012443045,0.000010138774,0.000030751962,0.00000840994,0.0002445883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975848,0.000992301,0.00012066677,0.00027032185,0.0006492577,0.00038255003],"domain_scores_gemma":[0.97746724,0.017239816,0.0018952326,0.0020973661,0.0010198198,0.0002805747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026148802,0.0010852716,0.0010907806,0.0004436957,0.00044820065,0.0010156168,0.0009661194,0.0005835123,0.00052849954],"category_scores_gemma":[0.0148173785,0.0004369252,0.0003329955,0.0006494141,0.00086996524,0.001663347,0.0010531738,0.00039666443,0.00011196974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012115813,0.000056286968,0.005921728,0.00014033608,0.00017502106,0.00068811857,0.00017092691,0.9260139,0.009831209,0.005367141,0.0003019617,0.050121848],"study_design_scores_gemma":[0.000050027928,0.0006089008,0.003399841,0.00002238021,0.00012277745,0.00065649877,0.00012441605,0.9800648,0.010571957,0.003827832,0.00051542476,0.000035134082],"about_ca_topic_score_codex":0.0025528544,"about_ca_topic_score_gemma":0.0042201704,"teacher_disagreement_score":0.0026148802,"about_ca_system_score_codex":0.00048804178,"about_ca_system_score_gemma":0.0009878894,"threshold_uncertainty_score":0.013828993},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07831405,0.002890345,0.90922874,0.00043599663,0.00012337483,0.000095200405,0.00003256254,0.00026023056,0.008619543],"genre_scores_gemma":[0.9310542,0.0014241099,0.06398139,0.00009495632,0.000078614496,0.00011593012,0.000034453762,0.000016603777,0.003199766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915993,0.000427874,0.000027503083,0.000068676025,0.00024423533,0.000071686336],"domain_scores_gemma":[0.9982938,0.0011293674,0.00012631413,0.00015442642,0.00025979325,0.000036375623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011989658,0.0004168675,0.0003083616,0.00046517715,0.00030708042,0.00065874355,0.0006814295,0.000789255,0.00047806592],"category_scores_gemma":[0.0038652595,0.00020628887,0.00014438675,0.000639312,0.0012494195,0.00081255514,0.000695096,0.00053123594,0.00012823641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020376733,0.000042149495,0.001021366,0.00016320068,0.000045134242,0.000330324,0.00027449927,0.7371623,0.01258684,0.14384456,0.0018442749,0.10248167],"study_design_scores_gemma":[0.000021274574,0.000072601244,0.00020631975,0.000020292306,0.000014219454,0.000144751,0.00003018843,0.9535068,0.0023616063,0.041144945,0.002461179,0.000015732146],"about_ca_topic_score_codex":0.0017859685,"about_ca_topic_score_gemma":0.0012394689,"teacher_disagreement_score":0.0017859685,"about_ca_system_score_codex":0.0006208367,"about_ca_system_score_gemma":0.0005836764,"threshold_uncertainty_score":0.0063408017},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16123924,0.0031595412,0.7477169,0.01093307,0.00054886634,0.00029796883,0.0015644501,0.00057306065,0.073966846],"genre_scores_gemma":[0.85978574,0.003593172,0.10659359,0.0017442219,0.0009371507,0.0007090972,0.0017243796,0.0005256173,0.024387008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99601704,0.0020829518,0.00013232809,0.00075718644,0.0005351566,0.00047541145],"domain_scores_gemma":[0.97949123,0.016307626,0.0011268063,0.0013667145,0.00076886447,0.000938674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003782698,0.0016338581,0.002198828,0.0014077807,0.0024673021,0.003868937,0.0032481984,0.004000379,0.013530316],"category_scores_gemma":[0.028759876,0.0008478691,0.0010992624,0.0021352048,0.003443362,0.012629973,0.0049566636,0.0038873153,0.00235207],"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.00034749025,0.0000867473,0.0004928058,0.00026670584,0.000061324325,0.0002348077,0.0003681025,0.083334796,0.0008563853,0.8712123,0.013337951,0.029400637],"study_design_scores_gemma":[0.00006211427,0.000045056895,0.00014708722,0.000049873957,0.000019721403,0.00023452925,0.00018865526,0.111724705,0.00089396967,0.8811287,0.005476598,0.00002895761],"about_ca_topic_score_codex":0.00096080184,"about_ca_topic_score_gemma":0.00041156064,"teacher_disagreement_score":0.013530316,"about_ca_system_score_codex":0.0017685124,"about_ca_system_score_gemma":0.001042382,"threshold_uncertainty_score":0.04526341},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046921387,0.00035130413,0.92395157,0.00062063825,0.000058971367,0.00018033436,0.00008165701,0.00009508266,0.02773905],"genre_scores_gemma":[0.9665373,0.0002656334,0.027484523,0.00013661331,0.000027421804,0.00028358135,0.00003773293,0.000017049886,0.0052101305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761873,0.0014119261,0.00006855898,0.00024539273,0.00041664875,0.00023880693],"domain_scores_gemma":[0.99833965,0.0010439705,0.00015364714,0.000089416266,0.00026511715,0.00010812602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020611295,0.001116305,0.0010316938,0.0005859358,0.0006340753,0.0014835728,0.0016151944,0.0013501046,0.0016552993],"category_scores_gemma":[0.004925048,0.00030844775,0.0005632591,0.0006587501,0.0019283575,0.0015267797,0.0014533472,0.00094630494,0.00028666927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017851955,0.00008244908,0.0005081348,0.00011200496,0.00008612749,0.0004032695,0.0003302763,0.5292123,0.004312784,0.4499973,0.0021787295,0.012598076],"study_design_scores_gemma":[0.000032996446,0.000054372533,0.00011928199,0.000012182203,0.000016621587,0.00006221054,0.000049532257,0.9248852,0.00042713693,0.07326391,0.0010576413,0.000018890543],"about_ca_topic_score_codex":0.0048033637,"about_ca_topic_score_gemma":0.0027921335,"teacher_disagreement_score":0.0048033637,"about_ca_system_score_codex":0.0024259042,"about_ca_system_score_gemma":0.0017997092,"threshold_uncertainty_score":0.017601311},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052726388,0.00046221341,0.9417073,0.00028771284,0.00003936078,0.000039632585,0.00018286711,0.00013975092,0.004414806],"genre_scores_gemma":[0.95346785,0.0013106149,0.039796278,0.00010552234,0.00008054464,0.00014453886,0.00019277759,0.00006604011,0.0048357584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938786,0.00021054887,0.00001999065,0.00008577499,0.00019772351,0.00009801456],"domain_scores_gemma":[0.9971022,0.0019197048,0.00038966854,0.0001804644,0.00036334406,0.000044612898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00116495,0.0006917689,0.00053721445,0.00065886567,0.00032049438,0.0007453457,0.0010931112,0.00092155085,0.000846481],"category_scores_gemma":[0.004201168,0.0004203638,0.00039443024,0.00090413867,0.0016691064,0.001432364,0.00051106664,0.001066947,0.0002785773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024933113,0.000018677458,0.0004874554,0.000033963144,0.00001371522,0.00011798575,0.00008167772,0.89362365,0.002921759,0.09843771,0.00030477965,0.0039337324],"study_design_scores_gemma":[0.0000018480655,0.0000052625605,0.00012855716,0.0000024095552,0.0000023227135,0.000018353925,0.0000046088876,0.9917385,0.00023410047,0.0077389656,0.00011980595,0.0000052185505],"about_ca_topic_score_codex":0.0047979853,"about_ca_topic_score_gemma":0.003075143,"teacher_disagreement_score":0.0047979853,"about_ca_system_score_codex":0.0012474878,"about_ca_system_score_gemma":0.00072901236,"threshold_uncertainty_score":0.009540141},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07031814,0.0012831556,0.91893035,0.00047066098,0.00011043706,0.00010905762,0.000070342816,0.0005958459,0.008112029],"genre_scores_gemma":[0.69231427,0.0009802093,0.30211392,0.00046955445,0.00026778836,0.000117530086,0.00016158167,0.00003714359,0.0035379494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921775,0.000223561,0.000028281533,0.000094596435,0.00033507746,0.00010077116],"domain_scores_gemma":[0.99907565,0.00033931198,0.0001178215,0.0002558016,0.00015082367,0.0000606761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065417396,0.00090126647,0.0006274996,0.0005673563,0.00045029714,0.00087749626,0.0008900054,0.000683461,0.0013780455],"category_scores_gemma":[0.0012508801,0.00019894018,0.0003839144,0.0012624905,0.00081112934,0.0009825863,0.0016387718,0.001174726,0.00040957078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008295524,0.0002557975,0.0035769402,0.00032780206,0.0003909275,0.0009476461,0.0003554327,0.09892667,0.2436433,0.09966665,0.0060792235,0.545],"study_design_scores_gemma":[0.00040590295,0.002001842,0.0032140207,0.00007704135,0.00028846337,0.005097336,0.00020092218,0.7337107,0.16813256,0.054683123,0.0320397,0.00014836549],"about_ca_topic_score_codex":0.0003809651,"about_ca_topic_score_gemma":0.0008663899,"teacher_disagreement_score":0.0013780455,"about_ca_system_score_codex":0.0003430942,"about_ca_system_score_gemma":0.0005438998,"threshold_uncertainty_score":0.0046100616},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037061013,0.0009896309,0.9376956,0.00025668083,0.000052434265,0.00004063888,0.00012057369,0.00027391312,0.023509568],"genre_scores_gemma":[0.9569562,0.0016316979,0.033121843,0.00011977292,0.000076057775,0.00012615566,0.000084644096,0.000084278574,0.0077992342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999456,0.0001827032,0.000014571739,0.000057100304,0.000173675,0.00011594089],"domain_scores_gemma":[0.99934393,0.00032114235,0.00008978723,0.00006869313,0.00014960152,0.00002681041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061990926,0.0010377206,0.0007223013,0.00076288794,0.00052325026,0.0010037615,0.0016481236,0.0011701983,0.0015562427],"category_scores_gemma":[0.0029012193,0.00036042163,0.0005266731,0.00124966,0.0010610906,0.0011448195,0.0007717443,0.00062472804,0.00055912574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013886098,0.000007128005,0.00019377636,0.000022179936,0.000009753202,0.0001276434,0.000064025044,0.9513821,0.0012337791,0.04404521,0.00034539317,0.0025550516],"study_design_scores_gemma":[0.0000019148556,0.000008199989,0.00006122482,0.000004692406,0.0000039157044,0.000038156864,0.000012637879,0.9902956,0.00019068574,0.008982018,0.00039638497,0.0000045730653],"about_ca_topic_score_codex":0.0056607937,"about_ca_topic_score_gemma":0.002795966,"teacher_disagreement_score":0.0056607937,"about_ca_system_score_codex":0.0015441299,"about_ca_system_score_gemma":0.00059480837,"threshold_uncertainty_score":0.0112556815},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09981276,0.005060836,0.87481,0.0008736472,0.00005930108,0.00005828785,0.00015112317,0.00044136873,0.018732747],"genre_scores_gemma":[0.9725734,0.0021123025,0.023057258,0.00016866243,0.00008705877,0.00006894512,0.00007877572,0.000066308676,0.0017873761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99559104,0.0020152854,0.00011961933,0.0002967977,0.0014975193,0.00047967714],"domain_scores_gemma":[0.98979235,0.007823627,0.0008130445,0.00038284407,0.0010484316,0.00013962967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004550762,0.0017964664,0.0014177414,0.0011003221,0.00055259216,0.0020286418,0.0012442352,0.0015005384,0.0018343254],"category_scores_gemma":[0.016758345,0.00071623205,0.00056358404,0.0013078662,0.0020451974,0.0021467367,0.0018973579,0.0010955199,0.00070885965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002460685,0.00003638653,0.0008499485,0.00023043671,0.00009106071,0.00025995765,0.00025547427,0.90267867,0.009303224,0.06720903,0.00069188455,0.018147836],"study_design_scores_gemma":[0.000011800089,0.0000852913,0.00029478737,0.000028901772,0.00002409671,0.00012775845,0.000032931963,0.9799226,0.0017920643,0.017266506,0.0003868106,0.000026430505],"about_ca_topic_score_codex":0.0014547,"about_ca_topic_score_gemma":0.0008618212,"teacher_disagreement_score":0.004550762,"about_ca_system_score_codex":0.0019500692,"about_ca_system_score_gemma":0.00082483335,"threshold_uncertainty_score":0.024066985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028150018,0.00028963236,0.9649908,0.00022135311,0.000033656932,0.000023657292,0.000016350241,0.000078072684,0.0061964793],"genre_scores_gemma":[0.8860784,0.00067322707,0.10969675,0.00018663898,0.00009207686,0.00006801058,0.000028911687,0.000016845843,0.0031589996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992995,0.00026543636,0.000032547305,0.00009801702,0.00022008992,0.00008428083],"domain_scores_gemma":[0.99813145,0.0010506455,0.0002820512,0.00031282596,0.00018362085,0.000039461782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009613498,0.00068917003,0.00041605398,0.00033868806,0.00036588655,0.0008761157,0.0008839079,0.000748326,0.0010641929],"category_scores_gemma":[0.0023124316,0.00023789325,0.00042732153,0.0005022249,0.0010755208,0.0018038189,0.0012364873,0.00078839244,0.00032250784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015639608,0.00011621163,0.0009823716,0.00022708086,0.000067280904,0.00051980687,0.00037724414,0.3284823,0.04356366,0.54087263,0.0012005876,0.083434545],"study_design_scores_gemma":[0.000032004227,0.00027154657,0.00022419551,0.00002346952,0.00005024045,0.0006447453,0.00006882699,0.89077425,0.015144272,0.08764253,0.005095085,0.000028908995],"about_ca_topic_score_codex":0.0006477661,"about_ca_topic_score_gemma":0.00085051265,"teacher_disagreement_score":0.0010641929,"about_ca_system_score_codex":0.00044319037,"about_ca_system_score_gemma":0.00075429317,"threshold_uncertainty_score":0.005084157},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11941702,0.0005884274,0.8709853,0.000301037,0.00004583357,0.00016639783,0.00003320244,0.0006888578,0.0077738413],"genre_scores_gemma":[0.8210702,0.00026153843,0.1764766,0.00019306182,0.00008689083,0.00014844054,0.000042409203,0.000053230506,0.0016676248],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875426,0.0003522568,0.00004469977,0.00016717467,0.00046634278,0.0002152508],"domain_scores_gemma":[0.9946656,0.0033732813,0.0005542872,0.0006869209,0.0004970672,0.0002228052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017906475,0.0010360768,0.00088108587,0.0011423946,0.0009129255,0.0015016033,0.0011228166,0.0010703263,0.0016641144],"category_scores_gemma":[0.0049729315,0.0004756602,0.0006264622,0.0014023955,0.0019351201,0.0018570271,0.0014034216,0.0010884637,0.00042498505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020176661,0.00035779233,0.010722928,0.00026364322,0.0005054841,0.0009655392,0.00089156895,0.22071601,0.15158823,0.10580198,0.0028099369,0.50335914],"study_design_scores_gemma":[0.00019315904,0.0019790418,0.002747904,0.000042440795,0.00034550898,0.002054947,0.000322628,0.8943172,0.053737685,0.037781682,0.0063026035,0.00017514586],"about_ca_topic_score_codex":0.0013366841,"about_ca_topic_score_gemma":0.0025929492,"teacher_disagreement_score":0.0017906475,"about_ca_system_score_codex":0.0007786022,"about_ca_system_score_gemma":0.0012727603,"threshold_uncertainty_score":0.009469926},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017627215,0.00017358117,0.981429,0.0000383911,0.0000094905645,0.00002568792,0.000005594362,0.00007503356,0.00061604456],"genre_scores_gemma":[0.57618946,0.00039720073,0.4218452,0.000065703185,0.00004077421,0.00017788346,0.000043508488,0.000025242283,0.0012150148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993849,0.0002913051,0.000024403544,0.00007875307,0.00018045506,0.000040157785],"domain_scores_gemma":[0.9991381,0.000559331,0.00009739241,0.00006864244,0.000117188305,0.000019238849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007356689,0.0005014108,0.000437701,0.00038330714,0.0003574387,0.00032156316,0.0005953775,0.00038433733,0.0005220892],"category_scores_gemma":[0.002301057,0.00020662314,0.0002346984,0.00057230104,0.0006789309,0.0005929707,0.0003740423,0.00028673105,0.00025778633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043768124,0.00012024555,0.0019158351,0.0001502585,0.000059620284,0.0002063903,0.00028823878,0.526205,0.10514992,0.028719781,0.0012389271,0.33550805],"study_design_scores_gemma":[0.000043060478,0.0002177429,0.00035544878,0.000012344496,0.000020581469,0.00016065908,0.000029162644,0.97006667,0.019355262,0.008410469,0.0013112645,0.000017415636],"about_ca_topic_score_codex":0.000493295,"about_ca_topic_score_gemma":0.0010225854,"teacher_disagreement_score":0.0007356689,"about_ca_system_score_codex":0.00025035188,"about_ca_system_score_gemma":0.00044662863,"threshold_uncertainty_score":0.0038906336},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41866413,0.00434186,0.554983,0.0011622407,0.00011912448,0.00022843051,0.0002872813,0.00061153155,0.019602407],"genre_scores_gemma":[0.99290293,0.0005678194,0.0055331104,0.000024923975,0.00002890493,0.00003340853,0.00005766727,0.00002180336,0.00082952576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985355,0.0004896838,0.000047191497,0.00015410788,0.000534831,0.00023878533],"domain_scores_gemma":[0.9932268,0.0045287223,0.0005062363,0.0002120907,0.0013506832,0.00017531801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00191797,0.0009249146,0.000931347,0.00090345455,0.00067476614,0.0010647015,0.00092437846,0.0008157732,0.0011504781],"category_scores_gemma":[0.00749378,0.00025116044,0.00036570855,0.0009772768,0.00091688265,0.0010668829,0.00090952945,0.0007903934,0.000158445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000888286,0.00003081811,0.00064350915,0.00007439567,0.000023912637,0.00009252874,0.000066448454,0.97750264,0.0036957588,0.010294575,0.0004353005,0.0070512155],"study_design_scores_gemma":[0.000001004255,0.000015461545,0.00009110223,0.0000016780523,0.0000032146124,0.000010580189,0.0000070211513,0.9990426,0.00025528524,0.0005298231,0.000039500814,0.000002701129],"about_ca_topic_score_codex":0.008721475,"about_ca_topic_score_gemma":0.0023391552,"teacher_disagreement_score":0.008721475,"about_ca_system_score_codex":0.0022982617,"about_ca_system_score_gemma":0.0013119983,"threshold_uncertainty_score":0.017341435},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030037446,0.00015101119,0.9958983,0.00003483019,0.000008847963,0.00001740559,0.000008045082,0.00004152772,0.0008362512],"genre_scores_gemma":[0.7431099,0.0006656912,0.25420135,0.0001258119,0.00006771643,0.00025852077,0.00005757227,0.000057373636,0.0014561097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983828,0.0005794018,0.000071367525,0.000295723,0.0005272516,0.00014338535],"domain_scores_gemma":[0.9983339,0.00093543815,0.00032032342,0.0001309638,0.0002466819,0.000032647604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002081242,0.0013920764,0.000945116,0.0005326277,0.0003322132,0.0010283138,0.0012122812,0.000966956,0.0011681436],"category_scores_gemma":[0.0052775503,0.000581488,0.00067750184,0.0004889449,0.0010917656,0.0012851708,0.0011160254,0.0009784097,0.00031293876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043001088,0.000022559632,0.00010237122,0.00006935402,0.00003509312,0.00004629227,0.00006745848,0.9483914,0.0031261547,0.026568178,0.00029374423,0.02123447],"study_design_scores_gemma":[0.000013669094,0.000054739245,0.00003771578,0.0000085348665,0.0000118360695,0.000021717524,0.00000946602,0.98741466,0.0011732487,0.010669127,0.0005770746,0.0000083203795],"about_ca_topic_score_codex":0.0009821034,"about_ca_topic_score_gemma":0.00080706936,"teacher_disagreement_score":0.002081242,"about_ca_system_score_codex":0.0008707411,"about_ca_system_score_gemma":0.00093735266,"threshold_uncertainty_score":0.011006832},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2043545,0.00041385117,0.7922752,0.000187838,0.000025618583,0.0000646138,0.000044396933,0.00042014295,0.002213866],"genre_scores_gemma":[0.9675522,0.00012477473,0.031851467,0.00002856668,0.000012572594,0.000041162977,0.000015088884,0.000013691223,0.00036044625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914706,0.00035786285,0.0000343331,0.0001119318,0.00014038429,0.00020846364],"domain_scores_gemma":[0.99709654,0.0019644427,0.00029239067,0.0004000457,0.00015450135,0.00009209453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015635013,0.0005207498,0.0007582443,0.0005582176,0.00049981155,0.00069359655,0.0009055789,0.00058682385,0.0005543478],"category_scores_gemma":[0.0052627646,0.00029982664,0.00019954982,0.0009037137,0.0011676585,0.0014145836,0.0012690127,0.0005241098,0.0001120367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068724476,0.000054112334,0.0004634681,0.000031514657,0.000010943774,0.000047847236,0.00007617632,0.96460164,0.00515424,0.0076357583,0.0003582538,0.02149725],"study_design_scores_gemma":[0.000010891081,0.000040942225,0.00015373988,0.0000025711006,0.000004674374,0.000026936103,0.000019502524,0.9912601,0.0011025339,0.0071554626,0.00021609562,0.000006480665],"about_ca_topic_score_codex":0.0021252665,"about_ca_topic_score_gemma":0.0025356358,"teacher_disagreement_score":0.0021252665,"about_ca_system_score_codex":0.0009441854,"about_ca_system_score_gemma":0.0008039227,"threshold_uncertainty_score":0.008268714},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30587876,0.001665088,0.6274585,0.005059,0.00011461065,0.00015633613,0.00013732308,0.00012517534,0.059405122],"genre_scores_gemma":[0.98386866,0.0005509523,0.013371115,0.00009049897,0.00009797944,0.0000598439,0.00001866094,0.000028076372,0.0019142032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981749,0.0009856231,0.000047961003,0.00016022533,0.00039583415,0.00023541697],"domain_scores_gemma":[0.97810227,0.018686313,0.0011547203,0.0007133208,0.0008855469,0.0004578754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036465917,0.000627767,0.0009903003,0.0009869274,0.0012530801,0.0033531282,0.0012460533,0.0015017148,0.003648567],"category_scores_gemma":[0.019640777,0.00056119624,0.0006048745,0.0010218044,0.0050430545,0.0077229543,0.0018604447,0.001814601,0.00024794106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008316245,0.000048278576,0.0005397848,0.00006781277,0.000020353633,0.00018513197,0.00018498054,0.20965715,0.0014262536,0.77865136,0.00074387796,0.008391844],"study_design_scores_gemma":[0.000027861086,0.000044390967,0.0002644145,0.000017492981,0.000010762774,0.000087948196,0.00007931951,0.626553,0.00045791268,0.37155786,0.0008772404,0.000021805296],"about_ca_topic_score_codex":0.0023590985,"about_ca_topic_score_gemma":0.0015064813,"teacher_disagreement_score":0.003648567,"about_ca_system_score_codex":0.0022410792,"about_ca_system_score_gemma":0.0014824409,"threshold_uncertainty_score":0.019285262},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17076346,0.00045391527,0.8266721,0.0001790816,0.000018600926,0.000014589357,0.000022860966,0.00018459877,0.0016907546],"genre_scores_gemma":[0.9543173,0.00038832767,0.044576876,0.000027883036,0.000020033067,0.000024171499,0.000024367213,0.000011595577,0.00060950924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933654,0.00028514094,0.000028762006,0.00008921027,0.00020501629,0.000055342072],"domain_scores_gemma":[0.9941194,0.0047010034,0.000525307,0.00030924357,0.00029418987,0.00005084461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012410969,0.00042223852,0.00040615821,0.00027851915,0.00029477692,0.00040776975,0.0004007054,0.00061502354,0.00022070965],"category_scores_gemma":[0.014144046,0.0002848526,0.000099347024,0.00043909706,0.00072822766,0.00077698054,0.0005637626,0.00045102896,0.00009327837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014399535,0.00002921311,0.0020985394,0.000041809548,0.000013725168,0.000088398454,0.00013607563,0.9105888,0.009053788,0.0077724094,0.00014583883,0.069887385],"study_design_scores_gemma":[0.000015686235,0.00010034045,0.00088913203,0.000015423391,0.000012416124,0.00008063258,0.000030424164,0.9804095,0.011700591,0.0063628117,0.000370315,0.000012725507],"about_ca_topic_score_codex":0.0018401151,"about_ca_topic_score_gemma":0.0017872807,"teacher_disagreement_score":0.0018401151,"about_ca_system_score_codex":0.0004660904,"about_ca_system_score_gemma":0.00066433114,"threshold_uncertainty_score":0.0065636635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30430052,0.0019788598,0.687969,0.00025003645,0.000042743486,0.000030961524,0.00015666666,0.0002898079,0.004981428],"genre_scores_gemma":[0.9916875,0.00053248816,0.007164435,0.000017621582,0.00003516774,0.000013088293,0.000039637896,0.000020296498,0.000489823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892235,0.00034889756,0.000050072085,0.00008374571,0.00043319134,0.00016184969],"domain_scores_gemma":[0.995044,0.0035403196,0.00042041135,0.00029716635,0.00058310386,0.00011494815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014209002,0.0006906445,0.00088427943,0.0007757184,0.0003560014,0.00075041014,0.00056112214,0.0004843225,0.00079274114],"category_scores_gemma":[0.006173487,0.00021262403,0.00038332885,0.0008531132,0.0010189319,0.0008660738,0.00078693224,0.0005618171,0.00019221027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014119198,0.000034223445,0.0032476431,0.00012737424,0.000064391854,0.00060440094,0.00020112163,0.95267445,0.006337832,0.019547774,0.00054390513,0.016475685],"study_design_scores_gemma":[0.0000036159233,0.000036624864,0.0012834094,0.000005756734,0.000017679205,0.00017460085,0.000036881152,0.9931017,0.0007949894,0.0043406133,0.0001950185,0.000009069648],"about_ca_topic_score_codex":0.0020330884,"about_ca_topic_score_gemma":0.0011070842,"teacher_disagreement_score":0.0020330884,"about_ca_system_score_codex":0.00094480405,"about_ca_system_score_gemma":0.0004780864,"threshold_uncertainty_score":0.0075145364},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08258998,0.0075829676,0.8894694,0.0009851909,0.00012463576,0.00009742792,0.0006455903,0.0006873915,0.017817382],"genre_scores_gemma":[0.96314967,0.0034153583,0.029340763,0.00023053472,0.00020281658,0.00028046643,0.00034629545,0.00014257904,0.002891585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746203,0.00067428115,0.00011582175,0.0003161148,0.0010348649,0.00039683274],"domain_scores_gemma":[0.9767323,0.01624197,0.0025354407,0.0020011896,0.0021666887,0.00032244166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035500405,0.00096047815,0.0013041445,0.0016263531,0.0007957113,0.0017885196,0.002045323,0.0014581708,0.002179573],"category_scores_gemma":[0.030100698,0.0005440107,0.0005676232,0.002655838,0.0030555497,0.003302074,0.0019451615,0.0015772292,0.00057583157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013425185,0.000049691575,0.0020570506,0.0002941977,0.000056190933,0.00043038177,0.0006206464,0.7256588,0.0064140554,0.24095918,0.0018672678,0.021458313],"study_design_scores_gemma":[0.000016750859,0.00005774697,0.0012179023,0.00012423046,0.000029969164,0.0006977492,0.00011920517,0.88597107,0.0033337995,0.1052846,0.0030793303,0.00006760892],"about_ca_topic_score_codex":0.003377378,"about_ca_topic_score_gemma":0.0013904347,"teacher_disagreement_score":0.0035500405,"about_ca_system_score_codex":0.0028093518,"about_ca_system_score_gemma":0.001522776,"threshold_uncertainty_score":0.020383298},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0140434485,0.00055693655,0.9817784,0.00008885958,0.00001608773,0.000025380226,0.000033403892,0.000093632974,0.0033638657],"genre_scores_gemma":[0.8609668,0.0014763105,0.13382408,0.00009002997,0.00006971343,0.00012783128,0.00005809236,0.00007786899,0.003309394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990625,0.0004585862,0.000032969278,0.00013767075,0.0001837215,0.00012456982],"domain_scores_gemma":[0.9992982,0.00044192717,0.00007937468,0.00008447594,0.000075196105,0.000020866035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009434094,0.00091567874,0.0010288233,0.00044702707,0.00032641992,0.0010153716,0.0006946824,0.00071416073,0.0014771256],"category_scores_gemma":[0.0024863854,0.00044243562,0.0003314214,0.0009059125,0.001230632,0.0011622421,0.00074672815,0.0004963424,0.0004883524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007927809,0.000024515191,0.00014989144,0.00007419458,0.000034524448,0.00006948425,0.000061005074,0.9086307,0.0052701724,0.056462213,0.00071805285,0.028425857],"study_design_scores_gemma":[0.000030307425,0.0000502092,0.0001401234,0.000012468677,0.000015547115,0.00007153924,0.00002600768,0.92896175,0.0020843004,0.06711694,0.0014747147,0.00001623103],"about_ca_topic_score_codex":0.00054900383,"about_ca_topic_score_gemma":0.00069297774,"teacher_disagreement_score":0.0014771256,"about_ca_system_score_codex":0.0008250917,"about_ca_system_score_gemma":0.0006195401,"threshold_uncertainty_score":0.0059865117},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04860622,0.00094236305,0.948147,0.00008590285,0.00005304347,0.00003174628,0.000018320252,0.00017471083,0.0019407613],"genre_scores_gemma":[0.88744634,0.00082304113,0.109395415,0.00006455225,0.000052636842,0.000088857334,0.000032807806,0.000020832324,0.0020754533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994103,0.00027416775,0.000017652079,0.00006903282,0.00014700089,0.00008194076],"domain_scores_gemma":[0.99917394,0.000509459,0.000096597694,0.00008571853,0.000094269344,0.000040099447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064349204,0.0003110924,0.00029732336,0.00044076546,0.00044094407,0.0006430041,0.00040907544,0.0003739453,0.00041680192],"category_scores_gemma":[0.0020101422,0.00021825913,0.00010702852,0.0005145209,0.00069564366,0.0006682255,0.0004838869,0.0003860579,0.00012653501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000883921,0.000036337056,0.00077826536,0.00008308106,0.000018677654,0.00013649072,0.00008400685,0.8257648,0.014509008,0.057794504,0.000846426,0.09986002],"study_design_scores_gemma":[0.00001243232,0.000051867723,0.0001827193,0.0000070610263,0.0000074999616,0.000063093066,0.000029914509,0.9763776,0.004139339,0.017303651,0.0018144129,0.000010418088],"about_ca_topic_score_codex":0.0012936428,"about_ca_topic_score_gemma":0.0013620296,"teacher_disagreement_score":0.0012936428,"about_ca_system_score_codex":0.00043342117,"about_ca_system_score_gemma":0.0004815134,"threshold_uncertainty_score":0.0034031272},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02298201,0.00033810825,0.97290534,0.00016825562,0.000046416455,0.000064175954,0.00006150883,0.00009606786,0.0033381132],"genre_scores_gemma":[0.8463493,0.00078584865,0.14824201,0.0001819291,0.00004909929,0.00034230918,0.00014401496,0.000053274165,0.0038521944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936205,0.0002481373,0.000021377346,0.00006458546,0.00023283929,0.000071138114],"domain_scores_gemma":[0.9975401,0.0016607537,0.00024168675,0.00022562167,0.00030054775,0.000031324184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000993281,0.0005448338,0.00042781982,0.00044215887,0.0003697835,0.0004948046,0.00072435517,0.00058631087,0.0010929207],"category_scores_gemma":[0.0040087965,0.00025288065,0.00029525592,0.00055162044,0.0011836732,0.0010376396,0.00083424366,0.00078291976,0.00020534632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010364977,0.00002559737,0.0002852078,0.00012958137,0.000025576872,0.00022977797,0.00015386422,0.7896948,0.0067760143,0.17819051,0.0011744247,0.023210926],"study_design_scores_gemma":[0.000011282346,0.000026976992,0.00006119664,0.000013509873,0.0000058827177,0.00006641262,0.000012654224,0.97524124,0.0010349596,0.022708962,0.00080589094,0.000011064528],"about_ca_topic_score_codex":0.0031470114,"about_ca_topic_score_gemma":0.0025674675,"teacher_disagreement_score":0.0031470114,"about_ca_system_score_codex":0.0010110582,"about_ca_system_score_gemma":0.0012503172,"threshold_uncertainty_score":0.007335782},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01726733,0.0010791675,0.9739575,0.00042865792,0.000069606845,0.0000420888,0.000069841706,0.0001470626,0.006938734],"genre_scores_gemma":[0.81881344,0.0031813579,0.17236242,0.00025734594,0.00018268652,0.00025036122,0.0001937655,0.000055657663,0.004702982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937767,0.00022329185,0.00002580702,0.00006901484,0.00023921976,0.000065020315],"domain_scores_gemma":[0.9985195,0.0009789722,0.00010032422,0.00015394326,0.00021056604,0.000036700276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013140811,0.00045674,0.0005106632,0.00064584584,0.00058486284,0.0011587843,0.0006676434,0.0007367132,0.0014119201],"category_scores_gemma":[0.0043186415,0.00023511832,0.00032005223,0.00066423835,0.00081247225,0.0020406262,0.0009840549,0.00076641986,0.00033739253],"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.000077286044,0.000026245121,0.00029286326,0.00017246041,0.000019610177,0.00030805526,0.00026027596,0.20462851,0.0062046917,0.71362746,0.0031264024,0.07125612],"study_design_scores_gemma":[0.000015338115,0.00005639406,0.00007558532,0.000026484251,0.000014290439,0.00018961017,0.000035378856,0.7180647,0.0019133547,0.27325475,0.006335185,0.000018897177],"about_ca_topic_score_codex":0.0008881967,"about_ca_topic_score_gemma":0.0007257972,"teacher_disagreement_score":0.0014119201,"about_ca_system_score_codex":0.0010236221,"about_ca_system_score_gemma":0.00082608877,"threshold_uncertainty_score":0.0074269176},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011619156,0.003132512,0.6213245,0.0015426105,0.0015631977,0.00014334485,0.00037628142,0.0077618533,0.35253656],"genre_scores_gemma":[0.25119323,0.0034899665,0.25884008,0.0010458563,0.0013440489,0.0001791268,0.00067515415,0.0011691195,0.48206347],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997594,0.00004337125,0.0000067471806,0.0000386422,0.00011894601,0.000032866188],"domain_scores_gemma":[0.99942386,0.00025654826,0.000020577005,0.00012840175,0.00013946253,0.000031093736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034968735,0.0005716978,0.0004009471,0.0008446263,0.0005298066,0.0007991905,0.00063625124,0.00070986827,0.030595861],"category_scores_gemma":[0.0019410464,0.0002625926,0.00023165594,0.000714701,0.00045417456,0.00071580865,0.0006502923,0.0009640552,0.010137343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035744102,0.000054522712,0.00026490344,0.00026633884,0.000026790289,0.00019369619,0.0002870264,0.008333062,0.025958462,0.21062054,0.07081822,0.68281895],"study_design_scores_gemma":[0.0002073027,0.00027881665,0.00088617293,0.00023525098,0.00011060816,0.0011048934,0.00012851639,0.103401914,0.031494476,0.23311667,0.6289655,0.000069872076],"about_ca_topic_score_codex":0.0011812258,"about_ca_topic_score_gemma":0.0016697056,"teacher_disagreement_score":0.030595861,"about_ca_system_score_codex":0.0004452176,"about_ca_system_score_gemma":0.00049034646,"threshold_uncertainty_score":0.102353394},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045882173,0.00022457333,0.9503614,0.00015700397,0.000009562683,0.0000326605,0.00011378435,0.00013188345,0.0030871034],"genre_scores_gemma":[0.8978233,0.00067783496,0.09673157,0.000059067173,0.000022159085,0.00009791426,0.00011537493,0.000048347163,0.0044244565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992956,0.0002648959,0.00003556735,0.00012696155,0.00017546427,0.000101454614],"domain_scores_gemma":[0.9986933,0.00094899634,0.00013406792,0.000070249276,0.00012265265,0.000030865096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016888557,0.00061688427,0.0007719907,0.00030562968,0.00023902344,0.0010364895,0.0005282827,0.0006776542,0.0008953519],"category_scores_gemma":[0.003995017,0.0004919169,0.00031344994,0.0006469856,0.0011786603,0.0010658711,0.0007195107,0.00057968433,0.00024924154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006539634,0.000024396913,0.00025560422,0.000061270286,0.000016442713,0.00008100005,0.00006087075,0.93961096,0.0034118365,0.040570676,0.00032704062,0.015514495],"study_design_scores_gemma":[0.000014488207,0.000029203193,0.00016114443,0.0000063520088,0.000008891381,0.000026424988,0.000015190145,0.97765726,0.001936565,0.01991774,0.00021780812,0.00000886439],"about_ca_topic_score_codex":0.0038447403,"about_ca_topic_score_gemma":0.0043821014,"teacher_disagreement_score":0.0038447403,"about_ca_system_score_codex":0.0010131829,"about_ca_system_score_gemma":0.0020814221,"threshold_uncertainty_score":0.008931637},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017227113,0.0011576,0.97484076,0.0011375822,0.000068364476,0.00003928186,0.00003115596,0.00004535752,0.0054527894],"genre_scores_gemma":[0.75711155,0.005511458,0.2326327,0.00031229193,0.0004421211,0.00023552247,0.00008227722,0.00006935463,0.003602741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987998,0.0006256474,0.00003162303,0.00009713175,0.00036833232,0.0000773418],"domain_scores_gemma":[0.99372745,0.0053172205,0.00027007723,0.00032948627,0.00027846312,0.00007719843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021319422,0.0007246031,0.0006544256,0.000651587,0.00053815794,0.0008896378,0.00088373065,0.0012653875,0.0008793246],"category_scores_gemma":[0.008875515,0.00036755452,0.0004633207,0.0010522512,0.0026507326,0.0023100434,0.0015979998,0.0015438616,0.00016224773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049802053,0.000040372342,0.0002925118,0.00011520132,0.00001712527,0.00007279181,0.00010674529,0.7495737,0.0029702228,0.21850601,0.00085255,0.027403016],"study_design_scores_gemma":[0.000008740199,0.000046440833,0.000078358404,0.000017061475,0.0000057346965,0.000033492277,0.000022395017,0.9339549,0.0007194777,0.06422553,0.0008787551,0.000009111853],"about_ca_topic_score_codex":0.0017216875,"about_ca_topic_score_gemma":0.0016577228,"teacher_disagreement_score":0.0021319422,"about_ca_system_score_codex":0.0009930875,"about_ca_system_score_gemma":0.0010132877,"threshold_uncertainty_score":0.011274934},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01659318,0.00038381742,0.9769632,0.00016786766,0.00006864785,0.00012187186,0.000026935315,0.00015673853,0.005517797],"genre_scores_gemma":[0.8592115,0.000821644,0.13489775,0.00019974157,0.000060683193,0.00052182213,0.00007468589,0.00003706243,0.0041751717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993636,0.00021106364,0.00003050195,0.00006276746,0.0002564602,0.000075600394],"domain_scores_gemma":[0.9988483,0.00060648756,0.00014744824,0.0001569053,0.00018680045,0.00005405428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009774342,0.00039628267,0.00034659426,0.0004686755,0.0007206203,0.0005794206,0.0010876588,0.00050400797,0.0009540688],"category_scores_gemma":[0.0022726203,0.00017575815,0.00023456124,0.00051067176,0.0007519263,0.0010471715,0.001461631,0.0005726276,0.0001559077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030149243,0.00016424751,0.0015306625,0.00047737983,0.000108033324,0.0013673522,0.0011389898,0.23540142,0.061796017,0.46861914,0.0057197907,0.22337544],"study_design_scores_gemma":[0.000046496072,0.00016093573,0.00026055815,0.000041654606,0.000052703635,0.0008523622,0.0001822474,0.89824456,0.009126043,0.06930495,0.021668788,0.000058766902],"about_ca_topic_score_codex":0.00079288665,"about_ca_topic_score_gemma":0.001312362,"teacher_disagreement_score":0.0010876588,"about_ca_system_score_codex":0.00045367845,"about_ca_system_score_gemma":0.00074605,"threshold_uncertainty_score":0.0051692724},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08009685,0.0026245792,0.9064524,0.0004401335,0.00015552646,0.00009779405,0.000056822435,0.0002675838,0.009808348],"genre_scores_gemma":[0.96965224,0.0010496789,0.025391776,0.00009989734,0.0001387645,0.00011267786,0.000042762636,0.000033007364,0.0034792365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978921,0.0009855111,0.00007059302,0.00021176282,0.00058275927,0.00025734337],"domain_scores_gemma":[0.9892614,0.008874241,0.0006351994,0.00038442048,0.00064006227,0.00020462362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027371594,0.000694512,0.0012365681,0.0010452789,0.0010506515,0.0013820747,0.0015587371,0.0011108292,0.00066709635],"category_scores_gemma":[0.009132366,0.000915336,0.00046026925,0.0018806162,0.0017935784,0.0014777657,0.0016324042,0.0008674027,0.00018822248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016954982,0.00009389067,0.0013132894,0.00015338452,0.00009546495,0.00050073257,0.00023475254,0.90049565,0.003165148,0.06398786,0.0014922114,0.028298095],"study_design_scores_gemma":[0.000016893144,0.00004444472,0.00021350566,0.000008165033,0.000024402778,0.0001260961,0.00004046796,0.98079,0.00044691886,0.017720137,0.00055748114,0.000011517419],"about_ca_topic_score_codex":0.0022795778,"about_ca_topic_score_gemma":0.0027207537,"teacher_disagreement_score":0.0027371594,"about_ca_system_score_codex":0.0010584051,"about_ca_system_score_gemma":0.0013600452,"threshold_uncertainty_score":0.014475703},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005114386,0.00070640026,0.99225414,0.00018688751,0.000023612598,0.000024250136,0.000024127505,0.000051988674,0.0016142314],"genre_scores_gemma":[0.765462,0.0040560607,0.2263423,0.0002790115,0.0002520637,0.00030550192,0.0001802458,0.000056709552,0.003066206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969163,0.0016834051,0.00011154543,0.0003060135,0.0008284978,0.0001542485],"domain_scores_gemma":[0.9936568,0.005145916,0.00031680235,0.00017108567,0.00062042865,0.00008901348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042092255,0.00086847163,0.0014228473,0.0011730951,0.00068038766,0.0015423439,0.0015116927,0.0011907559,0.0009781301],"category_scores_gemma":[0.011816578,0.0007781142,0.00058660435,0.001754667,0.0018400521,0.0023986297,0.0011964411,0.0012479572,0.00032946383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000887036,0.00003989002,0.00081260357,0.0001475391,0.00007755695,0.00018194878,0.0002043792,0.78983086,0.0009984743,0.15103187,0.0015879114,0.054998286],"study_design_scores_gemma":[0.00001836354,0.000024802144,0.00012342657,0.000017442751,0.000014809119,0.000038480273,0.000013600916,0.93102086,0.00029286213,0.06774612,0.0006714888,0.000017696291],"about_ca_topic_score_codex":0.0045688804,"about_ca_topic_score_gemma":0.0030745643,"teacher_disagreement_score":0.0045688804,"about_ca_system_score_codex":0.0014983916,"about_ca_system_score_gemma":0.0011788859,"threshold_uncertainty_score":0.022260725},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009029735,0.00020406995,0.97900224,0.00014980538,0.000048091548,0.00006338696,0.0001071009,0.0002058043,0.011189734],"genre_scores_gemma":[0.3297959,0.0013325905,0.65355384,0.00021243528,0.00009285594,0.0002731125,0.00030421358,0.00040120824,0.014033859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972004,0.00007542137,0.0000159415,0.00003584003,0.00012923377,0.000023481502],"domain_scores_gemma":[0.99940133,0.000293677,0.000058998416,0.00016465258,0.00006709207,0.00001430669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005484199,0.00055330497,0.00030654776,0.00033173597,0.00029768585,0.000735467,0.0003937777,0.0004925247,0.0064173155],"category_scores_gemma":[0.002559271,0.00017665248,0.00027986977,0.00045535737,0.00074522145,0.0011883298,0.0008194026,0.00095799967,0.0019442627],"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.00013750157,0.00007103265,0.00037574244,0.00040434118,0.000021742093,0.00039500516,0.000322073,0.17879666,0.04470297,0.5636476,0.004682864,0.20644243],"study_design_scores_gemma":[0.000016836555,0.00011304612,0.00028856247,0.00007144684,0.00001603832,0.00071640033,0.00005820598,0.74554163,0.04931552,0.17873137,0.025089376,0.00004150648],"about_ca_topic_score_codex":0.00086742867,"about_ca_topic_score_gemma":0.0014507815,"teacher_disagreement_score":0.0064173155,"about_ca_system_score_codex":0.00039021883,"about_ca_system_score_gemma":0.0008475549,"threshold_uncertainty_score":0.021468043},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040954333,0.0021241852,0.9328647,0.0004199947,0.00025970623,0.00004596366,0.00009248196,0.0001893998,0.023049135],"genre_scores_gemma":[0.7745479,0.0035955806,0.1924574,0.00011386145,0.0003514886,0.00012619648,0.000104798695,0.00014191533,0.028560901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981576,0.000058122616,0.000009652428,0.00003219711,0.00005844823,0.000025913278],"domain_scores_gemma":[0.999579,0.00027347525,0.000033783323,0.00003662867,0.000057512218,0.000019432053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042101403,0.00049754675,0.00035884438,0.0002846357,0.00031172685,0.00075707893,0.00064858,0.00042991218,0.0015243043],"category_scores_gemma":[0.00093518617,0.00024931855,0.0002093283,0.00075558526,0.00054444384,0.0008801453,0.00040512191,0.000710838,0.00028622986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015558538,0.000049516068,0.00014477888,0.00013143929,0.000022330032,0.00015672269,0.00013573193,0.528593,0.014133939,0.35815945,0.0032265584,0.095090896],"study_design_scores_gemma":[0.000019142117,0.00006259351,0.00009798226,0.00001896421,0.000017340246,0.00007843097,0.00002520091,0.844652,0.002454389,0.14781173,0.0047434843,0.000018777228],"about_ca_topic_score_codex":0.0013582561,"about_ca_topic_score_gemma":0.0020184384,"teacher_disagreement_score":0.0015243043,"about_ca_system_score_codex":0.0007255141,"about_ca_system_score_gemma":0.000621439,"threshold_uncertainty_score":0.0052639246},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0078075896,0.004828291,0.022502633,0.005892022,0.0052940156,0.00030636386,0.0029178532,0.0028895028,0.94756174],"genre_scores_gemma":[0.056203384,0.0033511722,0.0119723845,0.002820942,0.0008947613,0.00026196643,0.0042713936,0.00061755284,0.9196064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926084,0.00011544167,0.000047806025,0.00020862838,0.0002529146,0.00011440202],"domain_scores_gemma":[0.9992933,0.000067375724,0.000049093458,0.0001514887,0.00031973718,0.000118991404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070022314,0.00073703093,0.00058547297,0.0013315971,0.002037914,0.0033397914,0.0009381134,0.0017053538,0.38998917],"category_scores_gemma":[0.0014988341,0.0002584614,0.00045997452,0.0012143938,0.00072907243,0.001739342,0.0029144292,0.0010812083,0.19941813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004503114,0.000111154164,0.0019115689,0.00081292243,0.00003335115,0.0005978523,0.0006780471,0.00073747494,0.0112896515,0.08226099,0.23251505,0.66860163],"study_design_scores_gemma":[0.00001776716,0.000054938388,0.00080055994,0.00008841524,0.0000080245945,0.0002913189,0.00013391387,0.000674477,0.0014471308,0.0056674536,0.9908037,0.000012245535],"about_ca_topic_score_codex":0.0023750789,"about_ca_topic_score_gemma":0.0023710942,"teacher_disagreement_score":0.38998917,"about_ca_system_score_codex":0.0013535023,"about_ca_system_score_gemma":0.0014550928,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53713584,0.0044724313,0.43518925,0.0011832126,0.00017595533,0.000067584406,0.0009695927,0.0006449017,0.02016117],"genre_scores_gemma":[0.995374,0.00048046318,0.0027547835,0.000036086825,0.000032299988,0.000012522699,0.00007794448,0.000017614053,0.0012143136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912506,0.00028046145,0.000029523513,0.000092781345,0.00021267313,0.00025945422],"domain_scores_gemma":[0.994272,0.0042535146,0.00034950735,0.00023775171,0.00075699604,0.00013022526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001771915,0.0009796917,0.0011972985,0.0006585973,0.00051603734,0.0014314314,0.0011045261,0.0008032309,0.0021910237],"category_scores_gemma":[0.0066877296,0.00043267416,0.0004161504,0.0010015282,0.0011152055,0.0013538889,0.0011718548,0.00078720256,0.0002440019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005794714,0.00004417356,0.0020365303,0.00018908372,0.00007956968,0.0006209979,0.00026219198,0.95915514,0.0039379955,0.020767529,0.0014155621,0.010911709],"study_design_scores_gemma":[0.000010108164,0.0000498187,0.0004901096,0.000015018635,0.00003251778,0.00014049043,0.000078953024,0.9940001,0.00058292586,0.004425823,0.00016165599,0.000012509325],"about_ca_topic_score_codex":0.0067138914,"about_ca_topic_score_gemma":0.0060823457,"teacher_disagreement_score":0.0067138914,"about_ca_system_score_codex":0.0017110548,"about_ca_system_score_gemma":0.0013001579,"threshold_uncertainty_score":0.013349652},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045736797,0.0007688791,0.95168865,0.00015790816,0.00003665099,0.000030075798,0.000032847405,0.00012991141,0.0014182571],"genre_scores_gemma":[0.97346413,0.00028294706,0.025193853,0.000038942435,0.000021555828,0.000048952203,0.000019067633,0.000018095068,0.000912324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992506,0.0003389553,0.000023528699,0.00011712038,0.00012739986,0.00014225474],"domain_scores_gemma":[0.99884987,0.00077508757,0.00013566151,0.00005363524,0.000121923564,0.000063817104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001364653,0.0007588577,0.0011562654,0.0003706289,0.0004645566,0.0011150005,0.0013853256,0.0005810867,0.00077889534],"category_scores_gemma":[0.0026374976,0.0003852891,0.00031015926,0.0007191676,0.0008158525,0.0011055829,0.0008623945,0.0005400494,0.00014712884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009224343,0.0000377806,0.00021019178,0.000044101635,0.00002664044,0.00009385282,0.000052328804,0.96869916,0.0023707463,0.015170519,0.000399173,0.012803428],"study_design_scores_gemma":[0.0000054098773,0.000014975919,0.000028335515,0.0000013181328,0.0000031455781,0.000012024151,0.000005050858,0.99774903,0.00026312238,0.001830523,0.00008423252,0.0000028032127],"about_ca_topic_score_codex":0.002140246,"about_ca_topic_score_gemma":0.0018713983,"teacher_disagreement_score":0.002140246,"about_ca_system_score_codex":0.000974534,"about_ca_system_score_gemma":0.0009244591,"threshold_uncertainty_score":0.0072170496},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6939169,0.0010176476,0.27053905,0.0019243269,0.00010412634,0.0004690221,0.0006582949,0.0007855129,0.03058509],"genre_scores_gemma":[0.97184914,0.0003837935,0.025913348,0.00019766476,0.000036874422,0.0001715205,0.00022727675,0.00010452242,0.0011158856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973888,0.0013895921,0.00011163013,0.00042778344,0.0003781451,0.00030408005],"domain_scores_gemma":[0.95603687,0.033458617,0.004136606,0.0027057987,0.0016524795,0.0020097052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054885247,0.0007525886,0.001029016,0.0030379551,0.0016555437,0.002035739,0.0013142476,0.0010152648,0.007111762],"category_scores_gemma":[0.050827026,0.0006618216,0.0009843042,0.0018056649,0.0025930614,0.003738081,0.0020680793,0.001212328,0.0005836597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092087267,0.00029396353,0.015158847,0.0003671143,0.0002253921,0.00040963368,0.00067225,0.7200518,0.0076260883,0.21283521,0.005922269,0.035516575],"study_design_scores_gemma":[0.00009617512,0.00027939607,0.0045063053,0.00009008043,0.00008338645,0.00040053105,0.00041668225,0.8535855,0.0032200841,0.13533896,0.0019207968,0.00006214687],"about_ca_topic_score_codex":0.004019035,"about_ca_topic_score_gemma":0.0033437123,"teacher_disagreement_score":0.007111762,"about_ca_system_score_codex":0.0026652832,"about_ca_system_score_gemma":0.0013276632,"threshold_uncertainty_score":0.029026449},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20369168,0.0021191253,0.7670055,0.0013631601,0.0002817252,0.00018567275,0.0008575128,0.0009581288,0.023537552],"genre_scores_gemma":[0.9746721,0.00035805054,0.02048031,0.00011625757,0.000039543294,0.000043998945,0.0001771562,0.000015683087,0.0040969974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930954,0.00017694112,0.000030384286,0.00007087408,0.00017469266,0.0002376382],"domain_scores_gemma":[0.99916196,0.00037040064,0.000053762124,0.00013200637,0.0002467098,0.000035208468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070107984,0.0008629543,0.0006539676,0.00038772036,0.0008968505,0.00087655324,0.00058340136,0.00079137087,0.0018477505],"category_scores_gemma":[0.0019277857,0.00027040025,0.00045063268,0.00047949873,0.00047834832,0.0005686933,0.0010704527,0.00045587638,0.0006262339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001032818,0.0002531278,0.0045144437,0.00037957678,0.0002455495,0.0017017007,0.00097317895,0.60824656,0.1106671,0.06346141,0.0097583,0.19876632],"study_design_scores_gemma":[0.000041434072,0.00033462126,0.00063256134,0.000028938888,0.00010684943,0.0005986079,0.00023663028,0.96146214,0.019827474,0.013380129,0.0033104895,0.0000401638],"about_ca_topic_score_codex":0.007184449,"about_ca_topic_score_gemma":0.022913642,"teacher_disagreement_score":0.007184449,"about_ca_system_score_codex":0.0007059308,"about_ca_system_score_gemma":0.0018141493,"threshold_uncertainty_score":0.014285266},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065499255,0.0006518846,0.9882967,0.00028139583,0.000064287786,0.00004824921,0.00022330857,0.00022391508,0.0036603208],"genre_scores_gemma":[0.8563763,0.0037071258,0.12498528,0.00029019054,0.00022097131,0.0010972271,0.0009396616,0.00013051055,0.01225267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993818,0.0002470942,0.000029917212,0.000088729474,0.00016721367,0.00008522165],"domain_scores_gemma":[0.99662966,0.0025944847,0.00027279678,0.00012809747,0.00031918552,0.000055704728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012268644,0.0010321317,0.000961977,0.00082993,0.0005750574,0.0011480991,0.0012866167,0.0014271683,0.003200978],"category_scores_gemma":[0.004997094,0.0005107859,0.00097646983,0.0009140365,0.0011263437,0.0013568205,0.00074785016,0.0018146641,0.000668307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018723667,0.00001733935,0.0004265248,0.000040396593,0.000018348319,0.00007977874,0.0000734215,0.9173673,0.00044112385,0.0762628,0.0005858188,0.0046684793],"study_design_scores_gemma":[0.0000033189792,0.000006069324,0.000049576054,0.00000611681,0.000004465489,0.0000070819538,0.0000063682387,0.9845106,0.00007697773,0.014831381,0.0004934309,0.000004694476],"about_ca_topic_score_codex":0.017333997,"about_ca_topic_score_gemma":0.011879752,"teacher_disagreement_score":0.017333997,"about_ca_system_score_codex":0.0019851557,"about_ca_system_score_gemma":0.0015100475,"threshold_uncertainty_score":0.034466207},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0121171335,0.00035076012,0.98549336,0.00032567876,0.000031587115,0.000034120316,0.000029566065,0.00006329324,0.001554455],"genre_scores_gemma":[0.7329595,0.0013361243,0.26330125,0.00015122263,0.00012614836,0.00021758766,0.00013308467,0.000042982734,0.0017320274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932563,0.00024113884,0.000026190717,0.00007333448,0.00028080764,0.000052893738],"domain_scores_gemma":[0.99790573,0.0015682154,0.00016338352,0.00014227613,0.00018328613,0.000037088517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012015611,0.0005744036,0.0005987478,0.00044603256,0.00039185662,0.00061381166,0.0008521355,0.0007086644,0.00064073515],"category_scores_gemma":[0.0043787365,0.00027256852,0.00039115534,0.00072985375,0.0009932824,0.001615905,0.0010403849,0.0011005695,0.00011911327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006376126,0.00003453803,0.00040419094,0.00015643373,0.000020710599,0.000056580673,0.00009667842,0.8963561,0.008635031,0.04971774,0.00092347234,0.043534722],"study_design_scores_gemma":[0.0000034492957,0.000016181864,0.000047476537,0.000006429811,0.0000030671326,0.000017176832,0.000011635202,0.99131155,0.0010781019,0.0071216132,0.00037976628,0.0000036558686],"about_ca_topic_score_codex":0.002162005,"about_ca_topic_score_gemma":0.0027468514,"teacher_disagreement_score":0.002162005,"about_ca_system_score_codex":0.0009406767,"about_ca_system_score_gemma":0.0012619705,"threshold_uncertainty_score":0.006825149},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026154388,0.0004371777,0.97157145,0.00017626134,0.00007822594,0.000070415066,0.000028157388,0.00052488095,0.00095905137],"genre_scores_gemma":[0.53250754,0.0004140152,0.46380088,0.00026831307,0.00012921884,0.00015691106,0.000081416496,0.00003342436,0.0026082864],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933726,0.00022738222,0.000029482087,0.00010956976,0.0002518078,0.000044555574],"domain_scores_gemma":[0.9995403,0.00013706059,0.00007969561,0.00007076575,0.00014792418,0.000024290584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011239289,0.00055071816,0.0005991748,0.00027423992,0.00029906438,0.00060473185,0.0014669962,0.0010470005,0.0010274568],"category_scores_gemma":[0.0010276493,0.00033221924,0.00038831015,0.00020355677,0.00047534838,0.0007455266,0.00053528923,0.00068153144,0.00073805783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011960719,0.00036618055,0.0031319275,0.00067802356,0.00029728224,0.0010035151,0.00045195577,0.11441885,0.50051695,0.05404924,0.0042446083,0.31964535],"study_design_scores_gemma":[0.00024561936,0.0013738181,0.0006003421,0.00004108036,0.00014587994,0.0009359678,0.00002937309,0.889958,0.09511425,0.0025782122,0.008883222,0.00009423721],"about_ca_topic_score_codex":0.00044732462,"about_ca_topic_score_gemma":0.00074659195,"teacher_disagreement_score":0.0014669962,"about_ca_system_score_codex":0.00046918957,"about_ca_system_score_gemma":0.00049967266,"threshold_uncertainty_score":0.0059440136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008111395,0.102848165,0.7583862,0.0077313003,0.001846034,0.000080279875,0.00028943436,0.00015225001,0.120555],"genre_scores_gemma":[0.6028617,0.19510596,0.16512685,0.0033772285,0.0072693513,0.00048055127,0.00038723048,0.00014895249,0.02524218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998468,0.0005083633,0.00006869971,0.00018872568,0.000600245,0.00016602236],"domain_scores_gemma":[0.99688053,0.0021900989,0.0001976692,0.00028483156,0.00036796846,0.00007901035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014467956,0.0009994445,0.0010263842,0.0017949911,0.00083005894,0.003620318,0.0020015438,0.0027556783,0.0026813364],"category_scores_gemma":[0.0032275228,0.00063241285,0.0008721108,0.0023275123,0.004165465,0.0059491484,0.001424039,0.003989236,0.0010757056],"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.000008641963,0.000013865217,0.00006985395,0.000237613,0.00001667664,0.0000955592,0.00008992071,0.01214767,0.0005222207,0.9723769,0.0019707293,0.012450422],"study_design_scores_gemma":[0.0000066562898,0.00006283412,0.00013741195,0.00021772944,0.000022133467,0.00035651855,0.00011941096,0.04129257,0.0007862727,0.9166933,0.04026849,0.00003680676],"about_ca_topic_score_codex":0.00083724863,"about_ca_topic_score_gemma":0.0005723199,"teacher_disagreement_score":0.003620318,"about_ca_system_score_codex":0.0020891528,"about_ca_system_score_gemma":0.0010896766,"threshold_uncertainty_score":0.015157998},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010628246,0.00034743283,0.9866545,0.00028823636,0.000020563788,0.00002643355,0.000010686092,0.000110137385,0.0019137112],"genre_scores_gemma":[0.86460954,0.00055966526,0.13228856,0.00011518042,0.00010436781,0.0001716234,0.000033109853,0.00005573491,0.0020621852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980191,0.001123999,0.000047803154,0.00019574077,0.00042321213,0.00019019109],"domain_scores_gemma":[0.9977652,0.0016339493,0.0001763137,0.00015022059,0.00018326697,0.000091060574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024828056,0.00090455316,0.0015314296,0.0004391301,0.000590785,0.0018170538,0.0015396433,0.0012453183,0.0009168412],"category_scores_gemma":[0.004548236,0.00049229077,0.0006315546,0.0008700308,0.0014566254,0.0018413487,0.0014956667,0.0016683382,0.00024794153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082242914,0.00005690409,0.00017110124,0.000042953132,0.000023423205,0.000047345697,0.00007725874,0.9310275,0.0009883456,0.03534369,0.0007157483,0.031423427],"study_design_scores_gemma":[0.0000072544285,0.000010152765,0.00001873621,0.000002244385,0.0000025876723,0.0000061709966,0.000006027591,0.99275666,0.0001911558,0.0068953526,0.00010086902,0.000002878798],"about_ca_topic_score_codex":0.0020973145,"about_ca_topic_score_gemma":0.001475289,"teacher_disagreement_score":0.0024828056,"about_ca_system_score_codex":0.001474027,"about_ca_system_score_gemma":0.0013908586,"threshold_uncertainty_score":0.013130486},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022345748,0.00012022833,0.97560465,0.00005914553,0.000008937802,0.000020818145,0.000016283382,0.000075472955,0.0017487755],"genre_scores_gemma":[0.8669874,0.00027631002,0.13040943,0.00003877244,0.000029081895,0.00008840853,0.00004378886,0.000044550263,0.0020822196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995315,0.00017736854,0.000022015329,0.000073058334,0.00014363028,0.000052456147],"domain_scores_gemma":[0.99948597,0.0002939398,0.000077006865,0.000049231447,0.00007080564,0.000023104307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005799361,0.00065066834,0.00050899613,0.0003864007,0.00030534164,0.00059331924,0.0008104514,0.00044693396,0.00078290363],"category_scores_gemma":[0.0014485739,0.00027878533,0.0002890203,0.0005167405,0.0004999204,0.0009972231,0.00071780226,0.00051560736,0.00021746353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112943446,0.000037455415,0.00029960374,0.000056786976,0.000022035792,0.00006162,0.000076141274,0.90420973,0.012863634,0.023053607,0.00044152228,0.05876487],"study_design_scores_gemma":[0.000008239679,0.000030795465,0.00007540959,0.0000023930263,0.0000045525403,0.000021243392,0.000008635826,0.9934835,0.0016724836,0.0043640686,0.00032377153,0.000004898343],"about_ca_topic_score_codex":0.00094837416,"about_ca_topic_score_gemma":0.0014230696,"teacher_disagreement_score":0.00094837416,"about_ca_system_score_codex":0.000595939,"about_ca_system_score_gemma":0.0005628604,"threshold_uncertainty_score":0.0043238997},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05446177,0.00040455995,0.9404244,0.00017739773,0.00002886935,0.000050856765,0.00002771159,0.00009870573,0.004325749],"genre_scores_gemma":[0.9192761,0.00032087992,0.078208745,0.00006245805,0.000027442193,0.0000887956,0.000028716086,0.000023356259,0.0019636194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907446,0.0004485075,0.000025381245,0.00013026086,0.00018935626,0.00013197518],"domain_scores_gemma":[0.999275,0.00045749525,0.00007571433,0.00006966974,0.000089043795,0.000033067838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010113409,0.0009240874,0.0009228319,0.00029499707,0.00046819326,0.0010962082,0.00076150213,0.0008671399,0.00076390133],"category_scores_gemma":[0.001677768,0.00041678047,0.0006172189,0.0005520791,0.00090761716,0.0011263571,0.0010069434,0.00083077385,0.00019713896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000686725,0.000057702113,0.00045161278,0.00006135005,0.000031389212,0.0002620588,0.00012824354,0.9454826,0.008025113,0.029193152,0.00033308443,0.015905028],"study_design_scores_gemma":[0.0000054552984,0.000035186178,0.0000587971,0.0000024285966,0.000006568389,0.00004534999,0.000015521502,0.99420893,0.001299289,0.004069457,0.00024644265,0.000006556579],"about_ca_topic_score_codex":0.0018762166,"about_ca_topic_score_gemma":0.0016272693,"teacher_disagreement_score":0.0018762166,"about_ca_system_score_codex":0.00084076874,"about_ca_system_score_gemma":0.0007919642,"threshold_uncertainty_score":0.0061002374},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3417635,0.004240772,0.63936555,0.00055059197,0.00006616962,0.00008306894,0.00029465524,0.0005509617,0.0130848065],"genre_scores_gemma":[0.9827884,0.001281005,0.01447925,0.000060964307,0.000031584852,0.000052709012,0.00008979813,0.0000325456,0.0011838013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870276,0.00046527173,0.000055836947,0.00013539764,0.0004191123,0.00022159381],"domain_scores_gemma":[0.993255,0.0048781317,0.00055630086,0.0002521328,0.0009926233,0.000065849905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018129874,0.0013282867,0.0009236813,0.0010167912,0.00071906415,0.0012500559,0.00090839964,0.001237447,0.0013742744],"category_scores_gemma":[0.00846195,0.00032691756,0.00049508293,0.0011849728,0.0011347326,0.0015560625,0.0010644955,0.00064280344,0.0003295571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001106293,0.000016239484,0.00089482527,0.00011217636,0.000036739122,0.00018952297,0.00017293528,0.9721584,0.0048750476,0.011640376,0.0003204904,0.009472486],"study_design_scores_gemma":[0.000004057842,0.00007843697,0.00045336693,0.000014068527,0.000021127742,0.00016252734,0.000052257412,0.9945537,0.0019918422,0.0024600427,0.00019082274,0.000017737011],"about_ca_topic_score_codex":0.005570765,"about_ca_topic_score_gemma":0.003359724,"teacher_disagreement_score":0.005570765,"about_ca_system_score_codex":0.0019599753,"about_ca_system_score_gemma":0.0008002399,"threshold_uncertainty_score":0.014220715},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44425395,0.0008271913,0.5508473,0.00013126893,0.000021418764,0.000035582056,0.000028738881,0.00011929806,0.0037352748],"genre_scores_gemma":[0.9854359,0.00033408977,0.013646517,0.000019623416,0.00000941831,0.000018678636,0.000009951094,0.00000641197,0.0005193572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999225,0.00031480423,0.000026569094,0.00007507896,0.000278268,0.000080253296],"domain_scores_gemma":[0.99604046,0.0030604412,0.00040295493,0.0001486233,0.00031963695,0.000027827047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010254165,0.0005509473,0.00039637487,0.00025931644,0.00028190447,0.00047655654,0.00037602332,0.00044918183,0.0003353546],"category_scores_gemma":[0.0041663274,0.00022439839,0.00027004653,0.0006547325,0.00065636187,0.0008623974,0.0005862419,0.00030925276,0.00008405004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019497353,0.00004713911,0.0016082571,0.00010556108,0.000084917265,0.0003153265,0.00021575963,0.9260992,0.02497467,0.017112032,0.00021270811,0.029029481],"study_design_scores_gemma":[0.000010968538,0.00012769112,0.00042021452,0.000007402761,0.000042547694,0.00014359,0.000037400576,0.98980075,0.0074230265,0.001730592,0.00024477998,0.000010971772],"about_ca_topic_score_codex":0.001506769,"about_ca_topic_score_gemma":0.0019317192,"teacher_disagreement_score":0.001506769,"about_ca_system_score_codex":0.0004783791,"about_ca_system_score_gemma":0.00051575806,"threshold_uncertainty_score":0.0054230094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025842661,0.0011706168,0.95897305,0.00036231658,0.000055261837,0.00007317695,0.00022136589,0.00016286282,0.013138724],"genre_scores_gemma":[0.892622,0.0023024422,0.098109454,0.00021248922,0.0001624072,0.0002650025,0.00024369122,0.0001239493,0.005958561],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973894,0.0011659487,0.000097942335,0.0003182381,0.00057239615,0.00045610947],"domain_scores_gemma":[0.9946943,0.0036803829,0.00042814424,0.000314388,0.00073257426,0.0001502002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027646245,0.0022902514,0.0015351694,0.00077733456,0.0007391833,0.0025467821,0.0014912942,0.0011583837,0.0027201213],"category_scores_gemma":[0.006853202,0.00067125994,0.00094011537,0.0017346942,0.0021137402,0.0024850836,0.0020761213,0.0017197218,0.00082794105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002902874,0.00012756474,0.0004871414,0.00057290075,0.00012196946,0.00040899916,0.00022532893,0.8211479,0.011158608,0.13419119,0.0042962846,0.026971739],"study_design_scores_gemma":[0.000033779495,0.00009351444,0.00021310832,0.000025074629,0.000034690947,0.0002044038,0.00007571096,0.9464783,0.0032521694,0.048267037,0.0012925378,0.00002962289],"about_ca_topic_score_codex":0.0019886286,"about_ca_topic_score_gemma":0.0015308172,"teacher_disagreement_score":0.0027646245,"about_ca_system_score_codex":0.0016045009,"about_ca_system_score_gemma":0.0013943891,"threshold_uncertainty_score":0.0146209},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06037322,0.00074330467,0.923646,0.0007356081,0.00012155112,0.000074751835,0.00015334527,0.00013444248,0.014017862],"genre_scores_gemma":[0.9669971,0.0010840397,0.02216468,0.00011222411,0.00006942814,0.00021036161,0.00017194154,0.00003488068,0.009155373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997204,0.00007462685,0.0000115036855,0.00006434998,0.00009359296,0.00003545808],"domain_scores_gemma":[0.9996381,0.00014878418,0.00007005209,0.000023651319,0.00008689213,0.00003248018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003695523,0.00044643792,0.00045907652,0.0006462883,0.0005704951,0.0009336504,0.0009916074,0.00074342225,0.001298512],"category_scores_gemma":[0.0011114003,0.00024535615,0.00058214046,0.00058540795,0.00065895426,0.0013215377,0.0006116524,0.00084058294,0.00019605998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013950218,0.000015647809,0.00059810677,0.000023907094,0.000023391602,0.00013706915,0.00006698494,0.93007463,0.0010829761,0.06287694,0.0007148965,0.0043715257],"study_design_scores_gemma":[0.000002396011,0.000006459255,0.0000913249,0.0000015327026,0.0000038494054,0.00001677608,0.000007838234,0.9933356,0.000046136272,0.0061342004,0.0003503592,0.000003392135],"about_ca_topic_score_codex":0.007236682,"about_ca_topic_score_gemma":0.0031983424,"teacher_disagreement_score":0.007236682,"about_ca_system_score_codex":0.001191881,"about_ca_system_score_gemma":0.00056788424,"threshold_uncertainty_score":0.014389157},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5787022,0.001455682,0.39974406,0.0003396241,0.000055445096,0.00009718128,0.00014292846,0.00026335628,0.019199558],"genre_scores_gemma":[0.9928449,0.0003201795,0.005804532,0.000020721067,0.000010399402,0.00002056305,0.000024688276,0.000013026517,0.0009409962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937797,0.00024154597,0.00002643475,0.00007665521,0.00013838579,0.00013890635],"domain_scores_gemma":[0.9961403,0.0028806091,0.00029100972,0.00028445618,0.00032509063,0.00007848572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019410786,0.00047772858,0.00050814246,0.0005383462,0.00041175153,0.0009551174,0.00056885916,0.00043107354,0.001196917],"category_scores_gemma":[0.0077753915,0.00025897793,0.00027356984,0.0005054093,0.0008830009,0.0008496265,0.0006152226,0.00055372546,0.0001769853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064658624,0.00006203945,0.0044042645,0.00015993405,0.00006121828,0.0004708754,0.0006160314,0.7617446,0.017391292,0.16209626,0.0015761984,0.050770614],"study_design_scores_gemma":[0.000022425378,0.00013540313,0.0014571446,0.000022441616,0.000050366907,0.00034143147,0.00012859421,0.9715758,0.005413861,0.01989156,0.00092645996,0.000034517147],"about_ca_topic_score_codex":0.0020604783,"about_ca_topic_score_gemma":0.0021319147,"teacher_disagreement_score":0.0020604783,"about_ca_system_score_codex":0.0013873614,"about_ca_system_score_gemma":0.00078259374,"threshold_uncertainty_score":0.010265589},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046999035,0.000088016524,0.9933143,0.000059493876,0.000021572523,0.00002926078,0.000014469866,0.0004417827,0.0013312063],"genre_scores_gemma":[0.1772079,0.0002087057,0.8199821,0.00007475318,0.000052774652,0.00013921199,0.0002088676,0.00013524143,0.001990391],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986041,0.00033772734,0.00006909262,0.00024469147,0.0005453651,0.0001990411],"domain_scores_gemma":[0.99853885,0.0006353269,0.00007825221,0.0003680079,0.0003219731,0.000057650283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073901284,0.0007812548,0.0008520952,0.0011326699,0.00060316356,0.0008268523,0.0013209248,0.0006351828,0.002118644],"category_scores_gemma":[0.0027714649,0.0002712433,0.00068465725,0.0022031048,0.0007227913,0.0018104868,0.001111043,0.0012327513,0.00053695205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036382547,0.0002229965,0.00088636467,0.00021504807,0.00006186799,0.0001416983,0.00021983027,0.25355223,0.03793168,0.10939533,0.0081044985,0.5889046],"study_design_scores_gemma":[0.00003921887,0.00006674314,0.00009371832,0.0000070820433,0.000015873535,0.00010232644,0.000018430068,0.9731588,0.0069296793,0.017047182,0.0025073641,0.000013624256],"about_ca_topic_score_codex":0.0059263394,"about_ca_topic_score_gemma":0.004027389,"teacher_disagreement_score":0.0059263394,"about_ca_system_score_codex":0.0013751005,"about_ca_system_score_gemma":0.0023576533,"threshold_uncertainty_score":0.011783719},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008972289,0.2393927,0.44994554,0.0060839457,0.0019573024,0.00007476251,0.00007702348,0.00014884118,0.2933476],"genre_scores_gemma":[0.43348843,0.24966098,0.16763376,0.0025806723,0.0056817094,0.00041742588,0.00013089179,0.00007862841,0.14032747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996625,0.00012389354,0.000010413988,0.000049814633,0.0001240697,0.000029370152],"domain_scores_gemma":[0.99961543,0.00024124948,0.000029467637,0.00003467715,0.00006535324,0.000013926988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005965246,0.00058383326,0.0005076162,0.00059910485,0.0005197768,0.0013490609,0.0012863465,0.0015281265,0.0023783646],"category_scores_gemma":[0.001098506,0.00030871487,0.00033582764,0.0013400293,0.0015651777,0.0017930783,0.0007899089,0.0013692615,0.0009990542],"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.000012502056,0.00003956644,0.000116942734,0.000244579,0.0000146089715,0.00018232146,0.00035848827,0.013260766,0.00093054416,0.87620914,0.0083822375,0.10024832],"study_design_scores_gemma":[0.000014175832,0.0001313713,0.0004304091,0.00028770632,0.000019545603,0.00081357855,0.0003066429,0.05990797,0.0008577607,0.73808825,0.19910271,0.000039867933],"about_ca_topic_score_codex":0.0012623137,"about_ca_topic_score_gemma":0.0010889547,"teacher_disagreement_score":0.0023783646,"about_ca_system_score_codex":0.0011428044,"about_ca_system_score_gemma":0.00051580695,"threshold_uncertainty_score":0.008291662},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010693541,0.0005388492,0.97633135,0.00068737974,0.000073397845,0.000053451306,0.00039951963,0.00015195439,0.011070432],"genre_scores_gemma":[0.738546,0.0022250244,0.21534352,0.0005478745,0.0002503649,0.0005425373,0.00095967174,0.00029753835,0.04128746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995012,0.0002317531,0.0000136997005,0.00007146198,0.00010433247,0.0000775268],"domain_scores_gemma":[0.99800235,0.0014789569,0.000159954,0.00007322208,0.0002140129,0.000071554685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084335165,0.0012450088,0.0011692223,0.00084258773,0.00045569384,0.0015309964,0.0020392751,0.0016061241,0.008837175],"category_scores_gemma":[0.0033284621,0.0006727804,0.0006907551,0.0015938804,0.0009538438,0.0017741378,0.0011206436,0.0018802806,0.00095171697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032212367,0.000024267474,0.000091137175,0.000056399087,0.000015854628,0.00005277342,0.000042544587,0.91135716,0.00033297352,0.080092184,0.0027105445,0.005191909],"study_design_scores_gemma":[0.0000063468824,0.0000074266145,0.00001989405,0.000005209086,0.00000500567,0.000010063303,0.000008293604,0.9789144,0.00005921558,0.020546347,0.00041272942,0.0000050116314],"about_ca_topic_score_codex":0.008144812,"about_ca_topic_score_gemma":0.007878752,"teacher_disagreement_score":0.008837175,"about_ca_system_score_codex":0.0014573177,"about_ca_system_score_gemma":0.0012362354,"threshold_uncertainty_score":0.029563248},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09483842,0.0032525368,0.8776685,0.0014393334,0.000299671,0.00018526908,0.00020496098,0.000400915,0.021710362],"genre_scores_gemma":[0.9656899,0.0009520141,0.027025767,0.00022995127,0.00012454751,0.0001422848,0.00009040188,0.000034656616,0.00571047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973507,0.0012162342,0.00006945545,0.00025209866,0.0005319707,0.00057955185],"domain_scores_gemma":[0.9966478,0.0020850783,0.0001619565,0.00030660137,0.0006738676,0.00012466284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025567317,0.0010417461,0.0014020744,0.00065512664,0.0015296304,0.0012670398,0.0014622346,0.0014699782,0.004663509],"category_scores_gemma":[0.00504829,0.00057592767,0.0007686738,0.001005324,0.0011672871,0.0016537666,0.0022783806,0.0010131458,0.0006622097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009303875,0.00017952775,0.0018716065,0.00054098654,0.00020724036,0.0011259874,0.0010285332,0.50275826,0.015976992,0.37599912,0.013718165,0.08566319],"study_design_scores_gemma":[0.000040727093,0.00024635732,0.0005320633,0.000052969113,0.000106244945,0.00037751958,0.00020262541,0.9026108,0.002234004,0.08931592,0.004229386,0.00005140042],"about_ca_topic_score_codex":0.0035207658,"about_ca_topic_score_gemma":0.006654266,"teacher_disagreement_score":0.004663509,"about_ca_system_score_codex":0.0015303545,"about_ca_system_score_gemma":0.0021234036,"threshold_uncertainty_score":0.015600979},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2054553,0.0009767202,0.7845329,0.0004202627,0.000036827758,0.00005802612,0.00005970927,0.00007205693,0.008388189],"genre_scores_gemma":[0.9828401,0.00020944249,0.016061837,0.000019884807,0.0000103516395,0.000024885563,0.000010223685,0.000006921869,0.0008163465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995938,0.00020339598,0.000012506011,0.000039762523,0.00007567372,0.000074891446],"domain_scores_gemma":[0.9986451,0.0010194374,0.00013138888,0.000047137433,0.00012339783,0.000033472177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094072643,0.00047742523,0.00041382862,0.00036095068,0.0003126847,0.0007216209,0.0004730582,0.000491233,0.00078279886],"category_scores_gemma":[0.0028431679,0.00017144627,0.0002387631,0.00040676421,0.00058419176,0.0006555058,0.0006053284,0.0003574566,0.00012291063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007907086,0.000046209057,0.0006245974,0.00005295753,0.000019561763,0.00014772888,0.000051936953,0.94674987,0.0060357023,0.026595676,0.00041018918,0.019186517],"study_design_scores_gemma":[0.0000059126537,0.000025653411,0.00010066827,0.0000030955975,0.000004350721,0.000017362718,0.000013793926,0.9938698,0.0005035226,0.0052860337,0.00016611803,0.0000036683243],"about_ca_topic_score_codex":0.00229565,"about_ca_topic_score_gemma":0.0019009843,"teacher_disagreement_score":0.00229565,"about_ca_system_score_codex":0.0007595598,"about_ca_system_score_gemma":0.0006860031,"threshold_uncertainty_score":0.005510986},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24823345,0.0020677901,0.7428419,0.00036755085,0.00011246342,0.00010420318,0.00005821664,0.0005621841,0.0056522503],"genre_scores_gemma":[0.94662625,0.0008581052,0.051456273,0.000042993444,0.00002569916,0.000030501082,0.00004572972,0.00002434473,0.000890174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979514,0.000062975385,0.000009073468,0.000020007381,0.000085929016,0.00002691276],"domain_scores_gemma":[0.9996208,0.00017634334,0.000040751627,0.000026382333,0.000118054435,0.000017602099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000374244,0.00034521057,0.00023374325,0.00045990243,0.00026905478,0.0003217232,0.0003154315,0.0002042976,0.00046870948],"category_scores_gemma":[0.0012398909,0.00006636657,0.00015017854,0.0004537825,0.0002838279,0.0003618461,0.00030633243,0.0002687548,0.000078327415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005231891,0.00019887308,0.002927205,0.0003311171,0.00008863866,0.0006773889,0.00019088911,0.42970178,0.27795964,0.034918122,0.0021429171,0.2503402],"study_design_scores_gemma":[0.00001126039,0.00011523626,0.000564794,0.000011159855,0.00002084172,0.00013924997,0.000031262254,0.974668,0.02037955,0.0028601997,0.0011872781,0.000011098339],"about_ca_topic_score_codex":0.0024466806,"about_ca_topic_score_gemma":0.0025243282,"teacher_disagreement_score":0.0024466806,"about_ca_system_score_codex":0.00041265215,"about_ca_system_score_gemma":0.00043844542,"threshold_uncertainty_score":0.004864812},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10403528,0.0016166795,0.87258714,0.00025273956,0.00021723441,0.00010650555,0.00015699961,0.00035778419,0.02066962],"genre_scores_gemma":[0.8489651,0.00075248635,0.14439377,0.00011412714,0.00013204066,0.00008151392,0.00010087075,0.0000112622365,0.005448784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942017,0.00016000123,0.0000429173,0.000105187166,0.00019086592,0.000080940124],"domain_scores_gemma":[0.9992084,0.000286262,0.000110328154,0.00014202873,0.00021251304,0.000040536626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000509912,0.0007387393,0.0005974786,0.0003668687,0.00050256564,0.0010962569,0.001091412,0.0008786211,0.0014279275],"category_scores_gemma":[0.0013819976,0.00020432,0.0003831997,0.00051952293,0.00043131807,0.0011181905,0.00049048767,0.0005619804,0.00058219593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006922867,0.00030593586,0.002082024,0.00040929765,0.00019303877,0.001050833,0.000559949,0.56593484,0.06475181,0.09955234,0.00308428,0.2613833],"study_design_scores_gemma":[0.00007069368,0.00036269313,0.00035071632,0.000018702238,0.00005102335,0.0007181841,0.00005549212,0.9710488,0.008012986,0.015170697,0.0041056094,0.000034346234],"about_ca_topic_score_codex":0.0014223475,"about_ca_topic_score_gemma":0.002196624,"teacher_disagreement_score":0.0014279275,"about_ca_system_score_codex":0.0004290569,"about_ca_system_score_gemma":0.0004792141,"threshold_uncertainty_score":0.0047768354},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11867867,0.0009787182,0.87652755,0.00025274928,0.000030350791,0.0000344058,0.000058345675,0.00015068133,0.0032885754],"genre_scores_gemma":[0.9766244,0.0004408988,0.022319652,0.000025034562,0.00002069631,0.000036350324,0.000024252971,0.000010648855,0.0004978869],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921465,0.00040178007,0.000036463698,0.00006702052,0.00019889858,0.000081098166],"domain_scores_gemma":[0.99805224,0.0014652637,0.00020573265,0.00009054158,0.00015593076,0.000030252293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001056481,0.0006009721,0.0005963021,0.00024331704,0.00029166328,0.0005607763,0.00045396676,0.00041910703,0.00056567264],"category_scores_gemma":[0.0043005473,0.0002564706,0.00024139408,0.00058000523,0.00064450054,0.00070622924,0.0006085163,0.0002845448,0.00013449104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012478071,0.00002326172,0.0007451859,0.00009095632,0.00002507815,0.00013084777,0.000102048565,0.9461364,0.0065425257,0.016307976,0.00059149816,0.029179383],"study_design_scores_gemma":[0.0000067035744,0.000041482464,0.00015935737,0.0000042824063,0.000007169759,0.000041974483,0.000020954194,0.9934174,0.0011820935,0.0048976606,0.00021533373,0.000005512359],"about_ca_topic_score_codex":0.0011138406,"about_ca_topic_score_gemma":0.0014320769,"teacher_disagreement_score":0.0011138406,"about_ca_system_score_codex":0.0006946563,"about_ca_system_score_gemma":0.00064462674,"threshold_uncertainty_score":0.00558728},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012308656,0.00043313086,0.98580325,0.00012233069,0.000017776238,0.000020820935,0.000011090295,0.000048825365,0.0012342238],"genre_scores_gemma":[0.77032727,0.001178642,0.22585039,0.00011639681,0.00005506508,0.00022478994,0.000058637834,0.00005563262,0.0021331736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991528,0.00039209033,0.00002650664,0.00013430457,0.00022365926,0.00007059005],"domain_scores_gemma":[0.99919325,0.0005737413,0.000087672255,0.000041742354,0.000082089,0.000021473888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010448612,0.0007784294,0.00097331894,0.0005187792,0.00067674904,0.00075127516,0.0008034154,0.0008103993,0.0006734295],"category_scores_gemma":[0.0028226182,0.0004627738,0.00053671387,0.001120799,0.0010850892,0.0013867981,0.001113058,0.00071381405,0.00014138264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028343899,0.000029344425,0.00013221835,0.000046601548,0.000018015997,0.00002809148,0.000073131145,0.95526034,0.0017876358,0.022604162,0.00049689785,0.01949522],"study_design_scores_gemma":[0.00000395417,0.000017312514,0.000028709359,0.000002591873,0.0000033933693,0.000010612925,0.000010438467,0.99107075,0.00028574164,0.0083284695,0.00023493172,0.0000030982224],"about_ca_topic_score_codex":0.001954104,"about_ca_topic_score_gemma":0.0019639856,"teacher_disagreement_score":0.001954104,"about_ca_system_score_codex":0.00072032405,"about_ca_system_score_gemma":0.0014029698,"threshold_uncertainty_score":0.005525768},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12990722,0.0018085422,0.855702,0.00035427776,0.00009358701,0.00008644833,0.000064596075,0.00026676533,0.011716667],"genre_scores_gemma":[0.9675704,0.00057399645,0.030014694,0.000085093336,0.000027945114,0.000053235726,0.000044540477,0.000038775164,0.0015914472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985043,0.0005707791,0.000059079463,0.00018692728,0.0004924385,0.00018661913],"domain_scores_gemma":[0.99446714,0.0041037025,0.00022238525,0.00056629657,0.00057816785,0.00006228974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002031196,0.00059206516,0.00062485994,0.0004325426,0.00048234325,0.0010654579,0.0012834534,0.00063800154,0.0020066022],"category_scores_gemma":[0.008406993,0.00020073488,0.00023047683,0.0006602574,0.0011443158,0.0015347331,0.0013283436,0.0005893253,0.0003257146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048935896,0.00013116254,0.0015745173,0.00018846238,0.00006316505,0.00022073192,0.00016733665,0.7675639,0.016523192,0.10370794,0.0011616618,0.10820862],"study_design_scores_gemma":[0.000023005445,0.00016388785,0.00039375413,0.000018870274,0.000019098501,0.00016196952,0.00006706389,0.96896654,0.004214804,0.025021981,0.0009270934,0.000021946547],"about_ca_topic_score_codex":0.0007436713,"about_ca_topic_score_gemma":0.0005703709,"teacher_disagreement_score":0.002031196,"about_ca_system_score_codex":0.00058660435,"about_ca_system_score_gemma":0.0006856034,"threshold_uncertainty_score":0.010742128},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1051309,0.00091544114,0.888506,0.0002441848,0.000029353789,0.00003387415,0.00009270243,0.00016898997,0.0048785564],"genre_scores_gemma":[0.966649,0.00058898464,0.030813798,0.000036959773,0.000025186713,0.000032663484,0.00007637325,0.000016599397,0.0017603933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953234,0.00017989536,0.00001667559,0.000058480837,0.00013844295,0.000074126634],"domain_scores_gemma":[0.9988262,0.0006282799,0.0001700623,0.000103214516,0.0002510404,0.000021316062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061024155,0.0003131623,0.0004666029,0.00051091495,0.0004992575,0.00057639164,0.0005745334,0.00038978737,0.00073800614],"category_scores_gemma":[0.0022380434,0.00017799411,0.00032675057,0.00052887574,0.0005498939,0.0006219104,0.00053558935,0.00027377022,0.00018303224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007329069,0.00003477885,0.0022808115,0.000110258065,0.000039186758,0.00044720812,0.00022973421,0.8726676,0.009033767,0.07215986,0.0013029035,0.041620728],"study_design_scores_gemma":[0.0000038263797,0.000058054513,0.00047589152,0.000008733172,0.000016126169,0.00018694047,0.000066115965,0.98420864,0.0018804964,0.011654996,0.0014245077,0.000015718286],"about_ca_topic_score_codex":0.003729932,"about_ca_topic_score_gemma":0.0044188756,"teacher_disagreement_score":0.003729932,"about_ca_system_score_codex":0.0009470549,"about_ca_system_score_gemma":0.0007082701,"threshold_uncertainty_score":0.0074164867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021502795,0.0009119564,0.96930224,0.0002648973,0.000036102916,0.000048164293,0.00011639958,0.000093596165,0.0077238786],"genre_scores_gemma":[0.875155,0.0028287494,0.11379993,0.00016545298,0.0001758351,0.00036344834,0.00018194586,0.00014068942,0.007189092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982363,0.0009449564,0.00006316966,0.00019760834,0.0003586438,0.00019924465],"domain_scores_gemma":[0.9963923,0.0027122574,0.0002702223,0.00015651398,0.00037748963,0.00009126211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002373762,0.0016323647,0.0011978112,0.0006281886,0.0005104228,0.001876014,0.0013130703,0.0011180547,0.0016174028],"category_scores_gemma":[0.005889114,0.00053509284,0.0006453478,0.0012926481,0.0014758813,0.0021832276,0.0015922528,0.001209107,0.000625041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012976886,0.000053260326,0.00026052556,0.0003197705,0.000050853992,0.00021634258,0.0001857028,0.8398108,0.0068630604,0.13362218,0.0016320199,0.01685577],"study_design_scores_gemma":[0.000014573101,0.000042194933,0.0000755965,0.0000161232,0.0000123899645,0.000056257362,0.000027683544,0.9648364,0.0011160836,0.03317103,0.0006203706,0.000011298957],"about_ca_topic_score_codex":0.0011018678,"about_ca_topic_score_gemma":0.0010026576,"teacher_disagreement_score":0.002373762,"about_ca_system_score_codex":0.0016124961,"about_ca_system_score_gemma":0.000818846,"threshold_uncertainty_score":0.0125537515},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31916478,0.002135184,0.6594636,0.0003435862,0.0000535609,0.000022461436,0.00021861549,0.00026909224,0.018329209],"genre_scores_gemma":[0.9953076,0.0004740871,0.0030498928,0.000032464315,0.000018180635,0.000018584924,0.000028491813,0.000017252425,0.0010534646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937207,0.00019512673,0.0000164926,0.00006412837,0.00020300229,0.00014921672],"domain_scores_gemma":[0.9979127,0.0014095501,0.00020083282,0.0001380662,0.00029415434,0.00004470276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009652072,0.000637787,0.0004791433,0.00066030835,0.00033606673,0.0011533898,0.0008976943,0.00052951986,0.0009777243],"category_scores_gemma":[0.00402806,0.00024503516,0.00020735573,0.0005609757,0.0013301679,0.0015844166,0.00062417664,0.00033986883,0.00018594702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006202982,0.000020029956,0.00043625245,0.00008222798,0.000029546567,0.00021529057,0.000116866955,0.8612302,0.007135049,0.12202359,0.00052260415,0.008126311],"study_design_scores_gemma":[0.0000040806917,0.000018223973,0.00021842933,0.000015469848,0.000009555188,0.00006446361,0.000028610573,0.96643716,0.001083459,0.031726312,0.00038304334,0.000011099242],"about_ca_topic_score_codex":0.0027083715,"about_ca_topic_score_gemma":0.0014442957,"teacher_disagreement_score":0.0027083715,"about_ca_system_score_codex":0.0012481736,"about_ca_system_score_gemma":0.00081828557,"threshold_uncertainty_score":0.0090562105},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23443948,0.000925336,0.76208436,0.00014691183,0.00006408598,0.000069475165,0.00002818647,0.00046493867,0.0017773035],"genre_scores_gemma":[0.95939857,0.00014553226,0.03995389,0.00002537306,0.000021015816,0.000016853734,0.000021585238,0.000016277441,0.0004009142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997069,0.000101874575,0.000015066707,0.000045287437,0.0000995064,0.00003131072],"domain_scores_gemma":[0.9992217,0.00044550654,0.00008665142,0.00010067973,0.00011914695,0.00002635332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006103718,0.0002555246,0.0002836231,0.00033164237,0.00027988042,0.00025229086,0.00056930335,0.00035557844,0.0004155316],"category_scores_gemma":[0.0018135468,0.00008945633,0.00017082455,0.00022907976,0.00029344528,0.0005555252,0.00042909576,0.00030731384,0.00009077236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007236463,0.00015899325,0.0036763973,0.00025151984,0.00012339946,0.00077788957,0.00031915543,0.37848404,0.26216945,0.010360358,0.0015642183,0.341391],"study_design_scores_gemma":[0.000025069476,0.00017937282,0.0009102894,0.000009352978,0.00002429569,0.00022875455,0.000044935758,0.9558062,0.03768009,0.0034504838,0.0016280678,0.000013055718],"about_ca_topic_score_codex":0.00058791274,"about_ca_topic_score_gemma":0.00037004089,"teacher_disagreement_score":0.0006103718,"about_ca_system_score_codex":0.00030891184,"about_ca_system_score_gemma":0.00014993244,"threshold_uncertainty_score":0.0032279491},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010504079,0.0004921654,0.9871991,0.00010809964,0.000033326847,0.000029776005,0.000012901209,0.00004490896,0.0015756772],"genre_scores_gemma":[0.7559894,0.0010384899,0.24092351,0.00011032313,0.000078630605,0.00014113344,0.000059628263,0.000021990554,0.0016367573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916244,0.00032231028,0.000035130568,0.0000849981,0.00033408383,0.00006103011],"domain_scores_gemma":[0.99885654,0.0005014974,0.00015172028,0.00014161196,0.00031748824,0.00003119605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071324187,0.00078136235,0.0004927041,0.00044850173,0.00038442234,0.0006165504,0.00091195403,0.00072425365,0.00058071513],"category_scores_gemma":[0.0020853668,0.00020392842,0.0003120655,0.00073706853,0.00080271444,0.0007719583,0.00069490285,0.0007415398,0.0002432971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001491501,0.00007459045,0.0007751658,0.00021728546,0.000059692167,0.00027546336,0.00024225457,0.70017415,0.040950686,0.14794232,0.0010195369,0.10811977],"study_design_scores_gemma":[0.000013221584,0.00008582891,0.00006746021,0.000014643964,0.000013647073,0.00010156747,0.000015274321,0.98384964,0.0041881283,0.010338031,0.0012996625,0.00001291995],"about_ca_topic_score_codex":0.0010540416,"about_ca_topic_score_gemma":0.002049215,"teacher_disagreement_score":0.0010540416,"about_ca_system_score_codex":0.00087259867,"about_ca_system_score_gemma":0.00088089326,"threshold_uncertainty_score":0.0063311458},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06107696,0.0016439691,0.92280656,0.0010536333,0.00015334316,0.00009810415,0.000104818566,0.00021101281,0.012851608],"genre_scores_gemma":[0.9384782,0.0011897095,0.0562721,0.00022811617,0.00017833589,0.000076782104,0.000050627477,0.0000786528,0.003447488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980122,0.00062982703,0.000041903444,0.00026697284,0.00037634812,0.0006728366],"domain_scores_gemma":[0.9966853,0.0020014565,0.0002431256,0.00042235138,0.00046957767,0.00017822173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015664726,0.0010620296,0.0012248683,0.0007915372,0.0014511136,0.0018225039,0.0014307778,0.0009084247,0.0033432757],"category_scores_gemma":[0.0068359165,0.00036263984,0.00069030037,0.0017030742,0.0014147649,0.0025053762,0.0023407068,0.001048732,0.00047111305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000614103,0.00015697836,0.0020663042,0.0002375229,0.000085285974,0.00043902113,0.00023897499,0.69290626,0.0077893576,0.18011135,0.007313078,0.108041815],"study_design_scores_gemma":[0.000023304268,0.000051122504,0.00022819624,0.000020554397,0.000023889948,0.0001181089,0.00009451281,0.96561384,0.002082788,0.030069333,0.0016577337,0.000016670874],"about_ca_topic_score_codex":0.007472057,"about_ca_topic_score_gemma":0.0061863433,"teacher_disagreement_score":0.007472057,"about_ca_system_score_codex":0.0019557618,"about_ca_system_score_gemma":0.0024962255,"threshold_uncertainty_score":0.014857173},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018222422,0.000098737175,0.99683243,0.00004104348,0.00000836112,0.000017944974,0.000005339193,0.000052361167,0.0011214776],"genre_scores_gemma":[0.42327017,0.00081931945,0.5703021,0.00015826168,0.00012971592,0.0004260998,0.00005710062,0.000052553412,0.0047846874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965143,0.00012055566,0.000016495607,0.000061312996,0.0001234083,0.000026806283],"domain_scores_gemma":[0.9994911,0.0002802882,0.0000594119,0.000038633083,0.00011708267,0.000013441098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067089376,0.0009417515,0.00056750147,0.0003214681,0.00027041728,0.0006783036,0.0009109596,0.0009947527,0.0022605031],"category_scores_gemma":[0.0015680006,0.00039551844,0.00044411063,0.00039894925,0.00044378728,0.00071269827,0.00047801013,0.0008749515,0.0006729355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006767628,0.000071204304,0.00028468427,0.00013087498,0.000039410825,0.00006494228,0.00010813959,0.83610684,0.01425434,0.020383311,0.0008229812,0.12766573],"study_design_scores_gemma":[0.000009884162,0.000060187955,0.00004053631,0.0000058904634,0.0000075421403,0.000021570431,0.0000048702495,0.9959925,0.0009805757,0.0021103092,0.0007596834,0.0000065768536],"about_ca_topic_score_codex":0.0015545543,"about_ca_topic_score_gemma":0.0019385603,"teacher_disagreement_score":0.0022605031,"about_ca_system_score_codex":0.00047614565,"about_ca_system_score_gemma":0.00064186746,"threshold_uncertainty_score":0.0075621605},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029046867,0.00017085197,0.9685506,0.000109399705,0.000011567807,0.00003096541,0.0000381542,0.000075018565,0.001966666],"genre_scores_gemma":[0.8823178,0.00044352538,0.114105575,0.00005306317,0.00002555057,0.00016267475,0.00005078973,0.000027759519,0.0028133034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994023,0.0002975193,0.000025316456,0.00009364227,0.00011247569,0.00006883269],"domain_scores_gemma":[0.9988931,0.0007989509,0.000112418806,0.000049499646,0.00011577132,0.000030395908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009689591,0.0009749992,0.00082822004,0.00025527377,0.00029406787,0.0007347468,0.0005823675,0.0009547248,0.0009852373],"category_scores_gemma":[0.0030889593,0.00041327218,0.00026277342,0.00052596646,0.00088727596,0.0009545503,0.0007847411,0.00049642334,0.0003496252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005720485,0.000024187455,0.00017712373,0.000050688323,0.000012065842,0.00007661434,0.000039937517,0.9702602,0.004089816,0.012301111,0.00024077778,0.01267021],"study_design_scores_gemma":[0.000012865254,0.000033518398,0.00005961862,0.000004245287,0.0000050119784,0.00001893183,0.000011158695,0.9944786,0.00095492636,0.0042946804,0.00012078246,0.0000055733835],"about_ca_topic_score_codex":0.0012962908,"about_ca_topic_score_gemma":0.0016789736,"teacher_disagreement_score":0.0012962908,"about_ca_system_score_codex":0.0005388642,"about_ca_system_score_gemma":0.00066974893,"threshold_uncertainty_score":0.0051244497},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011556949,0.0035645398,0.960015,0.00081297156,0.00014701518,0.000094210205,0.00015209941,0.00019209553,0.023465244],"genre_scores_gemma":[0.88353026,0.0031912972,0.09963785,0.00031870132,0.00025686497,0.00031606562,0.00011814891,0.00007172404,0.012559184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939656,0.00027607326,0.000020032352,0.000081426595,0.00013497185,0.000090924594],"domain_scores_gemma":[0.99976593,0.00010322299,0.00003094142,0.000015027244,0.00006293681,0.0000219254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009593099,0.0007186702,0.0007650207,0.0004682167,0.00050058536,0.0014892195,0.0014199613,0.0009868743,0.004247004],"category_scores_gemma":[0.0009471425,0.0002921383,0.00043614538,0.000788545,0.0006326519,0.001325589,0.0010296867,0.00081379997,0.00055335404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042421983,0.000032141146,0.00021742264,0.00011833764,0.000023799665,0.000289921,0.000078303274,0.82403225,0.0014577429,0.15030946,0.003960342,0.019437814],"study_design_scores_gemma":[0.0000058335927,0.000016786773,0.000054478016,0.000007642204,0.0000057000716,0.000041405143,0.000021519232,0.9850802,0.00011151778,0.013549425,0.0010992623,0.000006166763],"about_ca_topic_score_codex":0.0049653915,"about_ca_topic_score_gemma":0.0038208612,"teacher_disagreement_score":0.0049653915,"about_ca_system_score_codex":0.0015936284,"about_ca_system_score_gemma":0.0010155023,"threshold_uncertainty_score":0.014207661},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003179832,0.00041252657,0.993883,0.0001011312,0.000025064337,0.000018171917,0.000036423004,0.00007590727,0.0022680708],"genre_scores_gemma":[0.63132083,0.0037613527,0.35522762,0.00024015387,0.00013237575,0.00032685915,0.00022638193,0.00012899433,0.0086354045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992482,0.00038435892,0.000030574844,0.000089196605,0.00019300121,0.000054569005],"domain_scores_gemma":[0.99915993,0.0004998138,0.000099800076,0.0000641353,0.0001481413,0.000028119559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001030588,0.0011158803,0.00067354506,0.000432535,0.00029079616,0.00087520084,0.00067233073,0.0008051535,0.0028577105],"category_scores_gemma":[0.0019156712,0.000388778,0.00047071846,0.0010157644,0.00067792484,0.0014172845,0.0006236596,0.0007549141,0.0009957113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006013655,0.000029048095,0.00016170499,0.00021694617,0.000036601534,0.0001217508,0.000062221654,0.8757131,0.009985707,0.06760048,0.001858665,0.044153653],"study_design_scores_gemma":[0.000011295821,0.000054937078,0.000080872276,0.000013420135,0.00000891123,0.000055537024,0.00002170953,0.9695951,0.0016678993,0.026955426,0.0015229129,0.0000120165205],"about_ca_topic_score_codex":0.00086648,"about_ca_topic_score_gemma":0.0010743262,"teacher_disagreement_score":0.0028577105,"about_ca_system_score_codex":0.00088899763,"about_ca_system_score_gemma":0.00062918686,"threshold_uncertainty_score":0.009559989},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00836703,0.00017976806,0.98914284,0.000065926804,0.00004223003,0.000074632655,0.00003511659,0.00019378259,0.0018986288],"genre_scores_gemma":[0.7296912,0.00038536763,0.26736486,0.00020646019,0.00006851623,0.00027219838,0.00010788331,0.000047185553,0.0018563945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990482,0.00033416064,0.000046703306,0.00015670265,0.00029660802,0.00011772874],"domain_scores_gemma":[0.99890125,0.00026758097,0.00014839334,0.00017097456,0.0004693649,0.00004241626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012161834,0.0006562793,0.0003373885,0.0003300256,0.00041360344,0.0006419026,0.0010035421,0.0004967402,0.0010900674],"category_scores_gemma":[0.0016735834,0.00021428375,0.00027986654,0.00031501675,0.0005017663,0.0007458449,0.0007430968,0.00067694386,0.00028132857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002684878,0.0001217771,0.0015113988,0.00031090528,0.00015190119,0.00038884662,0.00021001762,0.6631056,0.10533808,0.06744044,0.003658011,0.1574946],"study_design_scores_gemma":[0.000014959839,0.00018768576,0.00023070448,0.000013259827,0.000027709139,0.00016779947,0.000018028531,0.97838223,0.014344891,0.003307631,0.0032834823,0.000021729249],"about_ca_topic_score_codex":0.0014552126,"about_ca_topic_score_gemma":0.002018404,"teacher_disagreement_score":0.0014552126,"about_ca_system_score_codex":0.0007495679,"about_ca_system_score_gemma":0.000896994,"threshold_uncertainty_score":0.0064318776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019656925,0.00032557308,0.9774408,0.00017874283,0.000026797838,0.000029494944,0.000054942404,0.00008090433,0.0022056843],"genre_scores_gemma":[0.9072735,0.0004798153,0.0878059,0.00008815325,0.00006480336,0.00018745108,0.00007453283,0.00003974106,0.003986194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999206,0.0003235402,0.000031814394,0.00018739898,0.00014647593,0.000104806786],"domain_scores_gemma":[0.99885345,0.00080431177,0.0001291279,0.00004379384,0.00012691034,0.00004247576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000992886,0.0012449084,0.0011055087,0.00037617018,0.00036067358,0.0010450213,0.0008009979,0.0012131684,0.0013020111],"category_scores_gemma":[0.0024040982,0.0005457969,0.00031864777,0.00070356735,0.0010948386,0.0012683844,0.0008789808,0.0007921601,0.00034041767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000610834,0.000025637426,0.00013660188,0.000045537894,0.000016625669,0.000074475414,0.00003452835,0.9736613,0.0017863379,0.012942893,0.00029216535,0.010922941],"study_design_scores_gemma":[0.000021217707,0.000029772667,0.000041471638,0.0000028769346,0.0000041552616,0.000010652636,0.000007887534,0.9934622,0.00026373888,0.0059911967,0.00016015042,0.0000047507237],"about_ca_topic_score_codex":0.0021718328,"about_ca_topic_score_gemma":0.0023927165,"teacher_disagreement_score":0.0021718328,"about_ca_system_score_codex":0.0008836957,"about_ca_system_score_gemma":0.0007750641,"threshold_uncertainty_score":0.0064117312},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7327953,0.00239585,0.23563923,0.0010194838,0.00015266937,0.000102820246,0.00046584758,0.0007549481,0.026673775],"genre_scores_gemma":[0.9962871,0.000203529,0.0024391836,0.000036512876,0.000019957211,0.000011506799,0.000049276994,0.00001655526,0.0009363919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984206,0.00044549297,0.00006851685,0.00018106906,0.00040030046,0.00048396375],"domain_scores_gemma":[0.99370027,0.0034144619,0.00048219154,0.0003873223,0.001831071,0.00018453889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014371736,0.0009656087,0.001004994,0.00094948855,0.001052371,0.0017957473,0.00058948627,0.0010349024,0.004167736],"category_scores_gemma":[0.0043215067,0.00029037782,0.00051835633,0.0011990262,0.0010845435,0.00081037916,0.0011245421,0.00060364493,0.0005706599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001417276,0.00009352906,0.009616589,0.00029546215,0.00020991224,0.00066411245,0.00035404522,0.9052726,0.037930418,0.0150724,0.0013215939,0.02775216],"study_design_scores_gemma":[0.000017616234,0.00022504438,0.002009152,0.000018977646,0.000071283044,0.0002923664,0.00009776456,0.99108875,0.004595691,0.0011936799,0.00035535815,0.000034361034],"about_ca_topic_score_codex":0.010817025,"about_ca_topic_score_gemma":0.0076638875,"teacher_disagreement_score":0.010817025,"about_ca_system_score_codex":0.002251093,"about_ca_system_score_gemma":0.0017555242,"threshold_uncertainty_score":0.021508098},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07753221,0.0012888706,0.91708905,0.00025553038,0.000053854907,0.000039478648,0.000037402733,0.00023103594,0.003472636],"genre_scores_gemma":[0.95389795,0.00066031766,0.04379321,0.000053796884,0.000050965595,0.00006944852,0.000031861502,0.000014153795,0.0014283817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988851,0.0006206223,0.000041055733,0.00010959792,0.00024082919,0.00010285761],"domain_scores_gemma":[0.99868625,0.00075135514,0.00016712694,0.0002022292,0.0001461347,0.00004693379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000968972,0.0009392559,0.0007661259,0.0004754632,0.00036810612,0.0008516832,0.00082581287,0.0007913501,0.0004985459],"category_scores_gemma":[0.0018745717,0.0004241845,0.00046928218,0.0009592203,0.0009942345,0.0008339309,0.0012069558,0.0005682779,0.00032782892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031888255,0.000037070462,0.0010222163,0.00018265123,0.00010714364,0.00070980034,0.00035738805,0.79005194,0.057258867,0.05059413,0.0010939651,0.098266006],"study_design_scores_gemma":[0.00005221999,0.00029572088,0.0005182989,0.000019435163,0.000041203533,0.00045008695,0.00004959224,0.96564084,0.0072506815,0.023581449,0.00205288,0.000047562487],"about_ca_topic_score_codex":0.00057749724,"about_ca_topic_score_gemma":0.0007948519,"teacher_disagreement_score":0.000968972,"about_ca_system_score_codex":0.00047149693,"about_ca_system_score_gemma":0.0003229463,"threshold_uncertainty_score":0.0051245093},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20172024,0.003751491,0.7815757,0.0004180334,0.00016235275,0.000050518353,0.00011128383,0.00015092354,0.012059552],"genre_scores_gemma":[0.9768389,0.0014929214,0.01847198,0.00008592098,0.00008206328,0.000042536365,0.000027418164,0.00001174587,0.0029464825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941695,0.00019613066,0.00001660549,0.000116323536,0.00010644215,0.00014771083],"domain_scores_gemma":[0.9990815,0.0005742872,0.000106183215,0.000043221808,0.00014726116,0.000047517155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006825497,0.0010026853,0.0007114337,0.00031145918,0.00045755925,0.001038969,0.00069812825,0.0010303411,0.0006857605],"category_scores_gemma":[0.001595571,0.00038426352,0.00055016833,0.0005581415,0.0009480481,0.0013823141,0.0007324796,0.0005780248,0.00020147464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028534952,0.0000637734,0.0014780118,0.00017579959,0.00013373056,0.0010710721,0.00025229028,0.92397606,0.016246637,0.033375897,0.00071984954,0.022221465],"study_design_scores_gemma":[0.00002041797,0.0001822587,0.00065921486,0.000016423488,0.000060058133,0.00023793036,0.00013164472,0.988084,0.0018077473,0.00788505,0.0008865839,0.000028619292],"about_ca_topic_score_codex":0.004221172,"about_ca_topic_score_gemma":0.0037227874,"teacher_disagreement_score":0.004221172,"about_ca_system_score_codex":0.0007078588,"about_ca_system_score_gemma":0.00047326568,"threshold_uncertainty_score":0.008393228},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014611825,0.003594512,0.94900066,0.00065553794,0.00019373625,0.00007076377,0.0003001118,0.0002962801,0.0312766],"genre_scores_gemma":[0.77525544,0.0110487,0.19254239,0.0013225843,0.0016662875,0.0011049917,0.0009811677,0.0008974908,0.015180933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941386,0.0019224324,0.00022238982,0.00062292034,0.0020370858,0.0010565557],"domain_scores_gemma":[0.94857216,0.040520683,0.0026653246,0.0027909984,0.0043075583,0.0011432598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060040313,0.0039505353,0.0019487536,0.0040132157,0.0014401624,0.004393444,0.003259697,0.0020080705,0.006827954],"category_scores_gemma":[0.039991036,0.00097083964,0.001895441,0.0032264797,0.0050023133,0.008371503,0.005565986,0.0073838164,0.0016044786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014018019,0.0000949888,0.0004297646,0.00055609836,0.00008421636,0.00023695927,0.0006715687,0.14536011,0.0055976277,0.81638926,0.0048611844,0.025578067],"study_design_scores_gemma":[0.000014392473,0.00008783611,0.00036180136,0.00021001384,0.00007613008,0.00027891056,0.00015490862,0.46828398,0.004506603,0.5189894,0.0069388,0.00009717917],"about_ca_topic_score_codex":0.0014312848,"about_ca_topic_score_gemma":0.0008657088,"teacher_disagreement_score":0.006827954,"about_ca_system_score_codex":0.0028806867,"about_ca_system_score_gemma":0.0013549641,"threshold_uncertainty_score":0.031752765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024275208,0.00028337186,0.9723999,0.0001247867,0.000022601756,0.00005046899,0.000017702534,0.000088458575,0.0027374316],"genre_scores_gemma":[0.9075921,0.0004728547,0.089656495,0.00012907185,0.000032409676,0.00016888672,0.000037441023,0.000029884937,0.0018807276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999283,0.00025252253,0.00002637835,0.00012945944,0.00020339171,0.00010539281],"domain_scores_gemma":[0.99913603,0.0004310962,0.00014843006,0.00006787708,0.00017706212,0.000039513856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013662935,0.00072680536,0.000555355,0.00037172885,0.000335495,0.0007532648,0.0010685108,0.0006269499,0.00078867236],"category_scores_gemma":[0.0018917533,0.00029713722,0.00031722497,0.00043897776,0.0010155007,0.00083679095,0.0009612564,0.0007142039,0.00017099992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007819338,0.00006850205,0.00028194388,0.000109111905,0.000039717503,0.00020739496,0.00025219837,0.90552336,0.018385727,0.039373748,0.00089216477,0.034788083],"study_design_scores_gemma":[0.000008391041,0.00006465781,0.000027330654,0.0000051736492,0.000007928016,0.000029045144,0.000020772899,0.99402314,0.0012622558,0.0040780753,0.0004674832,0.0000056909107],"about_ca_topic_score_codex":0.0016836294,"about_ca_topic_score_gemma":0.0018954392,"teacher_disagreement_score":0.0016836294,"about_ca_system_score_codex":0.0008356403,"about_ca_system_score_gemma":0.00093330495,"threshold_uncertainty_score":0.0072256923},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25513667,0.0007509936,0.7395337,0.00042163386,0.000057565994,0.000055818982,0.000090079324,0.0004126469,0.0035408149],"genre_scores_gemma":[0.9880434,0.00043606487,0.01071207,0.000047655507,0.000030035864,0.000053577514,0.000052529158,0.000046462686,0.00057825266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987205,0.0004631762,0.000044811495,0.00016309702,0.0004854091,0.00012311291],"domain_scores_gemma":[0.9957639,0.0027793862,0.000391838,0.0003108616,0.0006726449,0.00008131745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015574797,0.0009400213,0.0007893558,0.0011495979,0.0008090209,0.0009518707,0.0013200658,0.0010824238,0.00035868978],"category_scores_gemma":[0.008989132,0.0005041247,0.00030499892,0.0012413687,0.0010976023,0.0026738935,0.00082907715,0.0004957117,0.0001748395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038977178,0.00002455734,0.0012927894,0.000036621397,0.000011990214,0.00009920629,0.00010123669,0.97769654,0.0051864786,0.008175423,0.00018140988,0.007154818],"study_design_scores_gemma":[0.0000012125312,0.000012618078,0.00019374806,0.0000031905047,0.0000029992464,0.000033166307,0.000022993705,0.9955243,0.00087483437,0.0031997424,0.0001247272,0.000006536921],"about_ca_topic_score_codex":0.0021813563,"about_ca_topic_score_gemma":0.0015269448,"teacher_disagreement_score":0.0021813563,"about_ca_system_score_codex":0.0015486873,"about_ca_system_score_gemma":0.0005685634,"threshold_uncertainty_score":0.011236608},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100741535,0.00092565676,0.89413613,0.00030492622,0.00006813082,0.00009444534,0.00004460082,0.00016916727,0.0035154861],"genre_scores_gemma":[0.8973688,0.0004795915,0.0998947,0.00009335073,0.00007322838,0.000083804596,0.000028701323,0.0000087344215,0.0019690995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991485,0.00030100247,0.000052956933,0.00016680008,0.0002317491,0.000098945355],"domain_scores_gemma":[0.99934226,0.00030371392,0.00014518794,0.00007974983,0.000106241525,0.000022761822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084664277,0.00079184567,0.00081511977,0.0002833785,0.00063186703,0.00085275184,0.0008602045,0.0010211251,0.0005411496],"category_scores_gemma":[0.0015656137,0.00046443962,0.0004145978,0.00048568146,0.0006744296,0.0011694869,0.00083865924,0.00063513767,0.00024345813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064969243,0.00022792195,0.004396798,0.00036346697,0.00022876405,0.0019258914,0.00079428894,0.7363958,0.051955894,0.07661615,0.00093116256,0.12551418],"study_design_scores_gemma":[0.000081141734,0.00042128732,0.00033495793,0.00001965318,0.00007464605,0.00044135627,0.00006332941,0.9790131,0.00989493,0.007942584,0.0016778241,0.00003519277],"about_ca_topic_score_codex":0.0013432327,"about_ca_topic_score_gemma":0.0019719077,"teacher_disagreement_score":0.0013432327,"about_ca_system_score_codex":0.000701435,"about_ca_system_score_gemma":0.0005444605,"threshold_uncertainty_score":0.0050893426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078290954,0.0005892148,0.9173779,0.0001404432,0.000023697758,0.0000576281,0.000011727303,0.00014448406,0.0033640314],"genre_scores_gemma":[0.87172663,0.00032928115,0.1268982,0.000038446917,0.000017338954,0.000083077575,0.000016263279,0.000012844901,0.0008778625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993248,0.000308371,0.00003497637,0.00006889848,0.0002024031,0.000060585633],"domain_scores_gemma":[0.9984047,0.0009911456,0.00024382015,0.00017772347,0.00014124207,0.000041364307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014062745,0.00054976024,0.00048725598,0.00056498725,0.0004042529,0.0007511027,0.000776677,0.00048778206,0.00032020884],"category_scores_gemma":[0.0026784663,0.0002875323,0.0003221495,0.0005010033,0.0011119096,0.00089542964,0.0011588279,0.000533876,0.00011499641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034924224,0.00012514177,0.0014353521,0.00019799593,0.00007085995,0.0003721754,0.00051051576,0.66985744,0.050496098,0.13713963,0.0008153251,0.13863015],"study_design_scores_gemma":[0.000035347257,0.00025533896,0.00021090425,0.000019415285,0.000024837145,0.00021597304,0.000037348815,0.9709802,0.010425115,0.016557017,0.0012075556,0.000030954194],"about_ca_topic_score_codex":0.00047888808,"about_ca_topic_score_gemma":0.00054709014,"teacher_disagreement_score":0.0014062745,"about_ca_system_score_codex":0.00064893026,"about_ca_system_score_gemma":0.00056453026,"threshold_uncertainty_score":0.0074371696},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018625814,0.0056163264,0.95203835,0.0006882317,0.00016137793,0.000069424204,0.00021892,0.0006919933,0.021889467],"genre_scores_gemma":[0.8144437,0.009852385,0.16399145,0.0013838127,0.00051289046,0.0005981921,0.0006300609,0.00076689414,0.007820511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9875974,0.003763218,0.0005209541,0.0011256181,0.0050006006,0.001992118],"domain_scores_gemma":[0.9345924,0.04932737,0.003561702,0.0054949233,0.0063473317,0.0006762382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01393606,0.003707695,0.0032848248,0.0041968934,0.001594297,0.004393354,0.003061792,0.0023399699,0.0048183603],"category_scores_gemma":[0.076877445,0.00137061,0.0018708692,0.0035625787,0.0061246324,0.007644105,0.0064027593,0.006342193,0.002010876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025791267,0.00010730218,0.0008275092,0.00033669,0.00010778329,0.00018300787,0.0005442897,0.67543566,0.0057200952,0.28316528,0.0031967678,0.030117702],"study_design_scores_gemma":[0.000023267059,0.000096397904,0.00054971984,0.0003067403,0.000057137724,0.00027216936,0.00017120823,0.7990312,0.00582384,0.19096541,0.0025924542,0.00011042214],"about_ca_topic_score_codex":0.0027494808,"about_ca_topic_score_gemma":0.0025535538,"teacher_disagreement_score":0.01393606,"about_ca_system_score_codex":0.0049272077,"about_ca_system_score_gemma":0.0024504354,"threshold_uncertainty_score":0.0737018},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019653983,0.0056683687,0.94173604,0.00060508086,0.00016748741,0.000039385264,0.00019596936,0.00043875736,0.031494908],"genre_scores_gemma":[0.72661656,0.0077687646,0.24468063,0.00067212735,0.00034047302,0.00028050906,0.00042235077,0.0004840355,0.01873453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779665,0.00060367986,0.00009975433,0.00018210788,0.0010090708,0.00030873538],"domain_scores_gemma":[0.9908426,0.0063357786,0.00050361804,0.0008862017,0.0013507449,0.000081024904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030559842,0.0013954565,0.0008218799,0.0015118949,0.0005092545,0.0020488864,0.0012751118,0.0013992545,0.0035421231],"category_scores_gemma":[0.013812814,0.0004241117,0.00057746394,0.0014875974,0.0016866993,0.0025750312,0.0016159395,0.0019311483,0.0014102625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001511377,0.00006904631,0.0006223052,0.0006008203,0.000055093,0.0003744447,0.00034490693,0.6585475,0.011421095,0.26606163,0.0042013195,0.057550713],"study_design_scores_gemma":[0.000007069632,0.000043635086,0.00040761236,0.00016792378,0.000027133512,0.0002332983,0.000050314375,0.9161083,0.005585235,0.0726067,0.004729931,0.000032854605],"about_ca_topic_score_codex":0.0014390141,"about_ca_topic_score_gemma":0.0016258631,"teacher_disagreement_score":0.0035421231,"about_ca_system_score_codex":0.002983636,"about_ca_system_score_gemma":0.000798854,"threshold_uncertainty_score":0.02164787},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0130316885,0.00048487025,0.9820404,0.00019068053,0.000025139543,0.00003761284,0.000032175656,0.000051445386,0.0041059223],"genre_scores_gemma":[0.8491554,0.0014320206,0.14368922,0.00013028881,0.00007183166,0.00023774529,0.00006703969,0.000068920315,0.0051475293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989806,0.00057786616,0.000028171247,0.00011106649,0.00015357666,0.0001486221],"domain_scores_gemma":[0.9987394,0.0009170162,0.00012850792,0.000054331173,0.00011339507,0.00004747009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020006895,0.0011902881,0.0010764371,0.00051121844,0.00033473907,0.0013989487,0.001118963,0.0014673085,0.002022237],"category_scores_gemma":[0.0036710436,0.00060320646,0.0005808768,0.0010391908,0.001112131,0.0017200239,0.001074981,0.00073142425,0.00038964787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030421896,0.0000227496,0.000120712626,0.000048532434,0.000016422748,0.00006673579,0.000036628717,0.9676252,0.00087323686,0.02421724,0.00032024746,0.0066217617],"study_design_scores_gemma":[0.0000060332836,0.000018618397,0.000037937323,0.0000043903538,0.0000036968368,0.000010780703,0.000014370287,0.99182713,0.0001999083,0.007681792,0.00019067198,0.0000046622536],"about_ca_topic_score_codex":0.0027632904,"about_ca_topic_score_gemma":0.0022455887,"teacher_disagreement_score":0.0027632904,"about_ca_system_score_codex":0.0013195631,"about_ca_system_score_gemma":0.00094368716,"threshold_uncertainty_score":0.010580778},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04822209,0.0014794907,0.9299118,0.000640632,0.000081787824,0.00007315377,0.00018406054,0.00019252951,0.019214451],"genre_scores_gemma":[0.97148377,0.0013637727,0.017097306,0.00009658227,0.000096672025,0.00014216386,0.00012546947,0.0000486487,0.009545478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940383,0.00020170226,0.000024658588,0.00009763474,0.00017391902,0.000098247656],"domain_scores_gemma":[0.99906856,0.0004895004,0.0001771304,0.000048175967,0.00017945026,0.000037154085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008187076,0.0010750332,0.0009862756,0.0006514306,0.00060780096,0.0016266691,0.0014588243,0.0018071901,0.0016707361],"category_scores_gemma":[0.002199977,0.00041983215,0.00072405016,0.0007681136,0.0010239133,0.0012964569,0.0010183351,0.00086143985,0.00042943357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011988582,0.000012370368,0.00032435256,0.000025670894,0.000014406357,0.00015321285,0.00007883226,0.96213514,0.00076276594,0.03364677,0.00031020324,0.002524318],"study_design_scores_gemma":[0.0000013417391,0.0000046061027,0.000041800668,0.0000018701808,0.000002508301,0.000012045678,0.000008291776,0.9963528,0.000045296074,0.0033322207,0.00019448102,0.0000027220574],"about_ca_topic_score_codex":0.013635963,"about_ca_topic_score_gemma":0.005507237,"teacher_disagreement_score":0.013635963,"about_ca_system_score_codex":0.0015964829,"about_ca_system_score_gemma":0.0008037527,"threshold_uncertainty_score":0.0271132},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046737526,0.0007612587,0.9510542,0.00017310858,0.000039032515,0.000025138734,0.000036310073,0.00010355957,0.0010698715],"genre_scores_gemma":[0.86637694,0.0006082166,0.13064606,0.00014248735,0.00005353875,0.000053612745,0.00007525834,0.000015062507,0.0020288238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952316,0.00017028615,0.000025730853,0.00006502259,0.00019246437,0.000023391638],"domain_scores_gemma":[0.9990544,0.00053868955,0.0001290529,0.00008849433,0.00016686693,0.00002242982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011123116,0.00037002505,0.00043035377,0.00042500635,0.00020264197,0.0005339821,0.00060068234,0.00047900947,0.0006984327],"category_scores_gemma":[0.0021842124,0.0002376729,0.00024387165,0.0003940135,0.0003296671,0.0009480584,0.00070366863,0.00052163407,0.00018541518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038034,0.00016001554,0.006169705,0.0004765549,0.00019032504,0.00070607086,0.00033457697,0.40245658,0.08819217,0.1658327,0.003075875,0.33202502],"study_design_scores_gemma":[0.00001345682,0.000057236524,0.00050334557,0.000009020956,0.000009114705,0.00016052963,0.000013197146,0.9823262,0.005085494,0.010950663,0.000854615,0.000017114833],"about_ca_topic_score_codex":0.0002569812,"about_ca_topic_score_gemma":0.00039743638,"teacher_disagreement_score":0.0011123116,"about_ca_system_score_codex":0.0003595633,"about_ca_system_score_gemma":0.00032224564,"threshold_uncertainty_score":0.005882561},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8046789,0.0015429425,0.18517222,0.0004440073,0.000030855474,0.000025310588,0.00008123197,0.00029452684,0.007729986],"genre_scores_gemma":[0.9960748,0.00019784085,0.0033461223,0.000023696148,0.00000752059,0.0000067528927,0.000013357002,0.000011061913,0.00031899475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979214,0.00089775235,0.000073761956,0.00015061795,0.0007179539,0.00023850605],"domain_scores_gemma":[0.9818526,0.0137970075,0.0015127347,0.00085749105,0.0018588881,0.00012127913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026288356,0.000853416,0.00080427324,0.00044628966,0.00045721108,0.000794911,0.0004866878,0.0008070517,0.00061903225],"category_scores_gemma":[0.016422939,0.00035925824,0.0002571307,0.0007015865,0.0010074419,0.0012384764,0.00094498135,0.00047666012,0.00021509377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024135069,0.000043351265,0.0041176965,0.000087315944,0.00008510834,0.00036235264,0.00014708447,0.95813906,0.014102862,0.008698856,0.00022359811,0.013751506],"study_design_scores_gemma":[0.000014662671,0.00020025208,0.0020241637,0.000016159102,0.0000463866,0.000331994,0.000070067,0.98218346,0.012074144,0.002814382,0.00019733388,0.000026941378],"about_ca_topic_score_codex":0.001506645,"about_ca_topic_score_gemma":0.0019005617,"teacher_disagreement_score":0.0026288356,"about_ca_system_score_codex":0.00077454466,"about_ca_system_score_gemma":0.0009095164,"threshold_uncertainty_score":0.013902783},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15379487,0.0004670515,0.83602,0.00030035694,0.000052533273,0.00006348468,0.00008457261,0.00018216103,0.009034915],"genre_scores_gemma":[0.95945907,0.00031058255,0.036437895,0.000045739467,0.00005160539,0.000085712774,0.000059708953,0.00007969516,0.0034700022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933785,0.00018249666,0.0000172751,0.00009763984,0.0002112759,0.00015354181],"domain_scores_gemma":[0.99678016,0.0024609668,0.00022176304,0.00012274057,0.00032715275,0.000087308435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010746528,0.00049551966,0.0005853296,0.0005546475,0.0005062181,0.0010311744,0.00090192107,0.0006370358,0.0013104129],"category_scores_gemma":[0.007056358,0.00024416437,0.00017064597,0.0007374858,0.0009988752,0.0013069902,0.00084242516,0.00066987186,0.00021557255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022532075,0.000045164183,0.00041502036,0.00007598236,0.0000105365925,0.00011250613,0.00019135293,0.86528504,0.013360168,0.098800644,0.00077723654,0.020700991],"study_design_scores_gemma":[0.000010801426,0.000023063225,0.000090583824,0.000005564851,0.000004511391,0.00002245931,0.000027358392,0.98064303,0.0026922068,0.016087243,0.0003856967,0.000007364851],"about_ca_topic_score_codex":0.004844761,"about_ca_topic_score_gemma":0.0033896351,"teacher_disagreement_score":0.004844761,"about_ca_system_score_codex":0.0023856699,"about_ca_system_score_gemma":0.0013652581,"threshold_uncertainty_score":0.017309368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008801162,0.0002718914,0.98627543,0.00008930211,0.000030697545,0.0000472244,0.00003637367,0.00007558134,0.0043722587],"genre_scores_gemma":[0.7687798,0.00091114757,0.22682324,0.000116870935,0.000051100145,0.00022778667,0.0001420918,0.000043134994,0.0029047688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907684,0.00027205184,0.0000334832,0.00012425482,0.00037488196,0.00011842963],"domain_scores_gemma":[0.99863523,0.0005644247,0.00014416238,0.00018975974,0.00042666268,0.000039736216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001093905,0.0006341626,0.00038153952,0.000495361,0.00037072873,0.00076130044,0.0008840069,0.0003933983,0.0011056367],"category_scores_gemma":[0.0032827023,0.00026581634,0.00029408553,0.00062329386,0.0007112476,0.0009569907,0.00078803004,0.00060724805,0.0001796201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052179505,0.000023449918,0.0005917234,0.00007459337,0.000027568663,0.00010646558,0.00006293144,0.81956065,0.0101250345,0.114907585,0.00088267203,0.053585123],"study_design_scores_gemma":[0.0000040598266,0.000022100034,0.000079201476,0.000007098108,0.000007188604,0.000032513803,0.0000071990526,0.99004704,0.0016398123,0.0071717664,0.00097574445,0.0000061989085],"about_ca_topic_score_codex":0.0031116488,"about_ca_topic_score_gemma":0.0032388805,"teacher_disagreement_score":0.0031116488,"about_ca_system_score_codex":0.0015179948,"about_ca_system_score_gemma":0.0014356114,"threshold_uncertainty_score":0.0110138655},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20139979,0.000951426,0.7909878,0.00040872832,0.000041097737,0.000049152524,0.000099298486,0.00016798376,0.0058947518],"genre_scores_gemma":[0.9879112,0.00026852157,0.011074715,0.00002409923,0.00001868235,0.000029320692,0.000021050895,0.0000067527235,0.0006455845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915373,0.00034873286,0.00003834787,0.0000979986,0.00020654174,0.00015464393],"domain_scores_gemma":[0.9984282,0.0010711473,0.00018903789,0.00007626372,0.00018766447,0.000047715603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011890335,0.00082940113,0.00063708983,0.00043843454,0.0005406118,0.0007942247,0.00062619714,0.00060943945,0.0007651741],"category_scores_gemma":[0.004007418,0.0003032095,0.0003633115,0.000937132,0.00076643773,0.0008588908,0.00092439086,0.00031041927,0.0001249622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015660595,0.000024845504,0.0009994017,0.00007406923,0.000027584365,0.00022071185,0.00013360297,0.9470005,0.0037643735,0.023176232,0.00063637766,0.023785708],"study_design_scores_gemma":[0.00000956262,0.000049875805,0.00017619434,0.000003941764,0.000013688496,0.00006079389,0.000034675108,0.99269205,0.0008507945,0.0058106026,0.0002897732,0.000008049339],"about_ca_topic_score_codex":0.0030233273,"about_ca_topic_score_gemma":0.0035562566,"teacher_disagreement_score":0.0030233273,"about_ca_system_score_codex":0.00123283,"about_ca_system_score_gemma":0.0010538021,"threshold_uncertainty_score":0.008944869},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033820637,0.00064367935,0.9576306,0.00032821824,0.00011548518,0.00006282618,0.00012446727,0.00027666357,0.006997616],"genre_scores_gemma":[0.94448227,0.0004150964,0.049902886,0.00010909245,0.00007827545,0.00011210014,0.00007399156,0.000041095645,0.004785282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999212,0.0002633828,0.00003606791,0.00013038419,0.00019249733,0.00016559039],"domain_scores_gemma":[0.9985953,0.00081259216,0.00009620133,0.00014776968,0.00026616987,0.000081950646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011107107,0.00070036197,0.0009560689,0.0004668997,0.0009387044,0.0011586717,0.0012230352,0.0007453848,0.002127778],"category_scores_gemma":[0.0031120293,0.00039271096,0.00041898736,0.0012437215,0.0007791823,0.0010344706,0.0017751193,0.0006566435,0.0004604452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004859319,0.00008592711,0.0008795327,0.00016736926,0.00009425302,0.00023699432,0.0002966701,0.7975918,0.013765971,0.06792275,0.005244893,0.11322793],"study_design_scores_gemma":[0.000021227203,0.000051092687,0.000091398244,0.0000057021634,0.0000217256,0.000058889713,0.000052728723,0.9774065,0.0015200493,0.019374045,0.001385844,0.0000108673],"about_ca_topic_score_codex":0.0034774279,"about_ca_topic_score_gemma":0.0058245054,"teacher_disagreement_score":0.0034774279,"about_ca_system_score_codex":0.00087758957,"about_ca_system_score_gemma":0.0015477497,"threshold_uncertainty_score":0.007118106},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009487833,0.00040043556,0.9886904,0.00012430946,0.00001616349,0.000014555183,0.000021643296,0.00007132,0.0011733201],"genre_scores_gemma":[0.7884893,0.0019780854,0.20466076,0.00014527063,0.00012278023,0.00021282792,0.000104134764,0.000056435958,0.00423048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991787,0.00038184843,0.000035107998,0.00013805676,0.00018015926,0.00008605198],"domain_scores_gemma":[0.9984877,0.0012150457,0.00010856469,0.00005313244,0.00010794072,0.000027587941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011791167,0.0010060723,0.0009410743,0.00044269065,0.00034685063,0.00091053866,0.0006874481,0.0012155286,0.0009479419],"category_scores_gemma":[0.0029449514,0.0005669689,0.00046493646,0.00097066385,0.0009227291,0.0015864016,0.00076188066,0.0007936561,0.00038294023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006442456,0.000022743554,0.00026248506,0.000095272546,0.000032899414,0.00012578722,0.000074427946,0.94400245,0.0035473641,0.023861187,0.0003870128,0.027524056],"study_design_scores_gemma":[0.000015555455,0.000036821046,0.00009428937,0.000006152469,0.000008726618,0.00004194365,0.000019770969,0.98700005,0.0007459988,0.011710109,0.00031090208,0.00000977443],"about_ca_topic_score_codex":0.0013875834,"about_ca_topic_score_gemma":0.0012558133,"teacher_disagreement_score":0.0013875834,"about_ca_system_score_codex":0.00067413365,"about_ca_system_score_gemma":0.00058577524,"threshold_uncertainty_score":0.006235838},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76967615,0.00187316,0.2147397,0.000319587,0.00006971244,0.000052281066,0.000077610326,0.00017151624,0.013020261],"genre_scores_gemma":[0.9970312,0.00016629524,0.0024658416,0.000015528674,0.000008048153,0.000007609003,0.000009648927,0.0000051929687,0.00029051874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990897,0.0002730537,0.000027439062,0.00010554038,0.00021471654,0.00028960055],"domain_scores_gemma":[0.9954673,0.0029590412,0.0004498711,0.00024101899,0.00073340157,0.00014940482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016472006,0.0008302156,0.00065120956,0.0005833591,0.00073413237,0.0011803292,0.00080625183,0.00050664996,0.00066653336],"category_scores_gemma":[0.0060270512,0.00023429526,0.00030810945,0.00072376314,0.0007619794,0.0009195572,0.0009970265,0.0003700305,0.00007489634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040296707,0.000094537274,0.004623101,0.0001215312,0.000092839706,0.0004207832,0.00019989317,0.95017976,0.008048158,0.014618961,0.0004964714,0.020700894],"study_design_scores_gemma":[0.0000063500315,0.0001114806,0.00073680526,0.000005436341,0.00002369036,0.00013137916,0.000085093845,0.9952922,0.0014751691,0.0019669728,0.00015445065,0.000011025596],"about_ca_topic_score_codex":0.0077132764,"about_ca_topic_score_gemma":0.006839332,"teacher_disagreement_score":0.0077132764,"about_ca_system_score_codex":0.0013607965,"about_ca_system_score_gemma":0.0015710008,"threshold_uncertainty_score":0.015336812},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57807803,0.0027329498,0.40309575,0.00040462535,0.00010778217,0.000059699487,0.000100855985,0.00030508343,0.015115202],"genre_scores_gemma":[0.9963084,0.0002281218,0.0031100637,0.000021902564,0.000013146521,0.000009749162,0.000011043876,0.000007167606,0.000290304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989108,0.00029724342,0.000030482895,0.00011790399,0.00028501617,0.00035857921],"domain_scores_gemma":[0.9958205,0.002659112,0.00044561693,0.00021375489,0.0007079491,0.00015292803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017720787,0.0009099646,0.0008217131,0.0008066553,0.00083960715,0.0014451039,0.0009862699,0.00070142903,0.0006805952],"category_scores_gemma":[0.006353493,0.00030934153,0.00038557552,0.00090425287,0.0010508758,0.0009359091,0.0012762388,0.00048519953,0.00008589747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022451059,0.000048670878,0.0024366581,0.00008735538,0.000063099214,0.00046079233,0.00013343079,0.9677156,0.005174046,0.012244789,0.00032318148,0.011087846],"study_design_scores_gemma":[0.0000031511588,0.000046685323,0.0003720345,0.000004194929,0.000014436147,0.0000855127,0.00004133847,0.997253,0.000630502,0.001458486,0.00008119315,0.000009529488],"about_ca_topic_score_codex":0.0096213855,"about_ca_topic_score_gemma":0.0069933105,"teacher_disagreement_score":0.0096213855,"about_ca_system_score_codex":0.0016707361,"about_ca_system_score_gemma":0.00179399,"threshold_uncertainty_score":0.019130766},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050158992,0.0034229758,0.9391705,0.00022878988,0.00008440325,0.00005051044,0.000023996452,0.00016793085,0.006691984],"genre_scores_gemma":[0.9629533,0.001449228,0.032990992,0.0000643557,0.0000717243,0.000092132366,0.00003083512,0.000022542683,0.002324935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958533,0.00016177064,0.000018129058,0.00006477596,0.00013608663,0.00003397241],"domain_scores_gemma":[0.99964046,0.00018819897,0.00004656226,0.000036947524,0.00007306316,0.000014766112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059810386,0.00039398758,0.00036687133,0.00046544793,0.00040902046,0.0005216574,0.00074404705,0.0005951708,0.0005887134],"category_scores_gemma":[0.0012835561,0.00020056308,0.00020035321,0.0007509695,0.00046407257,0.0008644245,0.00064604165,0.00026502277,0.00013113079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118120675,0.000044917906,0.0005585911,0.00021871092,0.000053755182,0.00016860406,0.0002171851,0.7864702,0.019940006,0.057564832,0.0013736788,0.1332714],"study_design_scores_gemma":[0.0000145234235,0.000083315426,0.00023029084,0.000016121392,0.00001533071,0.00009649396,0.000057475503,0.96639496,0.0032488932,0.026380999,0.0034465475,0.0000150325095],"about_ca_topic_score_codex":0.0007948739,"about_ca_topic_score_gemma":0.0006446025,"teacher_disagreement_score":0.0007948739,"about_ca_system_score_codex":0.00039050594,"about_ca_system_score_gemma":0.0002681163,"threshold_uncertainty_score":0.0031630993},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041485213,0.00133433,0.9530568,0.00019256843,0.000041002106,0.000042854186,0.000025210942,0.00010608455,0.003715883],"genre_scores_gemma":[0.86943203,0.0012323208,0.12769222,0.00008497792,0.00006827015,0.00007436481,0.000037908623,0.0000157752,0.0013620463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868494,0.0006272026,0.000045972694,0.00012964109,0.00040465716,0.0001075991],"domain_scores_gemma":[0.99800867,0.0011689413,0.00025076367,0.00025576734,0.00028289948,0.000032929787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010764586,0.0008806373,0.00069549255,0.00052863103,0.00039682043,0.00090178393,0.00078506797,0.00094450207,0.00042804377],"category_scores_gemma":[0.0038498244,0.00028501236,0.00030940847,0.0008959173,0.00097010913,0.0009644966,0.00090775936,0.0006382783,0.0002273683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028145598,0.00008240581,0.0014820892,0.00042572652,0.00008621645,0.0006438439,0.00054095977,0.7275188,0.03632298,0.11410536,0.0009319257,0.11757837],"study_design_scores_gemma":[0.000019810945,0.00021781704,0.00022501782,0.000028176344,0.00002469689,0.000339306,0.00005100773,0.9750073,0.009623228,0.013207695,0.0012293292,0.000026723908],"about_ca_topic_score_codex":0.00089570525,"about_ca_topic_score_gemma":0.0012121635,"teacher_disagreement_score":0.0010764586,"about_ca_system_score_codex":0.0007308707,"about_ca_system_score_gemma":0.00053497404,"threshold_uncertainty_score":0.005692959},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015972305,0.00031750833,0.979538,0.00021273163,0.00009955471,0.000067621215,0.00006843697,0.0002371611,0.003486661],"genre_scores_gemma":[0.681282,0.0008743033,0.30787542,0.00020823082,0.00017649413,0.00015925981,0.0002560472,0.00007715342,0.009091125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996488,0.00007189892,0.0000130031995,0.0000432287,0.00016472902,0.00005837998],"domain_scores_gemma":[0.9994271,0.00020872637,0.000028037359,0.00005634986,0.00025147595,0.00002831515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004954261,0.0005459907,0.0005043694,0.0006890302,0.00043942238,0.0005929868,0.000841778,0.0005635741,0.0016131412],"category_scores_gemma":[0.0014117319,0.00018437063,0.00025389675,0.0007551976,0.00038106297,0.00084104843,0.0007188647,0.0008676626,0.0003029425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003392199,0.00022356446,0.0006697017,0.00019151939,0.00007520549,0.0002863846,0.0001778976,0.5777942,0.07293416,0.08745463,0.007220154,0.25263342],"study_design_scores_gemma":[0.0000035222715,0.00002230175,0.000042163003,0.0000036961314,0.000005713226,0.000032699707,0.000010367559,0.9934855,0.0026413766,0.0031388458,0.0006099001,0.0000039126367],"about_ca_topic_score_codex":0.0043784087,"about_ca_topic_score_gemma":0.006320908,"teacher_disagreement_score":0.0043784087,"about_ca_system_score_codex":0.0007736971,"about_ca_system_score_gemma":0.0010346294,"threshold_uncertainty_score":0.008705854},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073955715,0.00019744322,0.9243916,0.00007293984,0.000011710945,0.000039409377,0.000034500765,0.000254217,0.0010424501],"genre_scores_gemma":[0.8403121,0.00018908965,0.1582501,0.000032081247,0.00002648977,0.00006744155,0.000072214556,0.000030500096,0.0010199217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994148,0.00022520137,0.000021879983,0.00008003273,0.00017448828,0.0000834832],"domain_scores_gemma":[0.9988732,0.000673104,0.00009811339,0.00015479614,0.00014668723,0.00005406222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010319641,0.0007492076,0.0008410115,0.0004970135,0.0006998646,0.0006230717,0.001638158,0.00047765003,0.0007983369],"category_scores_gemma":[0.0029592363,0.0002584146,0.00041715585,0.00073375186,0.00053681154,0.00090386445,0.0010674293,0.000513229,0.00023186783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027672757,0.00007176395,0.0010949597,0.000057183897,0.000041428164,0.00013494346,0.00027053925,0.8869885,0.0075500105,0.010143313,0.0011800767,0.0921905],"study_design_scores_gemma":[0.000005807581,0.000058436966,0.000072282826,0.000001783042,0.0000087215885,0.000048318045,0.000024054681,0.9959785,0.0014287481,0.0021571324,0.00021335029,0.0000028740621],"about_ca_topic_score_codex":0.0018578776,"about_ca_topic_score_gemma":0.002506263,"teacher_disagreement_score":0.0018578776,"about_ca_system_score_codex":0.0009052913,"about_ca_system_score_gemma":0.000672183,"threshold_uncertainty_score":0.0065683722},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015234093,0.0020023014,0.9713245,0.00028019276,0.00006006677,0.000038390266,0.0001469009,0.00032662612,0.010586816],"genre_scores_gemma":[0.85464823,0.005428838,0.1323699,0.00037636358,0.000217762,0.00030423646,0.0004055511,0.00034222635,0.005906871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981494,0.0006530444,0.00006654137,0.0002190838,0.00062184746,0.00029016496],"domain_scores_gemma":[0.98917025,0.008330649,0.0005335631,0.00060580723,0.0012418022,0.000117846335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003699812,0.0016197214,0.0014012341,0.00149273,0.0006276889,0.0020785213,0.001759462,0.0011614553,0.0031780407],"category_scores_gemma":[0.02193517,0.0005802535,0.00093668344,0.0017123716,0.0023898543,0.0034846377,0.0015088258,0.0018647317,0.0010968022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040226507,0.000023596129,0.00034760011,0.00014090465,0.00002900929,0.00017617801,0.00013109055,0.91058916,0.0015320741,0.07440596,0.0015697373,0.011014571],"study_design_scores_gemma":[0.00000296639,0.000012046325,0.00011831125,0.000031201747,0.000009128971,0.00010894386,0.00003799435,0.97670263,0.000527144,0.021821806,0.0006159571,0.0000118310845],"about_ca_topic_score_codex":0.0034373656,"about_ca_topic_score_gemma":0.0027103685,"teacher_disagreement_score":0.003699812,"about_ca_system_score_codex":0.0024601629,"about_ca_system_score_gemma":0.001355434,"threshold_uncertainty_score":0.019566715},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121229164,0.00006181779,0.87499166,0.0001449276,0.00001485041,0.000100851124,0.000028931834,0.00013218896,0.003295696],"genre_scores_gemma":[0.9233939,0.00006226408,0.07403645,0.000082765684,0.000008741345,0.0000923023,0.00003765959,0.000023896562,0.0022620906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986034,0.0006768196,0.00005430352,0.0001754446,0.00025297658,0.00023706479],"domain_scores_gemma":[0.9978104,0.0012257982,0.00032006603,0.0002194765,0.0001799309,0.00024424575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021675,0.00053043646,0.0009861806,0.00044147656,0.00069783855,0.0011271789,0.0011277185,0.0010789514,0.002183053],"category_scores_gemma":[0.006271168,0.00040677583,0.00044650643,0.00079835294,0.0010743226,0.0018529112,0.002069687,0.0008309524,0.0002940261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003306692,0.00018343289,0.0015498044,0.00005316913,0.000047036512,0.0001740712,0.00016775455,0.87389064,0.0052400487,0.06490692,0.0008815185,0.052574906],"study_design_scores_gemma":[0.000017113718,0.00007671438,0.00016633386,0.0000035987537,0.0000072434336,0.000051935083,0.000034225854,0.98178,0.00087949616,0.016584253,0.0003917999,0.000007339105],"about_ca_topic_score_codex":0.0010901542,"about_ca_topic_score_gemma":0.001049828,"teacher_disagreement_score":0.002183053,"about_ca_system_score_codex":0.0010295734,"about_ca_system_score_gemma":0.0009845443,"threshold_uncertainty_score":0.011462927},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015923275,0.0017744021,0.97082233,0.00051731896,0.000060189923,0.00005908889,0.00008996654,0.00021545718,0.010537985],"genre_scores_gemma":[0.91662014,0.0064606066,0.06588045,0.00035365298,0.0004047334,0.000580162,0.0003044867,0.0002090263,0.00918674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971963,0.0012028062,0.000109163,0.0003087274,0.00084594666,0.00033714253],"domain_scores_gemma":[0.991011,0.006239939,0.0006905718,0.00041972526,0.0014857403,0.00015310728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036245792,0.0015255996,0.0015187198,0.0011400415,0.000582267,0.0021396475,0.0012790109,0.0014288981,0.0023664515],"category_scores_gemma":[0.019945638,0.00069190376,0.0007177903,0.0010839956,0.0020570457,0.0018738001,0.0022761326,0.0017025587,0.0008348997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050551735,0.000027753926,0.00060435524,0.00027547733,0.00007237031,0.000114074915,0.00019000133,0.85789096,0.0028976896,0.11833205,0.0013555759,0.018189218],"study_design_scores_gemma":[0.0000074066766,0.000050790488,0.00021494164,0.000038252445,0.000017490978,0.00004243619,0.00003398306,0.96700794,0.00052642607,0.03128572,0.00076195144,0.000012728223],"about_ca_topic_score_codex":0.00297088,"about_ca_topic_score_gemma":0.0012120578,"teacher_disagreement_score":0.0036245792,"about_ca_system_score_codex":0.0020931072,"about_ca_system_score_gemma":0.0020145923,"threshold_uncertainty_score":0.019168794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15353142,0.00055620633,0.82981163,0.0006902992,0.000056208657,0.00008817634,0.000349685,0.00060608174,0.014310358],"genre_scores_gemma":[0.88186014,0.00066247385,0.109139085,0.00026669563,0.00010603019,0.0001441705,0.000304941,0.000116027346,0.0074003604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935573,0.00015138522,0.000031664233,0.00007876369,0.00027912625,0.00010330559],"domain_scores_gemma":[0.99750644,0.0010807792,0.00035178752,0.00042479066,0.0004548422,0.0001813837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000639561,0.0006100339,0.00036413973,0.00051572634,0.00035775147,0.0009136883,0.0004632377,0.0006420904,0.0018070706],"category_scores_gemma":[0.005459725,0.00024194294,0.00025621106,0.0006691866,0.0011666719,0.0013676669,0.0010499735,0.0011855932,0.0003489514],"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.0002057142,0.000068198126,0.00086879055,0.00011863095,0.00002537172,0.00023407242,0.00015611779,0.24013731,0.028494187,0.6769789,0.003622383,0.04909039],"study_design_scores_gemma":[0.00002128849,0.0001268795,0.00033554877,0.000032020656,0.00000922808,0.00016241902,0.000031460488,0.760705,0.018473119,0.21726121,0.002809809,0.000032089956],"about_ca_topic_score_codex":0.0013456465,"about_ca_topic_score_gemma":0.0016728211,"teacher_disagreement_score":0.0018070706,"about_ca_system_score_codex":0.00095029845,"about_ca_system_score_gemma":0.0010920812,"threshold_uncertainty_score":0.0068948865},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054776496,0.00028094673,0.9922462,0.000076865545,0.000021468404,0.000020754776,0.00002044466,0.000104331375,0.0017513457],"genre_scores_gemma":[0.66951275,0.0008271561,0.32645,0.00017931513,0.00005771515,0.00020334516,0.00009018234,0.000033302997,0.002646261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987109,0.00054203835,0.000046472447,0.0001886179,0.0003963781,0.000115686635],"domain_scores_gemma":[0.9984341,0.0006818556,0.00022121774,0.000226145,0.00038653205,0.000050033632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014481491,0.0009667953,0.0006136377,0.00042399386,0.00043482115,0.0009643248,0.0010911573,0.0010578381,0.00175751],"category_scores_gemma":[0.0026714199,0.00030012152,0.00046958507,0.000737818,0.0007311761,0.0010667966,0.0007373741,0.0008159516,0.00066987186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033269892,0.00011333498,0.0009612559,0.00032262417,0.000104874314,0.00021792205,0.0002125258,0.7006942,0.045367558,0.09494496,0.0021613722,0.15456669],"study_design_scores_gemma":[0.000033771885,0.0002959404,0.00027707542,0.000034227218,0.000034249453,0.00022461331,0.0000669017,0.96355927,0.012746587,0.01901467,0.0036746494,0.000038070757],"about_ca_topic_score_codex":0.0009757566,"about_ca_topic_score_gemma":0.0014931365,"teacher_disagreement_score":0.00175751,"about_ca_system_score_codex":0.00088552217,"about_ca_system_score_gemma":0.00074031507,"threshold_uncertainty_score":0.0076586604},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1796873,0.0004215033,0.81321365,0.00032488143,0.00003604334,0.00012222365,0.00012146719,0.00016019851,0.00591265],"genre_scores_gemma":[0.96325916,0.00019920302,0.034008294,0.00004855993,0.000020456811,0.00008813955,0.000030979016,0.000024973446,0.0023202347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916506,0.0003252659,0.00004002978,0.00013380048,0.00016537633,0.00017058397],"domain_scores_gemma":[0.99751055,0.0013938072,0.00038977794,0.00021507792,0.00038261423,0.0001081258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014426339,0.0009416865,0.0009327679,0.0004984579,0.00052468135,0.0012814129,0.0013524224,0.00096910953,0.0022978408],"category_scores_gemma":[0.0041001067,0.0003629717,0.0006944322,0.0007133112,0.000986121,0.0018365888,0.00091230765,0.00074408785,0.00034081755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017005164,0.00007780009,0.00062190916,0.00006643833,0.000058806178,0.00025568416,0.00012878155,0.9322223,0.0069744913,0.05217396,0.00031811974,0.0069315895],"study_design_scores_gemma":[0.00003150647,0.00009719784,0.00013387931,0.0000039911997,0.00002136801,0.000065151566,0.000038705162,0.9920219,0.0012671632,0.006086071,0.00021982218,0.000013210101],"about_ca_topic_score_codex":0.0037092592,"about_ca_topic_score_gemma":0.0028489288,"teacher_disagreement_score":0.0037092592,"about_ca_system_score_codex":0.0014505541,"about_ca_system_score_gemma":0.001278699,"threshold_uncertainty_score":0.010524571},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19226274,0.0011090689,0.7834149,0.00029473423,0.0001808467,0.00007075416,0.00007391603,0.0010195398,0.021573586],"genre_scores_gemma":[0.8355084,0.0006122169,0.15715705,0.00011862878,0.00009078009,0.000037101025,0.000049637518,0.000041005766,0.006385195],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997396,0.00007047938,0.000013945172,0.000060020386,0.000084809486,0.000031118634],"domain_scores_gemma":[0.9996458,0.00009729555,0.00007427814,0.000078377896,0.0000797933,0.000024353345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023414408,0.0005701448,0.00037490728,0.00021914745,0.00021047007,0.0005689502,0.00072303205,0.0004360346,0.0019185982],"category_scores_gemma":[0.00042619975,0.00016963268,0.00033829905,0.00025097755,0.00029969262,0.0009259462,0.0005271178,0.00037238948,0.00088431226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033166798,0.00007594001,0.00052197813,0.00017401419,0.00005182562,0.00061073544,0.00017019777,0.016559595,0.87730885,0.027739573,0.00089997274,0.07555564],"study_design_scores_gemma":[0.000037415226,0.00075287686,0.000637107,0.000020520747,0.00009786747,0.0021192117,0.000059685277,0.20899434,0.77013063,0.0039759655,0.013103761,0.00007048],"about_ca_topic_score_codex":0.00012745145,"about_ca_topic_score_gemma":0.00021558303,"teacher_disagreement_score":0.0019185982,"about_ca_system_score_codex":0.00027409405,"about_ca_system_score_gemma":0.00014934814,"threshold_uncertainty_score":0.0064182878},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048830784,0.0015400995,0.9695116,0.00045575385,0.00039894128,0.00004827109,0.000037827034,0.00021745484,0.022907065],"genre_scores_gemma":[0.44677326,0.0046167625,0.51075506,0.00097126263,0.00082984794,0.00026391784,0.00014107616,0.00029040017,0.035358436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999564,0.00015503769,0.00002063586,0.000072970106,0.00014290698,0.00004446261],"domain_scores_gemma":[0.99944,0.00033361014,0.000028266006,0.0000787228,0.000098033604,0.000021373753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005311931,0.0007492133,0.00066311785,0.00042839462,0.00067712064,0.0010541003,0.0012514294,0.0013258107,0.0041811457],"category_scores_gemma":[0.0013022387,0.00029364848,0.0006288451,0.000648166,0.0011916606,0.0017043402,0.0012494564,0.0017747782,0.0011132859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006006793,0.00005361984,0.00007443689,0.00020904254,0.00003911924,0.00022812602,0.00019487973,0.051519573,0.017967338,0.83647144,0.008184317,0.08499802],"study_design_scores_gemma":[0.000016643868,0.0001281836,0.00009723871,0.000062659296,0.000029782117,0.00047942152,0.000046284935,0.57838196,0.0069677103,0.39562997,0.018104741,0.00005541658],"about_ca_topic_score_codex":0.00054934144,"about_ca_topic_score_gemma":0.0006382345,"teacher_disagreement_score":0.0041811457,"about_ca_system_score_codex":0.00048773972,"about_ca_system_score_gemma":0.00052457984,"threshold_uncertainty_score":0.013987303},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003915226,0.00029431857,0.99447566,0.00007488711,0.000025930496,0.000026799506,0.000034079563,0.000082395396,0.0010707541],"genre_scores_gemma":[0.8304218,0.0030082837,0.16168423,0.00022595686,0.00020439214,0.00032119293,0.00017065457,0.00012775844,0.003835706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989158,0.00031702087,0.000049129794,0.00018928591,0.00033083782,0.00019798307],"domain_scores_gemma":[0.99829346,0.00087548426,0.00021560604,0.00013559357,0.00042098312,0.000058906662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022232335,0.0017045764,0.0011348828,0.0011142609,0.0006247143,0.0016165029,0.0017750334,0.00085765636,0.0018866641],"category_scores_gemma":[0.0040296596,0.0005078355,0.0010383634,0.00086363085,0.0011267269,0.0022303753,0.0010961943,0.0013711733,0.00038367254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003089281,0.000027971546,0.00040672615,0.00009040009,0.000044540917,0.00020942179,0.00014270352,0.8496809,0.005484884,0.13333806,0.0008673552,0.009676071],"study_design_scores_gemma":[0.0000034222694,0.0000225531,0.00006908156,0.000009208161,0.000016394933,0.000042126503,0.00001689262,0.9865665,0.0006191528,0.012031814,0.0005922978,0.000010667024],"about_ca_topic_score_codex":0.0055403593,"about_ca_topic_score_gemma":0.0030107126,"teacher_disagreement_score":0.0055403593,"about_ca_system_score_codex":0.0020041638,"about_ca_system_score_gemma":0.0020702593,"threshold_uncertainty_score":0.014541268},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03746476,0.00023511791,0.95807624,0.00035973295,0.000046626057,0.00005489556,0.000033445736,0.00020432036,0.003524864],"genre_scores_gemma":[0.7634881,0.00027820078,0.23276888,0.00016917862,0.000056815254,0.00010581679,0.000071798335,0.00010653226,0.0029547373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960893,0.00009766148,0.000010968313,0.00005623255,0.00016401986,0.000062222156],"domain_scores_gemma":[0.9991393,0.00047748612,0.00010237035,0.000073385236,0.00014240514,0.00006499922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074649265,0.00052499527,0.000487485,0.00035455852,0.00046958934,0.00081915775,0.00084735744,0.00062802725,0.0011460913],"category_scores_gemma":[0.0019179811,0.00021933914,0.00035163484,0.00067233935,0.0010995766,0.0013560466,0.0010645827,0.0008683731,0.00017010079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011824186,0.00007481284,0.00037317094,0.00006191363,0.00002116671,0.00005371025,0.000068878966,0.9224315,0.012363459,0.031759582,0.0011477697,0.031525813],"study_design_scores_gemma":[0.000003991061,0.00001460205,0.000027135746,0.000002223064,0.0000017190207,0.000006051969,0.0000063483035,0.99505544,0.000998324,0.0036489815,0.00023223199,0.0000030385652],"about_ca_topic_score_codex":0.0026980797,"about_ca_topic_score_gemma":0.0025298381,"teacher_disagreement_score":0.0026980797,"about_ca_system_score_codex":0.0010223751,"about_ca_system_score_gemma":0.0015884322,"threshold_uncertainty_score":0.0074178576},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085125044,0.00079563487,0.89739805,0.0005463924,0.00016024796,0.000121261015,0.00023668281,0.00042011784,0.015196555],"genre_scores_gemma":[0.9562554,0.00026940732,0.03941973,0.00009136197,0.000064036976,0.00009424,0.000076289856,0.000022775324,0.003706752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938154,0.00016179551,0.000034478853,0.00008479293,0.00015124137,0.00018626795],"domain_scores_gemma":[0.9989485,0.0004950636,0.00007334597,0.00013865295,0.00028020394,0.000064175074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009351536,0.0007655939,0.0007749503,0.0005536423,0.00092788704,0.001259131,0.00090443384,0.00059967185,0.0024778717],"category_scores_gemma":[0.0024295177,0.00029561616,0.0004315262,0.0010930581,0.00067770586,0.0007020015,0.001031564,0.00048004615,0.0004884823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080223504,0.00018057167,0.0024547058,0.0002259681,0.00015286426,0.000489245,0.0005042701,0.6142911,0.036269344,0.07381485,0.0072737085,0.2635411],"study_design_scores_gemma":[0.00003465457,0.00012502201,0.00031709773,0.00001568167,0.00005138669,0.00019098882,0.00010077985,0.9744984,0.005101265,0.017212633,0.002333144,0.000018952303],"about_ca_topic_score_codex":0.00541295,"about_ca_topic_score_gemma":0.012094504,"teacher_disagreement_score":0.00541295,"about_ca_system_score_codex":0.0009216022,"about_ca_system_score_gemma":0.0021398673,"threshold_uncertainty_score":0.01076287},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13526739,0.0024491155,0.853291,0.00043084729,0.00016417835,0.00008426406,0.00007754792,0.0005171264,0.007718587],"genre_scores_gemma":[0.90208155,0.0009888028,0.0945697,0.00013886455,0.00005073743,0.00005282902,0.00007900281,0.000014343929,0.002024207],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996681,0.000100765734,0.000015901438,0.0000347116,0.00013237527,0.000048188933],"domain_scores_gemma":[0.9995747,0.00013962254,0.00005571812,0.000059368387,0.0001509851,0.000019534831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043968193,0.00039389744,0.00034090303,0.00037409953,0.00041761904,0.0003252767,0.00046793604,0.00038899117,0.00070239796],"category_scores_gemma":[0.0010133615,0.00014648952,0.00023862951,0.0004268696,0.00041783665,0.00059449184,0.00046214036,0.00043024446,0.0001791142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007157865,0.00016673868,0.0031530892,0.00041600663,0.00011952413,0.0008607296,0.00034436723,0.21464069,0.39917353,0.070619166,0.0050204913,0.30476987],"study_design_scores_gemma":[0.00006408769,0.00062358653,0.0011988147,0.00004225351,0.00007411083,0.0009850827,0.00007840904,0.869508,0.109602414,0.01243591,0.0053293463,0.000057955967],"about_ca_topic_score_codex":0.0010399618,"about_ca_topic_score_gemma":0.0016132494,"teacher_disagreement_score":0.0010399618,"about_ca_system_score_codex":0.00031938197,"about_ca_system_score_gemma":0.00066010293,"threshold_uncertainty_score":0.002349794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44826058,0.0018462397,0.52836144,0.00080241705,0.00008671528,0.00007741518,0.00016256524,0.00046113972,0.019941442],"genre_scores_gemma":[0.9929087,0.00028734707,0.005978783,0.00003833812,0.000022622664,0.000031563217,0.00001646143,0.000017129427,0.00069901557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797827,0.00077834283,0.000061510036,0.00024433716,0.0004961869,0.0004413729],"domain_scores_gemma":[0.98021287,0.015502696,0.0014834076,0.0011488528,0.0013287667,0.0003233519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023545686,0.0011816669,0.001092509,0.00083411403,0.0007527787,0.0016651223,0.000903879,0.0010642157,0.0013044383],"category_scores_gemma":[0.014180337,0.0005106576,0.0004926515,0.0009884401,0.0028098924,0.0030784148,0.001932397,0.0012382717,0.00028756054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017012168,0.000042169355,0.0008969623,0.00009435588,0.00005563887,0.00041132479,0.00022763234,0.9345739,0.010786031,0.045357455,0.00045393413,0.0069305296],"study_design_scores_gemma":[0.000010335657,0.00007898062,0.00022446677,0.000013777796,0.000027980574,0.00019928327,0.00011785813,0.9833228,0.0045623556,0.011188116,0.00022757365,0.000026438574],"about_ca_topic_score_codex":0.0016775108,"about_ca_topic_score_gemma":0.0009023577,"teacher_disagreement_score":0.0023545686,"about_ca_system_score_codex":0.0016091304,"about_ca_system_score_gemma":0.0008777714,"threshold_uncertainty_score":0.012452245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1422421,0.0011220311,0.8448993,0.00030317687,0.000078959536,0.000037557053,0.00012601429,0.00019473782,0.0109961005],"genre_scores_gemma":[0.97281814,0.00037317644,0.02474861,0.000051052746,0.000021097814,0.000027213435,0.00003298358,0.000012122482,0.0019155712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992493,0.00028251056,0.000022985729,0.0000962267,0.00021832203,0.0001305625],"domain_scores_gemma":[0.99878687,0.0008007755,0.00010413061,0.00014424066,0.00013406246,0.00002983799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075983925,0.00046559173,0.0005062075,0.00027794667,0.0003623245,0.001016048,0.000489665,0.00075355207,0.0015371352],"category_scores_gemma":[0.0027394434,0.00019886432,0.00026370506,0.00077498436,0.0011260444,0.0015015496,0.000812537,0.000586915,0.00024106128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021431214,0.000040328163,0.00062952394,0.00014691874,0.00003324164,0.00022900317,0.00015651174,0.6285109,0.011883815,0.3448236,0.0006010748,0.012730804],"study_design_scores_gemma":[0.000023921888,0.000059488648,0.0001901532,0.000014597449,0.000012008496,0.00013473596,0.0000474717,0.9386831,0.004974515,0.054622732,0.0012128412,0.000024495976],"about_ca_topic_score_codex":0.0009976379,"about_ca_topic_score_gemma":0.0007579846,"teacher_disagreement_score":0.0015371352,"about_ca_system_score_codex":0.0006991416,"about_ca_system_score_gemma":0.0005170807,"threshold_uncertainty_score":0.0051422715},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02806451,0.0018278,0.95841515,0.0004142507,0.000073711635,0.00006552535,0.00005254496,0.00016578761,0.010920816],"genre_scores_gemma":[0.90280837,0.002141345,0.08995253,0.0001717592,0.00011082777,0.00026310966,0.00009404593,0.000039910745,0.0044181217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988129,0.0005654664,0.000033342767,0.000072681665,0.00043354082,0.000082058286],"domain_scores_gemma":[0.99539316,0.0034751277,0.00032106775,0.00024784036,0.0005093319,0.000053529613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017125093,0.0006602568,0.0005337582,0.0008519678,0.00043475316,0.0010380598,0.0006825149,0.0008594291,0.0017323863],"category_scores_gemma":[0.0044449265,0.0002985115,0.0003299787,0.0012464498,0.0014481953,0.00089218834,0.0012869647,0.00089330645,0.0003217898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021702063,0.00003529814,0.00041042131,0.0003701209,0.000058107293,0.00031045472,0.00028665064,0.65293676,0.015614321,0.27428186,0.0024953804,0.052983552],"study_design_scores_gemma":[0.000012200486,0.00004482762,0.000101455546,0.000031355754,0.00001333896,0.00007102836,0.00001924336,0.9490344,0.0018994692,0.04708827,0.0016705391,0.000013853099],"about_ca_topic_score_codex":0.0015325878,"about_ca_topic_score_gemma":0.0015525062,"teacher_disagreement_score":0.0017323863,"about_ca_system_score_codex":0.0016528772,"about_ca_system_score_gemma":0.0010508207,"threshold_uncertainty_score":0.011992574},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12767752,0.00016482272,0.8701683,0.000091497044,0.000020485726,0.000030719242,0.000026283205,0.0001249759,0.0016954095],"genre_scores_gemma":[0.9365668,0.00009349308,0.062366158,0.000022691233,0.000010395167,0.000028006898,0.000027080445,0.000008232788,0.00087720604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943775,0.00016780806,0.000030651885,0.00008927923,0.00017654998,0.00009791127],"domain_scores_gemma":[0.9992812,0.00030404315,0.000109673485,0.00006768919,0.00014998295,0.000087423396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008336485,0.0003370574,0.00042743114,0.00052589,0.0005694168,0.0007812469,0.0010436071,0.00045778303,0.00051677297],"category_scores_gemma":[0.002237493,0.00023781708,0.00028663536,0.0004567572,0.0007725021,0.0009037115,0.00078709266,0.00042820643,0.00012370913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018365975,0.000038293078,0.0011753183,0.000037432357,0.00003071605,0.00012447823,0.00019871541,0.90907097,0.008823517,0.024946412,0.0004921533,0.054878406],"study_design_scores_gemma":[0.000004412117,0.000016362032,0.0001919601,0.0000021112469,0.000005703423,0.000015781963,0.000020530864,0.9938088,0.0011469782,0.0045910645,0.00018905471,0.0000072647977],"about_ca_topic_score_codex":0.0060357847,"about_ca_topic_score_gemma":0.003899389,"teacher_disagreement_score":0.0060357847,"about_ca_system_score_codex":0.0011717656,"about_ca_system_score_gemma":0.00063254155,"threshold_uncertainty_score":0.012001276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026362002,0.00058991904,0.9659204,0.00033979578,0.00003210139,0.00003912508,0.0001545818,0.00010044612,0.0064617037],"genre_scores_gemma":[0.782889,0.0011924925,0.20236167,0.00020791519,0.00006715038,0.0003414073,0.00035087482,0.00015003316,0.012439497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942964,0.00025640128,0.000017598566,0.0001089372,0.000119242235,0.00006810546],"domain_scores_gemma":[0.9990435,0.00069112965,0.000083425126,0.00004884491,0.000095603056,0.000037476133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096919265,0.0013465688,0.0010242313,0.00046690166,0.00035099545,0.0011963544,0.0011408868,0.0011494118,0.0022572319],"category_scores_gemma":[0.0020639875,0.00056158926,0.0006101839,0.0009617185,0.0010094494,0.001334474,0.0011123869,0.00083934,0.0003821498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027682348,0.000018860697,0.00010267305,0.000067677,0.000015854817,0.000059322272,0.00003441295,0.98064065,0.0009222162,0.01150034,0.0005783021,0.006031982],"study_design_scores_gemma":[0.000008169862,0.000023151946,0.000052303545,0.000004579513,0.0000035771561,0.000015830306,0.000012287783,0.99085325,0.000259566,0.008443044,0.00032027034,0.000004005805],"about_ca_topic_score_codex":0.002808784,"about_ca_topic_score_gemma":0.0024063622,"teacher_disagreement_score":0.002808784,"about_ca_system_score_codex":0.0013452376,"about_ca_system_score_gemma":0.00076567126,"threshold_uncertainty_score":0.00976038},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42189997,0.0036645727,0.5463214,0.00064391136,0.00010640858,0.00007864565,0.00026202074,0.00042048222,0.026602592],"genre_scores_gemma":[0.9876979,0.0007365544,0.010007747,0.00004391777,0.00003548168,0.000028985496,0.00005134831,0.000017288892,0.0013807782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881434,0.00033386424,0.000048840044,0.00016502436,0.00040016093,0.00023779468],"domain_scores_gemma":[0.99627703,0.0020906893,0.00049147883,0.00018015623,0.0008618839,0.000098808356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011876323,0.0012468802,0.0009694397,0.0009745093,0.00066693744,0.0012678608,0.0010175782,0.001135131,0.0012728936],"category_scores_gemma":[0.0043262243,0.00032958318,0.0005945139,0.0009856452,0.00094312266,0.0012697103,0.0010539899,0.000626762,0.0003477081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013217653,0.000035249646,0.0017314806,0.000099229874,0.000043010918,0.0004167169,0.0001236344,0.9667008,0.008697536,0.013475155,0.0003042733,0.008240824],"study_design_scores_gemma":[0.0000034516763,0.000051227198,0.00027903417,0.0000047997796,0.000014815131,0.0001460771,0.000028298171,0.99705005,0.0008724409,0.0014300608,0.00010992764,0.000009848301],"about_ca_topic_score_codex":0.0044913064,"about_ca_topic_score_gemma":0.002397772,"teacher_disagreement_score":0.0044913064,"about_ca_system_score_codex":0.0016681595,"about_ca_system_score_gemma":0.00082553085,"threshold_uncertainty_score":0.012103379},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009761976,0.00022691485,0.9887883,0.00007909218,0.000018489163,0.000026252299,0.00002076593,0.00012905357,0.0009491908],"genre_scores_gemma":[0.28057528,0.00035474787,0.716074,0.00010543748,0.000036293288,0.00017664612,0.00010770803,0.000042616804,0.0025271955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929416,0.00015395135,0.00005448301,0.00009159181,0.00033650125,0.000069252215],"domain_scores_gemma":[0.9980248,0.00091905653,0.0002277225,0.00020386222,0.00058308523,0.000041456125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009928397,0.0006635338,0.0006909875,0.0009340152,0.0005064341,0.0008681001,0.0012262412,0.000761954,0.0009914832],"category_scores_gemma":[0.004533884,0.00039289743,0.00032325368,0.00066853216,0.00060334924,0.0010151187,0.001004929,0.0008210838,0.0004098229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003215551,0.000079696656,0.0017397898,0.00017392996,0.000058272683,0.00012601409,0.0005335785,0.524173,0.01482598,0.06543175,0.0022536507,0.39028287],"study_design_scores_gemma":[0.00001983669,0.000046015626,0.00015275991,0.000010382117,0.000007686105,0.0000964351,0.000024626283,0.9856595,0.0041018855,0.008406345,0.0014564155,0.000018017729],"about_ca_topic_score_codex":0.0017752986,"about_ca_topic_score_gemma":0.0023951728,"teacher_disagreement_score":0.0017752986,"about_ca_system_score_codex":0.0010440885,"about_ca_system_score_gemma":0.0012112441,"threshold_uncertainty_score":0.0075754523},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5537432,0.0016648057,0.34942007,0.004044436,0.00023593147,0.00014473693,0.0024708118,0.0005865159,0.08768959],"genre_scores_gemma":[0.9651878,0.0006467729,0.020150313,0.0003636041,0.00012972174,0.00011117487,0.00072351977,0.00006414812,0.012623019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880874,0.00046916032,0.000057881294,0.0001533432,0.0002480411,0.00026288562],"domain_scores_gemma":[0.9950223,0.002695798,0.0008298667,0.0005760468,0.0004123007,0.0004637127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007737424,0.00047542562,0.0006296281,0.0010612003,0.0011360889,0.0016959922,0.0008581566,0.00091086497,0.0042436924],"category_scores_gemma":[0.0042329542,0.00034209396,0.0004892946,0.0014469415,0.0017071278,0.0024028223,0.0026763577,0.0013423995,0.00091580744],"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.00016229536,0.000032531065,0.00044611143,0.00007572554,0.000017582695,0.00022320212,0.0002212361,0.020297281,0.0013983272,0.9653089,0.0043143495,0.0075023724],"study_design_scores_gemma":[0.000038971004,0.00003158172,0.00026414316,0.000026794263,0.000011143189,0.00023871973,0.00014678048,0.07687617,0.0007574207,0.91869724,0.0028906446,0.00002040997],"about_ca_topic_score_codex":0.0017209223,"about_ca_topic_score_gemma":0.0015378272,"teacher_disagreement_score":0.0042436924,"about_ca_system_score_codex":0.0009864339,"about_ca_system_score_gemma":0.0008810838,"threshold_uncertainty_score":0.014196575},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36486918,0.0013741397,0.62101734,0.00035238577,0.000047238325,0.00005332728,0.0001228613,0.00021425246,0.011949204],"genre_scores_gemma":[0.99297136,0.00024327365,0.00582916,0.000029688226,0.000011665025,0.00002437882,0.000012272548,0.000007726392,0.0008705437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989749,0.0003937266,0.000026461285,0.000101603095,0.00025591414,0.00024743],"domain_scores_gemma":[0.9957071,0.0032230674,0.00040418885,0.00017154826,0.00040187017,0.000092243754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015570229,0.00069979555,0.00083847897,0.00058401335,0.00063309434,0.0013004533,0.0010675229,0.0008017118,0.0006028383],"category_scores_gemma":[0.0054911855,0.0003929156,0.0003410568,0.0008680517,0.0015792496,0.0011076328,0.0012092573,0.0005885852,0.00011241522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091387126,0.000022287313,0.00048999744,0.00006920415,0.00003643243,0.0005964039,0.00025863317,0.9537296,0.0024516138,0.03423243,0.00034518592,0.007676876],"study_design_scores_gemma":[0.0000064979054,0.000025594785,0.00014110978,0.000005888827,0.000012340387,0.00008593861,0.000040186376,0.9862671,0.00046540258,0.012782391,0.00015808309,0.000009458401],"about_ca_topic_score_codex":0.006212666,"about_ca_topic_score_gemma":0.005171682,"teacher_disagreement_score":0.006212666,"about_ca_system_score_codex":0.0014148491,"about_ca_system_score_gemma":0.0012060427,"threshold_uncertainty_score":0.012353003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6418702,0.0016111217,0.1859911,0.002953019,0.00031698513,0.00035529997,0.0038438307,0.0007928415,0.16226564],"genre_scores_gemma":[0.967827,0.0006314765,0.022744985,0.0003416042,0.0002802084,0.00018764944,0.0015493066,0.00008974937,0.006347972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984584,0.0002049606,0.0001330896,0.00046860994,0.00036010696,0.00037493513],"domain_scores_gemma":[0.9907101,0.0048804944,0.0013943709,0.0010450234,0.0008053512,0.0011645822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011377849,0.00079626543,0.0006616546,0.0016094897,0.0014618246,0.0015985591,0.00133036,0.0012368555,0.012573506],"category_scores_gemma":[0.0109873265,0.00055026036,0.0009409094,0.001321792,0.002530542,0.006197229,0.0026024438,0.0024348034,0.0012020487],"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.0007446986,0.00024052683,0.008544044,0.0006479572,0.00007246037,0.0021922775,0.0012529333,0.020086946,0.022555538,0.89828455,0.006683853,0.03869419],"study_design_scores_gemma":[0.000182908,0.0004321526,0.011313587,0.0001947521,0.00013678301,0.0053503127,0.0013006828,0.04588259,0.023505913,0.87678003,0.034784134,0.00013608522],"about_ca_topic_score_codex":0.0009645577,"about_ca_topic_score_gemma":0.0012566989,"teacher_disagreement_score":0.012573506,"about_ca_system_score_codex":0.00068973016,"about_ca_system_score_gemma":0.00051577797,"threshold_uncertainty_score":0.04206258},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0891416,0.0003502922,0.9072171,0.00017910193,0.000016695973,0.000055728986,0.000077612654,0.00010438936,0.0028573947],"genre_scores_gemma":[0.92096937,0.00036853843,0.075861484,0.000061741026,0.00002721287,0.00008571762,0.000047209185,0.000013478736,0.0025652044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993229,0.00030673583,0.00003562128,0.00011880975,0.00013769719,0.00007828856],"domain_scores_gemma":[0.999172,0.00052997743,0.000105057894,0.00005358903,0.000116266965,0.000023126251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086140324,0.00065737794,0.00079362176,0.00023511093,0.00030100497,0.00088213134,0.00047721862,0.0006780796,0.0011862823],"category_scores_gemma":[0.0016406619,0.0003525908,0.00032001105,0.00028404608,0.0006327159,0.00083424046,0.0005364676,0.00040702737,0.00031221908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003312621,0.00008329215,0.0008460228,0.00021453638,0.00010517753,0.0003855699,0.00026598337,0.8821888,0.02638426,0.029287959,0.00072780356,0.059179354],"study_design_scores_gemma":[0.000031720687,0.000103709106,0.00021615557,0.0000071523596,0.000023969667,0.00010049273,0.00003648634,0.99024993,0.00366267,0.0051139337,0.0004407648,0.0000130149165],"about_ca_topic_score_codex":0.001282843,"about_ca_topic_score_gemma":0.0017583041,"teacher_disagreement_score":0.001282843,"about_ca_system_score_codex":0.0006078578,"about_ca_system_score_gemma":0.00074351823,"threshold_uncertainty_score":0.004555583},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99796486,0.0004938109,0.00030794227,0.000068278125,0.0000071732334,0.0000044425506,0.0001408626,0.000006928919,0.0010057165],"genre_scores_gemma":[0.9968305,0.00033868238,0.00015571553,0.000016594237,0.000012869757,0.000010181456,0.00011598047,0.000007159656,0.0025122922],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998092,0.000053415675,0.000008568355,0.00004364153,0.00003139439,0.000053854335],"domain_scores_gemma":[0.9985958,0.00059621874,0.00023265275,0.00005718167,0.00025304823,0.0002651447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026060402,0.00019981827,0.00034803295,0.0006031521,0.0005423059,0.0009554151,0.00018396656,0.0004221246,0.004950867],"category_scores_gemma":[0.002068971,0.00014487357,0.00027814865,0.00040465716,0.00028993408,0.0003432728,0.00024357633,0.0004248862,0.0006046045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007439775,0.00036287826,0.8335416,0.00017621284,0.00040252056,0.0028506326,0.00719129,0.0032726408,0.08651027,0.0014541289,0.0008766171,0.055921458],"study_design_scores_gemma":[0.000021452592,0.00028784116,0.99132335,0.000018234257,0.000059758586,0.0010304145,0.0014459676,0.0009127734,0.0027932224,0.00024895728,0.0018416465,0.00001626854],"about_ca_topic_score_codex":0.022385977,"about_ca_topic_score_gemma":0.012411498,"teacher_disagreement_score":0.022385977,"about_ca_system_score_codex":0.0007020901,"about_ca_system_score_gemma":0.00028403796,"threshold_uncertainty_score":0.044511378},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28777567,0.0019592084,0.690079,0.00022150144,0.000071752394,0.000071798466,0.00005109694,0.00022645162,0.019543575],"genre_scores_gemma":[0.98093283,0.0011661351,0.014681416,0.000038485083,0.000027873144,0.000036807432,0.000014014936,0.000006955306,0.0030954944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953365,0.00014047866,0.000013524221,0.00006887385,0.00013569031,0.00010775938],"domain_scores_gemma":[0.9990754,0.00059439125,0.00011759539,0.00006204683,0.0001259131,0.000024671417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004024601,0.00060012157,0.0005194895,0.0003498489,0.00039564833,0.0010333405,0.00058976136,0.0006203863,0.00050447584],"category_scores_gemma":[0.0019100958,0.00015014461,0.00030502887,0.00073414703,0.00062535447,0.0005949734,0.0006202012,0.00045555618,0.00016753655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016176514,0.00009657678,0.0017562018,0.00021144863,0.000081377315,0.0007014712,0.0005479447,0.8746965,0.019161463,0.0610323,0.0006510785,0.040901825],"study_design_scores_gemma":[0.000014683965,0.00011305018,0.00045157605,0.000018354693,0.00003088151,0.00014553258,0.00010876627,0.9822075,0.0033786974,0.012118513,0.001396552,0.000015966312],"about_ca_topic_score_codex":0.002996532,"about_ca_topic_score_gemma":0.0022241687,"teacher_disagreement_score":0.002996532,"about_ca_system_score_codex":0.0005952638,"about_ca_system_score_gemma":0.00070584303,"threshold_uncertainty_score":0.0059581995},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006023059,0.3062801,0.35102662,0.0032357706,0.010322296,0.00013879557,0.0002542772,0.0008257736,0.32189333],"genre_scores_gemma":[0.05965478,0.35509396,0.08736268,0.0012812577,0.009123272,0.00019858574,0.00044100374,0.00028755015,0.48655698],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998086,0.00003564464,0.000009186608,0.000031553394,0.00010033617,0.000014668766],"domain_scores_gemma":[0.99980825,0.000119501696,0.000009179151,0.00002448313,0.00003131694,0.000007250505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002465916,0.0013742239,0.0009416802,0.0006216659,0.0002816211,0.0012919344,0.000954017,0.0010328453,0.0066117775],"category_scores_gemma":[0.0004452044,0.0004048763,0.0003249401,0.0014863365,0.00079323986,0.0016815884,0.0005940899,0.0017577994,0.005561786],"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.00005550119,0.00010654313,0.00007838815,0.0012765176,0.000040701805,0.00021655523,0.0002167355,0.011943442,0.012008927,0.25100145,0.10195053,0.6211046],"study_design_scores_gemma":[0.000023877627,0.00018966604,0.0002845802,0.00044836575,0.000046521523,0.0007414453,0.000064989494,0.023489924,0.0045655775,0.24878536,0.7213165,0.00004316091],"about_ca_topic_score_codex":0.00029016472,"about_ca_topic_score_gemma":0.00045425294,"teacher_disagreement_score":0.0066117775,"about_ca_system_score_codex":0.000361543,"about_ca_system_score_gemma":0.00041349028,"threshold_uncertainty_score":0.022118568},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02298112,0.00021214742,0.9738307,0.000095928684,0.00003146297,0.000024904977,0.00002743519,0.0001786929,0.0026175622],"genre_scores_gemma":[0.77230054,0.00039736784,0.22402413,0.00013442927,0.000045058623,0.00009926998,0.00006835432,0.000026141275,0.002904786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940586,0.00020859021,0.000027775792,0.00007538351,0.0002177962,0.000064585336],"domain_scores_gemma":[0.9993894,0.00028695265,0.00007963997,0.000084094514,0.00013547046,0.000024532696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057588815,0.0008887491,0.0005044499,0.00031113095,0.00025884339,0.00047698416,0.00060708827,0.00057769293,0.001476551],"category_scores_gemma":[0.0011554153,0.00033490348,0.00052001316,0.0005893239,0.00047315608,0.0005462338,0.0007762253,0.00051110756,0.0005145709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027984908,0.00009230336,0.00092252274,0.00020456417,0.00011320229,0.00037734205,0.00030697446,0.6803714,0.14086437,0.031036453,0.0016473058,0.14378373],"study_design_scores_gemma":[0.000026439855,0.00023125748,0.0003291841,0.000012756223,0.000022855964,0.00017997457,0.000023631334,0.976904,0.016406769,0.0043026526,0.0015353896,0.00002512047],"about_ca_topic_score_codex":0.0006732489,"about_ca_topic_score_gemma":0.0011041358,"teacher_disagreement_score":0.001476551,"about_ca_system_score_codex":0.00030829778,"about_ca_system_score_gemma":0.00049828767,"threshold_uncertainty_score":0.004939556},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09356076,0.00023456551,0.9045904,0.00012395642,0.000027920889,0.000063968015,0.00004632244,0.00022498025,0.0011270725],"genre_scores_gemma":[0.9356607,0.00010349639,0.063597776,0.000034595843,0.00000966238,0.000055126166,0.00005375773,0.000009128444,0.0004757464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938214,0.00013780242,0.000042484386,0.00011950591,0.00021457158,0.00010337641],"domain_scores_gemma":[0.99935573,0.00023960767,0.00009558288,0.0000908765,0.00017619926,0.000042081763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010195164,0.00044886812,0.0006158351,0.00043251686,0.0006274736,0.0005411111,0.0010131318,0.000584656,0.0003443622],"category_scores_gemma":[0.0015286867,0.00023417737,0.00030138227,0.0003664706,0.0005462887,0.0007172956,0.000701563,0.00049811596,0.00006882979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017591592,0.00007506432,0.0006950942,0.000029803705,0.00001881199,0.00007585637,0.000055436656,0.9339245,0.011928073,0.010827577,0.00052715396,0.04166671],"study_design_scores_gemma":[0.000009791419,0.00003211254,0.00007829039,0.000001436324,0.0000042784886,0.000011089419,0.0000044328053,0.99676573,0.0015740378,0.0013801637,0.00013343693,0.0000052385853],"about_ca_topic_score_codex":0.00728349,"about_ca_topic_score_gemma":0.0060057472,"teacher_disagreement_score":0.00728349,"about_ca_system_score_codex":0.0014111955,"about_ca_system_score_gemma":0.0018280352,"threshold_uncertainty_score":0.014482141},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26913905,0.0034851034,0.7071837,0.00039407137,0.000090103116,0.00005259002,0.00010236969,0.00076548866,0.01878763],"genre_scores_gemma":[0.99062246,0.00067627826,0.008172229,0.000017207196,0.000016571183,0.000012514454,0.000017685983,0.000015040807,0.00045003791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994357,0.00020974144,0.00001890285,0.000053470325,0.00020298365,0.000079036596],"domain_scores_gemma":[0.9982284,0.0011580173,0.00019495474,0.00010777333,0.00027129607,0.000039646457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074394426,0.0005241023,0.000618274,0.00043853043,0.0003088444,0.00068856374,0.0005153089,0.00040779583,0.00095124595],"category_scores_gemma":[0.0025559429,0.00016248738,0.00030945096,0.00055635447,0.0004561761,0.00055792875,0.00054039154,0.00034808883,0.00017670673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022539371,0.00004930778,0.0015464696,0.0001595795,0.000055232416,0.0002890769,0.00016990115,0.93197304,0.024336057,0.013761863,0.00072167057,0.0267125],"study_design_scores_gemma":[0.0000049381847,0.000097704884,0.00057871564,0.000011317768,0.00002019678,0.000112234135,0.000020611256,0.9935121,0.0036686661,0.001638682,0.000324275,0.000010527933],"about_ca_topic_score_codex":0.0010554598,"about_ca_topic_score_gemma":0.00074657693,"teacher_disagreement_score":0.0010554598,"about_ca_system_score_codex":0.00062166445,"about_ca_system_score_gemma":0.00032359562,"threshold_uncertainty_score":0.0045104623},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5303115,0.0026562333,0.4555543,0.0001976631,0.000044228836,0.000029494551,0.000045255547,0.00019905291,0.010962222],"genre_scores_gemma":[0.9952561,0.00029048286,0.0041231895,0.000012205573,0.000013771893,0.0000074771297,0.0000043688433,0.000005587053,0.00028675713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917006,0.00032455855,0.00002362402,0.00007580593,0.00021250408,0.00019349731],"domain_scores_gemma":[0.9979182,0.0014433535,0.00025180058,0.00013064225,0.00019257673,0.00006342027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010753026,0.00080010004,0.000562826,0.0004270475,0.00054671976,0.0011575432,0.0007259207,0.0006553024,0.00045671494],"category_scores_gemma":[0.0037236242,0.0002774299,0.00027442747,0.0005151621,0.0009468934,0.0009290769,0.001052161,0.00041073773,0.00014914578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003305746,0.000079412464,0.0020734689,0.00016470156,0.00007882589,0.00076202315,0.00041110904,0.9038538,0.018874656,0.029763592,0.00031384255,0.043294065],"study_design_scores_gemma":[0.000009256167,0.00013904557,0.00040461967,0.000010426172,0.00002913267,0.00015040177,0.000066073575,0.9862114,0.0017433763,0.010890923,0.00033011878,0.000015149965],"about_ca_topic_score_codex":0.0028011296,"about_ca_topic_score_gemma":0.002937586,"teacher_disagreement_score":0.0028011296,"about_ca_system_score_codex":0.00055063155,"about_ca_system_score_gemma":0.0006162161,"threshold_uncertainty_score":0.00568676},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037604462,0.00057785807,0.95684046,0.00016458622,0.00007000026,0.0000751375,0.00003195631,0.00032955233,0.0043060295],"genre_scores_gemma":[0.8744123,0.0014195398,0.12114659,0.00010466421,0.000060822167,0.00009583465,0.0001205588,0.000028840715,0.0026109642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965775,0.00009303954,0.000017495571,0.000043852433,0.00014766022,0.00004018687],"domain_scores_gemma":[0.9995641,0.00020744182,0.00004022283,0.000059600454,0.00010939538,0.000019184654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005112679,0.00047101342,0.00032708686,0.00045154063,0.0003348556,0.00046285766,0.0005398495,0.00043156443,0.00040379053],"category_scores_gemma":[0.0011655655,0.00017047489,0.0003358222,0.00049832754,0.00050539395,0.0009513837,0.00062200753,0.0005831537,0.000119299235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001598683,0.00009804395,0.0011396701,0.00014673921,0.000073763724,0.00057801296,0.00020876403,0.64362794,0.060522374,0.13751979,0.001502674,0.15442227],"study_design_scores_gemma":[0.000011111212,0.00007579462,0.00014151793,0.000016232842,0.000016576401,0.000116937445,0.000023552628,0.9794561,0.009309309,0.008664042,0.0021524103,0.000016407923],"about_ca_topic_score_codex":0.0029597906,"about_ca_topic_score_gemma":0.0020131127,"teacher_disagreement_score":0.0029597906,"about_ca_system_score_codex":0.00050011463,"about_ca_system_score_gemma":0.000688825,"threshold_uncertainty_score":0.005885124},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05591967,0.00030698424,0.9388279,0.00027668677,0.00006937258,0.00021389996,0.00033859658,0.00059900084,0.003447939],"genre_scores_gemma":[0.32797512,0.00035586272,0.6679523,0.00010041867,0.000037774982,0.00035645018,0.00093208253,0.0001574881,0.002132476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986827,0.00046420487,0.00010288091,0.0002521536,0.0003403312,0.00015776433],"domain_scores_gemma":[0.9959124,0.0024753183,0.00018427259,0.00069207454,0.0005210419,0.00021490808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012341934,0.0006727973,0.0013168117,0.0010558114,0.00095259194,0.0012944365,0.0030967174,0.00079088996,0.0022662652],"category_scores_gemma":[0.006480933,0.00087358366,0.0011987351,0.0014029312,0.0008599308,0.0026236286,0.0038371978,0.0012382742,0.00046224034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069443235,0.00030972846,0.0030973777,0.0010602511,0.00015655685,0.0004163637,0.0010164374,0.5273538,0.020221058,0.12188935,0.0070716213,0.31671304],"study_design_scores_gemma":[0.000057895053,0.00013174284,0.0006435803,0.00006131346,0.00005730717,0.00020231656,0.00022198056,0.89539576,0.006447411,0.09175737,0.0049921013,0.000031250154],"about_ca_topic_score_codex":0.001237662,"about_ca_topic_score_gemma":0.002363884,"teacher_disagreement_score":0.0030967174,"about_ca_system_score_codex":0.00088846585,"about_ca_system_score_gemma":0.0011138126,"threshold_uncertainty_score":0.007581413},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0079535125,0.00041633841,0.9869658,0.00012426564,0.00006680398,0.000062084815,0.00003656481,0.00018404862,0.004190611],"genre_scores_gemma":[0.82767206,0.0008354233,0.16604216,0.0002602805,0.00009256747,0.00026488732,0.00012155482,0.000088017536,0.0046229744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989794,0.00030970655,0.00003611282,0.00016193753,0.0003244487,0.00018844691],"domain_scores_gemma":[0.99903846,0.0003436773,0.00011514661,0.000074245756,0.0003804384,0.000048050268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014832244,0.0011273732,0.00058156427,0.00045459272,0.00051778724,0.0013628457,0.0012171111,0.00065382704,0.00311337],"category_scores_gemma":[0.0023736898,0.00039077408,0.00043194025,0.00049390504,0.00060727785,0.00088651665,0.0011921949,0.00096899376,0.0005724639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001133446,0.000064541106,0.00047981503,0.00011799493,0.000056175504,0.00015865329,0.00009575882,0.8998885,0.010281146,0.033187043,0.0023044797,0.053252418],"study_design_scores_gemma":[0.000007117698,0.000042502106,0.00005426473,0.000008122374,0.000009843917,0.000024240884,0.000012074266,0.9958489,0.0010607161,0.0021453083,0.0007807238,0.000006233737],"about_ca_topic_score_codex":0.0043819603,"about_ca_topic_score_gemma":0.0051380727,"teacher_disagreement_score":0.0043819603,"about_ca_system_score_codex":0.0012676832,"about_ca_system_score_gemma":0.0014908648,"threshold_uncertainty_score":0.010415196},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01697752,0.0049474477,0.9375928,0.0035234997,0.00035955585,0.00029601486,0.0011028536,0.0011297582,0.034070518],"genre_scores_gemma":[0.3645789,0.009178066,0.5951515,0.0037677283,0.0022126795,0.002152837,0.0035958637,0.002009684,0.017352795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99236274,0.0031461772,0.000344894,0.0014099737,0.0017900529,0.0009461169],"domain_scores_gemma":[0.94413155,0.048676535,0.0017319842,0.002829376,0.001800065,0.00083041616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013270503,0.004892688,0.003943018,0.005318215,0.0029642347,0.0062822085,0.007027331,0.003542754,0.013108298],"category_scores_gemma":[0.05723235,0.0019600387,0.0044147745,0.0076677576,0.005765282,0.023383752,0.00658921,0.012647348,0.0025831233],"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.00050767075,0.00024532268,0.0013193614,0.00086343294,0.00016693503,0.00020650637,0.00050838396,0.16088918,0.0012315976,0.75974107,0.015787475,0.05853305],"study_design_scores_gemma":[0.000054579577,0.00007188589,0.00022747934,0.00011012128,0.000056610155,0.00011421572,0.00008984502,0.3217703,0.00066097913,0.6721034,0.004710734,0.000029845032],"about_ca_topic_score_codex":0.004438552,"about_ca_topic_score_gemma":0.0050190776,"teacher_disagreement_score":0.013270503,"about_ca_system_score_codex":0.007756006,"about_ca_system_score_gemma":0.0033057109,"threshold_uncertainty_score":0.070181966},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07629394,0.0012216433,0.91618806,0.0003649705,0.00007092083,0.0000578322,0.000087333756,0.00014729697,0.0055679125],"genre_scores_gemma":[0.9793218,0.000845056,0.017344156,0.000080911894,0.000051605635,0.00007942338,0.00005273882,0.000043532455,0.0021807814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989359,0.00023680336,0.000039734157,0.00018580919,0.00034219338,0.00025950506],"domain_scores_gemma":[0.9928005,0.0051872605,0.00064081606,0.0002510962,0.0009770057,0.00014327375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002203484,0.0010104058,0.0006868234,0.0008533522,0.0006727614,0.0011440723,0.0011072699,0.0006224722,0.0015837484],"category_scores_gemma":[0.009265833,0.00040404522,0.00040677603,0.0009711629,0.0012367218,0.0018920106,0.0010572623,0.00087412365,0.00021731347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009248842,0.000019730025,0.00069832575,0.00010518431,0.000028992357,0.0001660417,0.00018797218,0.9453675,0.0040438124,0.04246069,0.00041545834,0.006413905],"study_design_scores_gemma":[0.0000035250816,0.0000268221,0.00012240469,0.0000043999316,0.000008867143,0.000040202278,0.000037864025,0.9937785,0.0005365228,0.0051912814,0.00024253632,0.000006946095],"about_ca_topic_score_codex":0.0042640334,"about_ca_topic_score_gemma":0.0021944237,"teacher_disagreement_score":0.0042640334,"about_ca_system_score_codex":0.002717074,"about_ca_system_score_gemma":0.0015309907,"threshold_uncertainty_score":0.019713879},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027424807,0.0056824465,0.98057234,0.0001521062,0.00022902715,0.000045290955,0.00005311405,0.00024367633,0.010279469],"genre_scores_gemma":[0.34565088,0.01853515,0.60271794,0.00061662,0.00073009136,0.0003885404,0.00036335504,0.0003362028,0.030661177],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992269,0.00022975892,0.000047063935,0.00009515911,0.0003073884,0.00009362379],"domain_scores_gemma":[0.99939835,0.00023998288,0.00004064898,0.0001013547,0.00020322652,0.000016408785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012113168,0.0015250898,0.00055278203,0.00047390175,0.0003491098,0.0015187019,0.0015620408,0.00081447297,0.006283116],"category_scores_gemma":[0.001816318,0.00055236596,0.00038714326,0.0007064662,0.0004151689,0.0014065359,0.001172374,0.0014934223,0.0020588113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019115435,0.0001365406,0.0003059355,0.0007909942,0.00020518687,0.00018421937,0.0001915487,0.24018009,0.029798679,0.21562496,0.017813455,0.49457732],"study_design_scores_gemma":[0.000047198155,0.00026452812,0.00033754186,0.00019689093,0.00013205504,0.0005772417,0.00008010795,0.78797597,0.0139499735,0.14943981,0.04694803,0.00005066304],"about_ca_topic_score_codex":0.00034290305,"about_ca_topic_score_gemma":0.0007931696,"teacher_disagreement_score":0.006283116,"about_ca_system_score_codex":0.00057076215,"about_ca_system_score_gemma":0.00042123522,"threshold_uncertainty_score":0.021019101},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08934602,0.0011635018,0.90460074,0.00052280846,0.00011213456,0.00007743216,0.000024339983,0.00080566446,0.0033473289],"genre_scores_gemma":[0.9220762,0.00045924366,0.07626745,0.000101439204,0.000060570612,0.000053326236,0.000023861368,0.00004694925,0.0009108955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994122,0.00018564302,0.000022743603,0.000060337094,0.0002567002,0.00006239946],"domain_scores_gemma":[0.99722517,0.001710318,0.00022047565,0.00026455917,0.00049808115,0.00008133929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012168984,0.00039492955,0.00033815365,0.0006534287,0.0004851394,0.0005289241,0.0008279829,0.000511696,0.00072829326],"category_scores_gemma":[0.0048539545,0.000159109,0.00017043002,0.0005370242,0.0008956578,0.001285194,0.00096406933,0.0009462937,0.00015513392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041173855,0.00024008595,0.0016689794,0.00016183409,0.000034045745,0.000235049,0.00031117038,0.59586906,0.07491287,0.07193703,0.0018793728,0.25233877],"study_design_scores_gemma":[0.000007845209,0.00009009958,0.0001395584,0.000008407439,0.000007447882,0.0000608428,0.000015072711,0.9851917,0.008005183,0.005794427,0.00066778023,0.000011522312],"about_ca_topic_score_codex":0.0016774565,"about_ca_topic_score_gemma":0.0015458931,"teacher_disagreement_score":0.0016774565,"about_ca_system_score_codex":0.00069950515,"about_ca_system_score_gemma":0.0006904079,"threshold_uncertainty_score":0.0064356923},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050096128,0.0005079596,0.94397265,0.0003951389,0.00006162942,0.00008457374,0.000100693316,0.000142689,0.004638594],"genre_scores_gemma":[0.9605002,0.00056796405,0.035313547,0.00007349878,0.000042196978,0.00011484108,0.00007616288,0.000029225286,0.003282431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992125,0.0003081882,0.000026253218,0.0001241793,0.0001344214,0.0001945436],"domain_scores_gemma":[0.9976065,0.0018775258,0.00020347266,0.00007349646,0.00014285705,0.00009607821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014529618,0.0009001717,0.0011956425,0.0005428399,0.0006401574,0.0010999951,0.0010347757,0.0008164789,0.0025479756],"category_scores_gemma":[0.0023849835,0.0006620132,0.0008599242,0.00086848607,0.000939238,0.0013076401,0.00078886934,0.0009497446,0.00021795841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005373466,0.000024500934,0.00018440094,0.000029230023,0.000020736483,0.00008721057,0.000033086373,0.97833335,0.0005695386,0.016339386,0.00032429426,0.004000549],"study_design_scores_gemma":[0.00000825645,0.000011061762,0.000035822577,0.0000015736192,0.000004243965,0.000008336854,0.000004562059,0.9964593,0.00008182341,0.0032596278,0.00012226676,0.0000031689729],"about_ca_topic_score_codex":0.012499248,"about_ca_topic_score_gemma":0.010219703,"teacher_disagreement_score":0.012499248,"about_ca_system_score_codex":0.0020811588,"about_ca_system_score_gemma":0.0019803604,"threshold_uncertainty_score":0.024852991},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027163755,0.00047951104,0.96850103,0.00021461019,0.000025834534,0.000030718085,0.00007446759,0.000101716134,0.003408364],"genre_scores_gemma":[0.9450604,0.00047084453,0.051116824,0.00006170868,0.000028659564,0.000088677545,0.00008549738,0.000034823795,0.0030527187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995104,0.00016266984,0.000020156443,0.00011586762,0.00012684711,0.000064045984],"domain_scores_gemma":[0.9991054,0.000580181,0.00014167062,0.000046660218,0.000105224455,0.000020936792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000986338,0.0010411062,0.0011006675,0.00032830995,0.00025350755,0.001216173,0.0007053027,0.0012571687,0.0012180326],"category_scores_gemma":[0.0022482492,0.00044019902,0.0005488183,0.0005050145,0.0007761591,0.0009180571,0.00073781586,0.00076726533,0.00022159169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002927115,0.000011712966,0.000106349224,0.000043779866,0.000022947774,0.000049471746,0.000020578747,0.98849154,0.0013714136,0.005138852,0.00012933611,0.0045847166],"study_design_scores_gemma":[0.000005340516,0.00002070577,0.00005173084,0.0000029754085,0.0000056248086,0.000009248349,0.0000060937405,0.9981335,0.00037674798,0.0012823406,0.00010154317,0.0000041514822],"about_ca_topic_score_codex":0.0030205029,"about_ca_topic_score_gemma":0.0017116177,"teacher_disagreement_score":0.0030205029,"about_ca_system_score_codex":0.00087719155,"about_ca_system_score_gemma":0.00081553846,"threshold_uncertainty_score":0.0063644648},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86778873,0.0012553053,0.12627953,0.00025848372,0.000034745175,0.00002232967,0.00006583919,0.00021005402,0.0040849634],"genre_scores_gemma":[0.99839044,0.00015364675,0.0012688346,0.000012853782,0.000004207675,0.0000041506582,0.000009425621,0.0000064948804,0.0001501362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867815,0.00044834946,0.00006768802,0.00014303367,0.00036936114,0.00029333634],"domain_scores_gemma":[0.9937483,0.004374173,0.0006950841,0.0003201892,0.00074509997,0.00011715514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017570122,0.0009466896,0.00097251794,0.0004547052,0.00053202186,0.00094380585,0.00074150943,0.0011085522,0.0005421483],"category_scores_gemma":[0.0070489175,0.00024222546,0.00034165784,0.00049694366,0.0011543449,0.0009067009,0.00083590753,0.0005706218,0.000095909425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005847627,0.000050913975,0.0046451283,0.00016381481,0.00011271806,0.0009563561,0.0002727284,0.9461718,0.0296776,0.0072030798,0.00015693619,0.0100040445],"study_design_scores_gemma":[0.000012233862,0.00022589229,0.0015325155,0.000019083805,0.00005846382,0.0003123801,0.000101743186,0.98681575,0.009509197,0.0012786709,0.00010568092,0.000028414268],"about_ca_topic_score_codex":0.0033574847,"about_ca_topic_score_gemma":0.0018507614,"teacher_disagreement_score":0.0033574847,"about_ca_system_score_codex":0.0009970664,"about_ca_system_score_gemma":0.0006870076,"threshold_uncertainty_score":0.009292066},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009031861,0.0024831083,0.9791875,0.00017626362,0.00014366256,0.000057521636,0.000053642245,0.0002006722,0.008665676],"genre_scores_gemma":[0.7876942,0.004740922,0.1956767,0.00029738664,0.00029422346,0.00037464095,0.00018629512,0.0001658717,0.010569814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993767,0.00020178972,0.000029841603,0.000093739414,0.00020310063,0.00009489134],"domain_scores_gemma":[0.9990446,0.00048123824,0.00010089928,0.000075640724,0.00025319235,0.000044415523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012054611,0.000978247,0.0005417624,0.0003602444,0.00035579273,0.0010285503,0.0011315924,0.0005369372,0.004413219],"category_scores_gemma":[0.0020602588,0.00031173605,0.00032876222,0.0006127464,0.0005417128,0.0007156064,0.0009029816,0.0008277904,0.00088598806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012202197,0.000060196962,0.00033107732,0.00028420382,0.000074937554,0.00021405108,0.00020562018,0.8094288,0.01184308,0.06717072,0.006066869,0.10419836],"study_design_scores_gemma":[0.000019617763,0.000110079534,0.00012846375,0.000028603245,0.000022681907,0.000112114576,0.000032974327,0.98096794,0.0018210735,0.012129184,0.00461429,0.000013021409],"about_ca_topic_score_codex":0.0014062116,"about_ca_topic_score_gemma":0.0014454776,"teacher_disagreement_score":0.004413219,"about_ca_system_score_codex":0.0009495595,"about_ca_system_score_gemma":0.0010170044,"threshold_uncertainty_score":0.014763653},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022363825,0.0044235876,0.95964247,0.0003449935,0.00009325606,0.00003976706,0.00002777091,0.00010369114,0.012960622],"genre_scores_gemma":[0.7272732,0.015613551,0.24286701,0.0002613244,0.00029474808,0.0002659477,0.000107393,0.00008429454,0.013232527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957186,0.00016986496,0.000012668969,0.00006349885,0.00015442018,0.000027694543],"domain_scores_gemma":[0.9993493,0.0004955545,0.00004129224,0.000048402388,0.00005141501,0.000013909769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007196499,0.0006153062,0.0005701391,0.00035798605,0.00031189152,0.0006943561,0.0007075442,0.00058809284,0.0009246798],"category_scores_gemma":[0.0013465835,0.00032227824,0.000391798,0.0012039038,0.00081750815,0.0013019082,0.0008353493,0.00073342957,0.00027511147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006994059,0.000052836735,0.00039121942,0.0005634983,0.000049642713,0.0002423849,0.00032008052,0.6381466,0.013107731,0.21565686,0.0029547075,0.12844454],"study_design_scores_gemma":[0.000013048738,0.00009911552,0.0002059352,0.000057446163,0.00002090708,0.00020025915,0.00007664044,0.9069541,0.0026771836,0.08077808,0.008900763,0.000016520104],"about_ca_topic_score_codex":0.00037202932,"about_ca_topic_score_gemma":0.0003783175,"teacher_disagreement_score":0.0009246798,"about_ca_system_score_codex":0.00050600804,"about_ca_system_score_gemma":0.00040671072,"threshold_uncertainty_score":0.0038059354},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054878652,0.004750171,0.9295801,0.00031954935,0.00009004764,0.000060492952,0.000044977187,0.00015664872,0.010119366],"genre_scores_gemma":[0.8830109,0.0023637547,0.111809365,0.00014845624,0.00008902266,0.00010373992,0.000043037995,0.00001832918,0.0024133786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872535,0.0005159804,0.000043900196,0.00010746091,0.0004865766,0.00012065885],"domain_scores_gemma":[0.9985266,0.00084169995,0.00015253191,0.00016606443,0.00028285795,0.000030367662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011271928,0.0007346873,0.00071828545,0.00078343914,0.0004946801,0.00093465217,0.000880485,0.001116305,0.00044647962],"category_scores_gemma":[0.0032393688,0.00034643602,0.00030569322,0.00090927427,0.0011442243,0.0009845148,0.0009939881,0.0007538817,0.0003258043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024675333,0.000083530394,0.0018656487,0.0005926984,0.00008971106,0.0010275737,0.0008611963,0.5180728,0.030400861,0.34544954,0.002088069,0.099221684],"study_design_scores_gemma":[0.000015437954,0.00018296562,0.00027208318,0.000044583907,0.000020224374,0.00058056315,0.000061445106,0.9548352,0.0064803846,0.034924205,0.002539536,0.000043408192],"about_ca_topic_score_codex":0.00108423,"about_ca_topic_score_gemma":0.0009774063,"teacher_disagreement_score":0.0011271928,"about_ca_system_score_codex":0.00075215846,"about_ca_system_score_gemma":0.00067542336,"threshold_uncertainty_score":0.0059612393},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050733616,0.0045924424,0.97000396,0.00024935443,0.0001962901,0.000056976067,0.00006947672,0.00033898975,0.01941912],"genre_scores_gemma":[0.658279,0.011818882,0.27153462,0.00042401458,0.0005279549,0.00034349575,0.0003087185,0.0003033884,0.056459863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967206,0.00008514874,0.000012323145,0.00007388953,0.00012121921,0.000035425343],"domain_scores_gemma":[0.99982387,0.00008048225,0.000017676537,0.000019457215,0.000051740924,0.0000068160434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003728857,0.0006995065,0.0006400705,0.0002548798,0.00042320284,0.0014559487,0.0009916528,0.00065364764,0.0067168847],"category_scores_gemma":[0.00079845294,0.00035674762,0.0003170439,0.00067964854,0.00042493443,0.00086737995,0.00071139133,0.0010224788,0.001995082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001235612,0.00010246632,0.00030415846,0.00044091005,0.00006105056,0.00022453238,0.00016267096,0.48015207,0.022707446,0.2155584,0.017464694,0.26269802],"study_design_scores_gemma":[0.00001631933,0.000074876654,0.00017318451,0.000044933644,0.00001298111,0.00013550784,0.000044042197,0.93355334,0.0031505423,0.043650597,0.01912265,0.000020986154],"about_ca_topic_score_codex":0.0005216972,"about_ca_topic_score_gemma":0.00073279,"teacher_disagreement_score":0.0067168847,"about_ca_system_score_codex":0.000676969,"about_ca_system_score_gemma":0.00041832367,"threshold_uncertainty_score":0.022470176},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013110645,0.062892675,0.78394765,0.00096166844,0.0005241763,0.0001485496,0.00011211466,0.0005415943,0.13776097],"genre_scores_gemma":[0.52108675,0.1093507,0.29078782,0.00065035064,0.001151913,0.0005999693,0.00028845595,0.00014335946,0.07594061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958974,0.00016977971,0.000015578711,0.000061046594,0.00013052532,0.000033366283],"domain_scores_gemma":[0.99974877,0.00015367953,0.000017941227,0.000033432752,0.00003655842,0.000009578762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048970815,0.00064971496,0.0004529333,0.00035883905,0.0003376057,0.0010225729,0.0008280421,0.0008494767,0.0027396532],"category_scores_gemma":[0.001030485,0.0003046246,0.00020879527,0.0012842732,0.000716487,0.0011267269,0.00074146135,0.0006022184,0.0015372429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059764705,0.000040558516,0.00034205476,0.0008179247,0.000035692858,0.00043600064,0.0005596141,0.09112057,0.0075573926,0.46059266,0.020529928,0.41790786],"study_design_scores_gemma":[0.000041279975,0.00023706781,0.00042376545,0.0003876595,0.0000482235,0.0012788733,0.00018930568,0.22121884,0.005101489,0.45590618,0.31511387,0.000053492087],"about_ca_topic_score_codex":0.00048630175,"about_ca_topic_score_gemma":0.00048521336,"teacher_disagreement_score":0.0027396532,"about_ca_system_score_codex":0.0006074437,"about_ca_system_score_gemma":0.0003700536,"threshold_uncertainty_score":0.009165108},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05145476,0.0006786025,0.94358826,0.00026736458,0.000019614658,0.000058492467,0.00002997211,0.00014310218,0.0037598638],"genre_scores_gemma":[0.84049934,0.0011441476,0.15450083,0.000104956845,0.000055133372,0.00022996198,0.00006862061,0.00006486715,0.0033322042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882036,0.00051099155,0.000034294717,0.0000995788,0.0003819281,0.00015283762],"domain_scores_gemma":[0.99633956,0.002755379,0.00028500077,0.0002574596,0.00029413463,0.00006850412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022340606,0.0009914506,0.0006097166,0.0011287341,0.00041617005,0.0009799363,0.001038173,0.0010122214,0.00052908144],"category_scores_gemma":[0.008901467,0.00044124137,0.0002829687,0.001307368,0.0024930479,0.002084353,0.0015659962,0.0010057454,0.00020133484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010657641,0.000035266643,0.00032340697,0.00006931125,0.000018162511,0.00008499403,0.00013789356,0.8495653,0.009036785,0.114378914,0.00052633235,0.025717039],"study_design_scores_gemma":[0.000019536847,0.000052952862,0.00011158646,0.000019598783,0.000008740777,0.00004582111,0.000021868986,0.92924553,0.003319149,0.06663166,0.0005109027,0.000012622228],"about_ca_topic_score_codex":0.0025987963,"about_ca_topic_score_gemma":0.0026723323,"teacher_disagreement_score":0.0025987963,"about_ca_system_score_codex":0.002098217,"about_ca_system_score_gemma":0.0012168335,"threshold_uncertainty_score":0.015223682},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005862644,0.1002124,0.52881056,0.0024558152,0.0040760674,0.00010086563,0.00014931119,0.00059000135,0.35774228],"genre_scores_gemma":[0.18136545,0.11652209,0.15717824,0.0019384912,0.00864396,0.0005202215,0.00043257137,0.0004289767,0.5329701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997855,0.000047874244,0.000007688312,0.000027684668,0.00011609984,0.000015162888],"domain_scores_gemma":[0.9997582,0.00013019545,0.000011230181,0.000040931183,0.000050470724,0.000009079988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025375446,0.0009452988,0.00054114615,0.0008559827,0.000411684,0.0011496932,0.0007430284,0.0009497865,0.00850866],"category_scores_gemma":[0.0005668071,0.00033180203,0.00022068735,0.0016482718,0.0010843462,0.0015911721,0.00072121806,0.0018093807,0.0032461148],"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.000017913208,0.000035717367,0.000047401605,0.0003042068,0.000019017441,0.00006440098,0.00022307839,0.0062962645,0.006122783,0.63386345,0.06651982,0.28648597],"study_design_scores_gemma":[0.000016486269,0.000077774705,0.00015163164,0.00015006916,0.000019042034,0.00044979877,0.000056536726,0.019515892,0.0033706527,0.45007125,0.52609056,0.00003019663],"about_ca_topic_score_codex":0.00020190078,"about_ca_topic_score_gemma":0.0004092211,"teacher_disagreement_score":0.00850866,"about_ca_system_score_codex":0.0005416408,"about_ca_system_score_gemma":0.0003333617,"threshold_uncertainty_score":0.028464258},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14199938,0.0010723716,0.84767663,0.00024138017,0.00005726691,0.00007676274,0.000055088287,0.00021439086,0.00860675],"genre_scores_gemma":[0.9334721,0.00037148356,0.06365651,0.000034615656,0.00001806993,0.00005238176,0.000028996757,0.0000057245866,0.0023601395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994716,0.00019661839,0.000027824708,0.00009455101,0.0001424642,0.00006690562],"domain_scores_gemma":[0.9992599,0.0003407282,0.00011887015,0.00010489144,0.00015024962,0.000025369643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058696367,0.0007365254,0.0006449638,0.00040662292,0.0005123111,0.00081937324,0.0009601452,0.00090256875,0.00068351894],"category_scores_gemma":[0.0012330214,0.00025603012,0.00039874337,0.00061567104,0.0005510587,0.0009689744,0.0009529627,0.00044562266,0.00025027504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058333046,0.00013973945,0.0018460137,0.00029323515,0.0001659713,0.0008412745,0.00048425462,0.75552213,0.05520566,0.059326947,0.0011471563,0.12444431],"study_design_scores_gemma":[0.0000477143,0.00027372318,0.00019546469,0.000014723799,0.000041001644,0.0003130674,0.000056074143,0.98008966,0.0077508693,0.008162305,0.0030219457,0.000033377808],"about_ca_topic_score_codex":0.0015811085,"about_ca_topic_score_gemma":0.001805231,"teacher_disagreement_score":0.0015811085,"about_ca_system_score_codex":0.00068695267,"about_ca_system_score_gemma":0.0005053029,"threshold_uncertainty_score":0.0049842596},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008681895,0.0002796392,0.9857547,0.00021136132,0.000042716787,0.00009876751,0.000033031676,0.000057387017,0.00484047],"genre_scores_gemma":[0.82592696,0.0012142335,0.16030811,0.0003146636,0.00014536665,0.0009405276,0.00012113645,0.000101452664,0.010927628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976185,0.0012404199,0.00008171611,0.00026405294,0.0005116749,0.00028373164],"domain_scores_gemma":[0.9950375,0.003601134,0.000489018,0.00017705567,0.00054292724,0.00015235668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037863732,0.0019379735,0.0011100825,0.0011709271,0.00070499093,0.0015521101,0.0018205158,0.001612956,0.0035701885],"category_scores_gemma":[0.0108930245,0.0007242696,0.0014573559,0.0008348878,0.0022814253,0.0020509348,0.0014277969,0.0025288167,0.00042964568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000430722,0.00008957664,0.0006205926,0.00011197914,0.000079947786,0.00021145493,0.00024109203,0.7124253,0.002175174,0.27545008,0.0009430453,0.0076086945],"study_design_scores_gemma":[0.000006802788,0.000021621874,0.00005938034,0.000006862436,0.000008109449,0.000013194669,0.000015422776,0.96983624,0.0001036828,0.029525263,0.00039616958,0.000007386371],"about_ca_topic_score_codex":0.0065277945,"about_ca_topic_score_gemma":0.004671344,"teacher_disagreement_score":0.0065277945,"about_ca_system_score_codex":0.0031192296,"about_ca_system_score_gemma":0.0025461146,"threshold_uncertainty_score":0.022631705},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013337503,0.018124916,0.062873915,0.003172426,0.0022921027,0.00010435622,0.00017689755,0.0003811808,0.91154045],"genre_scores_gemma":[0.03551213,0.023354394,0.029645683,0.0018998325,0.0011952887,0.00027079778,0.0005198809,0.00019673978,0.9074052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993235,0.00020067646,0.000030710875,0.00013785019,0.00023001965,0.00007717474],"domain_scores_gemma":[0.9994417,0.00017264321,0.00003698741,0.0001388862,0.00011903359,0.000090848785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069839245,0.0009136386,0.000550888,0.00090246217,0.0015066012,0.0036968568,0.0013579489,0.0016574243,0.055781964],"category_scores_gemma":[0.0014682792,0.00033712358,0.00048536423,0.0014174693,0.0011460765,0.004595194,0.003631871,0.0015119272,0.024461359],"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.00001921874,0.000028554326,0.000075294876,0.00034488732,0.000015910802,0.00014070317,0.00064965646,0.00071773323,0.00092444714,0.6720859,0.13857864,0.18641914],"study_design_scores_gemma":[0.0000041606377,0.000011375771,0.000055127934,0.00014211194,0.0000037781508,0.0002818807,0.00012563121,0.0005057623,0.00035499994,0.071199484,0.9273084,0.0000072713483],"about_ca_topic_score_codex":0.00048394984,"about_ca_topic_score_gemma":0.00089592586,"teacher_disagreement_score":0.055781964,"about_ca_system_score_codex":0.001065637,"about_ca_system_score_gemma":0.0012295207,"threshold_uncertainty_score":0.18660927},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027887069,0.000434742,0.9689395,0.00013547132,0.000015043557,0.000029826238,0.00002469696,0.00012327079,0.0024103916],"genre_scores_gemma":[0.9391464,0.00047659516,0.058454234,0.000056897487,0.000023866387,0.00007954059,0.00002471348,0.000030262037,0.0017074848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994505,0.00022293808,0.000024839832,0.00008621636,0.000147661,0.000067927656],"domain_scores_gemma":[0.9994816,0.0003181766,0.000076332966,0.00003265977,0.00007426785,0.000017009625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009580527,0.0009094133,0.0007128185,0.0003424351,0.00030038028,0.00080766244,0.00073205814,0.00051348493,0.0008939029],"category_scores_gemma":[0.0016334933,0.00038622943,0.00042561468,0.00041271647,0.0005649256,0.0008806537,0.0005288682,0.00054309395,0.00016001184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007530546,0.000037380836,0.00024727202,0.0000685768,0.000027279868,0.00010534457,0.00007811867,0.9509161,0.0074247676,0.019695979,0.00046398444,0.020859879],"study_design_scores_gemma":[0.0000064022906,0.000039758284,0.00005616342,0.0000029858036,0.00000790741,0.000022673015,0.000009377457,0.99517655,0.0010454035,0.0034268259,0.00020238962,0.0000035433702],"about_ca_topic_score_codex":0.0017829287,"about_ca_topic_score_gemma":0.0016389474,"teacher_disagreement_score":0.0017829287,"about_ca_system_score_codex":0.0009301525,"about_ca_system_score_gemma":0.0008652321,"threshold_uncertainty_score":0.006748736},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009621204,0.00069260574,0.98228097,0.00069949403,0.00005745143,0.0000658085,0.0001454666,0.00013589647,0.0063011195],"genre_scores_gemma":[0.81392646,0.004653584,0.17157148,0.00047335977,0.0004676866,0.00069671904,0.00040125143,0.00018062549,0.0076287626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986119,0.0006080839,0.00005448529,0.00012639342,0.00043202584,0.00016709666],"domain_scores_gemma":[0.9971409,0.0019181991,0.00028879652,0.00022047384,0.00035926295,0.00007239653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025918165,0.0010161898,0.00097377336,0.0010188799,0.0006015506,0.001510609,0.0019788397,0.001491349,0.0014101067],"category_scores_gemma":[0.008458686,0.0005015219,0.00088259875,0.001392831,0.0012073973,0.0030241753,0.0013204211,0.0018399442,0.00039679944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014562212,0.00002971331,0.00034678585,0.000042290336,0.000018667282,0.000073485,0.00006836894,0.83634967,0.00083502656,0.15687157,0.00093775295,0.004412097],"study_design_scores_gemma":[0.0000027764627,0.000010722962,0.000055266843,0.00000803557,0.000004596161,0.000012797906,0.000009501775,0.9694789,0.00007355835,0.029730327,0.00060829514,0.000005303879],"about_ca_topic_score_codex":0.0051504746,"about_ca_topic_score_gemma":0.002965835,"teacher_disagreement_score":0.0051504746,"about_ca_system_score_codex":0.0021477737,"about_ca_system_score_gemma":0.0015754617,"threshold_uncertainty_score":0.015583277},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05642676,0.0060188,0.89039403,0.0005118925,0.00026207117,0.00008687127,0.00004671628,0.00014313146,0.046109743],"genre_scores_gemma":[0.88267106,0.0036373525,0.09065797,0.00014513296,0.00011922543,0.00015704696,0.000065855915,0.00003949454,0.022506934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997458,0.000071296054,0.0000071922523,0.000043483888,0.00009094674,0.000041388914],"domain_scores_gemma":[0.9998099,0.000095117255,0.000019331264,0.000024585559,0.00003466386,0.000016384325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004167445,0.00033865304,0.00038627288,0.00021172219,0.0004416704,0.0008994139,0.0007860018,0.00052411377,0.00085445587],"category_scores_gemma":[0.0011836569,0.00017550243,0.00031971192,0.00047155877,0.00076661666,0.0006892469,0.000854055,0.0005055055,0.00019617422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094402494,0.00004852209,0.00049047207,0.00009990155,0.000040808955,0.00025680548,0.00036525988,0.54614675,0.0071284263,0.35936233,0.0036782303,0.08228806],"study_design_scores_gemma":[0.000016489974,0.000045790897,0.0003747225,0.000020576625,0.000010804401,0.000111580106,0.00010014441,0.8834968,0.0017602597,0.10228063,0.011768159,0.000014097428],"about_ca_topic_score_codex":0.0037813995,"about_ca_topic_score_gemma":0.0027913235,"teacher_disagreement_score":0.0037813995,"about_ca_system_score_codex":0.0011873811,"about_ca_system_score_gemma":0.000674834,"threshold_uncertainty_score":0.008615136},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008325101,0.021948295,0.7326981,0.007332992,0.0016739783,0.00014166356,0.000331348,0.0006867062,0.22686191],"genre_scores_gemma":[0.2236587,0.04083555,0.40925857,0.0064694816,0.0033382182,0.0006212064,0.00064162584,0.00044505135,0.31473166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997248,0.000058322596,0.000009973966,0.000048608883,0.00013232887,0.000025944426],"domain_scores_gemma":[0.9997646,0.00010943403,0.000019425155,0.00005508359,0.000038041493,0.000013419952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048107156,0.0006324484,0.000512864,0.00053564366,0.0007302215,0.0013560937,0.0011361365,0.0011359499,0.0059101027],"category_scores_gemma":[0.0008951243,0.00026961483,0.00032508574,0.0008753776,0.00090912136,0.0045103687,0.0013988008,0.0024661806,0.0027774586],"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.000040444957,0.000030304007,0.00006542851,0.00031572022,0.000012316502,0.00014146231,0.00032341667,0.0058300896,0.0033084499,0.8212197,0.026719756,0.1419928],"study_design_scores_gemma":[0.000013261398,0.000078994824,0.00016768448,0.00026385064,0.000019976604,0.0007716996,0.00010380882,0.026685826,0.0036341224,0.56856954,0.39966565,0.000025497058],"about_ca_topic_score_codex":0.00019194178,"about_ca_topic_score_gemma":0.00027326823,"teacher_disagreement_score":0.0059101027,"about_ca_system_score_codex":0.00076695357,"about_ca_system_score_gemma":0.00035661604,"threshold_uncertainty_score":0.019771278},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008314515,0.07693294,0.61386734,0.0031073904,0.0016865314,0.00008847961,0.0002730273,0.0004137809,0.29531598],"genre_scores_gemma":[0.39937058,0.21105549,0.20953536,0.0017245691,0.0022585306,0.0005034249,0.00052739086,0.00024889168,0.17477582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978775,0.000063422485,0.000007233601,0.00002894321,0.00009562146,0.000017062397],"domain_scores_gemma":[0.99971074,0.00018564235,0.0000145665035,0.00003250417,0.000046776735,0.0000096982485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000335236,0.00042079037,0.00031157202,0.00043696395,0.00025063156,0.00079881784,0.00057710713,0.00066785497,0.0035803707],"category_scores_gemma":[0.0010676567,0.00021101299,0.00015905107,0.0010299712,0.00093092653,0.0011909265,0.00048614695,0.001172508,0.001340247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000145815675,0.0000109279335,0.00005026557,0.00020692582,0.000008517326,0.000081945596,0.00015465663,0.025187677,0.0016733602,0.8659236,0.016179308,0.09050826],"study_design_scores_gemma":[0.000012427755,0.000043051303,0.00020021967,0.00026702715,0.000014583978,0.00029499343,0.00004953696,0.051233206,0.0017676075,0.7576623,0.18842953,0.000025567451],"about_ca_topic_score_codex":0.00095208286,"about_ca_topic_score_gemma":0.0006562812,"teacher_disagreement_score":0.0035803707,"about_ca_system_score_codex":0.00068464584,"about_ca_system_score_gemma":0.0005392704,"threshold_uncertainty_score":0.011977494},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063845557,0.033985887,0.80630505,0.0009840863,0.0011367658,0.0000914575,0.00023080596,0.0005171547,0.15036435],"genre_scores_gemma":[0.1965543,0.075900234,0.43787336,0.00083638943,0.0011777334,0.00056826585,0.0011317563,0.00035998505,0.28559798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998276,0.000026024709,0.000006509448,0.00001987301,0.000105954685,0.000013900032],"domain_scores_gemma":[0.99980134,0.00010620926,0.000009682945,0.000023411185,0.000051491326,0.000007930902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019999954,0.0005440102,0.00033281327,0.00039971824,0.00024106012,0.0006249749,0.0005133812,0.00046850042,0.00598369],"category_scores_gemma":[0.0005671951,0.00021816861,0.00017951462,0.000999906,0.00047166352,0.0008369875,0.00046537808,0.0013530949,0.0028526413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003994851,0.000035032732,0.00009909846,0.00047693812,0.000016295182,0.000107754975,0.00027114296,0.034240846,0.0107112015,0.6095844,0.032002002,0.3124153],"study_design_scores_gemma":[0.000021501257,0.00011420196,0.00033851995,0.00032587437,0.000023626742,0.00052245165,0.00007837624,0.17977542,0.0076379576,0.3580615,0.4530622,0.000038339494],"about_ca_topic_score_codex":0.0008686301,"about_ca_topic_score_gemma":0.0010219748,"teacher_disagreement_score":0.00598369,"about_ca_system_score_codex":0.0007457937,"about_ca_system_score_gemma":0.00064111874,"threshold_uncertainty_score":0.020017385},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027816368,0.011420371,0.95121694,0.0005841475,0.0007609491,0.00011241128,0.000091764654,0.0005370427,0.032494728],"genre_scores_gemma":[0.21255459,0.03863614,0.6477454,0.0005830005,0.0016584578,0.0007839621,0.0006949475,0.0005521183,0.096791476],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994721,0.00010721766,0.00002351731,0.000050322356,0.00031695553,0.000030016914],"domain_scores_gemma":[0.9993455,0.0003953388,0.000023255325,0.000079780446,0.00014292411,0.000013230029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056690216,0.00075043057,0.0006632993,0.00076784356,0.00033284313,0.0009618821,0.0010124429,0.0011879135,0.0052055316],"category_scores_gemma":[0.0019975519,0.00028970503,0.00022980319,0.0015782905,0.0009927904,0.0013689459,0.00077790325,0.0016961948,0.0017047047],"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.000056164998,0.00005098819,0.00007997186,0.0004934751,0.000025291587,0.00014376648,0.00017751513,0.049562108,0.011217927,0.41579315,0.029110918,0.49328864],"study_design_scores_gemma":[0.000037639675,0.000085962245,0.00022160537,0.00030800063,0.000035564448,0.00073669926,0.00006376759,0.48858383,0.011576386,0.3628196,0.13547242,0.000058504822],"about_ca_topic_score_codex":0.0012461297,"about_ca_topic_score_gemma":0.0011386079,"teacher_disagreement_score":0.0052055316,"about_ca_system_score_codex":0.0008445024,"about_ca_system_score_gemma":0.00063936814,"threshold_uncertainty_score":0.017414272},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051332912,0.063752025,0.84717214,0.001466594,0.0011141819,0.00014294672,0.00019086272,0.0007341241,0.08029386],"genre_scores_gemma":[0.1819019,0.13109857,0.5773761,0.0010275922,0.0029854826,0.00084293174,0.00080839527,0.0004155682,0.1035434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996866,0.00006508099,0.00001773114,0.000054092525,0.00015533273,0.00002126191],"domain_scores_gemma":[0.999858,0.00006665484,0.0000122444335,0.000020812877,0.00003519538,0.000007067239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004140295,0.0010480543,0.0006071007,0.0003826392,0.00045859916,0.0014653465,0.0009371565,0.0008252685,0.0048175394],"category_scores_gemma":[0.000869756,0.0003255724,0.00027726198,0.0009155584,0.0004883673,0.0017453282,0.00057402323,0.0011992005,0.002572052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053316697,0.000059376835,0.00011166013,0.0008227309,0.00002905856,0.0002836557,0.00021332466,0.060141902,0.014243799,0.45968276,0.034230873,0.4301276],"study_design_scores_gemma":[0.00002482925,0.000092494556,0.00032334615,0.0003378996,0.000036243193,0.000754449,0.00010641014,0.2536034,0.00599029,0.3211575,0.4175077,0.00006551363],"about_ca_topic_score_codex":0.000555414,"about_ca_topic_score_gemma":0.00066611706,"teacher_disagreement_score":0.0048175394,"about_ca_system_score_codex":0.0007078312,"about_ca_system_score_gemma":0.000597007,"threshold_uncertainty_score":0.016116321},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004620037,0.00015562958,0.99414474,0.00007285952,0.000025960187,0.000012826015,0.000013134922,0.00009382858,0.0008609756],"genre_scores_gemma":[0.4823877,0.00048970024,0.5133266,0.00022333,0.00015994564,0.00014722072,0.0000777489,0.000041062514,0.0031467304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901164,0.00025117997,0.00004841807,0.00022283998,0.00035682405,0.00010903109],"domain_scores_gemma":[0.999345,0.000255346,0.0001095098,0.00008299474,0.00017067393,0.000036479865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010607843,0.0005949428,0.0010361129,0.0004191192,0.0005197431,0.00119409,0.0007099498,0.001284277,0.0010861978],"category_scores_gemma":[0.0022107332,0.00044450557,0.00054200593,0.0003283106,0.0007960117,0.00089826155,0.0010228943,0.0009670044,0.00075642567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048171534,0.00013993151,0.0015143953,0.00044034678,0.00018940947,0.0004585474,0.00046627733,0.43543836,0.10890134,0.20600423,0.0049509048,0.24101458],"study_design_scores_gemma":[0.000037820042,0.00017890813,0.00016810486,0.000029736546,0.000048409536,0.00032135143,0.000037739443,0.9593568,0.014785965,0.02100094,0.0039980896,0.00003610745],"about_ca_topic_score_codex":0.0003620652,"about_ca_topic_score_gemma":0.0005276034,"teacher_disagreement_score":0.001284277,"about_ca_system_score_codex":0.0005224703,"about_ca_system_score_gemma":0.0012009545,"threshold_uncertainty_score":0.005610049},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014802317,0.008694777,0.95581436,0.0005005085,0.00017279951,0.000053207797,0.000033646822,0.00013136468,0.01979717],"genre_scores_gemma":[0.5578372,0.034850735,0.37771672,0.0004545508,0.00053605833,0.00040023023,0.00016088085,0.00013293946,0.02791074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964046,0.0001265883,0.000011517155,0.00005304378,0.00014854438,0.000019739842],"domain_scores_gemma":[0.9995789,0.00028666077,0.000029579178,0.00004468142,0.000048568894,0.000011601216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000568851,0.0005398086,0.0005266236,0.00035633682,0.00025591394,0.0007563009,0.0006255285,0.0005850931,0.001053637],"category_scores_gemma":[0.00089982315,0.0003223615,0.00042127463,0.0012855264,0.00078587065,0.0012734303,0.00073236093,0.0009008191,0.0003887174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061357125,0.00006222602,0.00041463424,0.00093954237,0.000061198225,0.00029523805,0.0003886581,0.41395378,0.019274393,0.34492514,0.0065635024,0.21306033],"study_design_scores_gemma":[0.000014215988,0.00012915401,0.00041198748,0.0001648432,0.000033849097,0.00038509024,0.00012529563,0.81343794,0.0053431024,0.1435328,0.036391374,0.000030352498],"about_ca_topic_score_codex":0.0003811262,"about_ca_topic_score_gemma":0.0004202464,"teacher_disagreement_score":0.001053637,"about_ca_system_score_codex":0.00053479784,"about_ca_system_score_gemma":0.00040448763,"threshold_uncertainty_score":0.0038802624},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050825637,0.00030250696,0.94518113,0.0001054134,0.00001636571,0.00003804075,0.000025748495,0.00006471555,0.0034404437],"genre_scores_gemma":[0.9212886,0.00035223993,0.07670187,0.00004480625,0.000017578637,0.00010219044,0.000019771942,0.000021830638,0.0014511993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959344,0.00016076582,0.000019852789,0.0000704842,0.00010206605,0.000053298518],"domain_scores_gemma":[0.99946064,0.000330408,0.000089843285,0.000032714637,0.00007026612,0.000016080738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000677712,0.0006874576,0.00057447917,0.00028093054,0.00030888474,0.0008494014,0.00070246187,0.00051854906,0.001063288],"category_scores_gemma":[0.0018646083,0.00029328474,0.00033389704,0.00036761758,0.0005624515,0.00088228984,0.0006756249,0.00038461864,0.0001979844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008458221,0.000058355075,0.00035250053,0.00009720037,0.000034403958,0.00011893291,0.000155062,0.9202081,0.010011943,0.025413398,0.00040104234,0.043064497],"study_design_scores_gemma":[0.000008045442,0.000040137922,0.00006107947,0.000004160111,0.000006141916,0.00003396878,0.00001848204,0.9929091,0.0007743708,0.005821877,0.00031912318,0.0000037086427],"about_ca_topic_score_codex":0.0011714525,"about_ca_topic_score_gemma":0.0014509748,"teacher_disagreement_score":0.0011714525,"about_ca_system_score_codex":0.00054445193,"about_ca_system_score_gemma":0.0006837421,"threshold_uncertainty_score":0.0039503574},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06398751,0.0014921875,0.921339,0.00035882767,0.000049560407,0.000055004108,0.00006557877,0.00022916478,0.012423268],"genre_scores_gemma":[0.95235205,0.00084919116,0.044422254,0.000058954935,0.00006514269,0.00006949219,0.00006321227,0.00005252189,0.002067145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980959,0.0008863417,0.00005742163,0.00019571233,0.0004788676,0.00028562165],"domain_scores_gemma":[0.9959227,0.003079903,0.0003092714,0.00017077893,0.00046683,0.000050566385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023342276,0.00090669317,0.0008663933,0.00057964126,0.00049999263,0.001202019,0.00066868577,0.0007913935,0.0023491695],"category_scores_gemma":[0.011721058,0.000339449,0.00024845928,0.0009955643,0.0009039565,0.0014302187,0.00087434356,0.0006116396,0.00045000168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001117702,0.000028348712,0.0005767913,0.00007836712,0.00002572544,0.000069702684,0.000050303206,0.9426171,0.002023591,0.024884176,0.00058723264,0.028946852],"study_design_scores_gemma":[0.0000055502937,0.000028535273,0.00015330578,0.0000048087377,0.000005635532,0.000031301603,0.000012238131,0.9957606,0.00072017853,0.003058715,0.00021505821,0.0000039861307],"about_ca_topic_score_codex":0.002067789,"about_ca_topic_score_gemma":0.0012163074,"teacher_disagreement_score":0.0023491695,"about_ca_system_score_codex":0.0013907361,"about_ca_system_score_gemma":0.0009907708,"threshold_uncertainty_score":0.012344718},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4320843,0.0021731062,0.55971575,0.00033277454,0.000060997085,0.000045849996,0.0001837815,0.00017579472,0.0052277567],"genre_scores_gemma":[0.9930988,0.0004094999,0.0058560506,0.000021450385,0.000031950163,0.000011281364,0.000019544084,0.000011166744,0.00054017163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892646,0.00036241507,0.0000521384,0.00017693064,0.00026259257,0.00021947191],"domain_scores_gemma":[0.99014294,0.0074700774,0.0012154127,0.00042023795,0.00062424806,0.00012699723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018623689,0.000909552,0.0010806394,0.00059381453,0.000754001,0.0015258415,0.0010848385,0.0010822971,0.00068128796],"category_scores_gemma":[0.010230098,0.00046677663,0.00038721063,0.0008506451,0.0015753043,0.002392285,0.0010318501,0.0008264663,0.00014245739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017318335,0.000040140327,0.0019693791,0.00014029257,0.00006786033,0.0011696033,0.00033872217,0.9568347,0.0042085424,0.024200087,0.00032447084,0.010532927],"study_design_scores_gemma":[0.000010474998,0.00006853453,0.0005903197,0.000011893218,0.000033138385,0.00034729936,0.000086645676,0.9859849,0.0010301463,0.0115569895,0.00026340334,0.000016246786],"about_ca_topic_score_codex":0.0036196124,"about_ca_topic_score_gemma":0.0031760158,"teacher_disagreement_score":0.0036196124,"about_ca_system_score_codex":0.0011083579,"about_ca_system_score_gemma":0.00070023915,"threshold_uncertainty_score":0.00984925},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2071366,0.00020579988,0.7896634,0.00021193393,0.000119444885,0.00013141106,0.000027855625,0.00058707217,0.0019165846],"genre_scores_gemma":[0.97470075,0.00004371453,0.024806473,0.000037305963,0.0000089931555,0.000023585593,0.000017788474,0.0000037391108,0.00035773256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930763,0.0001985871,0.0000497631,0.00010165506,0.00022951883,0.00011279253],"domain_scores_gemma":[0.99915576,0.00028527452,0.00013814578,0.00012857914,0.00023602863,0.000056112473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012898498,0.00041337046,0.00042604274,0.00045691634,0.00070275186,0.00064826943,0.0006360781,0.00045744018,0.0004456061],"category_scores_gemma":[0.0021038975,0.0001486619,0.00031194746,0.0003317508,0.00069945154,0.0010672895,0.0011404591,0.00055866735,0.00011787243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013782369,0.00033025962,0.01295014,0.0001732693,0.00015872996,0.00091913657,0.0006780934,0.5804172,0.10403024,0.0388185,0.0018493801,0.25829688],"study_design_scores_gemma":[0.000021878664,0.00013074762,0.0004109433,0.0000047818417,0.000018854922,0.000108361324,0.00003282022,0.98647577,0.009922406,0.0024713299,0.00039035067,0.000011670946],"about_ca_topic_score_codex":0.001815648,"about_ca_topic_score_gemma":0.0017694497,"teacher_disagreement_score":0.001815648,"about_ca_system_score_codex":0.0006677095,"about_ca_system_score_gemma":0.00095861143,"threshold_uncertainty_score":0.0068214536},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04773445,0.001093276,0.9368152,0.00048127177,0.00008278891,0.00010861649,0.00015638626,0.00041530794,0.0131126065],"genre_scores_gemma":[0.93162215,0.00080786523,0.06471849,0.0001920864,0.000052258958,0.00015378669,0.0001104747,0.000049825914,0.0022930566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987078,0.00052657083,0.00003405133,0.00014305975,0.00034022782,0.00024826688],"domain_scores_gemma":[0.99696356,0.0019163287,0.0002587816,0.00026465172,0.00049930194,0.0000974703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020195472,0.0012812568,0.00091834273,0.0008563151,0.0009201124,0.001450769,0.0015758781,0.001041364,0.002039606],"category_scores_gemma":[0.0057499604,0.00037049537,0.00060450536,0.0011395627,0.0021926789,0.001546153,0.0019523797,0.001315426,0.0005769974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030938862,0.000097343516,0.00046335367,0.0002471685,0.00007783724,0.00035950888,0.00048354073,0.552536,0.0139289135,0.39245784,0.004060127,0.03497901],"study_design_scores_gemma":[0.000024564855,0.00009366033,0.00008634864,0.000021710313,0.000022283946,0.0001613919,0.00004355772,0.9590339,0.0022273443,0.037149966,0.0011019178,0.000033433476],"about_ca_topic_score_codex":0.0031749518,"about_ca_topic_score_gemma":0.0026193599,"teacher_disagreement_score":0.0031749518,"about_ca_system_score_codex":0.0022739018,"about_ca_system_score_gemma":0.0018938294,"threshold_uncertainty_score":0.016498387},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42858002,0.0009294457,0.5664533,0.00019210391,0.00002288409,0.000032184882,0.000050862025,0.0001611594,0.0035781437],"genre_scores_gemma":[0.99386567,0.00012839907,0.005729671,0.000012979884,0.000008682991,0.000008612232,0.000006744004,0.0000028618342,0.00023635219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990996,0.00048523993,0.0000341116,0.000087307366,0.00020075304,0.00009297083],"domain_scores_gemma":[0.99659663,0.0023777047,0.0004360666,0.00029686381,0.0002450777,0.000047702353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001495033,0.0004889008,0.00068129966,0.00029801612,0.00041483404,0.0009078805,0.0005747596,0.00046146466,0.0004686456],"category_scores_gemma":[0.0034422886,0.00029748585,0.00026937874,0.0005217845,0.0009681392,0.0008203549,0.0008137061,0.0003953535,0.00010574119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021279819,0.000047253976,0.0014329611,0.00009306195,0.000084283594,0.0004584756,0.0003175504,0.9362921,0.012531009,0.0200247,0.00033104996,0.028174799],"study_design_scores_gemma":[0.00001193633,0.00011284317,0.0003725212,0.000008923169,0.000025465775,0.00013542589,0.000040689963,0.98556966,0.0033150723,0.010083943,0.0003116318,0.000011852322],"about_ca_topic_score_codex":0.0011771696,"about_ca_topic_score_gemma":0.0011033083,"teacher_disagreement_score":0.001495033,"about_ca_system_score_codex":0.0004761917,"about_ca_system_score_gemma":0.00040830128,"threshold_uncertainty_score":0.007906616},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058998264,0.0077138785,0.9068375,0.009174884,0.00047591474,0.00019167799,0.00006938086,0.0008926569,0.015645854],"genre_scores_gemma":[0.6198,0.011404222,0.3555056,0.0010195726,0.0013443734,0.00028547985,0.00026785326,0.00027958542,0.01009341],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980147,0.00039949294,0.000046469737,0.00026200636,0.0011716124,0.00010558479],"domain_scores_gemma":[0.99335796,0.0032790343,0.00026175636,0.0007667064,0.001978303,0.0003562992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028080628,0.0005140273,0.00095779664,0.00039526945,0.00105584,0.0021216685,0.0018008136,0.0019059179,0.00264838],"category_scores_gemma":[0.011478116,0.00042072262,0.00024110425,0.00094401895,0.0014172156,0.006086769,0.0013813068,0.0037213126,0.0012776155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042380037,0.00050285604,0.0012887216,0.001277377,0.00011830345,0.00033754462,0.0015051833,0.086159706,0.15573937,0.341359,0.025513453,0.3857748],"study_design_scores_gemma":[0.00017840303,0.00083052955,0.0007349584,0.0001545302,0.000061207786,0.00072464184,0.00057261356,0.7639361,0.03993532,0.13802953,0.054762874,0.000079256824],"about_ca_topic_score_codex":0.0009820258,"about_ca_topic_score_gemma":0.0006652358,"teacher_disagreement_score":0.0028080628,"about_ca_system_score_codex":0.0008499099,"about_ca_system_score_gemma":0.00117037,"threshold_uncertainty_score":0.014850616},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20954894,0.0018973774,0.7860835,0.00020586498,0.00006616948,0.00007799385,0.000045404686,0.00017602286,0.0018986878],"genre_scores_gemma":[0.97345996,0.00042006586,0.025483362,0.000030037463,0.000022539582,0.000039763352,0.0000142237,0.000011018101,0.0005190723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938726,0.0003036517,0.00002693328,0.000093483824,0.00008485426,0.00010387671],"domain_scores_gemma":[0.9977717,0.0017124643,0.0002137493,0.00009196829,0.00013876313,0.00007128752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001228934,0.0007958823,0.0009329088,0.0005252478,0.0004970443,0.00080485595,0.0013271593,0.0007188986,0.0006355201],"category_scores_gemma":[0.0046027596,0.00034513455,0.00034195636,0.0005395732,0.0007132316,0.0016506872,0.00082527916,0.00046604997,0.00013078688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003057018,0.000071673494,0.0010564076,0.00014750777,0.000066881374,0.0004049806,0.00031936026,0.9332667,0.012597711,0.02281859,0.000482083,0.02846234],"study_design_scores_gemma":[0.000018319522,0.00009895047,0.00013860827,0.000006661183,0.000022487991,0.000073343384,0.00004571112,0.9944147,0.002051881,0.002844167,0.00027413364,0.000011001241],"about_ca_topic_score_codex":0.0011301801,"about_ca_topic_score_gemma":0.001083438,"teacher_disagreement_score":0.0013271593,"about_ca_system_score_codex":0.0005433596,"about_ca_system_score_gemma":0.0004742585,"threshold_uncertainty_score":0.0064992905},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39924982,0.0031867702,0.5475905,0.00034647153,0.00005022394,0.0000548854,0.00021622989,0.00020591833,0.049099267],"genre_scores_gemma":[0.9917093,0.0006489995,0.0058865966,0.000038436694,0.000017679944,0.000018421842,0.00004443775,0.00001575238,0.0016203541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995233,0.00017926931,0.000013303722,0.000060349445,0.00012503861,0.00009878858],"domain_scores_gemma":[0.9982193,0.0012481506,0.00013701906,0.00009563138,0.00027101923,0.000028857126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006833581,0.0004583826,0.00047825533,0.0004952493,0.00020984406,0.0009726588,0.00046194764,0.0004772266,0.0019347575],"category_scores_gemma":[0.0032537854,0.00015723494,0.00020078656,0.0007489156,0.0005415076,0.00090229616,0.0006456723,0.0003064975,0.00036430187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011284022,0.00002770614,0.0018822756,0.00009334198,0.000050677427,0.00021324784,0.000104103485,0.9207311,0.008263622,0.042407412,0.0006909635,0.025422659],"study_design_scores_gemma":[0.0000069899725,0.00008557383,0.0014013136,0.00001641232,0.000020367537,0.00020858306,0.000072885276,0.97876793,0.0036877769,0.014117643,0.0016027131,0.0000117843865],"about_ca_topic_score_codex":0.0009194858,"about_ca_topic_score_gemma":0.00055999425,"teacher_disagreement_score":0.0019347575,"about_ca_system_score_codex":0.00073843665,"about_ca_system_score_gemma":0.00028818302,"threshold_uncertainty_score":0.0064724684},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44249418,0.00071898533,0.5495504,0.000627065,0.00006614469,0.000062654704,0.0002003303,0.00065919,0.005621159],"genre_scores_gemma":[0.98832303,0.00023368637,0.010113243,0.00005024129,0.000023546294,0.0000301998,0.000055521265,0.000026059048,0.0011444219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995221,0.0001485092,0.000017793805,0.00006294378,0.00013936682,0.00010928246],"domain_scores_gemma":[0.99529135,0.0027208668,0.000619542,0.00043520608,0.00062099425,0.00031205398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095196173,0.000498586,0.00048334038,0.00045093326,0.00047806939,0.00070656376,0.0007359182,0.00053860643,0.0008309927],"category_scores_gemma":[0.0076172906,0.00026300503,0.00016985151,0.00040782962,0.001141409,0.0018846823,0.0013571461,0.00095074443,0.00015033744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034681067,0.000049174232,0.001212472,0.000091483475,0.000022054415,0.00027323124,0.00021773967,0.8559317,0.015196165,0.1047991,0.0013708926,0.020489272],"study_design_scores_gemma":[0.0000071022237,0.00003206945,0.00013108458,0.0000049969763,0.0000031297848,0.000045302568,0.000030063487,0.97716767,0.001866568,0.02045683,0.00024756134,0.000007747711],"about_ca_topic_score_codex":0.0020413732,"about_ca_topic_score_gemma":0.0010357448,"teacher_disagreement_score":0.0020413732,"about_ca_system_score_codex":0.0010624592,"about_ca_system_score_gemma":0.000723888,"threshold_uncertainty_score":0.0077086687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11944594,0.0011040862,0.8742121,0.00033517592,0.000076872195,0.000112172376,0.000037609534,0.00043814266,0.0042378977],"genre_scores_gemma":[0.9578692,0.00022856456,0.04035153,0.000059629296,0.000014675799,0.00007162315,0.00003016547,0.000007826787,0.0013667308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954045,0.0001803732,0.000015598458,0.000044892062,0.00015645425,0.000062218125],"domain_scores_gemma":[0.9990233,0.0005238666,0.000108749075,0.000083468236,0.00022802492,0.000032528904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079906604,0.00047792925,0.0003160311,0.000494331,0.00068407843,0.00045460075,0.000989346,0.0005874973,0.0006594342],"category_scores_gemma":[0.0021396421,0.000108388864,0.00022784139,0.000531801,0.00060618145,0.00064246164,0.0007888505,0.00037423542,0.00010645678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035600373,0.00010597999,0.0009488744,0.00019455912,0.00004765376,0.0006074719,0.0004277134,0.8594899,0.029125316,0.022901123,0.0021140533,0.08368134],"study_design_scores_gemma":[0.000007845406,0.000069089336,0.000087786444,0.000004276976,0.00000737052,0.000053564254,0.000025237881,0.9955824,0.0022773126,0.0013483857,0.00052835146,0.000008287989],"about_ca_topic_score_codex":0.008456651,"about_ca_topic_score_gemma":0.008365389,"teacher_disagreement_score":0.008456651,"about_ca_system_score_codex":0.0010125012,"about_ca_system_score_gemma":0.0008201427,"threshold_uncertainty_score":0.016814828},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14395536,0.0024077175,0.8150955,0.0007869157,0.000058525537,0.000073987016,0.00024409838,0.00056714285,0.036810808],"genre_scores_gemma":[0.9883238,0.0007146909,0.0083628055,0.00006014539,0.000046666584,0.000033043565,0.00005201111,0.0000365625,0.0023702502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883705,0.0004565955,0.000033520875,0.00009558567,0.0003786718,0.0001985231],"domain_scores_gemma":[0.9967789,0.0021301643,0.00043673636,0.0001801456,0.00039831013,0.00007584525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018234948,0.0013047819,0.0011004118,0.00075141736,0.000550919,0.0013281924,0.00091687,0.001223743,0.0013525526],"category_scores_gemma":[0.005225192,0.00048813462,0.0007399945,0.0009292858,0.0012336399,0.001215715,0.0012259078,0.0007589365,0.00053609314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053812157,0.00001629155,0.00032172093,0.000054020657,0.00002690396,0.00015788089,0.00006448031,0.97664523,0.00227536,0.017548045,0.00026130644,0.002575028],"study_design_scores_gemma":[0.000002023196,0.000019781324,0.00012145772,0.00000506377,0.000006468451,0.00004486699,0.0000085088805,0.99751616,0.00030552733,0.0018791371,0.00008515849,0.000005919424],"about_ca_topic_score_codex":0.0039321957,"about_ca_topic_score_gemma":0.002091546,"teacher_disagreement_score":0.0039321957,"about_ca_system_score_codex":0.00144084,"about_ca_system_score_gemma":0.0008909832,"threshold_uncertainty_score":0.010454059},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8990641,0.0016228164,0.08790532,0.00057969487,0.00019928085,0.00008717234,0.00015783489,0.0005234458,0.009860382],"genre_scores_gemma":[0.99645823,0.00017270927,0.0026100068,0.00003565213,0.000014765923,0.000018424043,0.000038889375,0.000012149709,0.00063919503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978181,0.00067743124,0.0001093914,0.00020212338,0.0006133847,0.00057949894],"domain_scores_gemma":[0.99228925,0.004912124,0.0005544635,0.00039901765,0.0016051414,0.00023995872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037814374,0.0010872196,0.0010722976,0.0010922727,0.00077215326,0.0010748053,0.0010479306,0.0010913267,0.001026059],"category_scores_gemma":[0.00853984,0.00034297106,0.00027174831,0.0009424301,0.0009971604,0.0012300067,0.0013067257,0.00072871405,0.00015144025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028704177,0.00038654712,0.0048245545,0.00031437972,0.00017655204,0.0003646858,0.00026890103,0.9197592,0.026754636,0.007731212,0.0014119254,0.035136838],"study_design_scores_gemma":[0.000050476443,0.000903934,0.001528623,0.000015162135,0.000063555315,0.0001693259,0.00014712622,0.98720896,0.007350831,0.002238256,0.0002944162,0.00002932512],"about_ca_topic_score_codex":0.003381372,"about_ca_topic_score_gemma":0.0024647769,"teacher_disagreement_score":0.0037814374,"about_ca_system_score_codex":0.00092626346,"about_ca_system_score_gemma":0.0015838764,"threshold_uncertainty_score":0.019998372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013309837,0.00069307454,0.980205,0.000050596453,0.00002074958,0.0000198878,0.000076291115,0.00029032372,0.005334262],"genre_scores_gemma":[0.6439381,0.0025665201,0.34556645,0.00006811097,0.000105871484,0.0002320412,0.00032934488,0.00036153026,0.00683196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929273,0.00023630132,0.000026191452,0.000121573015,0.00025565815,0.00006747547],"domain_scores_gemma":[0.9984968,0.0008297124,0.00015672344,0.00018134936,0.00029811106,0.00003720478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008028777,0.00053157983,0.00048226185,0.0012705233,0.00035682195,0.0011722858,0.0011156013,0.00035032685,0.0014994214],"category_scores_gemma":[0.0047539813,0.00037711195,0.00043963772,0.0009112157,0.0007407315,0.0015104422,0.0008123662,0.0009283437,0.00060734845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019349197,0.00002142853,0.00059773505,0.00020997688,0.00003986909,0.00020247503,0.00030454586,0.46021497,0.019620946,0.4386174,0.002374509,0.07760267],"study_design_scores_gemma":[0.000008382491,0.000038059305,0.00025021782,0.000021659742,0.000019483557,0.0002114548,0.000037310787,0.88167083,0.010353439,0.10175955,0.005604713,0.000024783218],"about_ca_topic_score_codex":0.0012153247,"about_ca_topic_score_gemma":0.00041715568,"teacher_disagreement_score":0.0014994214,"about_ca_system_score_codex":0.0007301599,"about_ca_system_score_gemma":0.00046085782,"threshold_uncertainty_score":0.005297661},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1477828,0.0006349208,0.8400469,0.00040110646,0.000041787127,0.0001027695,0.00019423525,0.0002475412,0.010547963],"genre_scores_gemma":[0.96611184,0.0004409369,0.031705726,0.00006919082,0.000023657461,0.000092305956,0.000057723282,0.00005287422,0.0014457973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728394,0.0015123095,0.00008051157,0.000304346,0.00045468548,0.00036418918],"domain_scores_gemma":[0.99553865,0.0030326962,0.0006161904,0.00032851126,0.00031918872,0.00016467212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030298608,0.0016259606,0.0016262006,0.0008747965,0.0005668176,0.0015723341,0.0013558387,0.0011519601,0.0018493993],"category_scores_gemma":[0.00736319,0.00061362685,0.00077777094,0.0012708463,0.0018509165,0.0018691169,0.0019856177,0.0011266405,0.0004896566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003137108,0.00009940116,0.00058372965,0.00021499766,0.00006019586,0.00042828443,0.00018494054,0.86577463,0.010848479,0.10784685,0.0012187152,0.0124261],"study_design_scores_gemma":[0.000029185445,0.00013399658,0.00017402935,0.000019138293,0.000020723426,0.0002189921,0.000057196954,0.9643823,0.0030710364,0.031457968,0.0004050383,0.000030450863],"about_ca_topic_score_codex":0.000845805,"about_ca_topic_score_gemma":0.00073417847,"teacher_disagreement_score":0.0030298608,"about_ca_system_score_codex":0.001459902,"about_ca_system_score_gemma":0.0010161158,"threshold_uncertainty_score":0.016023636},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16589409,0.0035410458,0.7915499,0.0006121235,0.000070123344,0.000054758606,0.000113202754,0.00014102478,0.038023617],"genre_scores_gemma":[0.96981514,0.002528189,0.025713958,0.000113104536,0.000055087334,0.000059473412,0.00004676231,0.00003757006,0.0016307547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990276,0.00036026965,0.000035616325,0.0001177161,0.0003387766,0.00011992605],"domain_scores_gemma":[0.99563855,0.0034481958,0.00022381256,0.00025937567,0.0003998331,0.000030243467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014610814,0.000769843,0.00066083216,0.00066864304,0.0004055819,0.0009243314,0.0007250766,0.0006167978,0.0012304145],"category_scores_gemma":[0.0066408487,0.0003230784,0.00030362228,0.0007928862,0.0011571203,0.0015009979,0.0009360116,0.0006442871,0.00033487476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021309935,0.000095545365,0.0012040258,0.0001841195,0.00004965169,0.0002546096,0.00020159956,0.760674,0.019919831,0.14831425,0.0012084565,0.067680776],"study_design_scores_gemma":[0.000018939458,0.00009597881,0.00057055097,0.000055754677,0.000028602284,0.00020347083,0.00005188439,0.9551324,0.01068313,0.031466138,0.0016667154,0.000026443327],"about_ca_topic_score_codex":0.0011592683,"about_ca_topic_score_gemma":0.0011174765,"teacher_disagreement_score":0.0014610814,"about_ca_system_score_codex":0.0010704186,"about_ca_system_score_gemma":0.00055435946,"threshold_uncertainty_score":0.007766485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01866528,0.0002439775,0.97938836,0.00012779246,0.000015356323,0.000025670983,0.00002384325,0.00009517193,0.001414583],"genre_scores_gemma":[0.7417829,0.00048308534,0.25454953,0.00006891648,0.00004151511,0.00012109461,0.000050609848,0.00004617599,0.0028561396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993494,0.00029352232,0.000027602377,0.00008756146,0.00014308875,0.000098790806],"domain_scores_gemma":[0.99943775,0.000389341,0.00006833131,0.000044923163,0.000041215244,0.000018361749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092820305,0.00076148944,0.0010472399,0.00034239888,0.0004402259,0.0007047897,0.00070151925,0.0007050484,0.0010705716],"category_scores_gemma":[0.0025016682,0.00040274143,0.00022717415,0.0006778286,0.0006247765,0.0010578976,0.00082042644,0.0005845482,0.00027203787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015520219,0.00007167683,0.00027855334,0.00007945942,0.00002763686,0.00009959927,0.00009133538,0.88572174,0.0055998843,0.027558353,0.0013226167,0.07899398],"study_design_scores_gemma":[0.000015436546,0.000025745287,0.000043418935,0.0000022637655,0.000005860679,0.000024611252,0.000010645768,0.9896417,0.0015427431,0.008250664,0.0004324568,0.000004510936],"about_ca_topic_score_codex":0.0013633306,"about_ca_topic_score_gemma":0.0022992184,"teacher_disagreement_score":0.0013633306,"about_ca_system_score_codex":0.0007264446,"about_ca_system_score_gemma":0.00075070735,"threshold_uncertainty_score":0.005270779},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034819752,0.0007074419,0.9233055,0.004121631,0.0002459078,0.000110720684,0.00022823953,0.00020555244,0.03625523],"genre_scores_gemma":[0.7892338,0.001526743,0.19265164,0.0015594291,0.00093337015,0.00064277026,0.00060748035,0.00024077029,0.012604054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970751,0.0012718186,0.00007285807,0.0003431234,0.00093258603,0.00030456795],"domain_scores_gemma":[0.9896847,0.0077751493,0.00033161868,0.0014139385,0.0006070432,0.00018751883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030059447,0.00084093906,0.00093241694,0.001710488,0.0016425843,0.0018532103,0.002072979,0.0016770838,0.0040664324],"category_scores_gemma":[0.011945689,0.0005322955,0.0017953713,0.0014097563,0.0050378554,0.005220923,0.003553929,0.00503564,0.0006117652],"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.000034781435,0.000026825895,0.00018623243,0.00006035067,0.000012478579,0.00006912472,0.00015683196,0.01849674,0.0007441071,0.97241193,0.0022168418,0.0055838325],"study_design_scores_gemma":[0.000016290507,0.000026954935,0.00007826038,0.00002186465,0.000010113539,0.00008180128,0.00004990165,0.07731247,0.00086837803,0.9176403,0.003879368,0.000014394541],"about_ca_topic_score_codex":0.0012524358,"about_ca_topic_score_gemma":0.0011579478,"teacher_disagreement_score":0.0040664324,"about_ca_system_score_codex":0.0020464833,"about_ca_system_score_gemma":0.0012060388,"threshold_uncertainty_score":0.015897155},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12903549,0.0015612012,0.8607729,0.00025494784,0.000044466764,0.000044941266,0.00015151428,0.00020004672,0.007934471],"genre_scores_gemma":[0.9728142,0.00074560393,0.023501366,0.000041747022,0.00003551271,0.000038219598,0.00010280089,0.00005477963,0.0026659186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860424,0.00038362303,0.000039132756,0.00013308607,0.0006613021,0.00017862413],"domain_scores_gemma":[0.9946478,0.0035102202,0.000573996,0.00026934172,0.0008867709,0.00011179871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015610474,0.0011280983,0.00085249805,0.0005859919,0.0003816101,0.0010102667,0.0010832713,0.00070467085,0.0010503182],"category_scores_gemma":[0.006161448,0.00033720635,0.00042831153,0.00044277505,0.0011193143,0.0010909755,0.00093846157,0.0008748898,0.0002607345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003350781,0.000044172793,0.0010814004,0.00012962383,0.00006405161,0.00027664346,0.00016603555,0.9425409,0.013194598,0.026151903,0.0004668541,0.015548763],"study_design_scores_gemma":[0.0000039439965,0.000069530215,0.0002842532,0.0000059196973,0.0000148091185,0.00011938809,0.000025592894,0.9919063,0.0045188726,0.0028164606,0.00022270177,0.00001211866],"about_ca_topic_score_codex":0.003321801,"about_ca_topic_score_gemma":0.0018002002,"teacher_disagreement_score":0.003321801,"about_ca_system_score_codex":0.0024416323,"about_ca_system_score_gemma":0.0007629029,"threshold_uncertainty_score":0.017715335},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011380204,0.0017247411,0.98493576,0.00021981525,0.0000418065,0.00004096287,0.0000138493615,0.000095298405,0.0015475814],"genre_scores_gemma":[0.7468703,0.003227168,0.24651702,0.00021944281,0.0001508745,0.00035592445,0.00007247852,0.00009367724,0.002493099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987526,0.00051559083,0.00004435916,0.00015913206,0.00045063492,0.0000776649],"domain_scores_gemma":[0.9981798,0.0012956521,0.00016688838,0.00012790954,0.00019716985,0.00003253267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016726492,0.0008035846,0.00081005227,0.0007334198,0.0007762253,0.00079775025,0.0011455291,0.0007937571,0.00073752936],"category_scores_gemma":[0.0044198995,0.00044352468,0.0004773722,0.0015993012,0.0011730621,0.0011679528,0.0011975016,0.00074980466,0.00016582172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006840675,0.00004475712,0.00047725448,0.00019738369,0.000077103454,0.000108494445,0.00029480175,0.8638029,0.0068366746,0.067478485,0.0015324447,0.059081327],"study_design_scores_gemma":[0.000011863054,0.000053685246,0.00008892431,0.000012040382,0.000017137852,0.00004893391,0.00002484177,0.9716779,0.001381211,0.025330525,0.0013442987,0.000008668178],"about_ca_topic_score_codex":0.0016416204,"about_ca_topic_score_gemma":0.0015670253,"teacher_disagreement_score":0.0016726492,"about_ca_system_score_codex":0.00092149683,"about_ca_system_score_gemma":0.0012330842,"threshold_uncertainty_score":0.008845925},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1701918,0.0005319835,0.8273456,0.0001031122,0.000032456217,0.000025159132,0.000022868491,0.0001259092,0.0016210831],"genre_scores_gemma":[0.9699738,0.0004617018,0.028567342,0.000033857843,0.00002374974,0.000016371458,0.00002001478,0.000013880662,0.00088927435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953914,0.00018120193,0.000018611006,0.000077896824,0.00012223153,0.000060971364],"domain_scores_gemma":[0.9978466,0.0016852362,0.00017869282,0.000111509165,0.00014294949,0.00003495592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070332433,0.00046764777,0.0005322671,0.0003733722,0.00032152145,0.0004662728,0.00045153804,0.000400808,0.00031914213],"category_scores_gemma":[0.003427066,0.00018469966,0.00017665736,0.0005114275,0.0008174478,0.0007939299,0.0005474712,0.00032213968,0.00011208469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024417895,0.000025165615,0.0015002347,0.000084131665,0.000043603286,0.00041964918,0.00022106989,0.9288066,0.016442306,0.022228014,0.00030564578,0.029679406],"study_design_scores_gemma":[0.0000061677665,0.000051445848,0.0002621358,0.0000042480165,0.000013394392,0.00012235536,0.000030042343,0.9918927,0.0037488327,0.003639151,0.00022124652,0.00000822844],"about_ca_topic_score_codex":0.0010794135,"about_ca_topic_score_gemma":0.0009919419,"teacher_disagreement_score":0.0010794135,"about_ca_system_score_codex":0.00037462916,"about_ca_system_score_gemma":0.00029321483,"threshold_uncertainty_score":0.0037195683},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35906503,0.0017667285,0.6298234,0.00036408482,0.00004527824,0.000039936,0.00006394164,0.00035244878,0.008479217],"genre_scores_gemma":[0.9917081,0.0002871847,0.007418969,0.000026318474,0.000020997208,0.000018926281,0.00001288395,0.000013130698,0.00049345405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898106,0.0004741739,0.000022145472,0.000114719995,0.00022826524,0.00017957544],"domain_scores_gemma":[0.99330187,0.0052848016,0.00057664287,0.0002950804,0.00041713568,0.00012443951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016705237,0.00076841994,0.0008486119,0.0005315413,0.00060542073,0.0010688173,0.0008743244,0.0008318218,0.0006483446],"category_scores_gemma":[0.0091569675,0.00038254308,0.00039393216,0.0006537713,0.0017011199,0.0017111591,0.0010108536,0.00055752345,0.00015605733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015124773,0.00003192473,0.0012304408,0.000057714296,0.000053563585,0.000438231,0.00018270913,0.95539534,0.0049193627,0.026866917,0.00033132627,0.010341344],"study_design_scores_gemma":[0.0000066393227,0.000055378452,0.00029835073,0.0000044656085,0.00001533877,0.00017402378,0.00004972806,0.9899478,0.000755993,0.008525065,0.0001579482,0.00000925541],"about_ca_topic_score_codex":0.0022772688,"about_ca_topic_score_gemma":0.001601761,"teacher_disagreement_score":0.0022772688,"about_ca_system_score_codex":0.0011730146,"about_ca_system_score_gemma":0.00058845675,"threshold_uncertainty_score":0.00883466},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6305023,0.0030490272,0.35775596,0.00070900994,0.000056839628,0.00005840319,0.0003026849,0.00035887727,0.00720685],"genre_scores_gemma":[0.9963915,0.00033344625,0.0027572985,0.000025092155,0.000012299689,0.000018306308,0.00003308073,0.000010242285,0.0004187118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987048,0.000556867,0.000052789794,0.00014332944,0.00028511367,0.00025718135],"domain_scores_gemma":[0.990703,0.0074931947,0.00072334666,0.00024805166,0.0006812765,0.00015114238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020409701,0.000845142,0.0008739209,0.0008369854,0.00082203577,0.0009308911,0.00081607874,0.0010561721,0.00072698307],"category_scores_gemma":[0.007485801,0.0004181636,0.0002862361,0.00097259204,0.00148888,0.0013974028,0.0011760762,0.0006146231,0.00011555205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024206401,0.000022983113,0.0047698272,0.000090121044,0.000035560566,0.0005053795,0.00022631118,0.9721929,0.003048936,0.010692366,0.0005052959,0.007668158],"study_design_scores_gemma":[0.000008446228,0.00006622636,0.0012510439,0.0000112117605,0.000023038057,0.00018544988,0.00009208406,0.99361455,0.0009522969,0.0036088575,0.00016689223,0.000019804856],"about_ca_topic_score_codex":0.004261477,"about_ca_topic_score_gemma":0.0034040778,"teacher_disagreement_score":0.004261477,"about_ca_system_score_codex":0.0017512451,"about_ca_system_score_gemma":0.00060733827,"threshold_uncertainty_score":0.01270622},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065329924,0.0062615033,0.8997454,0.0008125653,0.00013967806,0.0001119199,0.00010454561,0.00033860406,0.027155863],"genre_scores_gemma":[0.94193643,0.0059239403,0.04439789,0.00021957097,0.00021506673,0.00009029239,0.00006932895,0.00010358611,0.0070438725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999286,0.00018772254,0.000020515112,0.00006095418,0.00032260478,0.00012228802],"domain_scores_gemma":[0.99740005,0.001717645,0.00023098817,0.00013063074,0.0004834884,0.000037176003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009662883,0.0010319985,0.00076665543,0.00090420723,0.0006809011,0.001202619,0.0006469567,0.0008654135,0.002101686],"category_scores_gemma":[0.00650171,0.0003536855,0.0005047767,0.0010552317,0.0008946681,0.0014701176,0.00064510887,0.00104771,0.00048040418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004690231,0.000050207625,0.00089001557,0.00027372895,0.00003589368,0.000502236,0.00038039,0.9019199,0.00781716,0.0649766,0.0012277301,0.021879239],"study_design_scores_gemma":[0.000002410899,0.000026616743,0.00020902514,0.000029591749,0.0000114415725,0.0002079804,0.00005270653,0.9924752,0.0009167761,0.0051003555,0.00095898716,0.000008859663],"about_ca_topic_score_codex":0.0047391234,"about_ca_topic_score_gemma":0.0041751266,"teacher_disagreement_score":0.0047391234,"about_ca_system_score_codex":0.0015938947,"about_ca_system_score_gemma":0.0012776873,"threshold_uncertainty_score":0.011564493},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049394257,0.00034168243,0.94437295,0.00010700615,0.00013377312,0.0000987714,0.00006411983,0.000437966,0.00504945],"genre_scores_gemma":[0.72410524,0.00038323426,0.26939136,0.00015480048,0.00014314451,0.00016101172,0.0001234548,0.0000638917,0.0054738866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995264,0.00014858664,0.000027834061,0.00008951325,0.0000967093,0.00011095741],"domain_scores_gemma":[0.9992884,0.00021860457,0.00013669596,0.0001706122,0.00012757866,0.000058040787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004671973,0.0005200709,0.0004301985,0.0002823144,0.0007532498,0.0005503742,0.0006476488,0.00034222574,0.0019847325],"category_scores_gemma":[0.000888907,0.00018328232,0.00035949497,0.00052432314,0.00059190724,0.00082869956,0.0008558647,0.0005035683,0.0005933939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001360888,0.00015989832,0.00072218647,0.00025406835,0.000084816056,0.00042631908,0.00045114575,0.3863187,0.20781723,0.1655188,0.004050056,0.23283587],"study_design_scores_gemma":[0.00014993193,0.0008973171,0.00037281576,0.000030272395,0.000049320188,0.0003565003,0.0001229138,0.91819364,0.04451952,0.02123633,0.013979558,0.00009185079],"about_ca_topic_score_codex":0.0014381977,"about_ca_topic_score_gemma":0.0017331855,"teacher_disagreement_score":0.0019847325,"about_ca_system_score_codex":0.0006094606,"about_ca_system_score_gemma":0.0008537084,"threshold_uncertainty_score":0.0066396594},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120947994,0.00089299516,0.8712745,0.00035132834,0.000031049774,0.000050010745,0.000053385742,0.000105762956,0.006292958],"genre_scores_gemma":[0.965958,0.00035906152,0.032058403,0.000032303768,0.00003236331,0.00006174817,0.000020418742,0.000014909762,0.0014628412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899405,0.0006465037,0.00002620786,0.000103498016,0.0001347028,0.00009506991],"domain_scores_gemma":[0.9987465,0.00096491113,0.00012336753,0.000045080047,0.000093863266,0.00002632675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014077432,0.0007811089,0.0008262611,0.00041509708,0.00029018213,0.0006649804,0.0006294001,0.00078905426,0.0009384258],"category_scores_gemma":[0.0030573588,0.0003916419,0.00036883922,0.0009820177,0.0009227159,0.0009516439,0.0007523312,0.00036763458,0.00018135652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006237441,0.00001961203,0.00021317537,0.000032038286,0.000019531806,0.00006745833,0.000028199931,0.9849337,0.0011841202,0.004969312,0.00019899922,0.00827157],"study_design_scores_gemma":[0.0000152089015,0.00003791661,0.00007062817,0.0000028144343,0.0000059052322,0.000020684163,0.000013019114,0.99501824,0.00039679086,0.004304192,0.00011113299,0.0000034608495],"about_ca_topic_score_codex":0.0014761926,"about_ca_topic_score_gemma":0.0012795476,"teacher_disagreement_score":0.0014761926,"about_ca_system_score_codex":0.0007421956,"about_ca_system_score_gemma":0.00042709778,"threshold_uncertainty_score":0.007444918},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23424354,0.0013764058,0.63477945,0.002034003,0.00021861107,0.00017898329,0.00050931174,0.0006434455,0.1260162],"genre_scores_gemma":[0.91559607,0.00088475604,0.06617803,0.00042546343,0.00026308084,0.00021473323,0.00049754645,0.00009768111,0.015842658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999288,0.0001799576,0.000027736469,0.000119535005,0.0002436645,0.00014115675],"domain_scores_gemma":[0.99894804,0.0005895052,0.000101046186,0.00016140207,0.00015575268,0.00004424172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006866274,0.0004432301,0.00036381284,0.00086405315,0.00063691434,0.0014746898,0.00044153148,0.0005119599,0.0044801277],"category_scores_gemma":[0.0029850632,0.00015778416,0.00036336156,0.0008359911,0.0014605048,0.002537763,0.0011958468,0.0013302141,0.0008626859],"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.0000901246,0.000021176516,0.0003103121,0.00007029281,0.0000063744505,0.0001595173,0.00023318072,0.01990665,0.0030268955,0.9524088,0.0027466472,0.021019947],"study_design_scores_gemma":[0.000034308137,0.00005202609,0.0001528292,0.000042090327,0.000009202192,0.00017603757,0.00009141458,0.14381568,0.0046909233,0.84035367,0.010563288,0.00001849229],"about_ca_topic_score_codex":0.0014480051,"about_ca_topic_score_gemma":0.000937591,"teacher_disagreement_score":0.0044801277,"about_ca_system_score_codex":0.0015544764,"about_ca_system_score_gemma":0.00082347944,"threshold_uncertainty_score":0.014987528},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030870287,0.0024648663,0.94746834,0.00075572473,0.00013100408,0.00005369357,0.0001516576,0.00022435865,0.017880017],"genre_scores_gemma":[0.9345371,0.0044222036,0.046853144,0.00033949342,0.0003373176,0.00020136563,0.00020925418,0.0001851361,0.012914979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986206,0.00055599806,0.000053666216,0.00015870278,0.00035022912,0.00026074718],"domain_scores_gemma":[0.99536043,0.0032835489,0.00040377578,0.00019424674,0.00066589465,0.000092099675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025861582,0.0021250208,0.001438545,0.0012866319,0.0005794518,0.0023316892,0.0012829296,0.0011856818,0.0028814317],"category_scores_gemma":[0.0071145003,0.0007576127,0.0010181778,0.0016190798,0.0016059964,0.002270488,0.00157599,0.0015553478,0.00073436816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006932513,0.000040261977,0.00028675963,0.00015353953,0.000083858446,0.00019061384,0.00012554739,0.89474154,0.0027333417,0.08956921,0.0020811239,0.009924818],"study_design_scores_gemma":[0.0000042961137,0.000022188067,0.000112599206,0.000011122802,0.00001551669,0.00004699248,0.000021179152,0.9860994,0.0004928599,0.012650516,0.0005122475,0.000010995692],"about_ca_topic_score_codex":0.0029838716,"about_ca_topic_score_gemma":0.0017136593,"teacher_disagreement_score":0.0029838716,"about_ca_system_score_codex":0.0025027606,"about_ca_system_score_gemma":0.0011976275,"threshold_uncertainty_score":0.018158853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13770528,0.0016911228,0.85424304,0.00038204543,0.00020668628,0.00015085078,0.000027856835,0.00074086123,0.004852119],"genre_scores_gemma":[0.96569276,0.00042131272,0.0329206,0.00007069687,0.00005116058,0.000070645845,0.000019655154,0.000027746191,0.00072536815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921834,0.00030717213,0.000041535597,0.000080718455,0.00024258607,0.0001095283],"domain_scores_gemma":[0.9968528,0.0018245026,0.00031288262,0.00040107663,0.00053274113,0.00007601539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016485984,0.00043611357,0.0004250979,0.00081742555,0.0005630785,0.0006825891,0.00083643425,0.00062437356,0.0003673137],"category_scores_gemma":[0.005982337,0.00024559582,0.00032108033,0.00095680024,0.0010382655,0.0014118657,0.00090210617,0.0006725377,0.00006245465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019700665,0.0001408244,0.0035232531,0.00017063103,0.00008542978,0.0005123935,0.00027768908,0.80551845,0.021078512,0.041398227,0.0017634479,0.12533411],"study_design_scores_gemma":[0.000010239424,0.00004463555,0.00035252143,0.000008756206,0.000017256903,0.00011800738,0.000020334493,0.9877337,0.0038249202,0.0069222054,0.0009321973,0.000015224721],"about_ca_topic_score_codex":0.003669016,"about_ca_topic_score_gemma":0.0024031,"teacher_disagreement_score":0.003669016,"about_ca_system_score_codex":0.00077620527,"about_ca_system_score_gemma":0.0010755463,"threshold_uncertainty_score":0.008718789},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21084623,0.0057628667,0.7641319,0.00080939755,0.00013143891,0.00006392657,0.00018017368,0.0004767944,0.017597264],"genre_scores_gemma":[0.9826334,0.0016573068,0.013895754,0.000082857514,0.00006486984,0.000049797523,0.00007131588,0.00003242235,0.0015122811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986174,0.00047925123,0.000050514926,0.00015548404,0.0004786191,0.00021864517],"domain_scores_gemma":[0.99620503,0.0024677927,0.00034302037,0.00019857353,0.00073220365,0.000053357744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013022337,0.001342936,0.0011326768,0.0008803051,0.0008401757,0.001133697,0.0007505142,0.0011490488,0.0018757471],"category_scores_gemma":[0.006875486,0.00027752062,0.00061473553,0.0009595078,0.0009123095,0.001613343,0.001071616,0.0008537527,0.00043459408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019654172,0.000028673725,0.0014182822,0.00028800193,0.00008691619,0.0003592297,0.00019059617,0.936612,0.013594055,0.028359571,0.0007634236,0.01810263],"study_design_scores_gemma":[0.0000047904277,0.00008776489,0.000535825,0.000017551005,0.000030369149,0.00025144094,0.00004061121,0.9923344,0.003042102,0.0032530641,0.00038103052,0.000020966456],"about_ca_topic_score_codex":0.0030847318,"about_ca_topic_score_gemma":0.0015332592,"teacher_disagreement_score":0.0030847318,"about_ca_system_score_codex":0.0012779569,"about_ca_system_score_gemma":0.0009477843,"threshold_uncertainty_score":0.009272218},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015035859,0.00021589398,0.9835321,0.00007697937,0.000013184495,0.000020791991,0.000032003645,0.00006775612,0.0010055028],"genre_scores_gemma":[0.807907,0.00074082287,0.18804921,0.00013779796,0.000080741076,0.00018616063,0.00012299385,0.00004184815,0.0027334448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893004,0.00037934614,0.000044621254,0.00015799617,0.00042349842,0.000064500804],"domain_scores_gemma":[0.9980574,0.0011893376,0.00017281185,0.0001552129,0.00039126753,0.00003388731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013627276,0.00069254066,0.0005820586,0.00034197804,0.00027926738,0.0007161887,0.00077306037,0.0008606378,0.0012902023],"category_scores_gemma":[0.004576077,0.0004121849,0.0003240547,0.00042201497,0.0007360265,0.00138869,0.0008697801,0.00073949934,0.0003414262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001473285,0.000041064133,0.0008725725,0.00020567993,0.00008669963,0.00032333343,0.00023059387,0.81990904,0.019026456,0.102583244,0.0007807205,0.05579338],"study_design_scores_gemma":[0.000015320325,0.00007025186,0.00027095343,0.000011314311,0.000018679852,0.00024468542,0.000017705306,0.9722201,0.0052282633,0.021321394,0.0005632326,0.0000180458],"about_ca_topic_score_codex":0.0007132357,"about_ca_topic_score_gemma":0.0006619037,"teacher_disagreement_score":0.0013627276,"about_ca_system_score_codex":0.00072515744,"about_ca_system_score_gemma":0.0009272829,"threshold_uncertainty_score":0.007206857},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66065973,0.0040335967,0.31021762,0.0007785115,0.00008376894,0.00020104248,0.00039612406,0.0008488399,0.022780646],"genre_scores_gemma":[0.963293,0.00077932235,0.033803582,0.000050340186,0.000026904716,0.00007854028,0.00021125398,0.000067471854,0.0016896427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997951,0.0006285839,0.00008247432,0.00017134067,0.0007454715,0.00042131054],"domain_scores_gemma":[0.98021024,0.0148243075,0.0010167068,0.0019745468,0.0017699269,0.00020420119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029522744,0.00063614454,0.0007786857,0.0009007333,0.0004788216,0.0015809453,0.0012223672,0.0010731186,0.0017376025],"category_scores_gemma":[0.017170133,0.00022693776,0.00034177644,0.0010525575,0.001462667,0.0029535005,0.0013623013,0.00078802963,0.00027855524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001845943,0.00024516642,0.0039069713,0.00041802524,0.000098734854,0.0002313218,0.0004116594,0.7100723,0.033588827,0.13758704,0.0018749015,0.10971907],"study_design_scores_gemma":[0.000058333073,0.00038150017,0.001614484,0.00004133985,0.000040345876,0.00021574894,0.00008871113,0.9430644,0.02236323,0.031104423,0.00097171863,0.00005578249],"about_ca_topic_score_codex":0.003285874,"about_ca_topic_score_gemma":0.003922887,"teacher_disagreement_score":0.003285874,"about_ca_system_score_codex":0.0016054369,"about_ca_system_score_gemma":0.0016872825,"threshold_uncertainty_score":0.0156133175},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14349155,0.0061669378,0.83178324,0.0009383538,0.00021145129,0.00010377684,0.000061206156,0.00040270167,0.016840804],"genre_scores_gemma":[0.94384944,0.0018441185,0.052341234,0.00011359151,0.000058853664,0.00008397451,0.000038053142,0.000025264919,0.0016455034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994382,0.00023667607,0.000014873748,0.000035064575,0.00022407334,0.000050959232],"domain_scores_gemma":[0.9983279,0.0010962331,0.0001636841,0.000106269195,0.00027477965,0.000031174604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007532972,0.00019884364,0.00019382614,0.00036796945,0.0003182061,0.00047830318,0.0004783335,0.00058221846,0.0006016552],"category_scores_gemma":[0.0033174355,0.000118978765,0.00011471023,0.00065636187,0.00087775633,0.0006421446,0.00040939296,0.0005001432,0.0000906989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001288809,0.000045805664,0.0013845225,0.00025758674,0.000033445536,0.00028866922,0.00023934757,0.765201,0.019061852,0.114175685,0.001992244,0.097191066],"study_design_scores_gemma":[0.000011369888,0.00009819931,0.00051911845,0.000043518325,0.000016070117,0.0001927549,0.00005794947,0.9598786,0.00968941,0.023875175,0.0055959024,0.000021845419],"about_ca_topic_score_codex":0.003408126,"about_ca_topic_score_gemma":0.0023109314,"teacher_disagreement_score":0.003408126,"about_ca_system_score_codex":0.0006326739,"about_ca_system_score_gemma":0.0008536523,"threshold_uncertainty_score":0.0067765713},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050018635,0.0004141669,0.94292957,0.00036928937,0.00006957833,0.00005108024,0.000069377034,0.00026834058,0.0058099204],"genre_scores_gemma":[0.79751265,0.0004297787,0.1994719,0.0001888442,0.000077159835,0.00010093816,0.00010876197,0.00003510767,0.002074853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999311,0.0001958949,0.000026419872,0.000072092786,0.00024131451,0.00015327639],"domain_scores_gemma":[0.99929,0.00028116902,0.00009186656,0.0001660564,0.0001392023,0.00003169713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086277386,0.0005246201,0.00054579583,0.0006363677,0.0005016539,0.00063622306,0.0009847033,0.0006683083,0.00074592594],"category_scores_gemma":[0.0024746456,0.00021833822,0.0003406058,0.0005901021,0.00067136873,0.0013953077,0.0012739404,0.00056501635,0.00017166989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023955622,0.000072055176,0.00048142124,0.00009342061,0.000032603373,0.00015657724,0.00013106996,0.6191012,0.011234195,0.2705513,0.002929504,0.09497704],"study_design_scores_gemma":[0.000024403937,0.000053921543,0.000082073806,0.00000906363,0.000010766068,0.00005607504,0.000013130243,0.92679715,0.0027375435,0.06864744,0.0015565264,0.00001191535],"about_ca_topic_score_codex":0.0013801752,"about_ca_topic_score_gemma":0.0013139454,"teacher_disagreement_score":0.0013801752,"about_ca_system_score_codex":0.00084,"about_ca_system_score_gemma":0.0009467478,"threshold_uncertainty_score":0.0060946345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029777378,0.00066180405,0.9652413,0.00016942834,0.000041889933,0.00003190966,0.00003164745,0.0002939604,0.0037506444],"genre_scores_gemma":[0.89122397,0.00047596914,0.10516362,0.00011242448,0.000039091057,0.0001010623,0.000052930518,0.000013729124,0.0028171972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951744,0.00016343045,0.000017788328,0.00007456369,0.0001693152,0.000057545978],"domain_scores_gemma":[0.99912065,0.00044092638,0.000112355556,0.0001427156,0.00016043863,0.000022904744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006094353,0.0004810094,0.00034898182,0.00039152187,0.0002927559,0.00042397267,0.000755144,0.00054347044,0.00045379566],"category_scores_gemma":[0.0018558328,0.00022677942,0.0001703782,0.00062251376,0.0005691604,0.00072074734,0.00088415085,0.0004449575,0.00014546672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017646441,0.00008639574,0.0008063224,0.00017512223,0.00006471624,0.00041450796,0.00036194077,0.7227156,0.024853172,0.10442611,0.0022924053,0.14362717],"study_design_scores_gemma":[0.000020913043,0.00006190342,0.0001328952,0.000013695922,0.000019735146,0.00011513106,0.000014394162,0.9845636,0.0034567227,0.009062563,0.0025227908,0.000015621421],"about_ca_topic_score_codex":0.0029538358,"about_ca_topic_score_gemma":0.004048787,"teacher_disagreement_score":0.0029538358,"about_ca_system_score_codex":0.0005772507,"about_ca_system_score_gemma":0.0008829041,"threshold_uncertainty_score":0.005873263},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019408995,0.00030187343,0.9750931,0.00024555155,0.000037654394,0.000022466567,0.000032800115,0.00022244322,0.004635173],"genre_scores_gemma":[0.8970974,0.00043842717,0.09664551,0.00011682782,0.000050455412,0.00007193531,0.00006955182,0.00003631804,0.0054736338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993616,0.00015772937,0.000023402896,0.000072862866,0.00029326932,0.000091214],"domain_scores_gemma":[0.99880826,0.0006488728,0.00012706965,0.00019313638,0.00019679112,0.00002586498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011827293,0.0004846818,0.00045299457,0.00034265325,0.000391815,0.00058621477,0.000764814,0.00060996355,0.0009607573],"category_scores_gemma":[0.0024943277,0.000242685,0.0003109136,0.00035274986,0.0012755096,0.0009100309,0.00073609105,0.00092918397,0.00019782549],"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.00004139046,0.00001814524,0.00025778337,0.000047719295,0.00002177734,0.00009568989,0.00009803725,0.75678045,0.0038208016,0.2154842,0.00074190967,0.022592047],"study_design_scores_gemma":[0.0000037908064,0.000009113589,0.000040300525,0.000005835445,0.0000034528296,0.000018999819,0.0000040042523,0.9844865,0.0007106489,0.014035941,0.00067673955,0.0000046452224],"about_ca_topic_score_codex":0.005413209,"about_ca_topic_score_gemma":0.0059586368,"teacher_disagreement_score":0.005413209,"about_ca_system_score_codex":0.002147461,"about_ca_system_score_gemma":0.001661602,"threshold_uncertainty_score":0.015581012},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06981758,0.00012223501,0.91839963,0.00024022548,0.000050091385,0.00012213271,0.0002879038,0.00073882757,0.010221264],"genre_scores_gemma":[0.53473634,0.00028239054,0.45767054,0.00016526262,0.000041286865,0.00024298728,0.0008400356,0.00021984262,0.0058013247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991696,0.0001854741,0.000039574163,0.00018433495,0.00025762492,0.0001634161],"domain_scores_gemma":[0.99856204,0.00033431637,0.00018994171,0.00046462443,0.0003308784,0.00011813201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005166132,0.00068088813,0.0005404372,0.0009687311,0.00066666637,0.0010275254,0.0009407341,0.00076204626,0.0032786045],"category_scores_gemma":[0.0024054192,0.00027447744,0.0006085003,0.0010226079,0.00086347,0.0016114785,0.0023377447,0.0012081158,0.00069812225],"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.00024899328,0.00012686673,0.0013847287,0.00027785607,0.000050542123,0.00044633116,0.00031001726,0.27137914,0.041750725,0.52247715,0.008336803,0.15321095],"study_design_scores_gemma":[0.000041133022,0.00011754967,0.0002737511,0.000027692255,0.000019837018,0.00036774285,0.000092658105,0.80445516,0.021461936,0.16658959,0.0065036383,0.000049291462],"about_ca_topic_score_codex":0.0019687694,"about_ca_topic_score_gemma":0.0026727302,"teacher_disagreement_score":0.0032786045,"about_ca_system_score_codex":0.0010712021,"about_ca_system_score_gemma":0.001114339,"threshold_uncertainty_score":0.0109680295},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015047609,0.00015414173,0.99645436,0.000069375026,0.00001397159,0.00002186401,0.000009567789,0.000024886158,0.001747072],"genre_scores_gemma":[0.34967563,0.0017845015,0.63593125,0.00026422212,0.00019193678,0.00044438124,0.00010418885,0.0001271767,0.011476717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923193,0.00035884336,0.00002592926,0.00012050185,0.00021283812,0.000049939743],"domain_scores_gemma":[0.999511,0.00031008036,0.000039147675,0.000040327544,0.0000830417,0.00001636556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094314956,0.0014328948,0.00092551584,0.0005344763,0.00042528802,0.00085617765,0.001525344,0.0009257632,0.002308548],"category_scores_gemma":[0.0014697647,0.0004119394,0.0007464525,0.0007035935,0.00092890824,0.0012369974,0.0010066581,0.0009315645,0.0006870872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043032294,0.000063141095,0.00018019366,0.00019686436,0.000066882894,0.00017723395,0.00013495456,0.8134446,0.009170195,0.11389049,0.0022558323,0.060376532],"study_design_scores_gemma":[0.0000141138335,0.000077000914,0.00006175113,0.00001323916,0.000019658683,0.00010676855,0.000020231137,0.9630075,0.0016574365,0.03243766,0.0025717814,0.000012907315],"about_ca_topic_score_codex":0.0006775293,"about_ca_topic_score_gemma":0.0008824428,"teacher_disagreement_score":0.002308548,"about_ca_system_score_codex":0.0008169638,"about_ca_system_score_gemma":0.00058671145,"threshold_uncertainty_score":0.0077228546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20121223,0.0010286177,0.7900414,0.0005638268,0.000062492756,0.000071567985,0.00015305448,0.0008807661,0.00598616],"genre_scores_gemma":[0.85080147,0.0008106693,0.14475128,0.00013557335,0.0000550043,0.00010263718,0.00016080125,0.00012342601,0.0030591178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890685,0.00024664562,0.000080847414,0.00018228615,0.00036211847,0.00022129779],"domain_scores_gemma":[0.9888671,0.007388113,0.0010050109,0.0016501034,0.00090137747,0.00018832089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015695676,0.00086678215,0.0009671597,0.0007806891,0.0006706655,0.0013075088,0.0015885299,0.0013874295,0.00092691544],"category_scores_gemma":[0.014107478,0.00036613306,0.00038280556,0.0010175335,0.0013324731,0.0016081838,0.0016629907,0.0011433113,0.00056406343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000955603,0.00016911149,0.0020309633,0.00039773434,0.000089792346,0.00025117837,0.00039994845,0.5920723,0.0640006,0.24027221,0.0019983696,0.09736212],"study_design_scores_gemma":[0.00006317626,0.00020692918,0.0003713829,0.00005070447,0.000024488558,0.00029614478,0.00006675358,0.8305274,0.07628755,0.090098694,0.0019683193,0.000038335987],"about_ca_topic_score_codex":0.0006941804,"about_ca_topic_score_gemma":0.00080612086,"teacher_disagreement_score":0.0015885299,"about_ca_system_score_codex":0.0014802206,"about_ca_system_score_gemma":0.0017571428,"threshold_uncertainty_score":0.010739803},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6026663,0.0017291937,0.3816436,0.00048922084,0.000042732823,0.000048398902,0.00028971265,0.00021422266,0.012876598],"genre_scores_gemma":[0.9959188,0.00042201247,0.002777577,0.000016236696,0.000022203856,0.000014954837,0.00003939075,0.0000081623,0.00078077713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938035,0.00020260166,0.000026141217,0.000067891415,0.00020257174,0.00012054158],"domain_scores_gemma":[0.9948894,0.0036902188,0.00051436044,0.00021440517,0.00060192146,0.000089692454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015493812,0.00053755014,0.00078992173,0.00069421483,0.00047887917,0.0006573726,0.00060573994,0.00054215913,0.0011080767],"category_scores_gemma":[0.005883748,0.00020429915,0.00021966855,0.0008276007,0.0010298952,0.00079912314,0.0005500485,0.00041046884,0.00013398581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017513115,0.000024031178,0.0019104689,0.000094481315,0.000030384428,0.00050220295,0.00025812382,0.93578327,0.0057470365,0.04519852,0.00074600265,0.009530375],"study_design_scores_gemma":[0.0000053142217,0.000025927238,0.0004384459,0.000004944196,0.000011447114,0.000088634835,0.000035465713,0.9926197,0.0004920984,0.0061158356,0.00015530386,0.0000068471672],"about_ca_topic_score_codex":0.0038807255,"about_ca_topic_score_gemma":0.002026989,"teacher_disagreement_score":0.0038807255,"about_ca_system_score_codex":0.0014295746,"about_ca_system_score_gemma":0.0005355985,"threshold_uncertainty_score":0.010372341},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.506295,0.0020783853,0.4196467,0.0030019446,0.00037447378,0.000088063425,0.0005271651,0.00019837366,0.06778985],"genre_scores_gemma":[0.953317,0.0010198926,0.033365738,0.00019745085,0.0005715729,0.000055966546,0.00016046103,0.000059661248,0.011252385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993013,0.00024293894,0.000036235182,0.00013120114,0.00017752936,0.00011080693],"domain_scores_gemma":[0.9958264,0.0019107523,0.0008307678,0.00039191605,0.0005728645,0.00046720263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012453243,0.0004804957,0.00068934314,0.0019356775,0.0013716454,0.0025430287,0.0009924808,0.000861519,0.005165388],"category_scores_gemma":[0.00436613,0.00042366315,0.000548872,0.0019602038,0.0034339956,0.004441699,0.001748221,0.001847156,0.00042880667],"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.000018732579,0.000014626589,0.0001036313,0.000012623827,0.0000022101071,0.000025179066,0.000101700185,0.0014540126,0.00036898218,0.9955031,0.00030632783,0.0020889717],"study_design_scores_gemma":[0.000010549586,0.00002068217,0.00013247556,0.000008501831,0.0000044981266,0.00007714301,0.00007587557,0.016472785,0.00042697028,0.9811102,0.0016478136,0.000012408633],"about_ca_topic_score_codex":0.0007914991,"about_ca_topic_score_gemma":0.000771966,"teacher_disagreement_score":0.005165388,"about_ca_system_score_codex":0.0012576011,"about_ca_system_score_gemma":0.00080865866,"threshold_uncertainty_score":0.017279983},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013903048,0.00035451687,0.9836706,0.0001316795,0.00003633896,0.00002485747,0.000029704683,0.00008178638,0.0017674502],"genre_scores_gemma":[0.77454126,0.00095606176,0.22044753,0.00011842846,0.000087840104,0.00023215888,0.00016860403,0.000026013493,0.0034221613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937564,0.0002699781,0.000019387047,0.00005759167,0.00021798493,0.0000593633],"domain_scores_gemma":[0.99874806,0.00069835404,0.00011334967,0.00017700282,0.0002340581,0.000029157753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007809757,0.00045527142,0.0004627597,0.0002649591,0.00030089822,0.00047048906,0.0007623008,0.00054311,0.00093800336],"category_scores_gemma":[0.002649077,0.00017568441,0.00026881223,0.0006992189,0.0005542833,0.0008383592,0.00073780457,0.0006653623,0.00032832185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017299633,0.000039628096,0.00042105376,0.000117677046,0.00003240798,0.00015587833,0.00017586714,0.7557176,0.012015521,0.14965883,0.0020235903,0.07946897],"study_design_scores_gemma":[0.000015764765,0.0000450793,0.000060753,0.0000068801764,0.000006684299,0.000033617707,0.000011174255,0.9785669,0.001300014,0.018591596,0.0013561064,0.0000054522056],"about_ca_topic_score_codex":0.0024773227,"about_ca_topic_score_gemma":0.0033103845,"teacher_disagreement_score":0.0024773227,"about_ca_system_score_codex":0.00095786504,"about_ca_system_score_gemma":0.0009415129,"threshold_uncertainty_score":0.0069497824},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11342985,0.0025681031,0.8710082,0.00043425357,0.0000889669,0.0001003074,0.00010850812,0.00017673027,0.012084996],"genre_scores_gemma":[0.9410254,0.0008455459,0.05672655,0.000054401313,0.000066854736,0.000059176713,0.00003455367,0.000011859544,0.0011755845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914813,0.00037035646,0.000035529218,0.00013805648,0.000206644,0.00010131512],"domain_scores_gemma":[0.9990042,0.0004957382,0.00012954409,0.00018854845,0.00013366315,0.00004836016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001144477,0.00089868833,0.00079308497,0.00040469225,0.0005263303,0.00095347903,0.0012027926,0.0007890133,0.0012580785],"category_scores_gemma":[0.002039148,0.00029006792,0.00039905784,0.00086043164,0.0007371914,0.0016487828,0.0009972141,0.0005034805,0.00024924512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034015512,0.00010839565,0.0014961447,0.0005144813,0.00012446505,0.00076839083,0.00026669295,0.5704484,0.05488262,0.26809233,0.001761664,0.10119623],"study_design_scores_gemma":[0.000027912896,0.0002360319,0.00030587122,0.000024168441,0.000039349827,0.0012045866,0.000051225714,0.95216304,0.009980347,0.033835635,0.0020967491,0.000035094854],"about_ca_topic_score_codex":0.00038067467,"about_ca_topic_score_gemma":0.0005307758,"teacher_disagreement_score":0.0012580785,"about_ca_system_score_codex":0.0010731667,"about_ca_system_score_gemma":0.0005345479,"threshold_uncertainty_score":0.007786393},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011993808,0.0017316983,0.9768569,0.0011690073,0.00008635731,0.00004779589,0.00013944629,0.00010042617,0.007874674],"genre_scores_gemma":[0.8546062,0.006408724,0.120002404,0.00040503548,0.0004970681,0.00047567103,0.00046084315,0.0001451282,0.01699886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964191,0.0020002997,0.00011866216,0.00038850185,0.0008501647,0.00022334703],"domain_scores_gemma":[0.98685825,0.008836506,0.0015732859,0.0011719404,0.001171548,0.0003884573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004187502,0.0018701126,0.0011182575,0.0017777552,0.00071094674,0.0026821704,0.002462179,0.0026386832,0.0021203544],"category_scores_gemma":[0.017182272,0.00047779558,0.0005894846,0.0021608707,0.003755815,0.005335451,0.0028144512,0.002873177,0.0005509626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002712765,0.000013688216,0.00020242097,0.00004915191,0.00001819726,0.000045275334,0.00007419049,0.28973714,0.00028939196,0.7017333,0.0011968977,0.0066132364],"study_design_scores_gemma":[0.0000041719854,0.000022250684,0.00005355671,0.000019895117,0.000005436616,0.000032549622,0.000015159575,0.7260432,0.00014640731,0.27249607,0.0011487758,0.000012545012],"about_ca_topic_score_codex":0.0028433031,"about_ca_topic_score_gemma":0.0012979012,"teacher_disagreement_score":0.004187502,"about_ca_system_score_codex":0.0028935086,"about_ca_system_score_gemma":0.000999995,"threshold_uncertainty_score":0.022145927},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026000269,0.0011706785,0.9672502,0.00025236327,0.000056821256,0.000024951321,0.00006157381,0.00014780695,0.005035278],"genre_scores_gemma":[0.8948617,0.0028529111,0.09498875,0.00019210568,0.00019530517,0.00013219117,0.000111538226,0.000039399016,0.0066260416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992093,0.00038991033,0.000019833164,0.00009399331,0.00018511656,0.00010178659],"domain_scores_gemma":[0.99894243,0.00072102953,0.00009105063,0.00006728606,0.00014991351,0.000028289436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000985434,0.00068341155,0.0007645003,0.00032240484,0.00035901373,0.0008099816,0.00046953702,0.0009196093,0.0011933742],"category_scores_gemma":[0.0022503864,0.00047282263,0.00038563894,0.00093114126,0.00091943063,0.0008591294,0.0005441466,0.00059457397,0.0005392308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001508866,0.000028023182,0.00068019814,0.00016787938,0.000047822625,0.00032975135,0.00015931894,0.89147496,0.010304686,0.05970782,0.0014926239,0.035455987],"study_design_scores_gemma":[0.000023142618,0.00009276411,0.00021732364,0.000012686988,0.000024303501,0.000118302945,0.000037352413,0.9837712,0.0019617826,0.012267913,0.0014567318,0.000016470372],"about_ca_topic_score_codex":0.0024854357,"about_ca_topic_score_gemma":0.0021212343,"teacher_disagreement_score":0.0024854357,"about_ca_system_score_codex":0.00076130405,"about_ca_system_score_gemma":0.00052197324,"threshold_uncertainty_score":0.005523622},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17078401,0.004408481,0.805108,0.00070173084,0.00011300951,0.00007840559,0.0001555718,0.00016208425,0.018488718],"genre_scores_gemma":[0.9757801,0.0013172087,0.021161666,0.00006818607,0.00009565946,0.000053048945,0.00003188942,0.000017344031,0.0014749429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989467,0.00047559728,0.00003145784,0.0001400024,0.00022161877,0.00018465292],"domain_scores_gemma":[0.9973381,0.001831088,0.0002977001,0.00021709141,0.00021729252,0.00009862856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014001617,0.0011053982,0.0009779591,0.00050463557,0.0007501338,0.0014127924,0.0009164097,0.0010680204,0.001610635],"category_scores_gemma":[0.0033936596,0.00044951806,0.00041513646,0.0010272773,0.0010790193,0.0023503264,0.0011281294,0.0006666598,0.00034057593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019668648,0.000068735724,0.00095633045,0.0002934957,0.00009794121,0.00074272713,0.00018723476,0.7612003,0.021426568,0.18768482,0.0013026712,0.025842465],"study_design_scores_gemma":[0.000020747835,0.00016152461,0.00039091994,0.000023610048,0.000040057046,0.00077784655,0.0000651688,0.9471288,0.004960245,0.044899218,0.0015020928,0.00002984795],"about_ca_topic_score_codex":0.00050282007,"about_ca_topic_score_gemma":0.00061710505,"teacher_disagreement_score":0.001610635,"about_ca_system_score_codex":0.001301263,"about_ca_system_score_gemma":0.00047508947,"threshold_uncertainty_score":0.009441316},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066293575,0.00057514705,0.9121664,0.0010643617,0.00014483315,0.00011580894,0.00017256207,0.0003270255,0.019140305],"genre_scores_gemma":[0.9726351,0.00027531784,0.021536501,0.00012643749,0.000053828666,0.00015124462,0.00007409867,0.000041425497,0.0051060454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987601,0.0004229074,0.00003629937,0.00022212323,0.00024836895,0.00031020606],"domain_scores_gemma":[0.9950539,0.0037420855,0.000467082,0.000121834,0.00046364166,0.00015133638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019275685,0.0010110375,0.0009762885,0.00069066026,0.00056276785,0.0011896074,0.00086379715,0.0008538467,0.0027369836],"category_scores_gemma":[0.0065443595,0.0003896122,0.00033646665,0.0006812938,0.0019067852,0.0009525251,0.0012376185,0.0014047975,0.00024723806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013266984,0.000039329378,0.00016727448,0.000059606253,0.00001575503,0.000041942552,0.00006328029,0.93854517,0.001355763,0.051849425,0.0010910465,0.006638641],"study_design_scores_gemma":[0.000019009689,0.000016804286,0.00004232263,0.000004560903,0.0000030240487,0.000003877165,0.0000075731004,0.9891521,0.00019779633,0.01034355,0.0002047513,0.0000046524688],"about_ca_topic_score_codex":0.013992188,"about_ca_topic_score_gemma":0.0074763335,"teacher_disagreement_score":0.013992188,"about_ca_system_score_codex":0.0037267297,"about_ca_system_score_gemma":0.0021934593,"threshold_uncertainty_score":0.027821481},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020282898,0.00043183545,0.9761494,0.00015135168,0.000023383249,0.000029063815,0.000026285932,0.000112316375,0.0027934199],"genre_scores_gemma":[0.9377044,0.0005050759,0.05924111,0.000045654222,0.000028610719,0.00009578224,0.00003119613,0.00003203842,0.0023161648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953973,0.00019040096,0.000020265863,0.000090403155,0.0001020269,0.000057244346],"domain_scores_gemma":[0.99918514,0.0005392366,0.00009859311,0.00004849765,0.00010413757,0.000024417288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009869213,0.0008368846,0.0006615237,0.00033405336,0.00036228323,0.0009622584,0.00085644645,0.0007632399,0.0014256416],"category_scores_gemma":[0.0022462746,0.0003411223,0.00033431654,0.0006265357,0.0007796223,0.0012086487,0.00079484814,0.00077755086,0.00027570224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008881582,0.000026270585,0.00019902574,0.000089032066,0.000017945644,0.00012299098,0.00009899374,0.94373167,0.004030103,0.023160044,0.00057032524,0.027864838],"study_design_scores_gemma":[0.000011097339,0.000025632122,0.000037432168,0.000003110769,0.0000035004282,0.000017402097,0.000008841286,0.99367696,0.00046746526,0.0055719675,0.0001720642,0.0000045285865],"about_ca_topic_score_codex":0.0026334065,"about_ca_topic_score_gemma":0.002145159,"teacher_disagreement_score":0.0026334065,"about_ca_system_score_codex":0.00086282974,"about_ca_system_score_gemma":0.0006655333,"threshold_uncertainty_score":0.0062603354},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045575625,0.153921,0.24890491,0.0032670733,0.006052883,0.00012263887,0.000312479,0.00039481613,0.58246666],"genre_scores_gemma":[0.10141692,0.3300784,0.08319142,0.0040426855,0.009321309,0.00046950614,0.0011653726,0.00046284814,0.46985152],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99967873,0.000060587845,0.000015166229,0.000067006134,0.0001450115,0.000033514745],"domain_scores_gemma":[0.99920267,0.0004706304,0.000029519979,0.00012028534,0.00015092126,0.000025968939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032476356,0.00087849103,0.000517431,0.0014413684,0.0007283593,0.0011908947,0.0011224359,0.0009377028,0.022562072],"category_scores_gemma":[0.0016338426,0.00030291016,0.00033730507,0.004323836,0.00071596314,0.0024848755,0.0012307586,0.0014774821,0.00726547],"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.000026414664,0.00008938028,0.00014688935,0.0014894248,0.000022293325,0.0001280113,0.0002725986,0.011768318,0.002122905,0.32961044,0.10081466,0.55350864],"study_design_scores_gemma":[0.0000063155303,0.00003641352,0.0001690189,0.00050849566,0.00003364862,0.00042236896,0.00011546419,0.010407969,0.0013321544,0.24036892,0.7465801,0.000019124234],"about_ca_topic_score_codex":0.0007737277,"about_ca_topic_score_gemma":0.0011226946,"teacher_disagreement_score":0.022562072,"about_ca_system_score_codex":0.0007810873,"about_ca_system_score_gemma":0.000628592,"threshold_uncertainty_score":0.0754776},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015398961,0.006569469,0.9708246,0.00039560537,0.0004253696,0.00009290585,0.00012369956,0.00031844375,0.019710004],"genre_scores_gemma":[0.1605717,0.03874593,0.6837176,0.0008230832,0.0018170212,0.0018871411,0.001142277,0.0009280276,0.110367194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899465,0.00023882769,0.000045394958,0.00010872024,0.0005578819,0.000054450375],"domain_scores_gemma":[0.9990183,0.00044833473,0.000053566582,0.00019465144,0.0002649429,0.000020090516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012586752,0.0017269778,0.0010707389,0.0012724324,0.000559923,0.0018183448,0.0019047518,0.0012654345,0.0058579915],"category_scores_gemma":[0.003103545,0.0007606988,0.00070175464,0.0020844245,0.0011525315,0.0022135559,0.0010323878,0.0025669278,0.0033347432],"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.00004736906,0.00008175121,0.00018644103,0.0005597711,0.000066436594,0.00014903922,0.0002282346,0.10556009,0.00842548,0.60348606,0.036933623,0.24427569],"study_design_scores_gemma":[0.00001654988,0.00007553311,0.00019189512,0.0001417796,0.000048522437,0.00027690406,0.00006100331,0.36124125,0.0030891222,0.5589268,0.07589099,0.000039609804],"about_ca_topic_score_codex":0.0014236233,"about_ca_topic_score_gemma":0.001045255,"teacher_disagreement_score":0.0058579915,"about_ca_system_score_codex":0.0013829627,"about_ca_system_score_gemma":0.0010390051,"threshold_uncertainty_score":0.019596994},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38737658,0.0017732778,0.58273226,0.00024369376,0.000023906521,0.00004341646,0.00012450769,0.00012199276,0.027560426],"genre_scores_gemma":[0.9914171,0.00042560947,0.007075273,0.000025005178,0.000013207865,0.000043099844,0.000031416716,0.000014405695,0.0009548927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994873,0.00019548359,0.000017566781,0.00007549569,0.00015809183,0.000066114124],"domain_scores_gemma":[0.9984269,0.0010649203,0.00014996338,0.00009739708,0.00023312798,0.000027679946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001147783,0.00041778965,0.00041831314,0.00071502116,0.00026704886,0.00074449315,0.0005847508,0.00058076717,0.0008104985],"category_scores_gemma":[0.0035888455,0.0001394543,0.000231264,0.0007421821,0.0007751549,0.0009694757,0.0006434375,0.0002350791,0.0002141365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114525035,0.000027136188,0.0015125229,0.00009386199,0.000029127737,0.0001872031,0.00022560709,0.87880284,0.011926479,0.085608274,0.00044094955,0.021031475],"study_design_scores_gemma":[0.000008249607,0.0000746338,0.0010649301,0.000016786447,0.000013601809,0.00019739576,0.00007384862,0.9636436,0.0029743628,0.03098718,0.00093008246,0.000015343732],"about_ca_topic_score_codex":0.0009329578,"about_ca_topic_score_gemma":0.0004871733,"teacher_disagreement_score":0.001147783,"about_ca_system_score_codex":0.00075658207,"about_ca_system_score_gemma":0.00029641457,"threshold_uncertainty_score":0.0060700774},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010568615,0.016309556,0.7119517,0.0011058962,0.00090604473,0.00007124297,0.00017403907,0.00044022858,0.25847277],"genre_scores_gemma":[0.43467692,0.03991203,0.16618258,0.0008807609,0.0017770266,0.00022730813,0.00034088158,0.0002558313,0.3557466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999818,0.00004389549,0.000007816026,0.000041480973,0.00007530549,0.000013427402],"domain_scores_gemma":[0.9998048,0.0001040143,0.000014002428,0.000040869825,0.000030742904,0.0000056396993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002320359,0.00079237216,0.0004924318,0.00040382784,0.00031362064,0.00091499893,0.00067334896,0.00078173436,0.004655479],"category_scores_gemma":[0.00060977496,0.0003076756,0.00029310863,0.00081497524,0.00074057095,0.001033659,0.0007016834,0.0008282713,0.0027934376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005393327,0.000034405683,0.00012274798,0.0004595595,0.00005414911,0.0003834942,0.00027994972,0.046994727,0.024231134,0.64497626,0.023176063,0.25923362],"study_design_scores_gemma":[0.000034138306,0.00015546192,0.00026168497,0.00021595394,0.00007950956,0.0019326499,0.00008395257,0.108034335,0.020039856,0.61150414,0.25758663,0.00007167406],"about_ca_topic_score_codex":0.00017265156,"about_ca_topic_score_gemma":0.00029524267,"teacher_disagreement_score":0.004655479,"about_ca_system_score_codex":0.00049132295,"about_ca_system_score_gemma":0.00025288522,"threshold_uncertainty_score":0.015574157},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1638085,0.0005913223,0.8318391,0.00012910266,0.00002689708,0.000092332055,0.00006866105,0.00017229168,0.0032718403],"genre_scores_gemma":[0.93972635,0.00038700303,0.05801559,0.0000414074,0.000015999762,0.00008990923,0.000038121918,0.0000071170566,0.0016785734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994411,0.00022691907,0.000025058445,0.00011072006,0.0001307668,0.00006546167],"domain_scores_gemma":[0.9994653,0.0002992101,0.00008463878,0.000055308676,0.00007562901,0.000019954827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054480776,0.0007454044,0.00074191723,0.00032397162,0.0004165864,0.00063750375,0.0009656206,0.00075625844,0.0004733108],"category_scores_gemma":[0.0008748206,0.00033462996,0.00041447356,0.0004239674,0.0006115763,0.001306549,0.0006978675,0.00030389856,0.00017021922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042330727,0.000098552024,0.0011799413,0.00022422988,0.00015127494,0.001176503,0.00021657938,0.86826843,0.039762117,0.043318722,0.000530182,0.044650104],"study_design_scores_gemma":[0.00004017385,0.00018838221,0.00015212379,0.0000067193228,0.000044592405,0.0002729741,0.000025674315,0.98590326,0.0072729085,0.005367142,0.00070730224,0.000018747327],"about_ca_topic_score_codex":0.0019334446,"about_ca_topic_score_gemma":0.0026323963,"teacher_disagreement_score":0.0019334446,"about_ca_system_score_codex":0.0006619526,"about_ca_system_score_gemma":0.0006481181,"threshold_uncertainty_score":0.004802823},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107328594,0.0006856184,0.86974466,0.001709382,0.00007422941,0.000065044514,0.00054420467,0.00022055536,0.019627735],"genre_scores_gemma":[0.9714829,0.001661358,0.020129282,0.00024950702,0.00014149744,0.00009241336,0.00022858875,0.00006275786,0.0059516546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776757,0.00078401336,0.00008792696,0.0004632853,0.00051648525,0.00038084938],"domain_scores_gemma":[0.97415435,0.020685952,0.0025663634,0.0015791716,0.000856345,0.00015788515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003411905,0.0016480342,0.0018048468,0.001215205,0.0007103464,0.0028552534,0.0019365324,0.002694392,0.0022237974],"category_scores_gemma":[0.024076918,0.001055095,0.00069853425,0.0014110927,0.0038869958,0.0058719064,0.0020717976,0.0024286625,0.00059414434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001319053,0.00005948097,0.0021816276,0.0001693767,0.00007187472,0.00055071793,0.00020798668,0.7813261,0.0022508188,0.20067453,0.00073961297,0.011635886],"study_design_scores_gemma":[0.000029685714,0.0001417199,0.0016575546,0.000059087,0.00007616796,0.00046499065,0.00010123291,0.90703344,0.0014339716,0.08781174,0.0011382579,0.000052144187],"about_ca_topic_score_codex":0.0045273765,"about_ca_topic_score_gemma":0.0032381066,"teacher_disagreement_score":0.0045273765,"about_ca_system_score_codex":0.0021737558,"about_ca_system_score_gemma":0.0014515069,"threshold_uncertainty_score":0.018044114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104754336,0.0006905908,0.8897057,0.00063852913,0.00013143403,0.000116992196,0.000058738573,0.0009054645,0.0029982382],"genre_scores_gemma":[0.9200423,0.00034790603,0.07705425,0.0001234051,0.000096877855,0.0000976131,0.00005370198,0.00003536405,0.002148572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992901,0.00018586728,0.000044528664,0.00014175939,0.0002202615,0.00011740941],"domain_scores_gemma":[0.9977738,0.00079248875,0.00041339768,0.00065425015,0.00024402424,0.00012185937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011308149,0.0005641712,0.0005781821,0.0008746956,0.0006854201,0.0006495964,0.0017828379,0.00097179,0.0010383076],"category_scores_gemma":[0.004292726,0.00020447007,0.00034780224,0.0005704051,0.0010370846,0.0019707351,0.0017173829,0.00085954374,0.00027962358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012353695,0.00044248533,0.0020771807,0.00037898068,0.00011739272,0.001018948,0.00080524373,0.38179982,0.11430637,0.11745771,0.0070502,0.37331027],"study_design_scores_gemma":[0.00011226454,0.00056312856,0.00046089338,0.00002840488,0.000059525813,0.0009951775,0.00009252957,0.9632223,0.012462941,0.0178668,0.004081697,0.000054345655],"about_ca_topic_score_codex":0.00057420955,"about_ca_topic_score_gemma":0.000581661,"teacher_disagreement_score":0.0017828379,"about_ca_system_score_codex":0.000613011,"about_ca_system_score_gemma":0.0006096453,"threshold_uncertainty_score":0.005980432},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066696174,0.0014779354,0.8371722,0.00022796729,0.00044561224,0.00010776559,0.00016068484,0.001000718,0.09271088],"genre_scores_gemma":[0.84838545,0.0009823976,0.107056074,0.000182946,0.00012874253,0.00014686013,0.00015185613,0.00017231496,0.04279337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999816,0.000035804147,0.000011166049,0.000044595883,0.000059790043,0.00003258314],"domain_scores_gemma":[0.99962187,0.00020067283,0.000025254105,0.00006636922,0.000052085008,0.000033757846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022521202,0.00038164447,0.0004207685,0.00049311685,0.00045676786,0.0007854136,0.0009252676,0.0005534371,0.0092961565],"category_scores_gemma":[0.0010812995,0.00024224877,0.00025032778,0.0006913267,0.00042808458,0.0007683288,0.00086011714,0.0006465658,0.0012061886],"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.0007992156,0.0001231259,0.00059515244,0.00049029395,0.00006145786,0.00034482873,0.00032803294,0.07478894,0.11347134,0.45262766,0.008128372,0.34824163],"study_design_scores_gemma":[0.00019480301,0.0002831074,0.00087056303,0.00011372472,0.00007410236,0.00065009925,0.00013032561,0.7062219,0.03099691,0.229753,0.030639509,0.00007196756],"about_ca_topic_score_codex":0.00052586343,"about_ca_topic_score_gemma":0.00067291246,"teacher_disagreement_score":0.0092961565,"about_ca_system_score_codex":0.00038067414,"about_ca_system_score_gemma":0.0002031188,"threshold_uncertainty_score":0.031098723},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050310507,0.00025883387,0.9468613,0.00005727535,0.00003698017,0.000019653397,0.000013911129,0.0001093639,0.0023321232],"genre_scores_gemma":[0.82654,0.00032073655,0.17071037,0.0000686126,0.00006177134,0.00004131101,0.00002852106,0.000013742938,0.0022150015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997906,0.000053699176,0.000010695026,0.000032431926,0.00008176823,0.000030818555],"domain_scores_gemma":[0.99964106,0.0001775552,0.000053091742,0.000048427373,0.00006735791,0.00001252317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002837183,0.00040751463,0.0002512996,0.00020023214,0.00029634137,0.0002968849,0.00042508738,0.00027053617,0.0005489693],"category_scores_gemma":[0.0010935477,0.00013629952,0.0002331712,0.00027591156,0.00032757118,0.000371819,0.0003570164,0.00035373087,0.00017396877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029322057,0.000107729335,0.0018072912,0.00020167943,0.00009491834,0.00040079706,0.0007031973,0.38698167,0.13460638,0.051707283,0.0012754947,0.4218203],"study_design_scores_gemma":[0.000023356828,0.0002875306,0.00039419913,0.000013675831,0.000032666183,0.00036109617,0.0000377447,0.97122836,0.01973303,0.0054147155,0.0024582339,0.0000153429],"about_ca_topic_score_codex":0.0011179518,"about_ca_topic_score_gemma":0.0016959453,"teacher_disagreement_score":0.0011179518,"about_ca_system_score_codex":0.00022005092,"about_ca_system_score_gemma":0.00035459283,"threshold_uncertainty_score":0.0022228956},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47429743,0.0008409005,0.5197663,0.00020214541,0.00002817881,0.000030046805,0.0000338287,0.00015611264,0.0046451474],"genre_scores_gemma":[0.9856603,0.00016993964,0.013434484,0.000018359273,0.000007304556,0.0000073970205,0.000012618205,0.0000047467242,0.0006848084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969554,0.00008686133,0.0000069630523,0.000045246037,0.000110635294,0.000054894877],"domain_scores_gemma":[0.9985487,0.001037702,0.00010764066,0.00007491467,0.00021284315,0.000018243769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006178237,0.00037534718,0.00035134732,0.00017719636,0.00018494621,0.0003203456,0.00025230672,0.00041320108,0.0006732636],"category_scores_gemma":[0.0022680569,0.00010070027,0.00019600202,0.00022361882,0.00040256506,0.00063516584,0.00024863798,0.0002480179,0.00012701226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020672819,0.0000655196,0.001488074,0.00009224688,0.000050485556,0.0001626109,0.000111738875,0.9238742,0.03603564,0.009603174,0.00022574027,0.028083887],"study_design_scores_gemma":[0.000009466999,0.0001069518,0.0004555567,0.0000044136445,0.000013485816,0.000074037365,0.000025398385,0.98941433,0.008305024,0.0013660343,0.00021771877,0.000007599406],"about_ca_topic_score_codex":0.0016137372,"about_ca_topic_score_gemma":0.0018595275,"teacher_disagreement_score":0.0016137372,"about_ca_system_score_codex":0.0005359685,"about_ca_system_score_gemma":0.00042606608,"threshold_uncertainty_score":0.0038887262},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21463828,0.004404711,0.7571155,0.0010381797,0.00007602141,0.00013393257,0.00027194372,0.0005032715,0.021818131],"genre_scores_gemma":[0.9847904,0.0010882015,0.012104408,0.00007606357,0.000041690568,0.00008412118,0.0000769031,0.000026605912,0.0017115994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983399,0.00065533404,0.00005197517,0.00017667808,0.00047030477,0.00030567992],"domain_scores_gemma":[0.9926944,0.00509289,0.0005546559,0.00022230492,0.0013056056,0.0001301731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028349522,0.0012705947,0.0010981968,0.001341531,0.0008834734,0.0013549216,0.0010541752,0.0011063077,0.0012638933],"category_scores_gemma":[0.009680451,0.00042356827,0.00052194664,0.0013244054,0.0013667835,0.0013131365,0.0011788843,0.0005561575,0.0002852328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014677687,0.000027927554,0.001397982,0.00011873337,0.000049447026,0.00024972495,0.0002692274,0.9578759,0.0032347506,0.023387413,0.0008074338,0.012434646],"study_design_scores_gemma":[0.000006732166,0.000060755152,0.0002717777,0.0000105842055,0.000018228666,0.000088096014,0.00005171327,0.9945623,0.0005931817,0.0041135093,0.00021033466,0.000012784279],"about_ca_topic_score_codex":0.01027312,"about_ca_topic_score_gemma":0.00588145,"teacher_disagreement_score":0.01027312,"about_ca_system_score_codex":0.002598065,"about_ca_system_score_gemma":0.0014521112,"threshold_uncertainty_score":0.02042669},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13637233,0.0012402431,0.8552482,0.00021828341,0.0000549282,0.000037329326,0.000083526575,0.00017873601,0.0065664696],"genre_scores_gemma":[0.9695366,0.00069698883,0.028567974,0.000029973547,0.000027851078,0.00003657818,0.000031642678,0.0000102136555,0.001062115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934787,0.00025599307,0.000028723654,0.000062119,0.00021005307,0.00009528369],"domain_scores_gemma":[0.9979213,0.0014403109,0.00024489427,0.00012231147,0.000249415,0.000021733158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072031235,0.0007831749,0.00051309477,0.00040648342,0.00033788342,0.00066808035,0.00044826025,0.0004919368,0.00050851726],"category_scores_gemma":[0.0036889394,0.0001555012,0.000302236,0.00080429285,0.00077728933,0.001016798,0.0005775223,0.00042708375,0.00011218049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008762225,0.0000114075965,0.0005207671,0.00006219021,0.00002486924,0.00016878633,0.00009172335,0.9293246,0.0050458796,0.04743595,0.00026784165,0.01695833],"study_design_scores_gemma":[0.0000030337442,0.000023784341,0.000096090145,0.0000052681107,0.0000064509627,0.00005868195,0.000010739107,0.9936226,0.0015485508,0.004399093,0.00021990595,0.000005914251],"about_ca_topic_score_codex":0.0041860347,"about_ca_topic_score_gemma":0.0040484006,"teacher_disagreement_score":0.0041860347,"about_ca_system_score_codex":0.001007942,"about_ca_system_score_gemma":0.00078408816,"threshold_uncertainty_score":0.008323312},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020992944,0.0006614854,0.9715514,0.0001817468,0.00005217104,0.00008466895,0.00008797875,0.00014152686,0.00624598],"genre_scores_gemma":[0.73863155,0.0012651132,0.25487888,0.00012500088,0.00014683529,0.00038396986,0.00016682185,0.00008104763,0.0043207454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897194,0.00038576263,0.00004265772,0.00014113242,0.0003407062,0.000117816344],"domain_scores_gemma":[0.997875,0.0012032916,0.0001729301,0.0001452963,0.0005312073,0.00007218891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012484405,0.0016143257,0.000649255,0.0006936031,0.00046945037,0.00120198,0.00049287576,0.0004972014,0.0055232057],"category_scores_gemma":[0.0055861305,0.00045668994,0.00043960544,0.000606007,0.00044587822,0.0008545267,0.000874699,0.0006943432,0.0010111097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007113344,0.00016483452,0.0018891162,0.00055766973,0.00016984674,0.00019493286,0.00036786587,0.48633614,0.053090047,0.10647268,0.0043643094,0.34568128],"study_design_scores_gemma":[0.00012386193,0.00091756706,0.0010706473,0.00014459286,0.00016541127,0.0005012568,0.000149226,0.93614835,0.01006087,0.04212358,0.008538582,0.000056179895],"about_ca_topic_score_codex":0.00097505597,"about_ca_topic_score_gemma":0.0014455905,"teacher_disagreement_score":0.0055232057,"about_ca_system_score_codex":0.0006966053,"about_ca_system_score_gemma":0.0012332316,"threshold_uncertainty_score":0.018476963},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011200224,0.00008343823,0.9974354,0.000050615716,0.000047064845,0.00010459512,0.000040085335,0.00017257636,0.00094633206],"genre_scores_gemma":[0.079705045,0.00048496167,0.9129567,0.00016047475,0.00014511935,0.0004065585,0.0002806459,0.00015314361,0.0057073585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983364,0.00043462508,0.00012802763,0.00019985078,0.0007919259,0.00010925518],"domain_scores_gemma":[0.9981616,0.00080290507,0.00013575963,0.00042562862,0.0004390206,0.000035006262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016325659,0.0012001405,0.0008213064,0.0011868033,0.0011519404,0.00083867117,0.0008771532,0.0014532676,0.0034582203],"category_scores_gemma":[0.00543746,0.00042174335,0.00087218144,0.0007767514,0.0012083891,0.0013137283,0.0011759172,0.001600261,0.0020651026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025965497,0.00011302958,0.00044118825,0.00031688416,0.000081857164,0.00056733633,0.00042718006,0.120559715,0.06483588,0.35648155,0.005487544,0.45042816],"study_design_scores_gemma":[0.00010071048,0.00040110567,0.00039906692,0.00009473342,0.00008221482,0.0020420486,0.000092367336,0.7250813,0.13446286,0.10030009,0.036734477,0.00020887486],"about_ca_topic_score_codex":0.0016258468,"about_ca_topic_score_gemma":0.002005405,"teacher_disagreement_score":0.0034582203,"about_ca_system_score_codex":0.00075206993,"about_ca_system_score_gemma":0.002071348,"threshold_uncertainty_score":0.0115689635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07242672,0.0012206127,0.9022781,0.0016852986,0.00010982685,0.0001171545,0.00022655462,0.0006050249,0.021330645],"genre_scores_gemma":[0.91162825,0.001551259,0.07827517,0.00055773306,0.00020664858,0.0007105911,0.00033049556,0.00031002314,0.0064297863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720937,0.00122808,0.000077497,0.00029714435,0.0006899602,0.000497964],"domain_scores_gemma":[0.9607332,0.03315275,0.0020623663,0.0018106233,0.001689193,0.00055194646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005899343,0.0012338879,0.0012929536,0.001442563,0.0011718392,0.00209395,0.0022856982,0.0016029724,0.003106779],"category_scores_gemma":[0.042826153,0.0007697381,0.00081986847,0.0011949656,0.0037954599,0.004575647,0.0024336975,0.0026217327,0.000560938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010602233,0.00006152726,0.0002879862,0.000108686254,0.000031197153,0.00009240406,0.0001821604,0.3979939,0.0028676419,0.5902862,0.0017614438,0.0062208874],"study_design_scores_gemma":[0.000028775083,0.000028423765,0.00008939155,0.000024521518,0.000009646703,0.00004314703,0.000030905652,0.83294296,0.0007088999,0.16541715,0.0006592477,0.000016841632],"about_ca_topic_score_codex":0.0030176898,"about_ca_topic_score_gemma":0.0014591251,"teacher_disagreement_score":0.005899343,"about_ca_system_score_codex":0.0037725952,"about_ca_system_score_gemma":0.0020592266,"threshold_uncertainty_score":0.031199038},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017075116,0.0003232904,0.9779398,0.00023215644,0.0000723281,0.000042700285,0.00007868253,0.00028603428,0.003949922],"genre_scores_gemma":[0.60718167,0.000977001,0.38473716,0.00033983518,0.00015293321,0.00026727686,0.00031404526,0.00008139815,0.00594876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940526,0.00019329163,0.000021675865,0.00006522333,0.00024041726,0.00007415468],"domain_scores_gemma":[0.99916875,0.00031109183,0.00012322163,0.00016256385,0.00020704693,0.000027379698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041067135,0.0006218437,0.000472701,0.00052629295,0.00031573686,0.00068686105,0.0006756413,0.00068259204,0.0009897258],"category_scores_gemma":[0.0023062,0.00021633973,0.0002453061,0.000853599,0.00064408913,0.0009919921,0.0009062928,0.0009610984,0.0005196923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005030914,0.00009633596,0.0005745067,0.00024825463,0.000063513464,0.00043169595,0.00019606997,0.5059478,0.045039576,0.22891031,0.004880768,0.21310806],"study_design_scores_gemma":[0.000023236998,0.00006897164,0.00009250796,0.000025271365,0.00001711096,0.00016146325,0.000015136056,0.9700209,0.0076753255,0.018091178,0.0037873157,0.000021565029],"about_ca_topic_score_codex":0.002269732,"about_ca_topic_score_gemma":0.0031271263,"teacher_disagreement_score":0.002269732,"about_ca_system_score_codex":0.00060370855,"about_ca_system_score_gemma":0.0006937208,"threshold_uncertainty_score":0.004513085},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047083203,0.0004652888,0.94743603,0.00033428424,0.0000591387,0.000043862558,0.000043826683,0.00018950731,0.004344801],"genre_scores_gemma":[0.96875036,0.00024524308,0.02859505,0.00008051996,0.000041688516,0.000045349963,0.00002686922,0.000028411074,0.0021864502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995795,0.000107635315,0.000023126948,0.00009241811,0.00011617293,0.00008114],"domain_scores_gemma":[0.999092,0.00056925206,0.00006887283,0.0000636938,0.00018024602,0.000026025511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008353008,0.0006988845,0.0006374922,0.00024367597,0.0003663216,0.0009252531,0.00093200355,0.0006980012,0.0013234396],"category_scores_gemma":[0.0029142934,0.00037962876,0.00023670182,0.0004970121,0.0006122957,0.0009051731,0.00094410346,0.0008004699,0.00038596478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044512443,0.00020191552,0.00089668157,0.00020347704,0.0000623818,0.00037715194,0.0004177053,0.82006073,0.040333726,0.042147648,0.002348218,0.0925053],"study_design_scores_gemma":[0.0000076227707,0.0000387093,0.0001065776,0.000003842735,0.0000070915626,0.00003878997,0.000014957462,0.995184,0.000921029,0.0034712492,0.00019978805,0.0000063585885],"about_ca_topic_score_codex":0.0015822832,"about_ca_topic_score_gemma":0.0022728126,"teacher_disagreement_score":0.0015822832,"about_ca_system_score_codex":0.000551575,"about_ca_system_score_gemma":0.00054727733,"threshold_uncertainty_score":0.004427314},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2506412,0.0024017994,0.729514,0.00049497397,0.000049315455,0.00007792587,0.0001524433,0.0001952889,0.016473062],"genre_scores_gemma":[0.9878911,0.00072261924,0.0102397185,0.000048337388,0.000028002572,0.000043131673,0.00004391057,0.000025046109,0.00095809094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993753,0.00029922338,0.000015942707,0.00004699462,0.00015031325,0.00011217229],"domain_scores_gemma":[0.9952903,0.0033428636,0.00034688454,0.00023518973,0.00070217025,0.000082545346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022406697,0.00080834544,0.000664745,0.0007413663,0.0004222196,0.00074856065,0.000715971,0.0006092884,0.0017524086],"category_scores_gemma":[0.0058160652,0.0002561732,0.00051668484,0.00071409706,0.0010477,0.00089784904,0.0008949703,0.00049048953,0.00027676995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100435456,0.000049888386,0.0017657821,0.00009656481,0.0000460864,0.00023640213,0.00016505306,0.9306994,0.007470631,0.047740612,0.0007978131,0.010831282],"study_design_scores_gemma":[0.0000021322742,0.000030637602,0.00030959086,0.000007943005,0.000010980064,0.000052892978,0.000034415458,0.9944617,0.0011197261,0.0038096113,0.00015387985,0.000006422695],"about_ca_topic_score_codex":0.0027551607,"about_ca_topic_score_gemma":0.0022175089,"teacher_disagreement_score":0.0027551607,"about_ca_system_score_codex":0.0010368248,"about_ca_system_score_gemma":0.0007339679,"threshold_uncertainty_score":0.01184994},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03828794,0.0031732216,0.81697446,0.0022481293,0.00041692142,0.000066046676,0.00018304391,0.00015436954,0.13849594],"genre_scores_gemma":[0.89297926,0.0038863465,0.072148986,0.0007458896,0.0006427898,0.00020008489,0.00010147228,0.000104863524,0.029190287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995472,0.0001845325,0.000013448033,0.000057771987,0.00013806831,0.000058888803],"domain_scores_gemma":[0.99925584,0.00036125918,0.00006626152,0.00012953398,0.00014237722,0.00004474927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005936592,0.0008998107,0.0009976398,0.0009321145,0.0006962821,0.0024845127,0.0013603728,0.0015082433,0.0056163496],"category_scores_gemma":[0.0022179785,0.00045938996,0.0007881232,0.0010242391,0.0016937879,0.0023519916,0.0019024498,0.0011191762,0.0006750308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010661929,0.000098845114,0.00024336649,0.00016811989,0.000041667823,0.0002029391,0.00014326262,0.39822432,0.0056262705,0.570605,0.0029067104,0.021633012],"study_design_scores_gemma":[0.000010190369,0.000034940298,0.00014339272,0.000017572705,0.000014148669,0.00008903049,0.000045512716,0.8659858,0.00071665255,0.13089843,0.0020139092,0.000030407073],"about_ca_topic_score_codex":0.00063239754,"about_ca_topic_score_gemma":0.0005525761,"teacher_disagreement_score":0.0056163496,"about_ca_system_score_codex":0.00095258106,"about_ca_system_score_gemma":0.0005015657,"threshold_uncertainty_score":0.018788517},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16029112,0.0013591507,0.8294821,0.0001919826,0.0000641254,0.000041137704,0.000051581315,0.0005721684,0.007946647],"genre_scores_gemma":[0.96941805,0.00037614605,0.029337496,0.00003081181,0.00002579872,0.000026446813,0.000019608184,0.000012449939,0.00075319165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991372,0.00032633933,0.000028610908,0.000119447686,0.0002002978,0.00018804667],"domain_scores_gemma":[0.9984799,0.0009916893,0.00015565533,0.000148868,0.00017508445,0.000048735204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010714398,0.0008149776,0.0006774973,0.0005182719,0.0006400735,0.00081778516,0.00080950826,0.00057848665,0.000553873],"category_scores_gemma":[0.001974146,0.0002804403,0.00047770675,0.00080795534,0.00090359786,0.001035074,0.0009650123,0.0004341717,0.00019767146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002952288,0.00009340404,0.0017762531,0.0002550065,0.00011947323,0.0007451395,0.0005680236,0.81852645,0.04917681,0.033336494,0.0009834078,0.09412433],"study_design_scores_gemma":[0.000011954161,0.00017801196,0.00038597136,0.000012157788,0.000036495512,0.00022784737,0.00006451219,0.9822856,0.008322369,0.00753991,0.0009143695,0.000020704756],"about_ca_topic_score_codex":0.0013212985,"about_ca_topic_score_gemma":0.0018503669,"teacher_disagreement_score":0.0013212985,"about_ca_system_score_codex":0.00078223844,"about_ca_system_score_gemma":0.00044022987,"threshold_uncertainty_score":0.0056755543},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050135974,0.00027120177,0.9460824,0.000092237526,0.0000384647,0.000029887511,0.00002102476,0.00011638929,0.0032124966],"genre_scores_gemma":[0.7779344,0.0004726694,0.2192233,0.00016077764,0.00006476285,0.0000808363,0.000047029105,0.000024960946,0.0019913302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993938,0.00028285882,0.000029953886,0.00008127895,0.00013013957,0.0000820179],"domain_scores_gemma":[0.99919873,0.0002812388,0.00025650446,0.00012987663,0.000102460624,0.00003128433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005305171,0.00046949938,0.00032704443,0.00023307519,0.000314638,0.0005612891,0.00029451313,0.00035200242,0.0008840448],"category_scores_gemma":[0.0011454407,0.00020208646,0.00030218845,0.00045347502,0.0005549164,0.00059085625,0.00054159947,0.0004438738,0.0004366015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081390113,0.0001663747,0.0018325844,0.00029656538,0.00011811152,0.0004214508,0.00028231528,0.47191504,0.17254226,0.16562255,0.0018253241,0.1841635],"study_design_scores_gemma":[0.000072930605,0.00081353757,0.0005215195,0.000030721698,0.000038270355,0.00038389803,0.00007543434,0.9293374,0.046175107,0.01585398,0.006652815,0.000044338372],"about_ca_topic_score_codex":0.00031757783,"about_ca_topic_score_gemma":0.0005309084,"teacher_disagreement_score":0.0008840448,"about_ca_system_score_codex":0.0002765415,"about_ca_system_score_gemma":0.00044414532,"threshold_uncertainty_score":0.0029574633},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012647012,0.048326284,0.7779082,0.0011051091,0.001873552,0.00008174337,0.00018647203,0.00083418767,0.1570374],"genre_scores_gemma":[0.5707562,0.062385824,0.13044082,0.00085827964,0.0021062614,0.00028479565,0.00073647744,0.00039418915,0.23203713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998405,0.000034960227,0.000006353162,0.00002439628,0.00007151794,0.000022259848],"domain_scores_gemma":[0.9998305,0.000094494986,0.0000074204304,0.0000192569,0.000041487823,0.0000068275644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000283389,0.00047155246,0.0003257009,0.00034508505,0.00030167837,0.0009787462,0.0006888634,0.0006661859,0.004132384],"category_scores_gemma":[0.000611354,0.0002753114,0.00016633242,0.0008388746,0.00044106998,0.0011033204,0.00067887816,0.00090500107,0.0012535343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007636966,0.00004534338,0.00019315323,0.00056181615,0.00003728006,0.00015510489,0.0002823796,0.10667867,0.010593495,0.31396163,0.048853923,0.51856077],"study_design_scores_gemma":[0.000017863511,0.0001018627,0.0003875976,0.00036755108,0.000048932463,0.00053608627,0.00018360939,0.44105655,0.009747793,0.24539174,0.30210966,0.000050764123],"about_ca_topic_score_codex":0.0017533704,"about_ca_topic_score_gemma":0.0018913713,"teacher_disagreement_score":0.004132384,"about_ca_system_score_codex":0.00072233094,"about_ca_system_score_gemma":0.00044655794,"threshold_uncertainty_score":0.0138242245},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027767899,0.010804522,0.90744996,0.007631684,0.0008554717,0.000032924003,0.00019530123,0.00012963706,0.04513264],"genre_scores_gemma":[0.66727984,0.018913481,0.27610606,0.0018134849,0.0024866625,0.0001688848,0.0003415859,0.00038497214,0.03250492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992312,0.00039882652,0.000034519264,0.000092422044,0.00017842071,0.00006451397],"domain_scores_gemma":[0.9974457,0.0019794828,0.00014178452,0.00025360016,0.00013610677,0.00004339589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016197067,0.001122415,0.0011104959,0.00019901435,0.00023038611,0.001571098,0.0014771748,0.0013118845,0.004696031],"category_scores_gemma":[0.008148818,0.0006213831,0.0003427109,0.00091211,0.0016923405,0.004507477,0.0010707047,0.0029429612,0.0007755528],"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.00020543278,0.000080725265,0.00030738092,0.0005930674,0.000088450506,0.000096692274,0.0001470382,0.2474009,0.0016855327,0.5394377,0.014445485,0.19551158],"study_design_scores_gemma":[0.0000706792,0.00008616679,0.0002472392,0.00018808641,0.00003732312,0.00007904764,0.000056376655,0.33164755,0.00086775585,0.6538866,0.012808131,0.000025097304],"about_ca_topic_score_codex":0.000470302,"about_ca_topic_score_gemma":0.0006166194,"teacher_disagreement_score":0.004696031,"about_ca_system_score_codex":0.0004387276,"about_ca_system_score_gemma":0.0006195129,"threshold_uncertainty_score":0.015709817},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03734649,0.00023302733,0.958927,0.000073397925,0.00005232173,0.000100663485,0.000025605825,0.0005770084,0.0026644315],"genre_scores_gemma":[0.8224911,0.00016891312,0.17369469,0.00009590086,0.000061663915,0.00011798584,0.00006270676,0.000019174502,0.0032878197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898916,0.00023948254,0.00004634278,0.00022880895,0.0003883958,0.000107815875],"domain_scores_gemma":[0.99887437,0.00033074085,0.00011784687,0.0002273556,0.0003678785,0.00008179238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005657964,0.0007288956,0.0005998299,0.0006174198,0.0008227347,0.00067433994,0.0012838788,0.00057133526,0.0008887563],"category_scores_gemma":[0.0012810377,0.00022787288,0.00047812858,0.00077700574,0.00062044186,0.00076001126,0.0010604786,0.00057847035,0.0003384818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013848005,0.00058743387,0.0034111668,0.000288939,0.00026923345,0.0006172574,0.0005879966,0.3380087,0.16190834,0.024582068,0.004166928,0.46418715],"study_design_scores_gemma":[0.00007344233,0.00043674343,0.0003839221,0.000009788716,0.00003791203,0.00033990399,0.000043824522,0.9763233,0.01703662,0.0031560236,0.002126669,0.000031793174],"about_ca_topic_score_codex":0.0026214323,"about_ca_topic_score_gemma":0.0041889357,"teacher_disagreement_score":0.0026214323,"about_ca_system_score_codex":0.0005717259,"about_ca_system_score_gemma":0.0010966413,"threshold_uncertainty_score":0.005212307},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34899566,0.027152177,0.49814582,0.011739664,0.0013945232,0.0006922763,0.0005008484,0.007259617,0.10411945],"genre_scores_gemma":[0.9469435,0.0062871384,0.041653946,0.0005837939,0.00025412475,0.00009245876,0.00018312351,0.00025678996,0.0037451568],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981919,0.00029196055,0.00006497092,0.00021080751,0.0006495472,0.0005908072],"domain_scores_gemma":[0.99760985,0.00075196923,0.00019925961,0.000440017,0.00079758366,0.00020121294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016454956,0.0012079473,0.001006262,0.00094224745,0.0015319729,0.0032206974,0.0017733772,0.0007907712,0.0028396146],"category_scores_gemma":[0.0070177107,0.000273232,0.00050645,0.00237264,0.000664479,0.0038930727,0.0016321595,0.0017158574,0.0014488099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001232277,0.00047545653,0.008310072,0.00074899715,0.00016982805,0.0009044043,0.0006124048,0.26510507,0.0939607,0.1192563,0.029700914,0.4795235],"study_design_scores_gemma":[0.000054403903,0.00031586402,0.002510862,0.00014463226,0.00007973926,0.00026590022,0.00028886794,0.91906875,0.03058084,0.016653081,0.029976899,0.000060227274],"about_ca_topic_score_codex":0.010777672,"about_ca_topic_score_gemma":0.0055246465,"teacher_disagreement_score":0.010777672,"about_ca_system_score_codex":0.002128668,"about_ca_system_score_gemma":0.0026341318,"threshold_uncertainty_score":0.021429896},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10224739,0.0025872584,0.8890968,0.00026893086,0.000044849985,0.00006417287,0.00004255798,0.00032534674,0.0053226454],"genre_scores_gemma":[0.96429336,0.0013008321,0.03286662,0.000051515264,0.000027796656,0.00005346573,0.0000356665,0.000028258846,0.0013425552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868625,0.0004251349,0.000044217388,0.00014350227,0.0005861006,0.00011481888],"domain_scores_gemma":[0.99735034,0.0016525853,0.00028116975,0.00015328452,0.0005277814,0.000034799505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015547362,0.0007106409,0.0005310144,0.00070959737,0.00042242173,0.00063386443,0.0007550339,0.0005750774,0.00066714024],"category_scores_gemma":[0.004141122,0.00026356228,0.00040844455,0.0005240164,0.0007342338,0.0012772689,0.0006317655,0.00049058936,0.00015376107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019699181,0.000057596353,0.0021075152,0.00027413553,0.00011448014,0.00031730635,0.00043382504,0.85358626,0.048635665,0.032736406,0.0009708402,0.060569007],"study_design_scores_gemma":[0.000003941027,0.00020097551,0.00031395443,0.000008790085,0.000030876785,0.00017466434,0.000049067105,0.9898756,0.0061538834,0.0026445827,0.0005287324,0.000014848435],"about_ca_topic_score_codex":0.002037346,"about_ca_topic_score_gemma":0.0014976335,"teacher_disagreement_score":0.002037346,"about_ca_system_score_codex":0.0009935962,"about_ca_system_score_gemma":0.00064322626,"threshold_uncertainty_score":0.008222342},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047624274,0.0005494506,0.97347045,0.00050988514,0.00008282648,0.00005448854,0.000084703606,0.000046995712,0.02043878],"genre_scores_gemma":[0.44995943,0.00427306,0.5309391,0.0005282282,0.0005146599,0.0005423687,0.0002081547,0.00006443967,0.012970579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923956,0.00026632764,0.000045687208,0.000106148174,0.0002611423,0.000081107995],"domain_scores_gemma":[0.99891233,0.00057594763,0.00013014063,0.00017149886,0.0001708296,0.00003918846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009546984,0.0005648381,0.00044265456,0.00095569907,0.0007403017,0.0018096329,0.001292168,0.00085536216,0.0036280283],"category_scores_gemma":[0.002845229,0.00033133075,0.0006013672,0.0012100621,0.0021211244,0.0025736303,0.0016414141,0.0020573176,0.0006911512],"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.000008121618,0.00000950075,0.000049549566,0.00004622947,0.0000044677568,0.00003206427,0.00004757334,0.031869225,0.0012036853,0.95834756,0.0005351557,0.007846817],"study_design_scores_gemma":[0.000011876121,0.000050434322,0.00006530783,0.00004067139,0.000008572522,0.00013267668,0.00004433926,0.31258798,0.0013907467,0.6741616,0.01148147,0.000024286366],"about_ca_topic_score_codex":0.0006584825,"about_ca_topic_score_gemma":0.0007251639,"teacher_disagreement_score":0.0036280283,"about_ca_system_score_codex":0.0015540688,"about_ca_system_score_gemma":0.0010682452,"threshold_uncertainty_score":0.012136936},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36060885,0.0014081252,0.6221372,0.00084065634,0.00011493445,0.0000672824,0.00009343766,0.00013319007,0.014596298],"genre_scores_gemma":[0.99026525,0.00036226568,0.008172556,0.000043950873,0.00003999949,0.000021656178,0.0000127658905,0.0000086889595,0.0010729157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927336,0.00034033353,0.000015359201,0.000082254504,0.00011996036,0.00016876901],"domain_scores_gemma":[0.9983038,0.0011110796,0.0002146561,0.00010269143,0.00016735157,0.000100453224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011416167,0.0010203657,0.00077553175,0.00054154603,0.00063060067,0.0013807083,0.0012109753,0.0013808005,0.0007550008],"category_scores_gemma":[0.003387928,0.00034457206,0.0005470393,0.00074403,0.0013906539,0.0010587666,0.0010789114,0.00067941967,0.00019813885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019583596,0.00005401723,0.00089118956,0.000059286613,0.00006841154,0.000587446,0.0001043646,0.9571895,0.005200338,0.03093823,0.00043667876,0.0042746756],"study_design_scores_gemma":[0.000010886838,0.000044230765,0.00013643682,0.0000030566703,0.000018899242,0.00007333316,0.000030620173,0.99403715,0.00045468792,0.005053842,0.00012742015,0.000009375362],"about_ca_topic_score_codex":0.0026831208,"about_ca_topic_score_gemma":0.002040402,"teacher_disagreement_score":0.0026831208,"about_ca_system_score_codex":0.0008220295,"about_ca_system_score_gemma":0.00043365735,"threshold_uncertainty_score":0.0060375333},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040817603,0.0008794732,0.9496438,0.00038504202,0.00012821001,0.000104284816,0.000083899955,0.00037762237,0.007580117],"genre_scores_gemma":[0.77868307,0.00080111146,0.21381448,0.00019224492,0.00013216176,0.00020032276,0.00013284123,0.000020212054,0.0060235397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931,0.00022479583,0.000045548077,0.00015765942,0.00020628878,0.000055696506],"domain_scores_gemma":[0.99967575,0.00007575719,0.00006045803,0.00008295406,0.00007915109,0.000025999077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005853198,0.0006205873,0.00075015303,0.00038368005,0.0006044982,0.0010873185,0.0012242647,0.00091176067,0.0011272482],"category_scores_gemma":[0.0005920581,0.00025632224,0.00042224396,0.00048250926,0.0005091645,0.0012507008,0.0012133238,0.0006102177,0.00068826915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006504164,0.0003243062,0.0014772053,0.00067239604,0.00022183578,0.0018169796,0.00064050645,0.29282162,0.2764288,0.1486549,0.006227228,0.27006376],"study_design_scores_gemma":[0.00012949354,0.0006690636,0.00043630775,0.000031785916,0.00006769041,0.0012540362,0.000040832256,0.9560038,0.018071886,0.007852607,0.015360002,0.00008259457],"about_ca_topic_score_codex":0.00039684825,"about_ca_topic_score_gemma":0.00046688257,"teacher_disagreement_score":0.0012242647,"about_ca_system_score_codex":0.00042040745,"about_ca_system_score_gemma":0.00041691595,"threshold_uncertainty_score":0.003771007},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032022458,0.0011804819,0.88786227,0.0028240199,0.0002606731,0.000121469835,0.00007085962,0.00026450455,0.07539322],"genre_scores_gemma":[0.6814091,0.0016464437,0.2983732,0.0007207289,0.0002243801,0.0002831055,0.00021563015,0.00013283739,0.016994627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983929,0.0006804841,0.00007008844,0.00014282724,0.00056850986,0.00014518992],"domain_scores_gemma":[0.998789,0.00030533774,0.000096547774,0.00012647673,0.0006216617,0.00006097735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023098313,0.0005294785,0.00021987746,0.00044525447,0.00057826616,0.002685928,0.0011019439,0.0012218701,0.0033383952],"category_scores_gemma":[0.0024306283,0.00031509157,0.0003471637,0.00024506485,0.0011479077,0.0021753067,0.0008725089,0.0011429143,0.0010606615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005651245,0.000027770719,0.0008732921,0.0002514225,0.000020088753,0.00040827104,0.00047097835,0.05250465,0.023563573,0.867555,0.0025134017,0.051754873],"study_design_scores_gemma":[0.00003877692,0.00041024067,0.0016858391,0.00038921362,0.00008684231,0.0014611214,0.0008254737,0.2893204,0.017695537,0.41389975,0.27412465,0.00006216054],"about_ca_topic_score_codex":0.001016862,"about_ca_topic_score_gemma":0.0015520762,"teacher_disagreement_score":0.0033383952,"about_ca_system_score_codex":0.0012308413,"about_ca_system_score_gemma":0.00095732627,"threshold_uncertainty_score":0.012215674},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005740588,0.00017390885,0.98874503,0.00019637302,0.000030898456,0.000026729113,0.000089672016,0.00013147612,0.004865297],"genre_scores_gemma":[0.4764766,0.0010631033,0.5102712,0.00036125732,0.00017265408,0.00023421097,0.00055612926,0.00011961932,0.010745247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908113,0.00038860904,0.000034514014,0.0000988636,0.00029774045,0.00009912257],"domain_scores_gemma":[0.99844897,0.0008895853,0.0001175202,0.00020242907,0.00030461058,0.00003690025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011966667,0.00074377976,0.00055945816,0.0006093529,0.00043692335,0.0008970961,0.0006298174,0.0008942305,0.0027865083],"category_scores_gemma":[0.004885002,0.0001961228,0.00041936894,0.0009803585,0.0011776979,0.0016846491,0.0010065397,0.0012687359,0.00092092896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010045076,0.000025786721,0.00024982326,0.00007871398,0.000016043772,0.00007617311,0.00010391831,0.4439499,0.003830868,0.48698947,0.0030333388,0.06154545],"study_design_scores_gemma":[0.0000068508048,0.000020378175,0.000024664814,0.000008100739,0.0000022543989,0.00003914735,0.000008720646,0.9359447,0.0012055801,0.06133931,0.0013904683,0.000009827485],"about_ca_topic_score_codex":0.0029363167,"about_ca_topic_score_gemma":0.0025908733,"teacher_disagreement_score":0.0029363167,"about_ca_system_score_codex":0.0010932435,"about_ca_system_score_gemma":0.001716073,"threshold_uncertainty_score":0.009321809},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045088187,0.00034756053,0.9495772,0.00020353246,0.00007515771,0.00015761734,0.00009572875,0.00070358964,0.0037514241],"genre_scores_gemma":[0.8150878,0.0003388137,0.18176246,0.00020612584,0.00005258588,0.00016316194,0.0002192531,0.00007698519,0.002092859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981811,0.00045058673,0.00010629686,0.00023241712,0.00071942876,0.00031017498],"domain_scores_gemma":[0.9935848,0.003190591,0.00064799306,0.0012306843,0.0011716486,0.0001742693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023014357,0.0009982778,0.0007676833,0.0012054789,0.0008665786,0.0009450885,0.001495122,0.00091536687,0.00089107576],"category_scores_gemma":[0.010571845,0.00033647867,0.00045471126,0.0012301994,0.0013602019,0.0021391576,0.0020272136,0.00097528537,0.00018532926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055054453,0.0001982055,0.0026878829,0.00014642603,0.00005919572,0.0005671214,0.00057029066,0.64243186,0.027294159,0.0752429,0.003873829,0.24637756],"study_design_scores_gemma":[0.000021366282,0.00011900289,0.00017787625,0.000019275252,0.000016080121,0.00023066763,0.000056888577,0.9743249,0.008135906,0.0149923405,0.001871094,0.000034482295],"about_ca_topic_score_codex":0.0068883398,"about_ca_topic_score_gemma":0.0068093278,"teacher_disagreement_score":0.0068883398,"about_ca_system_score_codex":0.0011670708,"about_ca_system_score_gemma":0.0023162565,"threshold_uncertainty_score":0.013696492},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016515354,0.0003242869,0.97866756,0.00036300297,0.00022598126,0.0003145282,0.00008960258,0.00038112726,0.0031185846],"genre_scores_gemma":[0.83479476,0.00036756194,0.15681379,0.0002952663,0.00035553743,0.00075497356,0.00011391109,0.0000615208,0.006442647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947674,0.0018238514,0.00036420298,0.0010722682,0.001385774,0.00058651203],"domain_scores_gemma":[0.9913242,0.003942758,0.0013735694,0.0014433869,0.0013578115,0.00055825536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051608495,0.0014950488,0.0018417002,0.0012498838,0.0016629947,0.0022963916,0.0059825615,0.0027762847,0.005131109],"category_scores_gemma":[0.010686471,0.0009216184,0.0012675159,0.0019768577,0.0018039279,0.0044573927,0.0023983377,0.002037497,0.0009141319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013979702,0.000821956,0.0016740437,0.00094555464,0.00031328597,0.0015748495,0.0006953659,0.3368108,0.0296828,0.45688954,0.00942139,0.15977252],"study_design_scores_gemma":[0.0002577134,0.00052481436,0.00024676038,0.00003092282,0.00008821146,0.00064992864,0.000057320325,0.90494925,0.0040301397,0.08100952,0.0080502,0.000105200015],"about_ca_topic_score_codex":0.0012493618,"about_ca_topic_score_gemma":0.0012163568,"teacher_disagreement_score":0.0059825615,"about_ca_system_score_codex":0.0017414412,"about_ca_system_score_gemma":0.002487094,"threshold_uncertainty_score":0.027293503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051446687,0.00014330186,0.9933903,0.00007473372,0.000012525519,0.000016666141,0.0000123439895,0.000037009282,0.0011685595],"genre_scores_gemma":[0.60988003,0.00088803587,0.3864192,0.00012919088,0.000089182235,0.00017220715,0.00009636464,0.000031482254,0.002294298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995449,0.00015938473,0.0000142627505,0.000043639233,0.00016473579,0.00007290737],"domain_scores_gemma":[0.9994641,0.0002882226,0.00006708983,0.00004747745,0.00010791353,0.000025185476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006648771,0.0006630417,0.00044831706,0.00035679678,0.00032522026,0.00053393934,0.0006052075,0.00048768226,0.0007772485],"category_scores_gemma":[0.0015592433,0.00023294945,0.0003400902,0.000654911,0.00063844654,0.000719182,0.00071225356,0.0006802149,0.00020600231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055587043,0.00003870581,0.00033674104,0.000054409316,0.000020967262,0.000073079565,0.00005582372,0.88434064,0.0066322912,0.042043652,0.00085790665,0.065490164],"study_design_scores_gemma":[0.0000040721775,0.000019242825,0.000031713804,0.0000031158281,0.0000031570632,0.0000131165,0.0000069051102,0.9948791,0.0008637564,0.0038417578,0.00033064105,0.0000034571265],"about_ca_topic_score_codex":0.0036713472,"about_ca_topic_score_gemma":0.0052395775,"teacher_disagreement_score":0.0036713472,"about_ca_system_score_codex":0.0006454631,"about_ca_system_score_gemma":0.0010124607,"threshold_uncertainty_score":0.0072999597},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13451296,0.0021377557,0.8552149,0.0005970381,0.0000642821,0.000063522166,0.00009306741,0.00023502206,0.007081434],"genre_scores_gemma":[0.9819088,0.00092911394,0.016188681,0.000047698304,0.00004926322,0.000045214834,0.000036009307,0.000037074282,0.0007582028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989436,0.00047698303,0.000035272282,0.00008397311,0.00031201282,0.00014819627],"domain_scores_gemma":[0.9939027,0.004952549,0.00031683905,0.00021509136,0.0005485751,0.00006428559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00247351,0.00068570336,0.00060390215,0.0011477191,0.00047825466,0.001003907,0.00087341765,0.0006757794,0.0008699226],"category_scores_gemma":[0.01119093,0.0002790869,0.00048294547,0.0009688003,0.0012145755,0.0019003231,0.0007222625,0.0007698719,0.000116736635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039569702,0.000030357176,0.0006887508,0.000049274186,0.000019673043,0.00006285716,0.0000882313,0.9282532,0.0025228995,0.062071394,0.00029276253,0.0058810236],"study_design_scores_gemma":[0.0000011471859,0.000006800071,0.000095006704,0.000003415979,0.0000026297466,0.0000073312467,0.000009982511,0.99240464,0.0002742919,0.007130496,0.00006151628,0.0000027181134],"about_ca_topic_score_codex":0.0042595714,"about_ca_topic_score_gemma":0.0015314573,"teacher_disagreement_score":0.0042595714,"about_ca_system_score_codex":0.0029025036,"about_ca_system_score_gemma":0.0010906663,"threshold_uncertainty_score":0.021059275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18371455,0.0009541497,0.81137943,0.00018259446,0.000028737417,0.000030983076,0.000031279487,0.0001314707,0.0035467907],"genre_scores_gemma":[0.9841441,0.00033036305,0.015052413,0.000022700226,0.000011058586,0.000015709627,0.000010627112,0.000005776351,0.00040717627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916136,0.0003528305,0.000047398204,0.00011287372,0.00021674905,0.00010871121],"domain_scores_gemma":[0.99823964,0.0011951596,0.00019374292,0.00015754493,0.00017107278,0.000042823416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011689612,0.00073610997,0.0006945375,0.0005133506,0.00042394857,0.0006119072,0.00058568426,0.00047122806,0.00038359262],"category_scores_gemma":[0.0031650085,0.00024729676,0.00041376767,0.00064789824,0.0008938493,0.0010670734,0.00086898025,0.00028997968,0.000118688105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035182256,0.00006233724,0.0026547934,0.00017423723,0.00010748857,0.0008352555,0.0005020928,0.80656016,0.04783781,0.09156011,0.0006035359,0.048750326],"study_design_scores_gemma":[0.000034475786,0.00024276867,0.00048964826,0.000016634558,0.000058692232,0.0004452532,0.00006842872,0.9663371,0.0106069585,0.020873196,0.0008048558,0.00002212219],"about_ca_topic_score_codex":0.00048249427,"about_ca_topic_score_gemma":0.00053589593,"teacher_disagreement_score":0.0011689612,"about_ca_system_score_codex":0.00047522737,"about_ca_system_score_gemma":0.00047057765,"threshold_uncertainty_score":0.006182134},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026635956,0.0006237741,0.9397754,0.0009130587,0.00042455466,0.00022680755,0.0005070145,0.0010433656,0.029850092],"genre_scores_gemma":[0.4863475,0.001494374,0.460805,0.000814149,0.00037792145,0.0006108036,0.0012189696,0.0006067189,0.047724616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876213,0.00040048282,0.00005484399,0.00021104426,0.00037731073,0.00019413738],"domain_scores_gemma":[0.99673104,0.0013436484,0.00019228383,0.0010710349,0.00043093588,0.00023106119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011403331,0.0007045211,0.0009651727,0.0010627685,0.0014373227,0.0021805896,0.0022956554,0.0012081589,0.008451155],"category_scores_gemma":[0.0055993,0.00053124374,0.0007945789,0.001748335,0.0011792813,0.0032210432,0.0029940868,0.002778427,0.0017428817],"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.00031464238,0.00013708227,0.00020847068,0.00026578348,0.000045322697,0.00007902007,0.0003792153,0.0976092,0.009598097,0.75675166,0.022821885,0.11178957],"study_design_scores_gemma":[0.000094830946,0.00011786099,0.00018783692,0.00008199807,0.000055043816,0.00019133209,0.00019075081,0.44371969,0.0052190935,0.52495694,0.025120718,0.00006392597],"about_ca_topic_score_codex":0.002183644,"about_ca_topic_score_gemma":0.0042618434,"teacher_disagreement_score":0.008451155,"about_ca_system_score_codex":0.002723762,"about_ca_system_score_gemma":0.0014446065,"threshold_uncertainty_score":0.028271973},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4240922,0.0010062366,0.56560785,0.00091088796,0.00007018028,0.00012256559,0.000202716,0.00020699875,0.007780341],"genre_scores_gemma":[0.9922834,0.00016380905,0.0062150448,0.00003085749,0.000012881421,0.00003355514,0.000031715397,0.000014968725,0.0012137528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993876,0.00018045212,0.000019131774,0.000080207516,0.00018250768,0.0001499852],"domain_scores_gemma":[0.99492973,0.0038490898,0.000473955,0.00016246046,0.00045925184,0.00012549543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020307852,0.0005068038,0.0006058089,0.00082105014,0.00050869834,0.00072328496,0.0013229192,0.0007657424,0.001153282],"category_scores_gemma":[0.007522683,0.00039098106,0.0005385772,0.0005259509,0.0010659844,0.001331289,0.00066528755,0.00051551475,0.000060700877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037688398,0.000015694299,0.000803665,0.000020099174,0.0000153161,0.000073414914,0.00003944245,0.9808295,0.0009645466,0.015045378,0.00021410944,0.0019410774],"study_design_scores_gemma":[0.0000012038306,0.0000066755956,0.000110345885,0.0000011217254,0.0000021732671,0.0000072544904,0.0000065019035,0.9983393,0.00007137646,0.0014187575,0.000033071767,0.0000022546524],"about_ca_topic_score_codex":0.013371619,"about_ca_topic_score_gemma":0.006046126,"teacher_disagreement_score":0.013371619,"about_ca_system_score_codex":0.0024345696,"about_ca_system_score_gemma":0.0013164394,"threshold_uncertainty_score":0.026587546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26365098,0.004424628,0.7136995,0.0014862322,0.00021545442,0.00011846147,0.00018075125,0.00025424775,0.015969781],"genre_scores_gemma":[0.9880212,0.00058367534,0.0103350645,0.00006901321,0.00003900046,0.000025076846,0.000013897067,0.000009450162,0.0009036744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839693,0.00086511637,0.000046755013,0.00017489852,0.00027899494,0.00023724214],"domain_scores_gemma":[0.99585354,0.0033276842,0.00027599875,0.00016017807,0.00027578484,0.00010683987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026912868,0.000663488,0.00090728985,0.00070125423,0.0010711306,0.0011749577,0.0010648754,0.00088656694,0.0011267263],"category_scores_gemma":[0.0071563893,0.00028057105,0.00037014709,0.0009706416,0.0011898805,0.0012439413,0.0009954657,0.0004676538,0.00016188565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027034414,0.000037786427,0.0016866194,0.000055665525,0.000028546474,0.00022926244,0.000111737856,0.924012,0.0014327796,0.050436,0.0008170867,0.020882124],"study_design_scores_gemma":[0.000023836128,0.000057608584,0.0004476524,0.000010694267,0.000019864501,0.00008970328,0.000040720068,0.97500527,0.0007435511,0.022802293,0.0007434423,0.000015460857],"about_ca_topic_score_codex":0.008663015,"about_ca_topic_score_gemma":0.006096201,"teacher_disagreement_score":0.008663015,"about_ca_system_score_codex":0.0022629912,"about_ca_system_score_gemma":0.0013632124,"threshold_uncertainty_score":0.017225206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20817922,0.0038932506,0.76357704,0.0008491141,0.00030649695,0.00015727177,0.0013269079,0.00038347652,0.021327216],"genre_scores_gemma":[0.9021474,0.0019611944,0.090754315,0.000116977106,0.00033792134,0.00024205973,0.0009807392,0.00011737505,0.003342097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910516,0.00021381523,0.000051546966,0.00020125198,0.00034101884,0.000087246255],"domain_scores_gemma":[0.9961612,0.0021093637,0.00069780526,0.00027857543,0.0005909987,0.00016203884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001158926,0.0004968577,0.0007309271,0.0045686,0.0005894967,0.0016809938,0.0008276946,0.0006661437,0.0017794458],"category_scores_gemma":[0.007198278,0.00019560046,0.00037319638,0.004073181,0.0013731963,0.0031396674,0.0007439559,0.0011461534,0.00030460776],"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.00018917027,0.000078297366,0.004148155,0.0002691167,0.0000853842,0.00023765358,0.00033675827,0.07062365,0.009431582,0.7813984,0.0046365066,0.12856536],"study_design_scores_gemma":[0.000034635254,0.0001736933,0.0056310506,0.000101254904,0.00007354721,0.00086908217,0.00030709652,0.3084843,0.004572658,0.6675306,0.012096953,0.00012507223],"about_ca_topic_score_codex":0.00057671673,"about_ca_topic_score_gemma":0.00056294166,"teacher_disagreement_score":0.0045686,"about_ca_system_score_codex":0.0009933193,"about_ca_system_score_gemma":0.0004195093,"threshold_uncertainty_score":0.0072070956},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08659676,0.000624435,0.9075506,0.00034139262,0.000036230093,0.0000713118,0.00004588578,0.00012287308,0.004610526],"genre_scores_gemma":[0.9188961,0.0005537652,0.07763614,0.00008792382,0.000042722848,0.000079886995,0.000047457223,0.000039736566,0.0026162372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964595,0.00012231691,0.000020220637,0.0000677148,0.00007373956,0.00007003989],"domain_scores_gemma":[0.9995505,0.00023105038,0.000077852324,0.000031683336,0.00007422115,0.00003471215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061968656,0.0010564468,0.00071113853,0.00037673934,0.00033379073,0.0008218607,0.0008692589,0.00077031663,0.0013866349],"category_scores_gemma":[0.0014751591,0.00041050892,0.0003881843,0.00043114563,0.00080634514,0.0009144473,0.0008348218,0.0006728018,0.00024501578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042554608,0.000086054984,0.00055922684,0.00026033234,0.000084863306,0.00031789482,0.0002329031,0.8398878,0.04800318,0.04438803,0.0013861313,0.06436802],"study_design_scores_gemma":[0.000020282361,0.00006637208,0.00008979303,0.0000076182555,0.000015901842,0.00003587957,0.000029673327,0.991181,0.003073799,0.005182727,0.0002850494,0.000011916053],"about_ca_topic_score_codex":0.0018875395,"about_ca_topic_score_gemma":0.0015506254,"teacher_disagreement_score":0.0018875395,"about_ca_system_score_codex":0.00081164466,"about_ca_system_score_gemma":0.0007907652,"threshold_uncertainty_score":0.0058889985},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047904174,0.00016545475,0.9939219,0.000045754918,0.000007707701,0.00001239385,0.000014787337,0.00008276151,0.0009588224],"genre_scores_gemma":[0.5465584,0.00090845017,0.44921476,0.0000762304,0.000048033915,0.00010567003,0.000085981424,0.000041851203,0.002960622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994809,0.00022553865,0.000023983785,0.0000745309,0.00015202141,0.00004308522],"domain_scores_gemma":[0.9996439,0.00017903978,0.000049280337,0.00004810856,0.00006678893,0.000012909132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006531793,0.00079609663,0.0005941913,0.00020808239,0.00022173645,0.00051623024,0.00054890756,0.0007419491,0.0012849419],"category_scores_gemma":[0.0011950408,0.00028541833,0.000561334,0.00039473004,0.00043597436,0.0008285511,0.00049555465,0.00046882412,0.0006405117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012266514,0.000040965213,0.0005362704,0.00018431088,0.000062157385,0.00024481973,0.000110409004,0.8294386,0.03837545,0.031249484,0.0009371739,0.09869772],"study_design_scores_gemma":[0.00001572777,0.00012325698,0.00012828659,0.000007705957,0.000026117541,0.00012079601,0.000011506221,0.9843827,0.0077931616,0.006020581,0.0013573354,0.000012849247],"about_ca_topic_score_codex":0.00056674005,"about_ca_topic_score_gemma":0.00095643423,"teacher_disagreement_score":0.0012849419,"about_ca_system_score_codex":0.00032188243,"about_ca_system_score_gemma":0.00047840056,"threshold_uncertainty_score":0.004298508},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017301442,0.00054935174,0.9791925,0.00021014838,0.000031974094,0.000049720067,0.000047514124,0.000097039985,0.0025202709],"genre_scores_gemma":[0.8574324,0.0010513644,0.13750747,0.00015258277,0.00008603663,0.00024443402,0.00010804613,0.00004805449,0.0033695966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990791,0.0003793543,0.000042103547,0.00019596229,0.00017532274,0.00012805876],"domain_scores_gemma":[0.99775606,0.0016323994,0.00023456088,0.00008514845,0.00023889447,0.000053014275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013147346,0.0013031599,0.0012878426,0.000429479,0.00038346704,0.0009978794,0.0008414856,0.0017420622,0.0017903041],"category_scores_gemma":[0.0047863913,0.00066809624,0.00043148056,0.0006692704,0.0010246314,0.0012063454,0.0008928078,0.0009234445,0.00041179644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006183927,0.000040035222,0.00023131497,0.00012071317,0.000028881368,0.000100968675,0.0000887922,0.96210766,0.0033267643,0.011615374,0.0005007931,0.021776902],"study_design_scores_gemma":[0.000011646734,0.000040736122,0.00005863776,0.000007518377,0.0000081819435,0.000026587937,0.000011002483,0.99621576,0.0006483571,0.002715211,0.00025024515,0.000006162682],"about_ca_topic_score_codex":0.0019508074,"about_ca_topic_score_gemma":0.0015139781,"teacher_disagreement_score":0.0019508074,"about_ca_system_score_codex":0.0008617485,"about_ca_system_score_gemma":0.0009341705,"threshold_uncertainty_score":0.0069530606},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040784284,0.0002526393,0.95648503,0.00013266123,0.000015227601,0.000026383577,0.000050221308,0.00007630687,0.0021772587],"genre_scores_gemma":[0.91035527,0.00051212264,0.085103355,0.00005331554,0.000031580792,0.00013579652,0.00007075411,0.00003274726,0.0037050487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995022,0.00020790644,0.000019328687,0.00008970335,0.00009336101,0.00008742764],"domain_scores_gemma":[0.9992467,0.0004819906,0.00010157202,0.00003505652,0.000103937,0.000030654297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008218184,0.0010276575,0.00080997543,0.0002733954,0.0002882465,0.0007217244,0.0006367365,0.00089061743,0.0010769607],"category_scores_gemma":[0.0023756905,0.00043105008,0.00025588294,0.00045279707,0.0007183549,0.00084464165,0.0007291235,0.00047963293,0.00032047942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006592753,0.000026425476,0.0001883936,0.00004042213,0.0000115758785,0.000059979626,0.00003714682,0.9704057,0.003714999,0.010765202,0.00020029146,0.0144839045],"study_design_scores_gemma":[0.0000110997335,0.00003308192,0.000042977885,0.000002628174,0.000004812516,0.000010289481,0.000010074052,0.99523443,0.0006346536,0.0039069257,0.00010466434,0.0000043926075],"about_ca_topic_score_codex":0.0028664551,"about_ca_topic_score_gemma":0.003337979,"teacher_disagreement_score":0.0028664551,"about_ca_system_score_codex":0.0006568497,"about_ca_system_score_gemma":0.00092134625,"threshold_uncertainty_score":0.0056995153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14399205,0.0016707649,0.8296203,0.0004258446,0.000052102598,0.00010305733,0.00024292489,0.00029368568,0.023599276],"genre_scores_gemma":[0.9741985,0.0011376109,0.021580108,0.000089959525,0.00004167475,0.00007950932,0.000084038504,0.00003592252,0.0027526682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990257,0.00036414203,0.00003504268,0.000097832075,0.0003480765,0.00012924652],"domain_scores_gemma":[0.9971927,0.0019117432,0.00023800618,0.00016166408,0.0004500766,0.000045879053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017966835,0.0011168087,0.00086360745,0.0009207131,0.00049398857,0.0013231775,0.0008459916,0.00092879933,0.0021031608],"category_scores_gemma":[0.005024996,0.00038119633,0.0005795297,0.0010118999,0.0014349881,0.0010823956,0.0009603845,0.00061455567,0.00046977535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013712289,0.000029704921,0.00088267715,0.00014284316,0.00003526396,0.000281819,0.00021262572,0.8807904,0.012011636,0.09606141,0.00057053467,0.008844063],"study_design_scores_gemma":[0.000004904682,0.000027136011,0.00017037481,0.000012159667,0.000008292441,0.00007593127,0.00002163711,0.9916699,0.0009589994,0.0068519274,0.0001899601,0.000008733491],"about_ca_topic_score_codex":0.0036144587,"about_ca_topic_score_gemma":0.0021357841,"teacher_disagreement_score":0.0036144587,"about_ca_system_score_codex":0.0020294422,"about_ca_system_score_gemma":0.0011588245,"threshold_uncertainty_score":0.014724731},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068647444,0.00049281894,0.92828286,0.00014097244,0.000046195433,0.00007552875,0.000022709311,0.0003272785,0.0019642995],"genre_scores_gemma":[0.89377356,0.00027501606,0.10486464,0.00006175373,0.000021453956,0.000084627056,0.00003861473,0.000015549414,0.0008648798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996562,0.000106609376,0.000010325807,0.00005331829,0.00012372862,0.000049779792],"domain_scores_gemma":[0.9992906,0.00037131613,0.000059961625,0.00011845338,0.00013160642,0.000028040857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010316957,0.00038018706,0.00041959208,0.0006501126,0.0008709577,0.00045578487,0.0009424368,0.000512775,0.0006257035],"category_scores_gemma":[0.0017975783,0.00018723939,0.0004405183,0.0006878997,0.00057388784,0.00085242203,0.0006405147,0.00038829868,0.00009265887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015713055,0.00012529248,0.0013417057,0.00012873589,0.00007269341,0.00016592527,0.00029488234,0.83608836,0.01912163,0.029079797,0.0018963136,0.111527614],"study_design_scores_gemma":[0.000012460212,0.00009368467,0.00019361515,0.0000037119214,0.000017033772,0.00005586474,0.000020202753,0.99205023,0.00333252,0.0030519243,0.0011572602,0.000011535182],"about_ca_topic_score_codex":0.005899505,"about_ca_topic_score_gemma":0.0072594266,"teacher_disagreement_score":0.005899505,"about_ca_system_score_codex":0.00096859125,"about_ca_system_score_gemma":0.0009467901,"threshold_uncertainty_score":0.011730373},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01854395,0.0010960997,0.97021824,0.00025430977,0.00015460806,0.000054866534,0.00007239655,0.000417323,0.009188258],"genre_scores_gemma":[0.78923476,0.0016109931,0.18721825,0.00030845887,0.000107588414,0.00015002601,0.00014877903,0.00007145163,0.021149738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997242,0.00007232931,0.000009488111,0.000052755462,0.00009403332,0.00004715395],"domain_scores_gemma":[0.9997129,0.000107490254,0.000021052223,0.000056553403,0.00008820431,0.000013773378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043047091,0.0006549584,0.0007608257,0.00049871247,0.0006663892,0.0006528753,0.0010814829,0.00065154076,0.001826049],"category_scores_gemma":[0.00050719304,0.00016996168,0.0003560165,0.00084465207,0.00057036546,0.0007101454,0.00087771536,0.0006856629,0.00047396272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004167812,0.0001713402,0.00060150627,0.0003751462,0.00015488069,0.0007925419,0.0007660792,0.21932687,0.10609945,0.23290476,0.016200112,0.42219052],"study_design_scores_gemma":[0.00003306628,0.00030409533,0.0003784394,0.000035559657,0.00008048048,0.000726107,0.00008728636,0.91484857,0.01595766,0.054740664,0.012748967,0.000059101087],"about_ca_topic_score_codex":0.0009705195,"about_ca_topic_score_gemma":0.0016900621,"teacher_disagreement_score":0.001826049,"about_ca_system_score_codex":0.0004432244,"about_ca_system_score_gemma":0.00056684273,"threshold_uncertainty_score":0.006108761},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115703,0.0004667336,0.8813752,0.00010809177,0.000021791524,0.000042492506,0.00003488132,0.00032101118,0.0019267632],"genre_scores_gemma":[0.8871598,0.00022582951,0.1117311,0.000031676,0.000015860514,0.000032767046,0.000045382087,0.000022373886,0.0007352515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958736,0.0001870253,0.00001617962,0.00006817034,0.00009186919,0.00004932202],"domain_scores_gemma":[0.99949145,0.00026519128,0.00009590267,0.00007141666,0.00004873724,0.000027306387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045885213,0.0005548973,0.00048924,0.00032463638,0.00028335364,0.0003257708,0.0005956841,0.0004946419,0.0003351689],"category_scores_gemma":[0.0015754183,0.00024935874,0.00024195194,0.00046234392,0.0003718564,0.00047454977,0.0005877435,0.00025148585,0.00012867087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100006975,0.000030316576,0.0006205286,0.000032130378,0.000013734728,0.00011476676,0.00004817227,0.9325705,0.010260877,0.002869786,0.00050203217,0.052837122],"study_design_scores_gemma":[0.0000078092435,0.00007646314,0.000272809,0.0000027399326,0.0000064644655,0.00010082139,0.00002067205,0.9939719,0.0036561922,0.0015567681,0.00032173615,0.000005565483],"about_ca_topic_score_codex":0.0015687317,"about_ca_topic_score_gemma":0.0018500659,"teacher_disagreement_score":0.0015687317,"about_ca_system_score_codex":0.00042693067,"about_ca_system_score_gemma":0.00039011062,"threshold_uncertainty_score":0.0031192303},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8327479,0.0058809277,0.1240727,0.002002564,0.00024002318,0.00009939064,0.0014064839,0.0005677636,0.03298228],"genre_scores_gemma":[0.99341077,0.0011304852,0.0036349995,0.000051428662,0.00006508512,0.000021010284,0.00019436778,0.000040265928,0.0014514631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977483,0.0008212259,0.000084088475,0.00019729223,0.000663952,0.0004851489],"domain_scores_gemma":[0.96733665,0.02894404,0.0009527931,0.0009467683,0.0015995742,0.00022025223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037032252,0.0018286305,0.001572231,0.0013552796,0.0009068862,0.0020574813,0.0012099503,0.0019865627,0.0029171587],"category_scores_gemma":[0.022955036,0.000633461,0.0004944022,0.0012340255,0.0026990923,0.0021306034,0.0016416297,0.0009193754,0.00043104228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014541303,0.00006196439,0.002085056,0.00023574843,0.00014494166,0.00038695108,0.00024276726,0.9522802,0.007169203,0.02046453,0.0011148187,0.014359636],"study_design_scores_gemma":[0.000102759535,0.0004357938,0.0020969133,0.0000770068,0.00017371948,0.0004522821,0.00019201505,0.9726556,0.007301626,0.015901297,0.00053866947,0.00007234285],"about_ca_topic_score_codex":0.0076580867,"about_ca_topic_score_gemma":0.007650285,"teacher_disagreement_score":0.0076580867,"about_ca_system_score_codex":0.0022396382,"about_ca_system_score_gemma":0.0019877553,"threshold_uncertainty_score":0.019584715},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05078187,0.00038166792,0.9442487,0.0002225069,0.000042111245,0.000050640112,0.00005141953,0.00009843129,0.00412266],"genre_scores_gemma":[0.96156484,0.00031958055,0.036372524,0.00004861146,0.000021560465,0.00008023454,0.00003293582,0.00001769029,0.0015420568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953127,0.000169056,0.000018236036,0.00007476225,0.000104741564,0.000101978556],"domain_scores_gemma":[0.9994159,0.00030785167,0.0001048145,0.000029063416,0.00011295836,0.000029468496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006372696,0.0007695807,0.00093349256,0.00033324986,0.0003945399,0.0014552466,0.0008821208,0.00066963537,0.0013196027],"category_scores_gemma":[0.002102076,0.00039420117,0.00031061049,0.00057167653,0.000627499,0.0007530675,0.00085549586,0.0006047849,0.00019734848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068886344,0.00004185562,0.00029121104,0.000066597895,0.000019677029,0.000055334734,0.0000663518,0.96447086,0.004376541,0.017842004,0.000433122,0.012267571],"study_design_scores_gemma":[0.0000070465053,0.00002322086,0.000032731892,0.0000023427199,0.000004223452,0.00000669141,0.000007919079,0.9980976,0.0003809968,0.0013230254,0.00011162746,0.0000025393535],"about_ca_topic_score_codex":0.002691165,"about_ca_topic_score_gemma":0.002994383,"teacher_disagreement_score":0.002691165,"about_ca_system_score_codex":0.0010959306,"about_ca_system_score_gemma":0.0014073753,"threshold_uncertainty_score":0.007951617},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009381345,0.20115376,0.34080297,0.0071522524,0.0057163695,0.00012484792,0.0003494478,0.0011428908,0.43417612],"genre_scores_gemma":[0.14846571,0.24527358,0.11233817,0.002491382,0.0062038405,0.00019613921,0.0005483847,0.00047934876,0.48400354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997974,0.000043753575,0.0000110593755,0.000044296947,0.00008697372,0.000016422759],"domain_scores_gemma":[0.99980456,0.00010426585,0.000011358298,0.000033707165,0.000038177124,0.000008037771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031705113,0.0008183869,0.0004023335,0.00077413884,0.0003238731,0.0012274144,0.00076256675,0.0013714992,0.014951916],"category_scores_gemma":[0.000618693,0.00026280974,0.00035508166,0.0010271383,0.00075395464,0.0027785248,0.0007454182,0.0014005422,0.005281605],"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.000036275876,0.000031223095,0.000075193464,0.00068031903,0.000023310293,0.00016931281,0.00026361115,0.0028425024,0.01294354,0.59116256,0.06320464,0.3285675],"study_design_scores_gemma":[0.000007786021,0.00009123775,0.00017054382,0.00027416483,0.000035925026,0.0007730896,0.000095462994,0.006188271,0.0059979437,0.15383063,0.8325098,0.00002515236],"about_ca_topic_score_codex":0.000382318,"about_ca_topic_score_gemma":0.00051392126,"teacher_disagreement_score":0.014951916,"about_ca_system_score_codex":0.00067652017,"about_ca_system_score_gemma":0.00034168328,"threshold_uncertainty_score":0.050019145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023211487,0.00032374723,0.97346467,0.00017539714,0.00011527765,0.00009099388,0.000037727554,0.00035569433,0.002225095],"genre_scores_gemma":[0.674627,0.00030449618,0.31934714,0.0002360875,0.0001258236,0.0003094633,0.0001893565,0.000089194735,0.0047713914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907506,0.00023678488,0.00004697392,0.00017289881,0.0003142261,0.0001541422],"domain_scores_gemma":[0.99757296,0.0013345047,0.00017533846,0.00020686063,0.0005947688,0.00011567313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014163717,0.0008479656,0.0012580203,0.0012611012,0.0010190479,0.00086082396,0.0028057203,0.0013614336,0.0016643108],"category_scores_gemma":[0.004811246,0.00034956122,0.00052682345,0.0013809386,0.00082369806,0.0017846777,0.0018979234,0.0011020981,0.00030836335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031980634,0.00019463441,0.0008459603,0.00010820502,0.00006433897,0.00010957691,0.00023417399,0.770604,0.0072864364,0.018817432,0.0051589566,0.19625649],"study_design_scores_gemma":[0.000022767394,0.00008051822,0.00007408891,0.000004849187,0.000010521951,0.00003907545,0.000019658002,0.9959501,0.00075021107,0.0024232531,0.00061781344,0.0000071102936],"about_ca_topic_score_codex":0.0048368773,"about_ca_topic_score_gemma":0.0058285296,"teacher_disagreement_score":0.0048368773,"about_ca_system_score_codex":0.0008191496,"about_ca_system_score_gemma":0.0014839048,"threshold_uncertainty_score":0.009617448},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08188467,0.003306019,0.890675,0.007785322,0.000392211,0.000045179666,0.0002351172,0.000100454134,0.015576079],"genre_scores_gemma":[0.8979529,0.0028671678,0.092548996,0.0008649547,0.00065142434,0.00009386219,0.00016605284,0.00011657045,0.004737977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979505,0.0012993271,0.000086007196,0.0001903798,0.00029708684,0.00017680752],"domain_scores_gemma":[0.98993355,0.008055315,0.00057201093,0.0008169529,0.00048644046,0.00013572516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036324072,0.0008326751,0.001420236,0.00027817572,0.00032009286,0.0015814163,0.0016482758,0.0016703607,0.0032416405],"category_scores_gemma":[0.021732235,0.00072248245,0.00029970636,0.0008599558,0.0020080234,0.005974714,0.001239106,0.0023082208,0.00037813743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039345332,0.0001248397,0.0009955723,0.00045779665,0.00011678217,0.00013698358,0.00016411934,0.61399144,0.0014767797,0.2751582,0.006259833,0.100724235],"study_design_scores_gemma":[0.000104891624,0.000089679044,0.00039841863,0.00009179915,0.000032314827,0.000058921807,0.00006829413,0.6696025,0.0007814165,0.32652104,0.0022245024,0.0000261435],"about_ca_topic_score_codex":0.0009212971,"about_ca_topic_score_gemma":0.0011901072,"teacher_disagreement_score":0.0036324072,"about_ca_system_score_codex":0.00046307564,"about_ca_system_score_gemma":0.00090820016,"threshold_uncertainty_score":0.019210279},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056518592,0.0006697982,0.9398316,0.00018196968,0.000033290617,0.000066055625,0.000046500983,0.00024873682,0.0024034563],"genre_scores_gemma":[0.90844643,0.00035783387,0.08946799,0.00003770085,0.000019846124,0.00006533104,0.000036167698,0.000018020657,0.0015506847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994868,0.0001829758,0.000022924767,0.00007602533,0.00016925916,0.000062001855],"domain_scores_gemma":[0.99926645,0.00042179108,0.00008332573,0.00008991,0.00011279143,0.000025828249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007227537,0.00058067753,0.00060188235,0.00038514147,0.00029209125,0.00051707774,0.00072168966,0.00057027,0.0008325811],"category_scores_gemma":[0.0016092538,0.00019940831,0.00034435236,0.00042699394,0.00044900243,0.00097597786,0.00070371927,0.00047148392,0.00016200118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039941145,0.00007345813,0.00062731333,0.00021594005,0.0000647772,0.0005987887,0.00024382581,0.8153906,0.038207907,0.041645743,0.0014446692,0.101087555],"study_design_scores_gemma":[0.000013724487,0.000052095882,0.00009467692,0.0000051350144,0.000012108468,0.00009075767,0.000012691514,0.99112684,0.0054691015,0.0026596952,0.00045229713,0.000010883917],"about_ca_topic_score_codex":0.0023080155,"about_ca_topic_score_gemma":0.0027183057,"teacher_disagreement_score":0.0023080155,"about_ca_system_score_codex":0.00059889816,"about_ca_system_score_gemma":0.00057547604,"threshold_uncertainty_score":0.0045891404},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065150976,0.0027288662,0.9129917,0.00065310975,0.00016692912,0.000046421832,0.00022158597,0.00037088853,0.017669555],"genre_scores_gemma":[0.9394547,0.0040390757,0.04422405,0.0005966453,0.0007637332,0.00016171855,0.00031933942,0.00019255426,0.010248175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916244,0.00027037572,0.000029635767,0.000106745596,0.0002927937,0.00013808164],"domain_scores_gemma":[0.99581367,0.0023662006,0.0005867785,0.00032810535,0.0006846394,0.00022058097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015859402,0.0013255646,0.000668538,0.001846408,0.0005004928,0.0013285935,0.0010752591,0.0008904579,0.0024959275],"category_scores_gemma":[0.010494943,0.00030513183,0.00080045336,0.0011584824,0.0024049089,0.0025068042,0.0013788469,0.0018416343,0.0006673415],"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.00005126774,0.000036335103,0.0011678475,0.00015684083,0.0000474254,0.00037848076,0.0002486312,0.14150411,0.0037897266,0.83398664,0.0026593208,0.015973412],"study_design_scores_gemma":[0.0000108133345,0.00007817199,0.0009947044,0.000046015197,0.000021943713,0.0003827366,0.00009795757,0.5862271,0.0009768321,0.40793383,0.0031761616,0.00005375383],"about_ca_topic_score_codex":0.0014273361,"about_ca_topic_score_gemma":0.00067377556,"teacher_disagreement_score":0.0024959275,"about_ca_system_score_codex":0.001380809,"about_ca_system_score_gemma":0.0006952832,"threshold_uncertainty_score":0.010018587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13880582,0.0015161479,0.8471037,0.0004608023,0.00008418044,0.000055099685,0.000071559756,0.00018599392,0.0117166145],"genre_scores_gemma":[0.98597604,0.0005921372,0.011794421,0.00006158229,0.000036301644,0.000036951,0.000015796071,0.000012433883,0.0014744095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995969,0.000172248,0.0000100377265,0.000047389978,0.00008879302,0.00008474281],"domain_scores_gemma":[0.99895597,0.00072369707,0.00012323922,0.00004087553,0.00012652697,0.000029731342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000852732,0.0006763944,0.0004620058,0.0003385102,0.00039856645,0.000800746,0.0007239449,0.0005591492,0.00091637834],"category_scores_gemma":[0.0024375024,0.00021529997,0.0004214618,0.00047698646,0.0008740091,0.0007367859,0.00053392,0.00046975634,0.00017470134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005331366,0.000024610395,0.0004557483,0.000060244518,0.000024647883,0.00027221837,0.00007514546,0.96130675,0.0034643393,0.028135618,0.00041069975,0.0057165986],"study_design_scores_gemma":[0.0000051500724,0.00003040037,0.00014215881,0.0000034102416,0.000009065973,0.00005487656,0.000016527134,0.9938683,0.00033600247,0.00536523,0.0001643123,0.000004661585],"about_ca_topic_score_codex":0.002977387,"about_ca_topic_score_gemma":0.0025195838,"teacher_disagreement_score":0.002977387,"about_ca_system_score_codex":0.000983522,"about_ca_system_score_gemma":0.00047656562,"threshold_uncertainty_score":0.0071359873},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057236377,0.00055553037,0.9366829,0.0005891569,0.00003419171,0.00005157214,0.000057235775,0.00013665784,0.004656345],"genre_scores_gemma":[0.91597897,0.00070257025,0.079648815,0.0001419895,0.000071590846,0.00008687511,0.00004749027,0.00014446171,0.0031771762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898916,0.00039378816,0.00004473212,0.00016009674,0.00028858223,0.00012357839],"domain_scores_gemma":[0.995808,0.0033233948,0.00031014366,0.00019688076,0.00032047057,0.00004104328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015143516,0.0011863953,0.0009921981,0.00042223808,0.0004052418,0.0012945499,0.0010241176,0.0009760295,0.0020215116],"category_scores_gemma":[0.01037496,0.00045017138,0.00024332959,0.0008325458,0.0012471955,0.0026261003,0.00092281785,0.0007331801,0.00050522055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008763557,0.00007315141,0.0005475403,0.00012248535,0.000038249123,0.000104899846,0.000089359164,0.94117403,0.010792325,0.025226044,0.00043945925,0.021304702],"study_design_scores_gemma":[0.000017970675,0.00010562144,0.00034526293,0.000013355092,0.000016169946,0.000090129986,0.000054050277,0.9798693,0.005683595,0.013312678,0.00047775707,0.000014091953],"about_ca_topic_score_codex":0.0008242493,"about_ca_topic_score_gemma":0.0009135433,"teacher_disagreement_score":0.0020215116,"about_ca_system_score_codex":0.0009905017,"about_ca_system_score_gemma":0.0009920968,"threshold_uncertainty_score":0.0080087185},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60756814,0.0006473504,0.38641134,0.00013217572,0.00003179292,0.00003391851,0.000045648874,0.0001581099,0.0049715466],"genre_scores_gemma":[0.99279803,0.00015403995,0.006349112,0.00001769775,0.000008480669,0.000009505266,0.000008804089,0.000003964077,0.0006502786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999498,0.00016737528,0.000014856322,0.00008463461,0.00013391401,0.000101097285],"domain_scores_gemma":[0.99841666,0.00090251723,0.00021609668,0.0001678878,0.00023807706,0.00005874338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050992414,0.00074619637,0.0007070087,0.00029490257,0.00045957766,0.0006667099,0.00054902973,0.00048008896,0.00048387467],"category_scores_gemma":[0.0013730564,0.00022943362,0.00029889878,0.0006061924,0.00056101975,0.00076021405,0.0010202462,0.00044203937,0.00013780764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017060216,0.000057165114,0.0019573993,0.00010724492,0.00006868939,0.0006617015,0.0002918713,0.9469353,0.023100669,0.008107022,0.00021037181,0.01833188],"study_design_scores_gemma":[0.00000705562,0.000110585606,0.00032466764,0.0000032637163,0.000029805238,0.00013242623,0.00006098922,0.9942826,0.0029532542,0.0018560413,0.00023070801,0.000008748196],"about_ca_topic_score_codex":0.0016127848,"about_ca_topic_score_gemma":0.0017145935,"teacher_disagreement_score":0.0016127848,"about_ca_system_score_codex":0.00042439866,"about_ca_system_score_gemma":0.000351665,"threshold_uncertainty_score":0.0032067895},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027353193,0.00010368026,0.99386615,0.00009281951,0.000016237202,0.000018962188,0.000021045951,0.000034153163,0.0031115382],"genre_scores_gemma":[0.40633786,0.0011549091,0.5784237,0.0002717343,0.00011104753,0.0004818101,0.00015388042,0.00015123087,0.0129137505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955565,0.0002112049,0.0000137245615,0.000061672865,0.0001180383,0.00003962326],"domain_scores_gemma":[0.99952006,0.0002975541,0.000045151937,0.000035156383,0.00008299265,0.000019010065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000892858,0.0011971969,0.0008414841,0.00051458465,0.00030051806,0.00093159114,0.0008760051,0.0009871394,0.003878759],"category_scores_gemma":[0.0015816415,0.00045577798,0.0006271976,0.00086273236,0.00084261666,0.0015326878,0.0009775083,0.0008331637,0.00074991013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021439439,0.000019318557,0.000101098616,0.00005934162,0.000020143314,0.000059966107,0.00003847428,0.9413028,0.0028798599,0.042299237,0.00080390275,0.012394365],"study_design_scores_gemma":[0.000008063241,0.000027226808,0.000026163123,0.000005001441,0.0000043902087,0.000027169148,0.000010701268,0.98679405,0.00055780023,0.011929451,0.0006040569,0.0000059118197],"about_ca_topic_score_codex":0.0013839377,"about_ca_topic_score_gemma":0.0015335733,"teacher_disagreement_score":0.003878759,"about_ca_system_score_codex":0.000764669,"about_ca_system_score_gemma":0.00080282724,"threshold_uncertainty_score":0.012975812},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056828256,0.0014971023,0.98258346,0.000553898,0.0000933592,0.00003275623,0.00005219147,0.00005124974,0.009453151],"genre_scores_gemma":[0.7131592,0.00955559,0.2527711,0.00073630613,0.0010979637,0.0005810341,0.00014557852,0.00025285807,0.021700388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998987,0.00054465514,0.000033067354,0.00012776894,0.00020560273,0.00010194743],"domain_scores_gemma":[0.9982869,0.0012814845,0.000103275044,0.00006152952,0.00021988431,0.000046900932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019833085,0.0017952961,0.0011643908,0.00069864973,0.0004904856,0.0016471784,0.0013707372,0.0014438054,0.003043182],"category_scores_gemma":[0.0047026975,0.00056635996,0.00088480616,0.0010758184,0.0016604943,0.002131933,0.0014878226,0.002099541,0.00075842533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006407458,0.00004896061,0.00023296737,0.00023009515,0.000057940186,0.0002391874,0.00015732196,0.6891424,0.0038280974,0.28696737,0.0030755769,0.015956048],"study_design_scores_gemma":[0.000009485901,0.000043401567,0.00006680657,0.000023427661,0.000014826031,0.00004864413,0.0000268093,0.9325101,0.0005850881,0.06507073,0.0015865206,0.00001410652],"about_ca_topic_score_codex":0.0015633233,"about_ca_topic_score_gemma":0.0011353862,"teacher_disagreement_score":0.003043182,"about_ca_system_score_codex":0.0015003291,"about_ca_system_score_gemma":0.00078760815,"threshold_uncertainty_score":0.010885656},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046555556,0.00076161907,0.9474487,0.00018723341,0.00008349601,0.00006955739,0.000089943154,0.00051420025,0.0042897495],"genre_scores_gemma":[0.90689194,0.0006212594,0.090290464,0.0001309361,0.00006137612,0.000054959834,0.00008201425,0.000017976445,0.0018490704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994282,0.00016869264,0.000032669548,0.00008178577,0.00019652737,0.00009201456],"domain_scores_gemma":[0.9988875,0.0005364844,0.00012868075,0.00017414591,0.00023173497,0.000041483807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072449015,0.00085120666,0.0005441637,0.00055503246,0.00042127157,0.00061822,0.0009300892,0.00044006438,0.00097599695],"category_scores_gemma":[0.0017256227,0.00022303454,0.0005268111,0.000509972,0.00065650954,0.0010718466,0.00095261505,0.0006069358,0.00030133774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089147035,0.00014090312,0.0034256792,0.00048737772,0.00025585532,0.0011461709,0.0008805774,0.31373063,0.18115355,0.13616125,0.0038172647,0.35790926],"study_design_scores_gemma":[0.000054760316,0.00053908944,0.00062375725,0.000035958856,0.00016248357,0.0013103492,0.00009902157,0.9272334,0.04323938,0.019220728,0.007419723,0.000061474624],"about_ca_topic_score_codex":0.00090027944,"about_ca_topic_score_gemma":0.0016129913,"teacher_disagreement_score":0.00097599695,"about_ca_system_score_codex":0.00040315703,"about_ca_system_score_gemma":0.00059694034,"threshold_uncertainty_score":0.0038315654},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001956141,0.00028386974,0.98731065,0.0003390821,0.0000741184,0.00004753604,0.00018510464,0.00007718863,0.009726254],"genre_scores_gemma":[0.57723117,0.0031995825,0.3920929,0.0008298282,0.0004721669,0.001144038,0.0008696438,0.00015813197,0.024002474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980996,0.000837738,0.00007552495,0.0002893086,0.0005026349,0.00019517048],"domain_scores_gemma":[0.9968188,0.0019870962,0.00028591065,0.0005281439,0.0002616455,0.0001184133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017386707,0.0012556519,0.0009090711,0.0011939975,0.00074634043,0.0018098708,0.0023402995,0.0016503182,0.004780655],"category_scores_gemma":[0.0056044003,0.0004565498,0.0009865937,0.0015001319,0.0024225807,0.0028348041,0.0030456248,0.0036078705,0.0008045431],"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.000018278308,0.000011679869,0.00008666346,0.000046153647,0.000014667955,0.00007701328,0.000044335862,0.1977088,0.00065315317,0.7907222,0.0019434768,0.008673586],"study_design_scores_gemma":[0.0000064098263,0.000019199235,0.000049333466,0.000031220607,0.000009308782,0.00009120263,0.000018152074,0.63628614,0.0004013903,0.3571722,0.0058979266,0.00001758202],"about_ca_topic_score_codex":0.002008271,"about_ca_topic_score_gemma":0.001838127,"teacher_disagreement_score":0.004780655,"about_ca_system_score_codex":0.002255381,"about_ca_system_score_gemma":0.0013289802,"threshold_uncertainty_score":0.016363978},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22710909,0.0072746915,0.7255497,0.0012878138,0.00015342915,0.00012239067,0.00037644192,0.00093508174,0.03719139],"genre_scores_gemma":[0.9858893,0.0014726517,0.010944378,0.000104661296,0.00009121523,0.000059765727,0.00007621107,0.000053363106,0.0013084123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829644,0.00058941817,0.000076681434,0.00023316599,0.00059128564,0.0002129985],"domain_scores_gemma":[0.9930027,0.0040058536,0.0010462648,0.00074752385,0.0010527957,0.0001447436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023288357,0.0011935794,0.0011926498,0.0009030587,0.00064622576,0.0014065579,0.0008643677,0.001132158,0.0013684538],"category_scores_gemma":[0.013432906,0.00059228134,0.00047303477,0.0012505751,0.0017152432,0.0020517695,0.0013452818,0.0010382165,0.00046796747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014427878,0.000055122015,0.002056444,0.0002834897,0.00006753291,0.00085440825,0.00042522055,0.8344899,0.014796898,0.12012992,0.0020017251,0.024695028],"study_design_scores_gemma":[0.0000049211394,0.0000520627,0.00063750334,0.000024031353,0.000012689867,0.0002589586,0.00005418959,0.9852208,0.001133035,0.012182953,0.00039429087,0.000024581726],"about_ca_topic_score_codex":0.001851291,"about_ca_topic_score_gemma":0.0010420498,"teacher_disagreement_score":0.0023288357,"about_ca_system_score_codex":0.0013842019,"about_ca_system_score_gemma":0.00062711514,"threshold_uncertainty_score":0.012316227},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03440325,0.00271359,0.9305945,0.00033652005,0.00015464098,0.00006674803,0.000076754885,0.0003310517,0.0313229],"genre_scores_gemma":[0.8991926,0.0026485743,0.092970885,0.00017236502,0.00021292845,0.000065002896,0.00008038959,0.00006835491,0.004588996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989759,0.0003787591,0.000040430376,0.00017367153,0.00029403364,0.0001372103],"domain_scores_gemma":[0.9973368,0.0017544422,0.00026956404,0.00038497883,0.00020922016,0.000045025907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009883186,0.0015843825,0.001118469,0.00067692,0.00060756644,0.0010170189,0.0011695253,0.00094864116,0.002439457],"category_scores_gemma":[0.0041249967,0.00025857924,0.0006745067,0.0008778249,0.0011313522,0.0017201196,0.0012685203,0.0006607472,0.00072140846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025126882,0.00010596558,0.00090980757,0.00047719383,0.00017022205,0.00071384205,0.00020653597,0.63828295,0.03990749,0.175916,0.0025429956,0.14051574],"study_design_scores_gemma":[0.000054720957,0.00057954126,0.00043029583,0.00012420124,0.00021529065,0.0015132135,0.000113901835,0.8778392,0.032513134,0.07184162,0.01471557,0.000059247297],"about_ca_topic_score_codex":0.00049343915,"about_ca_topic_score_gemma":0.0005891038,"teacher_disagreement_score":0.002439457,"about_ca_system_score_codex":0.0005223712,"about_ca_system_score_gemma":0.0004910925,"threshold_uncertainty_score":0.00816083},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03787248,0.0017295682,0.9539664,0.00045259253,0.00016509203,0.00007817055,0.00006987997,0.00038598545,0.005279873],"genre_scores_gemma":[0.76535845,0.0015121686,0.22947769,0.000162419,0.00025483564,0.00019294245,0.00016022119,0.000059027578,0.0028222455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949515,0.00021464762,0.000019467443,0.00005879595,0.00012775703,0.00008427378],"domain_scores_gemma":[0.9994692,0.00030104912,0.000044146334,0.000056684905,0.000106266976,0.00002263938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007604202,0.00030165623,0.00038061026,0.0005201163,0.00076132943,0.0005986765,0.0007450485,0.00059286674,0.0010935591],"category_scores_gemma":[0.0015062153,0.00017006461,0.00028186067,0.0006323439,0.00033359922,0.00091753335,0.00070139125,0.0005390661,0.00024147694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023543579,0.00013927961,0.002372768,0.00050168927,0.00008375139,0.00043757696,0.00024338085,0.54306424,0.029274665,0.11351427,0.008720859,0.30141208],"study_design_scores_gemma":[0.000015736548,0.000066419096,0.00028292165,0.00001710886,0.0000116217425,0.00008564724,0.000031155723,0.9723699,0.0036275561,0.018019244,0.0054620453,0.000010750631],"about_ca_topic_score_codex":0.00091492094,"about_ca_topic_score_gemma":0.0009934627,"teacher_disagreement_score":0.0010935591,"about_ca_system_score_codex":0.00056151673,"about_ca_system_score_gemma":0.00033035706,"threshold_uncertainty_score":0.0040741563},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009252525,0.049827974,0.57166535,0.0016063749,0.0032576385,0.00009664112,0.00008185197,0.00048774492,0.3637239],"genre_scores_gemma":[0.38999704,0.06341771,0.12166981,0.0018088684,0.0048700934,0.00049355923,0.00026186384,0.00035437528,0.41712674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996985,0.00007769074,0.000010329259,0.000044615314,0.00014006889,0.000028841985],"domain_scores_gemma":[0.9996637,0.00019401486,0.000015671554,0.000057603655,0.0000527233,0.000016268275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036202173,0.0007485539,0.00039709877,0.00044522606,0.0004577265,0.0011280768,0.00068704993,0.00077949086,0.0040568225],"category_scores_gemma":[0.0010319665,0.00034320363,0.00022808461,0.00087746285,0.0010040604,0.0016171648,0.0010005455,0.0015083825,0.0017148113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002264509,0.000043918626,0.000073381845,0.00028842312,0.000015178277,0.00007426809,0.00029938863,0.014294712,0.0025269473,0.7742794,0.025517648,0.18256405],"study_design_scores_gemma":[0.000010673619,0.00006975716,0.00021992938,0.00018603083,0.000023817074,0.00028394,0.00011318669,0.057700206,0.0024224739,0.6535107,0.2854321,0.000027233436],"about_ca_topic_score_codex":0.00044756598,"about_ca_topic_score_gemma":0.00042905117,"teacher_disagreement_score":0.0040568225,"about_ca_system_score_codex":0.0005898935,"about_ca_system_score_gemma":0.00048745197,"threshold_uncertainty_score":0.013571382},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22906369,0.002578367,0.74987274,0.0006528798,0.00007144192,0.00004779631,0.00032229128,0.0003391272,0.017051807],"genre_scores_gemma":[0.9927066,0.0006785703,0.005423807,0.0000398754,0.00003073871,0.000025961277,0.00005983141,0.000020603211,0.0010139659],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881196,0.0005217378,0.000052285624,0.00011100973,0.00032827386,0.00017477326],"domain_scores_gemma":[0.9937358,0.004467716,0.00064680696,0.0003729253,0.0006509968,0.00012581922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022407167,0.0007795165,0.0010132336,0.0008698149,0.00050832465,0.0009673504,0.001067444,0.00068893196,0.0013594669],"category_scores_gemma":[0.0075094295,0.00035337493,0.00036277348,0.0009549104,0.0011911364,0.0014803156,0.001008149,0.0006304955,0.0002486842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090100795,0.000018818084,0.0012575198,0.00010719916,0.000037129663,0.00046765016,0.00016131945,0.9413712,0.002521439,0.046431188,0.0007226486,0.0068137273],"study_design_scores_gemma":[0.0000023133546,0.000011970851,0.00023729372,0.0000063812513,0.0000055822525,0.00006851959,0.000027384336,0.9898727,0.00024094712,0.009394305,0.00012649027,0.000006088778],"about_ca_topic_score_codex":0.0021841896,"about_ca_topic_score_gemma":0.0011308054,"teacher_disagreement_score":0.0022407167,"about_ca_system_score_codex":0.0017091492,"about_ca_system_score_gemma":0.00053769414,"threshold_uncertainty_score":0.012400806},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024147423,0.00036569868,0.95976126,0.0004828675,0.00019557272,0.00015805686,0.00006805855,0.0014047576,0.013416332],"genre_scores_gemma":[0.63552123,0.0008203511,0.35246813,0.0003226193,0.00012235138,0.00035468367,0.00025073698,0.00014068892,0.009999215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997639,0.000040909446,0.000011876649,0.000048926213,0.000097756674,0.000036558104],"domain_scores_gemma":[0.99975103,0.000041271356,0.000019298683,0.000048915783,0.000104010294,0.0000354251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022838057,0.00037926016,0.00034557542,0.0004850742,0.00071928446,0.00068783644,0.0011920859,0.0007466791,0.0013418506],"category_scores_gemma":[0.0005220743,0.00021021935,0.00033436113,0.0005173092,0.00061348215,0.0014641462,0.0010210386,0.0009771521,0.00040882613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031305847,0.00020171942,0.0012305803,0.0003158037,0.00008487183,0.0009791421,0.0005934155,0.20949309,0.18041009,0.36119446,0.01140251,0.23378122],"study_design_scores_gemma":[0.000042571068,0.00018535975,0.00050234003,0.000034501478,0.00005370152,0.00050422276,0.0000794109,0.8920562,0.034796,0.040677153,0.031001845,0.00006663451],"about_ca_topic_score_codex":0.0036990829,"about_ca_topic_score_gemma":0.0026155668,"teacher_disagreement_score":0.0036990829,"about_ca_system_score_codex":0.00090834254,"about_ca_system_score_gemma":0.0009087685,"threshold_uncertainty_score":0.0073551536},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065443455,0.00022557405,0.9875658,0.00025891804,0.000057978414,0.00008256331,0.000024058454,0.00004851305,0.0051923343],"genre_scores_gemma":[0.7796523,0.0013023581,0.21139087,0.0003244136,0.0001539599,0.0005292536,0.000066516826,0.000063830885,0.0065164967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997875,0.0010301877,0.00006867292,0.00022181508,0.00044714264,0.000357197],"domain_scores_gemma":[0.9989152,0.000610416,0.00011205918,0.000059640202,0.00017255524,0.00013015616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024865249,0.0018041271,0.0013570667,0.0007220901,0.0010296367,0.0023978222,0.0028346935,0.0016507163,0.0030909155],"category_scores_gemma":[0.0031387527,0.0006374084,0.0012284771,0.0008631607,0.002144099,0.0031954038,0.0019551467,0.0025901513,0.00041642698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004476056,0.000083306935,0.00029303494,0.00008539759,0.000064813335,0.00021690823,0.000165515,0.6242652,0.00168397,0.35721782,0.0015876679,0.014291601],"study_design_scores_gemma":[0.000011920806,0.000041324325,0.000029093904,0.000008296485,0.000012028323,0.000027454395,0.000027246146,0.9296406,0.00021147694,0.06904609,0.000933501,0.000010957931],"about_ca_topic_score_codex":0.003608102,"about_ca_topic_score_gemma":0.0037457033,"teacher_disagreement_score":0.003608102,"about_ca_system_score_codex":0.0021771134,"about_ca_system_score_gemma":0.0030818367,"threshold_uncertainty_score":0.015796185},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7560129,0.00070622977,0.22907463,0.0006869623,0.00027983935,0.00015675575,0.00042211465,0.0011764868,0.011484125],"genre_scores_gemma":[0.9786083,0.0001606374,0.01967804,0.00012838302,0.000038469603,0.000051610547,0.00014991942,0.00004598092,0.0011385462],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716824,0.0009061335,0.00016028754,0.0004791435,0.0008224668,0.0004637751],"domain_scores_gemma":[0.98454684,0.010288576,0.0012797026,0.0021466233,0.0014845476,0.000253713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024116212,0.00095066655,0.00060621375,0.0006619968,0.00066771527,0.00076895213,0.0010406838,0.0013444377,0.0027089794],"category_scores_gemma":[0.014498081,0.00027611104,0.00039258515,0.0005199688,0.0013723569,0.0013067574,0.001022492,0.001065361,0.00043231528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004120047,0.0013029508,0.009464876,0.0008568784,0.0003664327,0.0011971128,0.00067838305,0.39008945,0.4895537,0.015665418,0.0019175621,0.08478715],"study_design_scores_gemma":[0.00030453972,0.008341378,0.009390804,0.00016127367,0.00021347418,0.0016059958,0.00057121384,0.46682024,0.500704,0.0073392815,0.004392534,0.0001553445],"about_ca_topic_score_codex":0.00070090784,"about_ca_topic_score_gemma":0.0004376249,"teacher_disagreement_score":0.0027089794,"about_ca_system_score_codex":0.0005030463,"about_ca_system_score_gemma":0.00033516795,"threshold_uncertainty_score":0.012754023},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17136621,0.0017928153,0.8145553,0.00080023176,0.00017533553,0.00012016425,0.00017574467,0.00020332956,0.010810845],"genre_scores_gemma":[0.9685499,0.000836653,0.026723268,0.00008058618,0.00010328502,0.00010542796,0.00007366918,0.000057167985,0.0034699973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999303,0.00028052292,0.000017479824,0.000061967105,0.00016725599,0.00016979303],"domain_scores_gemma":[0.9943263,0.004788332,0.00035562235,0.0000914473,0.00029409118,0.0001442421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001662113,0.0006054152,0.00068934576,0.00064918667,0.00043089953,0.000701154,0.0007291367,0.00058914983,0.0012574783],"category_scores_gemma":[0.007861325,0.00034266795,0.00023082782,0.0007275316,0.0011424621,0.0007843759,0.00067204144,0.000764237,0.00013801054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105881256,0.000033891974,0.00019154837,0.00007586328,0.000010946573,0.00004794357,0.000073903146,0.9532201,0.0020607896,0.03868035,0.00074734836,0.0047513912],"study_design_scores_gemma":[0.0000113726155,0.00002242086,0.000049367845,0.0000028649065,0.0000034924262,0.000006496008,0.000011807168,0.9921072,0.0002421201,0.007343396,0.00019581417,0.0000036435133],"about_ca_topic_score_codex":0.008607085,"about_ca_topic_score_gemma":0.005347568,"teacher_disagreement_score":0.008607085,"about_ca_system_score_codex":0.003000997,"about_ca_system_score_gemma":0.0017029081,"threshold_uncertainty_score":0.021773815},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038909227,0.00031598363,0.95550895,0.000121134166,0.0001097145,0.00010970079,0.00007343334,0.00041969397,0.0044321143],"genre_scores_gemma":[0.79434997,0.00026403333,0.19633724,0.00007578062,0.00007057215,0.00020951794,0.00015386411,0.000039032333,0.008500065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999703,0.00009836933,0.000015027932,0.00005809046,0.00008047452,0.000045061337],"domain_scores_gemma":[0.99959403,0.00012350755,0.00003919292,0.00010209084,0.00010193849,0.000039307648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040152256,0.00033215684,0.0004683995,0.00029432902,0.00055538304,0.00046605995,0.0010183394,0.00035750685,0.002408787],"category_scores_gemma":[0.0011146134,0.00014476103,0.0001751061,0.00041779186,0.00030672198,0.0006577436,0.0007134634,0.00039434663,0.00070613436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001201651,0.00034748975,0.0005924318,0.0001612323,0.00009416605,0.00027791306,0.0003171041,0.31996793,0.112304874,0.073246054,0.008619492,0.48286968],"study_design_scores_gemma":[0.00010848225,0.00028688123,0.00021872176,0.000008309,0.000027566204,0.00017773798,0.000028760483,0.9775904,0.008891812,0.006614549,0.0060239453,0.000022847127],"about_ca_topic_score_codex":0.0013323538,"about_ca_topic_score_gemma":0.0028213556,"teacher_disagreement_score":0.002408787,"about_ca_system_score_codex":0.00049514096,"about_ca_system_score_gemma":0.0006561417,"threshold_uncertainty_score":0.008058131},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56350183,0.0007908876,0.4280522,0.00021758818,0.00005310315,0.000028787412,0.00008273173,0.00027437473,0.0069984947],"genre_scores_gemma":[0.9954802,0.00007057052,0.003976611,0.000012511141,0.000006281812,0.0000039676406,0.000011583214,0.000002327114,0.00043595873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984527,0.000043448417,0.0000044726053,0.000028700293,0.000033082197,0.000044866152],"domain_scores_gemma":[0.9998275,0.000059138798,0.000029700606,0.000028763518,0.000031464562,0.000023450499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014766504,0.00028542485,0.0002870669,0.00021045201,0.00029550318,0.00034492684,0.00039159204,0.00038506952,0.0002664761],"category_scores_gemma":[0.00039848572,0.00011270556,0.00017084248,0.00026696283,0.00032372802,0.00034350788,0.0005131344,0.00017961221,0.000085946296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024452267,0.000037671027,0.0028478168,0.000043747696,0.000056955218,0.0016504343,0.00012645929,0.8965632,0.052689236,0.008453032,0.0009583634,0.036328502],"study_design_scores_gemma":[0.0000058683772,0.000062218336,0.0005241096,0.0000019385063,0.000010544247,0.00014139188,0.00002762431,0.99593085,0.0021565426,0.00077640754,0.00035638685,0.000005975361],"about_ca_topic_score_codex":0.004666232,"about_ca_topic_score_gemma":0.0033737267,"teacher_disagreement_score":0.004666232,"about_ca_system_score_codex":0.00041445022,"about_ca_system_score_gemma":0.00017652249,"threshold_uncertainty_score":0.009278178},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07391473,0.00056084455,0.9208972,0.0008019489,0.000054438835,0.00005036916,0.00006316533,0.00031771444,0.0033396764],"genre_scores_gemma":[0.9764864,0.0001300704,0.02181114,0.00014792022,0.000021440164,0.0000567454,0.000039804552,0.000023519899,0.0012829195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999658,0.00011983076,0.000012945857,0.000060244744,0.00006293493,0.00008607585],"domain_scores_gemma":[0.9978683,0.001464891,0.00021988792,0.000076122735,0.00024846446,0.00012233459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011983692,0.00071309705,0.0010625331,0.0003610014,0.00033221924,0.0007335306,0.001222812,0.0009402891,0.0010112933],"category_scores_gemma":[0.004039108,0.00038906717,0.00029870452,0.0004352742,0.001027707,0.0011057984,0.0009290649,0.0012292536,0.00010437444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025907646,0.000022557713,0.00040386207,0.000015036323,0.000012978226,0.000031170457,0.00001581879,0.98891896,0.00025167863,0.0033111223,0.0003081964,0.0066826893],"study_design_scores_gemma":[0.0000021482767,0.000003832633,0.00001796916,8.7749294e-7,0.0000012479851,0.0000017543977,0.0000019041519,0.99908173,0.000032283533,0.00082741625,0.000028095244,8.1486445e-7],"about_ca_topic_score_codex":0.009325801,"about_ca_topic_score_gemma":0.007961505,"teacher_disagreement_score":0.009325801,"about_ca_system_score_codex":0.0012820142,"about_ca_system_score_gemma":0.0016407798,"threshold_uncertainty_score":0.018543065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052346587,0.00026439558,0.9919755,0.00011664451,0.000026737025,0.00003209018,0.00002720429,0.0000899221,0.0022329197],"genre_scores_gemma":[0.52098495,0.0010111954,0.4718513,0.00019693177,0.00010711437,0.0002142464,0.00009271054,0.00003499942,0.0055065607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991468,0.00036514658,0.00003564463,0.00015436644,0.00023013915,0.00006798451],"domain_scores_gemma":[0.9994112,0.00021447349,0.00009566798,0.000103695595,0.00014434032,0.000030573152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008290996,0.0008948364,0.0006942205,0.00031079858,0.00035972652,0.0006710693,0.0012532293,0.00086653035,0.0012593642],"category_scores_gemma":[0.0012585783,0.00026464098,0.00038671005,0.00059914915,0.00078388344,0.0011422009,0.0007091309,0.0008907231,0.0005651181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014957518,0.000109578374,0.00034099104,0.00027103064,0.000062795116,0.00025617838,0.00020987773,0.7195461,0.03461403,0.13427545,0.0029683267,0.10719606],"study_design_scores_gemma":[0.000029258683,0.00016537315,0.000050868486,0.000011562873,0.000013402233,0.00013402612,0.000022874714,0.9726165,0.0064392965,0.017993752,0.0025024083,0.000020817459],"about_ca_topic_score_codex":0.0006392917,"about_ca_topic_score_gemma":0.0010305346,"teacher_disagreement_score":0.0012593642,"about_ca_system_score_codex":0.00061158853,"about_ca_system_score_gemma":0.00072100875,"threshold_uncertainty_score":0.004437387},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004687021,0.00016080956,0.9933929,0.00004444197,0.000014609079,0.000028541632,0.000020641828,0.000092629525,0.0015585357],"genre_scores_gemma":[0.2317174,0.0004272094,0.7634281,0.00010778644,0.00006499799,0.00026376924,0.00017268353,0.000058441514,0.0037596815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990687,0.0002149007,0.000075516415,0.00014534005,0.0004183596,0.000077206736],"domain_scores_gemma":[0.999166,0.0003659526,0.00011303906,0.000108023014,0.00022251061,0.000024522322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010126946,0.0011774169,0.0007795094,0.0007805199,0.00045756667,0.0012160955,0.0010828457,0.00080244784,0.0020037415],"category_scores_gemma":[0.0027725776,0.00044230683,0.0006208494,0.0013228089,0.0004634022,0.0015279694,0.0013420352,0.00082134205,0.00088871486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001636197,0.000048346385,0.0005576432,0.0001112848,0.00010419442,0.00010113461,0.00014475305,0.4962727,0.014925586,0.041370433,0.0016391897,0.44456112],"study_design_scores_gemma":[0.0000145110325,0.000075974465,0.00011158367,0.000008527172,0.000019552761,0.00010401773,0.000010424699,0.9849377,0.003165752,0.009601325,0.0019353773,0.00001532976],"about_ca_topic_score_codex":0.0010406128,"about_ca_topic_score_gemma":0.0012408143,"teacher_disagreement_score":0.0020037415,"about_ca_system_score_codex":0.00062329177,"about_ca_system_score_gemma":0.00085552025,"threshold_uncertainty_score":0.0067031384},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006266896,0.0003816387,0.9887866,0.0005020449,0.000042207008,0.000022794133,0.00008131604,0.00004208799,0.0038744921],"genre_scores_gemma":[0.53869516,0.0033728797,0.4491166,0.0009859683,0.0006961303,0.00040254634,0.0003996503,0.00016347508,0.006167682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996967,0.0015273199,0.00012252755,0.00038218647,0.0007963099,0.00020466968],"domain_scores_gemma":[0.99138075,0.0053626583,0.00077000994,0.0011613166,0.0010789275,0.00024643278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037180067,0.0009796956,0.0013800892,0.001611734,0.0009035682,0.0026258382,0.002162968,0.0017535617,0.0011819719],"category_scores_gemma":[0.0135513805,0.00068979856,0.0010030034,0.0019690897,0.004750783,0.005845589,0.0041262093,0.0040404564,0.00049059006],"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.000029038298,0.0000136052,0.00019634554,0.000050572693,0.000017138333,0.00005175323,0.00011230672,0.08858038,0.0005985875,0.8999513,0.00063156005,0.009767457],"study_design_scores_gemma":[0.000005529793,0.000017167717,0.000044487308,0.000016368853,0.0000050894955,0.000039684146,0.000019348976,0.3497235,0.0003002588,0.6486096,0.0012021778,0.000016851676],"about_ca_topic_score_codex":0.0013358168,"about_ca_topic_score_gemma":0.0010357305,"teacher_disagreement_score":0.0037180067,"about_ca_system_score_codex":0.0018015004,"about_ca_system_score_gemma":0.0016352875,"threshold_uncertainty_score":0.019662917},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052842095,0.00044120222,0.9429615,0.00016411663,0.000021259317,0.000045305085,0.000040645005,0.00008693472,0.0033969956],"genre_scores_gemma":[0.8403104,0.00052719616,0.15676734,0.000079617945,0.000027313836,0.000092086055,0.00005725272,0.000017373986,0.002121335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900764,0.00039353396,0.00004151302,0.0001523685,0.00031354997,0.00009129934],"domain_scores_gemma":[0.9985592,0.0010293084,0.0001486904,0.00012371359,0.0001148873,0.000024209647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013052201,0.0005676613,0.0006296221,0.00032146167,0.0002922294,0.00095603743,0.00046637212,0.00092974625,0.0006809806],"category_scores_gemma":[0.0035973028,0.0004134584,0.00031487775,0.0003214807,0.0012080185,0.0009673094,0.0006807901,0.00056561496,0.00023560977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019440574,0.00011963988,0.000992175,0.00024037452,0.00006258911,0.00026017998,0.0003143592,0.68426627,0.0315206,0.20012625,0.0011869866,0.08071612],"study_design_scores_gemma":[0.00002956607,0.00010014548,0.00021272148,0.000012762424,0.000014138307,0.00013554841,0.00003281748,0.9703094,0.0058893603,0.022550723,0.0006942821,0.000018546336],"about_ca_topic_score_codex":0.0009484947,"about_ca_topic_score_gemma":0.001518973,"teacher_disagreement_score":0.0013052201,"about_ca_system_score_codex":0.0005618476,"about_ca_system_score_gemma":0.0010949324,"threshold_uncertainty_score":0.0069027543},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06071823,0.0023578447,0.9262987,0.0003000011,0.0000425419,0.00010955844,0.000059817623,0.0002960968,0.009817207],"genre_scores_gemma":[0.93297184,0.0013606074,0.06389242,0.000044039705,0.00006246185,0.00010342805,0.000060863476,0.000044581528,0.0014597048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767643,0.0012539474,0.00011222975,0.00020681777,0.0005740351,0.0001764563],"domain_scores_gemma":[0.9965953,0.0021028668,0.0004115119,0.00022320446,0.00062430406,0.000042723572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003009216,0.0011422813,0.0007149565,0.0006525667,0.00033422568,0.0014547588,0.0005602914,0.0006516187,0.0011231899],"category_scores_gemma":[0.011017634,0.00037686952,0.00026957886,0.00060107897,0.00067717844,0.0013134361,0.0005935517,0.0005214034,0.00030702128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010235341,0.000047185345,0.0005973038,0.000114850554,0.00002947691,0.00007492907,0.00007283918,0.91226315,0.0064368364,0.0266795,0.0007465707,0.052834984],"study_design_scores_gemma":[0.0000074759,0.000085806125,0.00016776728,0.000011564158,0.0000111566,0.00003661927,0.000018848763,0.991542,0.0015658238,0.0061075934,0.0004379208,0.0000074221025],"about_ca_topic_score_codex":0.0011155141,"about_ca_topic_score_gemma":0.0010946123,"teacher_disagreement_score":0.003009216,"about_ca_system_score_codex":0.0012816295,"about_ca_system_score_gemma":0.0008524184,"threshold_uncertainty_score":0.01591444},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38866672,0.0044014202,0.58505255,0.0008973183,0.00016552937,0.00016623971,0.00018444736,0.00044253413,0.020023229],"genre_scores_gemma":[0.9843286,0.0006763723,0.013967573,0.000043325592,0.00002825958,0.000045854562,0.000052603154,0.000030063924,0.0008273705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817204,0.00054345356,0.000048135033,0.00014701099,0.0007413692,0.0003480055],"domain_scores_gemma":[0.9907348,0.006365585,0.0005677427,0.00046948856,0.001735284,0.00012705121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029483347,0.00081664784,0.0005146296,0.0015841993,0.0007157991,0.0010266775,0.00071475276,0.00083328586,0.00075342786],"category_scores_gemma":[0.013419994,0.00026308227,0.00037356373,0.0012674188,0.001203905,0.0014195626,0.000798596,0.00080717314,0.00011308417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006504877,0.000044298366,0.00124987,0.00005486439,0.000016292946,0.00007202338,0.000064061656,0.9522632,0.0025661606,0.03000948,0.000477523,0.013117227],"study_design_scores_gemma":[0.0000016308899,0.000017526898,0.00021812775,0.000004926392,0.000003414232,0.000016182837,0.000010163176,0.9971192,0.0004988346,0.0020025722,0.00010259619,0.0000048302736],"about_ca_topic_score_codex":0.013812566,"about_ca_topic_score_gemma":0.0059936726,"teacher_disagreement_score":0.013812566,"about_ca_system_score_codex":0.0036490855,"about_ca_system_score_gemma":0.0017116341,"threshold_uncertainty_score":0.02746433},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3651822,0.0022780052,0.61674905,0.00082114467,0.000084696774,0.00011085082,0.00017169926,0.0002199427,0.014382402],"genre_scores_gemma":[0.9896437,0.000621483,0.008531272,0.00007730539,0.00003673258,0.000053441767,0.000035310255,0.000014501876,0.0009863155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985581,0.00077064324,0.00003484583,0.00010217107,0.00031448764,0.00021973313],"domain_scores_gemma":[0.99253875,0.005769026,0.00062459323,0.00030870503,0.0005917876,0.00016702997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022190593,0.0012590578,0.00085952523,0.00065834506,0.00036909844,0.0010371484,0.00082345953,0.000729192,0.00095520116],"category_scores_gemma":[0.008236608,0.0002668376,0.0003438401,0.0012410164,0.0019306254,0.0010028821,0.0013083128,0.0006382932,0.00016335984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011225024,0.000017206436,0.00066323,0.00011759283,0.000048663704,0.00043730685,0.0002205383,0.8879448,0.004031181,0.09864161,0.0007957413,0.006969923],"study_design_scores_gemma":[0.000015507565,0.000055325916,0.00025212116,0.000015290192,0.000014144543,0.00011778215,0.000033282766,0.96414244,0.00059046794,0.034434088,0.00031483572,0.000014667768],"about_ca_topic_score_codex":0.0025885443,"about_ca_topic_score_gemma":0.0016015245,"teacher_disagreement_score":0.0025885443,"about_ca_system_score_codex":0.0014022907,"about_ca_system_score_gemma":0.00074847473,"threshold_uncertainty_score":0.011735678},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007947905,0.00016871233,0.98888856,0.00010378227,0.000023081528,0.000048640057,0.000038446127,0.00019078254,0.002590128],"genre_scores_gemma":[0.40759858,0.0008810563,0.5848807,0.000205262,0.00009273808,0.00033902095,0.0003896849,0.00011807986,0.0054949266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990501,0.0003061948,0.00004208442,0.000107224936,0.0003863215,0.00010806941],"domain_scores_gemma":[0.9982015,0.0009592456,0.00020074213,0.00016842759,0.00042783798,0.000042235675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007960477,0.0007234904,0.00050091493,0.00058080564,0.0003081106,0.00068600144,0.00062624074,0.0006100121,0.0012798524],"category_scores_gemma":[0.004428214,0.00031681184,0.0003321467,0.00073120336,0.00061995775,0.0008327708,0.0008200653,0.000785995,0.0006636376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010649985,0.000043122753,0.0004985969,0.00013256319,0.000028261908,0.000104789935,0.00012449549,0.81959146,0.013832945,0.064878836,0.0019221486,0.098736204],"study_design_scores_gemma":[0.000012432796,0.000054576532,0.000043692005,0.0000120190725,0.0000047874723,0.000045901455,0.000009163183,0.98698956,0.0037684233,0.007516393,0.001536426,0.000006655596],"about_ca_topic_score_codex":0.0019116637,"about_ca_topic_score_gemma":0.0029893976,"teacher_disagreement_score":0.0019116637,"about_ca_system_score_codex":0.00079977786,"about_ca_system_score_gemma":0.0014761531,"threshold_uncertainty_score":0.00580281},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2601514,0.0051113577,0.6945493,0.0014077149,0.00017648652,0.00017434341,0.000032228367,0.00023975261,0.038157355],"genre_scores_gemma":[0.90609115,0.0022757836,0.088467956,0.00009385893,0.00006624882,0.00005591999,0.000025380135,0.000044528362,0.00287919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789363,0.0012035664,0.00004279412,0.00009203306,0.0006260624,0.00014183398],"domain_scores_gemma":[0.9912135,0.007153461,0.00021255121,0.0005226379,0.00078449614,0.00011340703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022718387,0.0003624475,0.00027550702,0.00047854945,0.00072420435,0.0010411221,0.0005935192,0.0007277445,0.0015486135],"category_scores_gemma":[0.009277028,0.00019202563,0.0002119383,0.0006147578,0.00096096063,0.0024861312,0.0010317783,0.001392148,0.00021959108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088154065,0.00042951433,0.0022634992,0.000687773,0.000066768196,0.000422248,0.0015571272,0.18730673,0.08887197,0.22015415,0.002227952,0.49513075],"study_design_scores_gemma":[0.000061450206,0.0010709229,0.0024882709,0.00022870966,0.00012592108,0.0006193787,0.00096047734,0.79405636,0.112103686,0.07418972,0.0140069,0.00008828263],"about_ca_topic_score_codex":0.0011219992,"about_ca_topic_score_gemma":0.0014057403,"teacher_disagreement_score":0.0022718387,"about_ca_system_score_codex":0.00067044573,"about_ca_system_score_gemma":0.00050519884,"threshold_uncertainty_score":0.012014806},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17099085,0.00080882956,0.81445736,0.00061439566,0.00009733145,0.00007242751,0.00019336579,0.00018994068,0.012575438],"genre_scores_gemma":[0.95313674,0.0011795099,0.040490482,0.00015374713,0.00023144713,0.00012915839,0.00012637295,0.000041553172,0.004510976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980477,0.0008325971,0.000068885536,0.00022281974,0.0004215849,0.00040642105],"domain_scores_gemma":[0.99357975,0.0044440185,0.0007578897,0.0006289346,0.00037927224,0.0002101004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00161102,0.00075779506,0.00069857744,0.0008217515,0.0009026896,0.0011842985,0.0006679075,0.00059545896,0.0020673906],"category_scores_gemma":[0.0055530337,0.00031008472,0.00040758165,0.0011329185,0.0021959613,0.0030273974,0.00179925,0.0012328265,0.00038776064],"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.00017797766,0.000039935043,0.0002766224,0.00009868421,0.000012858327,0.0002567426,0.00022072271,0.21250056,0.004423696,0.77194875,0.000961874,0.009081554],"study_design_scores_gemma":[0.000030425843,0.000101884216,0.00015263683,0.0000289153,0.000012334901,0.00014790063,0.00006887128,0.6842729,0.0024286348,0.3105938,0.0021271606,0.000034529974],"about_ca_topic_score_codex":0.0013527431,"about_ca_topic_score_gemma":0.00097115507,"teacher_disagreement_score":0.0020673906,"about_ca_system_score_codex":0.0010695272,"about_ca_system_score_gemma":0.0008741057,"threshold_uncertainty_score":0.008520007},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35228842,0.0019027805,0.640214,0.00034235237,0.0001266896,0.00007638375,0.00013183411,0.0010677153,0.0038498251],"genre_scores_gemma":[0.93251276,0.00045786225,0.06509083,0.000079014615,0.00009324093,0.00006213722,0.00011093289,0.0000802485,0.0015129297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920315,0.00025157406,0.00003176525,0.00009613246,0.00024110974,0.00017628833],"domain_scores_gemma":[0.9935167,0.0045498125,0.000268859,0.00055094576,0.00095041574,0.00016327041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012575226,0.00089024205,0.0011247729,0.0009188341,0.0007713638,0.00095455616,0.0012503826,0.00086508325,0.0012553344],"category_scores_gemma":[0.009179002,0.00041712268,0.00034398815,0.0012532341,0.0007204449,0.0017206143,0.0009149335,0.0007202736,0.00023402713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009134034,0.0002634905,0.0021537356,0.00012385193,0.00007960204,0.00014903664,0.00013723143,0.8584786,0.016842548,0.008672207,0.0020687073,0.11011763],"study_design_scores_gemma":[0.000014458231,0.00008719761,0.00018723648,0.0000034558536,0.000016011358,0.00003109029,0.000015819705,0.9961455,0.0022232286,0.0011416479,0.0001293234,0.0000049320925],"about_ca_topic_score_codex":0.0073440117,"about_ca_topic_score_gemma":0.010743948,"teacher_disagreement_score":0.0073440117,"about_ca_system_score_codex":0.0012828307,"about_ca_system_score_gemma":0.0017303086,"threshold_uncertainty_score":0.014602542},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012717505,0.0001858071,0.9850964,0.00011261572,0.000012191298,0.00003183763,0.000018223247,0.00005370078,0.0017716705],"genre_scores_gemma":[0.63153845,0.00064332894,0.36188725,0.00016864215,0.00003988939,0.00035922063,0.00010306026,0.00014521205,0.0051149023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991749,0.00042609606,0.000021696884,0.00011432391,0.000155868,0.000107010404],"domain_scores_gemma":[0.99813,0.0014109648,0.00015039995,0.00009648711,0.00015141962,0.000060716156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002483003,0.001121043,0.000957902,0.00042515362,0.00036625421,0.0010875164,0.0011806189,0.0009839779,0.0015666889],"category_scores_gemma":[0.005716457,0.0006374494,0.00052757794,0.00047155877,0.0015242079,0.0015081915,0.0014066786,0.0015896291,0.0003974358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005544326,0.000036820107,0.00017167226,0.00006443189,0.000022230039,0.00004595601,0.00006093247,0.95577276,0.0015433767,0.03213235,0.00032458076,0.009769462],"study_design_scores_gemma":[0.0000056897034,0.00001416296,0.000025841357,0.000004029739,0.0000024747362,0.0000067535716,0.000007546846,0.99310535,0.0003168712,0.0063593895,0.00014921559,0.0000027655583],"about_ca_topic_score_codex":0.0022441766,"about_ca_topic_score_gemma":0.0016715411,"teacher_disagreement_score":0.002483003,"about_ca_system_score_codex":0.0011709667,"about_ca_system_score_gemma":0.0014330953,"threshold_uncertainty_score":0.013131559},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08365531,0.00044617162,0.9062921,0.00020460642,0.000022825268,0.00006220572,0.00007079221,0.0002168019,0.009029239],"genre_scores_gemma":[0.92333955,0.00031912082,0.07418361,0.00008502016,0.000022824106,0.0001445442,0.000044698514,0.000042612017,0.0018180538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991916,0.00032658406,0.000023092016,0.00011175844,0.00013221466,0.00021478574],"domain_scores_gemma":[0.99816626,0.0014440676,0.00014014354,0.00008915578,0.00009583865,0.000064580934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015801371,0.0013872518,0.001104857,0.00048828934,0.0004177763,0.0011953361,0.0010038528,0.00091263716,0.0011641696],"category_scores_gemma":[0.0037673851,0.00044907242,0.0007868156,0.0007136028,0.0012191967,0.0009874866,0.0017109889,0.0009515543,0.00029236457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014506567,0.00006580202,0.00030178335,0.00016259434,0.00006118858,0.00020722761,0.00012691972,0.9395292,0.006460128,0.03778455,0.0005997113,0.01455586],"study_design_scores_gemma":[0.000019528981,0.000048091377,0.0000858742,0.000012035279,0.00001093312,0.000051446426,0.000027307282,0.97971785,0.0020856778,0.017604018,0.00032687822,0.000010293211],"about_ca_topic_score_codex":0.002070947,"about_ca_topic_score_gemma":0.0013393251,"teacher_disagreement_score":0.002070947,"about_ca_system_score_codex":0.00084013294,"about_ca_system_score_gemma":0.0012316287,"threshold_uncertainty_score":0.008356631},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.330149,0.0015164111,0.6621256,0.0003538518,0.0000547926,0.000052857955,0.00006633718,0.00037533703,0.005305854],"genre_scores_gemma":[0.9816058,0.00022300912,0.017579209,0.000024364846,0.000012359968,0.000015833595,0.000015224348,0.0000061206,0.0005179251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994436,0.00015234794,0.000021566564,0.00006092636,0.00020900789,0.00011252626],"domain_scores_gemma":[0.99899286,0.0004962042,0.00018524456,0.000106710584,0.00018938539,0.000029617655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006489256,0.0004725282,0.00028828578,0.0003472114,0.00045986555,0.00057386735,0.00060719537,0.00046838322,0.00048748267],"category_scores_gemma":[0.0020586045,0.00013995533,0.00021357494,0.00052380364,0.0005164342,0.00091888494,0.000558776,0.00033044524,0.00008900434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069531443,0.000107628584,0.003960545,0.00027461874,0.00007990623,0.0010084304,0.00042348835,0.6430992,0.11077542,0.058684945,0.0013193188,0.17957121],"study_design_scores_gemma":[0.000018130324,0.00029852352,0.0007139536,0.000023219132,0.000037740814,0.00040835093,0.000091111586,0.9648547,0.02565511,0.0060991966,0.001769802,0.000030145668],"about_ca_topic_score_codex":0.0030553509,"about_ca_topic_score_gemma":0.0035449534,"teacher_disagreement_score":0.0030553509,"about_ca_system_score_codex":0.00079502165,"about_ca_system_score_gemma":0.0006333581,"threshold_uncertainty_score":0.006075144},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017248979,0.0008921321,0.97399515,0.00026386342,0.00010220315,0.00010722388,0.00008952945,0.0002858011,0.007015155],"genre_scores_gemma":[0.676025,0.0014615986,0.3168714,0.00029794793,0.00005136681,0.00029409656,0.00016558748,0.00003650757,0.0047965283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994708,0.00015341776,0.000028047623,0.0000918986,0.00018755002,0.00006836708],"domain_scores_gemma":[0.9990884,0.0003262092,0.00012383808,0.00013713993,0.0002939232,0.000030384923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007104625,0.0006673803,0.00039727936,0.00047055364,0.0005060587,0.0006717617,0.0009708669,0.0005748752,0.001239577],"category_scores_gemma":[0.0018307021,0.00026999376,0.00028702506,0.0007372245,0.0006115705,0.001196583,0.0008815205,0.00080610975,0.00032600565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000300928,0.00014544629,0.0016807065,0.0005716664,0.00009715423,0.00050308945,0.00034503013,0.4524961,0.08204301,0.19689734,0.006096219,0.2588234],"study_design_scores_gemma":[0.000019204608,0.00013657326,0.00018388109,0.000040440955,0.000024172685,0.00020344039,0.000027518961,0.97143,0.009834011,0.011681079,0.006387705,0.000031983895],"about_ca_topic_score_codex":0.0028068894,"about_ca_topic_score_gemma":0.00522692,"teacher_disagreement_score":0.0028068894,"about_ca_system_score_codex":0.0010032634,"about_ca_system_score_gemma":0.0012691988,"threshold_uncertainty_score":0.0072792172},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005877044,0.00026835353,0.98845273,0.00010051891,0.000023160905,0.000055559372,0.000057223282,0.00010083652,0.0050644684],"genre_scores_gemma":[0.6318829,0.0012243686,0.36220273,0.00014723203,0.000066810615,0.0003326459,0.0002463064,0.00005425556,0.0038426658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998906,0.00028490636,0.000045168843,0.00012361242,0.0005097537,0.00013050945],"domain_scores_gemma":[0.9985423,0.0006651354,0.00015776743,0.00015763719,0.00043938117,0.000037807604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011471327,0.00066634186,0.00039544192,0.0006638669,0.00040516764,0.00077095226,0.0009292707,0.000436035,0.0015446453],"category_scores_gemma":[0.0030869157,0.00038121597,0.0003549466,0.000760538,0.0008270504,0.0010245304,0.0008761241,0.0007197768,0.000335538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055052256,0.000027297845,0.00054903957,0.00010828597,0.000023809214,0.000118453114,0.000096092255,0.79666334,0.010581889,0.13172503,0.0013058897,0.058745727],"study_design_scores_gemma":[0.000005754585,0.000031805746,0.00008242358,0.000011447666,0.0000070493334,0.00003535099,0.000009086516,0.9861221,0.0014949637,0.010960323,0.0012311797,0.000008590741],"about_ca_topic_score_codex":0.004987478,"about_ca_topic_score_gemma":0.0054098624,"teacher_disagreement_score":0.004987478,"about_ca_system_score_codex":0.001895312,"about_ca_system_score_gemma":0.0021578274,"threshold_uncertainty_score":0.013751507},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0912126,0.0014466606,0.8974691,0.000332001,0.00019757531,0.00009332752,0.00011492681,0.0006859992,0.008447843],"genre_scores_gemma":[0.7495644,0.00079258264,0.24474224,0.00024796263,0.00014637233,0.00010029895,0.00020659907,0.000076383214,0.0041231224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963605,0.00005094857,0.00001897445,0.000057757235,0.00018658904,0.000049663187],"domain_scores_gemma":[0.99887234,0.0003674875,0.000085475556,0.00025414364,0.0003646228,0.000055951285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043507342,0.00044243687,0.00030600347,0.00063293957,0.0003762602,0.00052873633,0.0004706442,0.0006011787,0.00095617137],"category_scores_gemma":[0.0022095987,0.00014076506,0.00020515588,0.0003539744,0.00046281706,0.00067441195,0.00074913545,0.00080100546,0.0004021535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068878493,0.00016694893,0.0020697617,0.00027634512,0.00004031693,0.0005499533,0.0002806233,0.12235024,0.35968703,0.09930531,0.0033250637,0.4112596],"study_design_scores_gemma":[0.0000441099,0.00028870805,0.00074831623,0.00008508797,0.000026534011,0.0010539492,0.00004749849,0.8469405,0.10931104,0.025074184,0.016314086,0.000065945824],"about_ca_topic_score_codex":0.00097444485,"about_ca_topic_score_gemma":0.0009753072,"teacher_disagreement_score":0.00097444485,"about_ca_system_score_codex":0.0005193096,"about_ca_system_score_gemma":0.00052125234,"threshold_uncertainty_score":0.003767848},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005822405,0.00035000223,0.9924845,0.00006746032,0.000011745686,0.0000152021075,0.000017802444,0.00009140552,0.0011394782],"genre_scores_gemma":[0.6029835,0.0015751227,0.39100483,0.00010000575,0.00007471743,0.00015250294,0.00010417883,0.000050467508,0.0039547235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992975,0.00035030843,0.0000275011,0.00010115647,0.0001639536,0.000059548882],"domain_scores_gemma":[0.9995154,0.00028448892,0.000059349808,0.00004546031,0.00008158933,0.0000137292445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078873965,0.0009370758,0.0007296921,0.00023331531,0.00026943214,0.00066250766,0.0006367059,0.0009828489,0.0014277766],"category_scores_gemma":[0.0013067363,0.00035563775,0.0006037672,0.00048226418,0.0005392056,0.00095761043,0.00051725865,0.00060865574,0.0005406546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008911968,0.000033234708,0.00038590183,0.0001473417,0.00004772094,0.0002144887,0.000082233324,0.91772926,0.014914693,0.019432593,0.0006285243,0.046294942],"study_design_scores_gemma":[0.000010653505,0.00007269541,0.00009055713,0.0000053200692,0.000015252965,0.000061455146,0.000011244085,0.9910356,0.0031984563,0.004637436,0.0008510727,0.00001025342],"about_ca_topic_score_codex":0.00084110454,"about_ca_topic_score_gemma":0.0012218805,"teacher_disagreement_score":0.0014277766,"about_ca_system_score_codex":0.0004623234,"about_ca_system_score_gemma":0.00044340352,"threshold_uncertainty_score":0.0047763586},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.651986,0.0013473248,0.29148751,0.0033534067,0.00026454404,0.00008032943,0.000550934,0.00045882558,0.05047104],"genre_scores_gemma":[0.9737708,0.00042559492,0.012145087,0.00026662278,0.00023893252,0.000039748556,0.00014192364,0.000063736465,0.012907565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988933,0.00031373755,0.000057699024,0.00016835798,0.00034075312,0.00022609824],"domain_scores_gemma":[0.99652356,0.0014561284,0.00084677106,0.0004351253,0.00047297042,0.00026541992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092047325,0.00055571954,0.00058958575,0.0010628565,0.0009715937,0.0019536994,0.00065993686,0.000716331,0.00399504],"category_scores_gemma":[0.0051288605,0.0003702078,0.00039540682,0.0009898621,0.002013812,0.0029791766,0.0019424398,0.0016147754,0.0007989309],"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.00031826348,0.000038919607,0.0005331156,0.000054381155,0.000014463857,0.00013629944,0.00028046232,0.013619484,0.0039593196,0.9651788,0.00141899,0.014447516],"study_design_scores_gemma":[0.000034142628,0.00006137062,0.00030300068,0.0000175782,0.0000126057785,0.00026837972,0.00011244927,0.044530563,0.0045935162,0.9473443,0.0026776553,0.000044516873],"about_ca_topic_score_codex":0.00037852564,"about_ca_topic_score_gemma":0.00036337855,"teacher_disagreement_score":0.00399504,"about_ca_system_score_codex":0.0009807886,"about_ca_system_score_gemma":0.0011578988,"threshold_uncertainty_score":0.013364732},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012345023,0.00022033308,0.98264104,0.00014293441,0.00005144662,0.0001116039,0.00007106225,0.00020038264,0.004216129],"genre_scores_gemma":[0.7633568,0.00043875136,0.23272851,0.00019290364,0.000045405955,0.00037632257,0.00017848653,0.000040070692,0.002642833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925417,0.00022578229,0.00003049256,0.00012831176,0.0002279341,0.00013338178],"domain_scores_gemma":[0.99886876,0.00036358778,0.0001231515,0.00014072984,0.00044781942,0.000055954766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007724841,0.00074521295,0.00051265035,0.0005426878,0.00048523303,0.0008483297,0.0011776384,0.0005634127,0.0013348788],"category_scores_gemma":[0.0024167967,0.0002599303,0.00023741514,0.000828276,0.00072192284,0.0007905712,0.0011281456,0.00063412334,0.00030485733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020894001,0.000074782954,0.0007705729,0.0001415286,0.000054630207,0.00029209518,0.00013694927,0.7295538,0.028756604,0.10714055,0.0032991758,0.12957026],"study_design_scores_gemma":[0.0000128674255,0.00003688227,0.000061967134,0.000008759219,0.000009532866,0.000047103364,0.000009910646,0.99055135,0.0033405258,0.0047023613,0.0012076945,0.00001101861],"about_ca_topic_score_codex":0.0032779656,"about_ca_topic_score_gemma":0.004159555,"teacher_disagreement_score":0.0032779656,"about_ca_system_score_codex":0.0012164691,"about_ca_system_score_gemma":0.0020953743,"threshold_uncertainty_score":0.008826137},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04325955,0.0112296995,0.9138254,0.00048191295,0.0003432616,0.00023846548,0.00015862926,0.0005405931,0.029922528],"genre_scores_gemma":[0.59664714,0.010839999,0.37276295,0.00040074813,0.0002701872,0.0003568698,0.00026958867,0.000047738184,0.018404648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996196,0.00008677476,0.000025827623,0.00006680871,0.00014951125,0.000051370534],"domain_scores_gemma":[0.9996018,0.00010647179,0.00007848477,0.00007278216,0.00012811818,0.000012340153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036669357,0.0005915846,0.0004486358,0.00090502435,0.0005067516,0.0008064009,0.0008170907,0.0007866008,0.001256488],"category_scores_gemma":[0.0009440014,0.00024592833,0.00037450044,0.000992138,0.0005258655,0.0005936032,0.0006402843,0.00063944765,0.00073822594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036275652,0.00014801417,0.0015596148,0.0011239554,0.000111503,0.0006838166,0.00076250086,0.08888738,0.10387101,0.22531974,0.008579698,0.56859004],"study_design_scores_gemma":[0.00006342345,0.0010964433,0.0019385127,0.0003793256,0.000110995934,0.002764688,0.00023174213,0.74531955,0.101008564,0.032407235,0.114449024,0.00023057376],"about_ca_topic_score_codex":0.0012861823,"about_ca_topic_score_gemma":0.0018839194,"teacher_disagreement_score":0.0012861823,"about_ca_system_score_codex":0.0006467886,"about_ca_system_score_gemma":0.00043411725,"threshold_uncertainty_score":0.004692793},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10560143,0.00031043933,0.8899477,0.00018768062,0.000062531486,0.000103867744,0.00003070395,0.00016111026,0.0035946108],"genre_scores_gemma":[0.9697873,0.00007293828,0.029106533,0.000030520714,0.0000102306085,0.00005339914,0.00001543932,0.000013983944,0.0009096186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805933,0.00097104977,0.00007400949,0.00019632147,0.00037532108,0.00032387208],"domain_scores_gemma":[0.9980994,0.0011288965,0.00022808055,0.00015563655,0.00023547346,0.00015252615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029209405,0.0006042079,0.0010241078,0.0005164724,0.00068330445,0.0019228295,0.0020136866,0.0007635738,0.0012043937],"category_scores_gemma":[0.0038281712,0.0004530542,0.0005741639,0.00068031246,0.0012393792,0.002067062,0.0013923442,0.00085534796,0.00011012516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025953766,0.00014347446,0.0005520759,0.00008505429,0.000060184513,0.0003088418,0.00013622601,0.90188587,0.00448544,0.0652865,0.0006894219,0.026107408],"study_design_scores_gemma":[0.00001669419,0.000041585234,0.000044030377,0.0000020675066,0.0000056813155,0.000039902905,0.000016730562,0.99105424,0.00045239407,0.008119438,0.00020073794,0.00000661428],"about_ca_topic_score_codex":0.0024747152,"about_ca_topic_score_gemma":0.0016803298,"teacher_disagreement_score":0.0029209405,"about_ca_system_score_codex":0.0014243196,"about_ca_system_score_gemma":0.0014351767,"threshold_uncertainty_score":0.015447617},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09359554,0.0033382443,0.83179325,0.0026837054,0.00014447678,0.00012545958,0.00035812063,0.00036813936,0.0675931],"genre_scores_gemma":[0.96495014,0.0023460453,0.020635411,0.0003966152,0.00014104882,0.00026897553,0.00016823731,0.00008853646,0.011004972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992531,0.00023526189,0.000016459795,0.00006697492,0.00028057178,0.00014772592],"domain_scores_gemma":[0.99281317,0.005671138,0.00039155918,0.00023835545,0.000714749,0.00017111085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015927501,0.0012376545,0.00093426224,0.0015974697,0.0005408272,0.0013243537,0.0016137756,0.0013042726,0.0049300697],"category_scores_gemma":[0.010439932,0.00053943694,0.0005679798,0.0017080145,0.002187654,0.002085872,0.0018015134,0.0013465906,0.0008281174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017906794,0.00007087041,0.00085916463,0.0004078816,0.0000674836,0.000384813,0.00042716428,0.63708514,0.006169889,0.3309054,0.0060876915,0.017355459],"study_design_scores_gemma":[0.000017755534,0.000046053425,0.00029539855,0.000049800754,0.000023241035,0.00013317654,0.00008843307,0.885097,0.00047435358,0.112433,0.0013229019,0.000018893204],"about_ca_topic_score_codex":0.0032223493,"about_ca_topic_score_gemma":0.0022733752,"teacher_disagreement_score":0.0049300697,"about_ca_system_score_codex":0.0027716535,"about_ca_system_score_gemma":0.000971977,"threshold_uncertainty_score":0.020109892},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2360591,0.0024658062,0.7421391,0.0008111836,0.00006859854,0.000058079964,0.00017725024,0.00020198087,0.018018883],"genre_scores_gemma":[0.9903768,0.00081981363,0.00690618,0.00004049883,0.000043652915,0.000037043934,0.000034921468,0.000022136086,0.0017189301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878544,0.0004961054,0.000032232405,0.00011751182,0.00031353167,0.0002552035],"domain_scores_gemma":[0.99395424,0.004032713,0.0007109345,0.00030559933,0.00085037464,0.00014606654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018062613,0.0010626985,0.0009177877,0.0012963704,0.00080111274,0.0011857734,0.0010108453,0.00093483296,0.0012813031],"category_scores_gemma":[0.005347946,0.00049475976,0.0007252448,0.0011504606,0.0021760706,0.002041239,0.0014315527,0.0008529567,0.00029480754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099960635,0.00002859878,0.00084626855,0.00011068073,0.00004381716,0.00045281186,0.00025829344,0.90504885,0.008174995,0.07993778,0.0006580398,0.0043398608],"study_design_scores_gemma":[0.0000028858333,0.000026167194,0.00015036097,0.0000072405032,0.000011644535,0.000062837775,0.00004202831,0.9908869,0.0007456473,0.007892356,0.00016169851,0.000010190055],"about_ca_topic_score_codex":0.0033277124,"about_ca_topic_score_gemma":0.0015471493,"teacher_disagreement_score":0.0033277124,"about_ca_system_score_codex":0.0019006784,"about_ca_system_score_gemma":0.0009551398,"threshold_uncertainty_score":0.013790429},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058149572,0.0006551613,0.93249404,0.00035786084,0.00011280573,0.000099340636,0.000089400055,0.00034696973,0.007694961],"genre_scores_gemma":[0.9051477,0.00032469368,0.088573925,0.00012717723,0.000041595686,0.0001258215,0.000097956996,0.000022805883,0.005538348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992926,0.00027003727,0.000021213455,0.000102078746,0.0001880822,0.00012598792],"domain_scores_gemma":[0.9994671,0.00019400391,0.0000700953,0.000101351136,0.00013150857,0.000035989488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005904065,0.00072336185,0.00055561576,0.0005161485,0.00089246884,0.0008107484,0.0011162536,0.00067619944,0.00091816735],"category_scores_gemma":[0.0014532323,0.00023572394,0.0002982617,0.0007220615,0.00073380535,0.001297806,0.00146914,0.00065012067,0.00032345005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003464927,0.000105448504,0.0008574763,0.00024100003,0.000085641266,0.00057057705,0.00033722867,0.6856316,0.017590838,0.1480081,0.0051668985,0.14105864],"study_design_scores_gemma":[0.000022000417,0.00013424219,0.00014016367,0.000011582994,0.00001799146,0.00017602189,0.00005804868,0.97683513,0.002651154,0.016308034,0.0036209328,0.00002476198],"about_ca_topic_score_codex":0.0030270433,"about_ca_topic_score_gemma":0.003976596,"teacher_disagreement_score":0.0030270433,"about_ca_system_score_codex":0.00066950073,"about_ca_system_score_gemma":0.0012666392,"threshold_uncertainty_score":0.006018877},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14161803,0.0012876845,0.8445592,0.00033626883,0.000054120217,0.000045230307,0.00008404669,0.00013502837,0.01188039],"genre_scores_gemma":[0.96257675,0.000621782,0.035016783,0.000045887875,0.000025851767,0.000034705143,0.000037581896,0.0000096160165,0.0016309902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936515,0.0002811135,0.000022086082,0.000048123587,0.00020044211,0.00008317802],"domain_scores_gemma":[0.9990773,0.000585626,0.00010906468,0.00006692343,0.00013587292,0.000025068131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007926641,0.0006095364,0.0005246916,0.0003842016,0.00040691605,0.0007586849,0.00058373314,0.0006653145,0.0007069612],"category_scores_gemma":[0.0015496255,0.00023817467,0.00039619126,0.00091300596,0.0009793553,0.00097653875,0.00069335394,0.00051230186,0.00013354144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011710955,0.000026348882,0.00062577816,0.000079155994,0.00003512412,0.00029278712,0.0001793755,0.887412,0.008984823,0.080260724,0.0004239633,0.021562768],"study_design_scores_gemma":[0.000008582257,0.00004003817,0.00009988644,0.000006373705,0.000011069456,0.000055900135,0.000017265225,0.98946047,0.0009835473,0.008927289,0.0003805703,0.00000896378],"about_ca_topic_score_codex":0.0040198793,"about_ca_topic_score_gemma":0.0040820404,"teacher_disagreement_score":0.0040198793,"about_ca_system_score_codex":0.0010350065,"about_ca_system_score_gemma":0.00081715843,"threshold_uncertainty_score":0.007992983},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08206751,0.00097034185,0.90407926,0.0007202687,0.000059856535,0.000052439078,0.00008791697,0.00013028848,0.011832034],"genre_scores_gemma":[0.94030833,0.000656951,0.054074593,0.00013180422,0.000046227717,0.0001308505,0.00004933866,0.000066012464,0.004536011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931145,0.00039841683,0.000018548653,0.000088134,0.000082725724,0.00010073305],"domain_scores_gemma":[0.99815696,0.001515023,0.00013628152,0.000039009057,0.00009561938,0.00005712777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018788413,0.0017537018,0.0013539257,0.00053007307,0.0003939701,0.0014365976,0.000924541,0.0013940133,0.0014573067],"category_scores_gemma":[0.0038682113,0.0007474116,0.00052289775,0.0008781232,0.0015010328,0.0013271822,0.0011740101,0.0009890086,0.00024395029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000755043,0.000031958396,0.00012247612,0.00005687749,0.000029401474,0.00006312014,0.00004318741,0.9784757,0.0008908518,0.01546609,0.0003676085,0.0043772445],"study_design_scores_gemma":[0.000014502899,0.00003160356,0.000051856405,0.000005719492,0.0000075342373,0.000010876277,0.000014127207,0.98962677,0.0002559011,0.009818246,0.00015727211,0.000005569328],"about_ca_topic_score_codex":0.0027129774,"about_ca_topic_score_gemma":0.0018388709,"teacher_disagreement_score":0.0027129774,"about_ca_system_score_codex":0.0012983908,"about_ca_system_score_gemma":0.0008605665,"threshold_uncertainty_score":0.009936392},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122666225,0.0005231473,0.87059784,0.0003542336,0.00004753914,0.00007828168,0.00016633952,0.00021594256,0.005350419],"genre_scores_gemma":[0.8820146,0.0006588071,0.112995245,0.00015029978,0.00009272426,0.00012992657,0.00020125284,0.000056379085,0.0037007947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992592,0.00026121343,0.000034213066,0.00007045411,0.0002465461,0.00012839246],"domain_scores_gemma":[0.99496007,0.0028659515,0.00069322775,0.00051642535,0.0007609472,0.00020326507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010389512,0.00060671085,0.00038950602,0.00054383575,0.00045642816,0.0007625271,0.0006308411,0.0005565741,0.0016035226],"category_scores_gemma":[0.005974955,0.00023690276,0.00030173908,0.0007034437,0.001104877,0.0015851039,0.0011630446,0.0011173801,0.00026795143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002573,0.00006418046,0.0007797238,0.000118778815,0.000023438686,0.00020918623,0.0001758921,0.52440953,0.0124714775,0.4169092,0.0017894858,0.042791765],"study_design_scores_gemma":[0.000014144329,0.000081428545,0.00013777342,0.000014416769,0.0000054452576,0.00012221005,0.000031695112,0.91715133,0.0032082212,0.078265354,0.0009488826,0.000019065685],"about_ca_topic_score_codex":0.0013983527,"about_ca_topic_score_gemma":0.0013795977,"teacher_disagreement_score":0.0016035226,"about_ca_system_score_codex":0.00080378406,"about_ca_system_score_gemma":0.001082562,"threshold_uncertainty_score":0.0058318973},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021149954,0.0003057363,0.97652787,0.00004640123,0.00003656842,0.000035299487,0.000016613441,0.000105976615,0.0017754633],"genre_scores_gemma":[0.7891932,0.0004552016,0.20709068,0.0001333505,0.00005941703,0.000082865256,0.00005757024,0.000020285266,0.0029073798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936694,0.00014112455,0.000037869984,0.00009916662,0.00028687424,0.000067976674],"domain_scores_gemma":[0.9993963,0.00021174253,0.00008864627,0.00012792142,0.00013986466,0.000035488192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005985228,0.0005946769,0.00055318524,0.0003678074,0.0005662485,0.00057153846,0.0012373268,0.0005996862,0.0006683239],"category_scores_gemma":[0.0010775627,0.00021821959,0.00042209442,0.00038511725,0.0005877863,0.00094927324,0.0010686646,0.00056129036,0.00021462746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032343404,0.00015394393,0.0010035753,0.00045523726,0.00015677985,0.0008775513,0.0004145139,0.3892966,0.24764265,0.14383358,0.0016613753,0.21418081],"study_design_scores_gemma":[0.000032793003,0.0002463184,0.0002174333,0.000013032355,0.00003762204,0.0005806599,0.000021683165,0.9629977,0.022495283,0.010045878,0.0032691928,0.000042377244],"about_ca_topic_score_codex":0.00042783917,"about_ca_topic_score_gemma":0.00062681694,"teacher_disagreement_score":0.0012373268,"about_ca_system_score_codex":0.00050092663,"about_ca_system_score_gemma":0.000464173,"threshold_uncertainty_score":0.0036345124},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10701381,0.0000798474,0.8905474,0.00025638432,0.000018891391,0.00006528232,0.000021976135,0.00009527808,0.0019011544],"genre_scores_gemma":[0.9801865,0.00004637687,0.018643754,0.000041934745,0.000011024025,0.000058420686,0.00001077115,0.000009838252,0.0009913901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871075,0.00050407014,0.000052280528,0.00027425893,0.00026852527,0.00019015488],"domain_scores_gemma":[0.9961902,0.0023211634,0.0005832627,0.00038424318,0.00035380028,0.00016740034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015814638,0.00059876806,0.00087413576,0.0002829541,0.00044841607,0.0012103232,0.001541336,0.0011419996,0.0007552092],"category_scores_gemma":[0.004841778,0.00033824198,0.000515127,0.00038725437,0.0019002733,0.0014945072,0.0012128922,0.0010561032,0.000108361484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014578248,0.00008564203,0.000977638,0.000047897505,0.00005939712,0.00031613046,0.00017417905,0.9452664,0.0064472505,0.033934552,0.00034852224,0.012196596],"study_design_scores_gemma":[0.000011169489,0.000027748052,0.00006797804,0.0000014928315,0.0000044526973,0.000019231498,0.000010816831,0.99399006,0.00047594105,0.0053079976,0.000078506084,0.0000046950854],"about_ca_topic_score_codex":0.002877947,"about_ca_topic_score_gemma":0.0016368398,"teacher_disagreement_score":0.002877947,"about_ca_system_score_codex":0.0010338273,"about_ca_system_score_gemma":0.00091131206,"threshold_uncertainty_score":0.008363664},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8103897,0.0030225134,0.16091292,0.0014558154,0.0001520121,0.000046275512,0.0009623018,0.00084957137,0.022208847],"genre_scores_gemma":[0.9962261,0.0003213036,0.002084379,0.00004138879,0.000035691275,0.000009988253,0.00015883187,0.000027555974,0.0010947512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988765,0.00032287076,0.000041834595,0.00009725026,0.00032689297,0.00033471268],"domain_scores_gemma":[0.9879389,0.009335908,0.00052822736,0.000604672,0.0013667186,0.00022559817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025967096,0.0007122183,0.0009580681,0.0010658365,0.0009623688,0.0013438028,0.000658953,0.0009189126,0.0029592784],"category_scores_gemma":[0.010802784,0.00027426606,0.00023327926,0.0013122082,0.0012589559,0.000992763,0.0011072172,0.0006343437,0.00048176956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013307515,0.00010437605,0.0051515796,0.00027495937,0.00006778872,0.0006028156,0.0006890627,0.9070409,0.010880944,0.033607,0.004834723,0.035415117],"study_design_scores_gemma":[0.000043448457,0.00020236777,0.001963938,0.00004148721,0.00005314053,0.00038020604,0.0003135302,0.97832924,0.0033894896,0.014447954,0.00079838303,0.000036777332],"about_ca_topic_score_codex":0.0071578124,"about_ca_topic_score_gemma":0.005241178,"teacher_disagreement_score":0.0071578124,"about_ca_system_score_codex":0.0023021738,"about_ca_system_score_gemma":0.0011346132,"threshold_uncertainty_score":0.016703486},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06579737,0.0012341526,0.91701204,0.00044470464,0.000046751054,0.00011964572,0.0000947188,0.00015520016,0.01509548],"genre_scores_gemma":[0.94076157,0.0009932639,0.054019753,0.00018824947,0.000087653316,0.00012148841,0.00008199936,0.00002721507,0.003718767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944454,0.00014452157,0.000020380332,0.00009931193,0.00018556106,0.00010578508],"domain_scores_gemma":[0.9990269,0.0005947985,0.000110183406,0.00007767631,0.00014973986,0.000040742016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066580606,0.0010028993,0.00064550864,0.00048559188,0.00039994236,0.0010062256,0.0007118899,0.00069506984,0.0015853642],"category_scores_gemma":[0.0022617897,0.00017582101,0.0003519083,0.00056349323,0.0010140289,0.0012546125,0.0008878312,0.0007940964,0.00019252596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016425202,0.00006979871,0.00044131212,0.00015658532,0.000045141278,0.0004604783,0.00021284557,0.71535784,0.015812788,0.20366353,0.0016366013,0.061978806],"study_design_scores_gemma":[0.000017279188,0.00009785939,0.00015375618,0.000014359979,0.000015516374,0.00017403396,0.000044678014,0.97299284,0.0027122374,0.02252261,0.0012389813,0.000015799804],"about_ca_topic_score_codex":0.0027828894,"about_ca_topic_score_gemma":0.0016986561,"teacher_disagreement_score":0.0027828894,"about_ca_system_score_codex":0.001338054,"about_ca_system_score_gemma":0.0008741324,"threshold_uncertainty_score":0.009708285},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022782828,0.00035643842,0.9911107,0.00011592672,0.000037140493,0.000035547007,0.000090368405,0.00006152261,0.005914095],"genre_scores_gemma":[0.5118544,0.0034646564,0.46376052,0.0003366198,0.0003593134,0.00052863243,0.00042154512,0.0002629175,0.019011457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991678,0.00030881073,0.000030122983,0.00013245635,0.00024830757,0.00011253469],"domain_scores_gemma":[0.99860185,0.0007252134,0.00015366521,0.00020325326,0.00023208531,0.00008387275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014743978,0.0012208422,0.00068931945,0.0010178734,0.00095561624,0.0019216649,0.0015765257,0.0008097135,0.004986245],"category_scores_gemma":[0.003031499,0.00043220958,0.0008221062,0.0010009549,0.0017208201,0.0027769133,0.0015644357,0.002130427,0.00088689645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035758938,0.00002644049,0.00008276916,0.000064778986,0.000012005728,0.000113583155,0.00010553989,0.14769134,0.0016388437,0.83819467,0.0016460073,0.0103882],"study_design_scores_gemma":[0.000012942566,0.0000638966,0.000094737756,0.000044825014,0.000021164793,0.00015413604,0.000080781116,0.56315583,0.001422579,0.42590892,0.0090065915,0.000033640394],"about_ca_topic_score_codex":0.0023396793,"about_ca_topic_score_gemma":0.0020484447,"teacher_disagreement_score":0.004986245,"about_ca_system_score_codex":0.0017064892,"about_ca_system_score_gemma":0.0015726838,"threshold_uncertainty_score":0.016680717},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30907196,0.002715497,0.6709777,0.0004634401,0.0000606413,0.00009068859,0.00016241909,0.00036963206,0.01608806],"genre_scores_gemma":[0.98683876,0.0006605199,0.011379222,0.0000415841,0.000034314915,0.000029953588,0.000037491012,0.000019299012,0.0009588033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874204,0.0004690789,0.000043418942,0.00015017447,0.0004101992,0.00018511825],"domain_scores_gemma":[0.99543047,0.0030987624,0.00051798474,0.0002659437,0.0006096404,0.0000771582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017672798,0.0012754125,0.0010236732,0.0008100924,0.000560238,0.0009548854,0.0009657743,0.00085263944,0.0012685704],"category_scores_gemma":[0.008899419,0.00032708718,0.00055925496,0.000864322,0.001030704,0.0016408133,0.0010715302,0.00074380497,0.00036510048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010883074,0.00003771916,0.00090179686,0.00012547098,0.000045365545,0.000250617,0.00012994924,0.96241134,0.007960436,0.018124664,0.0002699622,0.009633855],"study_design_scores_gemma":[0.000004731146,0.00009067744,0.00032870006,0.000007806279,0.000014446701,0.00016165573,0.000040332226,0.99438524,0.0017978481,0.0030242135,0.00013269453,0.000011625776],"about_ca_topic_score_codex":0.001789183,"about_ca_topic_score_gemma":0.0011949742,"teacher_disagreement_score":0.001789183,"about_ca_system_score_codex":0.0010882319,"about_ca_system_score_gemma":0.0006701272,"threshold_uncertainty_score":0.009346366},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072000585,0.00075096876,0.9185615,0.00053531275,0.00005327431,0.000090714835,0.00016955005,0.00020975686,0.0076283114],"genre_scores_gemma":[0.9419916,0.00074751116,0.054548386,0.0001098149,0.000060580118,0.00013037385,0.00009880114,0.00005384018,0.0022591618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988263,0.0005373809,0.000026543048,0.00013610786,0.00023170198,0.00024196744],"domain_scores_gemma":[0.9977912,0.0016106871,0.00019344102,0.00012794099,0.00019864876,0.00007814651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014750769,0.0010052003,0.00092866615,0.0007705887,0.0005975321,0.0012921122,0.001240945,0.00067411916,0.0009248199],"category_scores_gemma":[0.004082087,0.00034972688,0.00041611984,0.001903579,0.0014577917,0.0013097721,0.0011192237,0.00080055755,0.0001556914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008906984,0.00003052109,0.00018458588,0.00006918169,0.000017983004,0.00009397168,0.00005703466,0.937989,0.0020581714,0.04746406,0.0008761367,0.011070353],"study_design_scores_gemma":[0.000009192906,0.000014637556,0.00004853433,0.000005420945,0.0000049705786,0.000015142655,0.000012785563,0.976482,0.00050265435,0.022600885,0.00029967437,0.000004153296],"about_ca_topic_score_codex":0.005967031,"about_ca_topic_score_gemma":0.0043333964,"teacher_disagreement_score":0.005967031,"about_ca_system_score_codex":0.0027155613,"about_ca_system_score_gemma":0.0017625928,"threshold_uncertainty_score":0.019702852},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44158688,0.0024422049,0.53253204,0.00093716907,0.000065032604,0.00011355427,0.00035637867,0.00026896477,0.021697827],"genre_scores_gemma":[0.99267524,0.00034481086,0.005678522,0.000017132914,0.000013834199,0.000027079048,0.000049384947,0.000009439684,0.0011845422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992949,0.0002714179,0.000027701526,0.000103324615,0.0001599473,0.0001425658],"domain_scores_gemma":[0.99820817,0.0010471776,0.00026853225,0.000064338485,0.0003517098,0.00006000616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096785004,0.0008999466,0.0010081395,0.00045655452,0.00047501337,0.0011159441,0.0006112966,0.00070069445,0.0013686422],"category_scores_gemma":[0.0019904994,0.00032442936,0.00040218377,0.00076206436,0.000714542,0.0006546367,0.0008161977,0.00048310825,0.0001906693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008190862,0.000018333365,0.00075942604,0.00006049564,0.000022001086,0.00019458258,0.00006640916,0.98712045,0.0021965334,0.004590667,0.0003806931,0.0045085205],"study_design_scores_gemma":[0.000005207924,0.00003922753,0.0002903585,0.0000034964048,0.000011869271,0.00004254625,0.00002796093,0.9981019,0.00035756506,0.0010138751,0.00009899198,0.0000070746273],"about_ca_topic_score_codex":0.0058107823,"about_ca_topic_score_gemma":0.0036927916,"teacher_disagreement_score":0.0058107823,"about_ca_system_score_codex":0.0017064324,"about_ca_system_score_gemma":0.0010689416,"threshold_uncertainty_score":0.012381136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011323926,0.00026209056,0.98428994,0.00009799289,0.00003331142,0.00006176515,0.000018200411,0.00019783142,0.0037150108],"genre_scores_gemma":[0.4052944,0.0005561911,0.5904388,0.00014661322,0.00007284919,0.0001609405,0.00006280106,0.000040698575,0.0032267803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994622,0.00016900516,0.00002314941,0.0000639935,0.00022177267,0.00006000396],"domain_scores_gemma":[0.9995646,0.00009475877,0.000076728844,0.000042510543,0.00019719217,0.000024187337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042837745,0.0005110019,0.00033629363,0.00024243015,0.00030394463,0.0006076808,0.0004637369,0.0004848186,0.00095500005],"category_scores_gemma":[0.0009765653,0.0002458392,0.00024575344,0.00046208553,0.00040254756,0.0005473851,0.00038852904,0.0005055777,0.0007351489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036874352,0.0001225079,0.0013635837,0.00022173881,0.00010388883,0.00037736568,0.0002656321,0.4597615,0.18001637,0.08069331,0.0021161647,0.27458915],"study_design_scores_gemma":[0.000047262383,0.0005460963,0.0003869005,0.00003736057,0.000029636041,0.00038336843,0.000042206273,0.93546265,0.04624903,0.006895813,0.00988839,0.00003121131],"about_ca_topic_score_codex":0.0016023201,"about_ca_topic_score_gemma":0.0024796557,"teacher_disagreement_score":0.0016023201,"about_ca_system_score_codex":0.0005067646,"about_ca_system_score_gemma":0.000971522,"threshold_uncertainty_score":0.0036768317},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32848155,0.0032461064,0.6125699,0.0013858437,0.00013122494,0.00012433385,0.0005198538,0.00023747787,0.05330367],"genre_scores_gemma":[0.9898431,0.00071624806,0.0058703437,0.00010763924,0.000058821905,0.00006477529,0.00009166606,0.000022414302,0.0032251272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898595,0.0003804779,0.000030953568,0.00008491422,0.00030583836,0.00021188076],"domain_scores_gemma":[0.9928618,0.0046783383,0.00068344537,0.00025307757,0.0013518888,0.00017151676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018369325,0.0009899309,0.0008016022,0.0010853683,0.0006932499,0.0012492392,0.00078663527,0.0009787611,0.002517532],"category_scores_gemma":[0.0060888208,0.00050581904,0.0005015406,0.0013994505,0.0017765514,0.0011677959,0.0014740251,0.00096379983,0.00036379276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009263073,0.000024511672,0.0009221396,0.00011364562,0.00005385786,0.00043785648,0.0003076812,0.8878917,0.004181941,0.09981587,0.0011886645,0.004969601],"study_design_scores_gemma":[0.000006309851,0.00002401533,0.00027152052,0.000011471586,0.0000087213475,0.00009083158,0.000049005193,0.98583037,0.00034096293,0.013140448,0.00021183077,0.000014496161],"about_ca_topic_score_codex":0.005411564,"about_ca_topic_score_gemma":0.0033285806,"teacher_disagreement_score":0.005411564,"about_ca_system_score_codex":0.0023182672,"about_ca_system_score_gemma":0.0014135514,"threshold_uncertainty_score":0.016820252},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54915804,0.0009494545,0.4345859,0.00040479546,0.00007306093,0.00013378644,0.00013331391,0.00019584536,0.014365796],"genre_scores_gemma":[0.99411184,0.00013411917,0.00525773,0.000021772168,0.000008582606,0.00002625877,0.00001648644,0.000003920596,0.00041942607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982377,0.00088268693,0.000052791176,0.0001808185,0.00037936532,0.00026649793],"domain_scores_gemma":[0.9888122,0.0083832955,0.00090023945,0.0005367855,0.0012045782,0.00016293678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025841764,0.0011095549,0.00091059384,0.0004576356,0.0005481244,0.0009965883,0.000907334,0.0008428572,0.0004807303],"category_scores_gemma":[0.009219923,0.00030778063,0.00024639725,0.00085337256,0.0020637715,0.0012445184,0.0011753293,0.0005292837,0.00009272887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025136475,0.00003742747,0.0013395651,0.00009991573,0.000053368592,0.0005309509,0.00019225148,0.9661741,0.0045957887,0.020253204,0.0003146074,0.006157406],"study_design_scores_gemma":[0.000019951889,0.00013017724,0.00029005986,0.000010985492,0.00002811634,0.00019416044,0.00005164925,0.9925632,0.0023330993,0.0041988622,0.00016364176,0.000016144717],"about_ca_topic_score_codex":0.0042987308,"about_ca_topic_score_gemma":0.003543655,"teacher_disagreement_score":0.0042987308,"about_ca_system_score_codex":0.0012887599,"about_ca_system_score_gemma":0.0013962587,"threshold_uncertainty_score":0.01366657},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26876011,0.0019561867,0.7212474,0.00045121263,0.000036471745,0.000056356766,0.00026120959,0.00026220692,0.0069688517],"genre_scores_gemma":[0.990419,0.0007090869,0.0076950653,0.000041576423,0.000022405964,0.00003035858,0.000064867076,0.000014853851,0.0010027929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989365,0.00039916317,0.000044385775,0.00015038544,0.000269109,0.0002004731],"domain_scores_gemma":[0.99522865,0.0032466955,0.00051565416,0.00028161224,0.0006142559,0.000113227856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00184476,0.0008119971,0.000773922,0.000774541,0.00041652707,0.00078718195,0.0009706574,0.00062361086,0.0012225646],"category_scores_gemma":[0.005905182,0.00028401305,0.0003732976,0.0008900338,0.0012798419,0.0015595789,0.0010392056,0.0007424311,0.00022820404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009757834,0.00002373215,0.0019941295,0.00005980525,0.00003620999,0.00036897222,0.00017177204,0.95934725,0.0031316865,0.027490027,0.0005322958,0.006746465],"study_design_scores_gemma":[0.0000039496313,0.000027820033,0.0005166415,0.0000045001752,0.000012469412,0.00009819052,0.0000495293,0.994532,0.00039854617,0.0042005824,0.00014529302,0.000010385529],"about_ca_topic_score_codex":0.0040713362,"about_ca_topic_score_gemma":0.0021022493,"teacher_disagreement_score":0.0040713362,"about_ca_system_score_codex":0.0014948389,"about_ca_system_score_gemma":0.00049043715,"threshold_uncertainty_score":0.0108459},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045507457,0.0009573349,0.9514983,0.0002944335,0.000037746908,0.00006668957,0.000027897348,0.00011389722,0.0014962272],"genre_scores_gemma":[0.7956869,0.00095408136,0.20161796,0.00011099967,0.00004083531,0.00013943325,0.000115505405,0.00004614793,0.0012880657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993261,0.00035656692,0.000029555402,0.000062721854,0.00016271169,0.00006231214],"domain_scores_gemma":[0.99901974,0.00065042137,0.00012972055,0.000074960095,0.00009124926,0.000033942957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014496311,0.0006084058,0.00041138116,0.00065652427,0.0006343815,0.00069701206,0.0007561266,0.0005823788,0.00078962743],"category_scores_gemma":[0.0031008257,0.0003045886,0.00037025544,0.00079829094,0.0005687065,0.0009188889,0.00085394515,0.00044541285,0.000113147384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010377437,0.000056656885,0.00069248135,0.0001506952,0.00005521243,0.00013258964,0.00013520913,0.8916408,0.011040411,0.028193768,0.0014449504,0.06635347],"study_design_scores_gemma":[0.0000061968512,0.000033039676,0.0000910803,0.0000047308536,0.000008712499,0.000037755715,0.000016785854,0.9941438,0.0014283232,0.003763561,0.00046025915,0.0000057975685],"about_ca_topic_score_codex":0.0014324479,"about_ca_topic_score_gemma":0.0020068237,"teacher_disagreement_score":0.0014496311,"about_ca_system_score_codex":0.0011376835,"about_ca_system_score_gemma":0.00072966365,"threshold_uncertainty_score":0.008254528},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04819768,0.00375478,0.94164133,0.00030712734,0.00004609474,0.000020010873,0.00003488092,0.0001225457,0.005875556],"genre_scores_gemma":[0.96550417,0.0019714069,0.030658849,0.00006474383,0.000059595797,0.000036656253,0.000016485643,0.000014752358,0.0016733577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993679,0.00029563953,0.00001950157,0.000059237856,0.00020226883,0.000055361437],"domain_scores_gemma":[0.9988298,0.0008222305,0.00013427793,0.000089710404,0.000104619256,0.000019283914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012670386,0.0004138809,0.00042748594,0.00029089735,0.00032382185,0.0008572874,0.00055079086,0.0006580063,0.000709381],"category_scores_gemma":[0.0033916705,0.00021885741,0.0002580138,0.0006501792,0.0007456388,0.00081062055,0.0006832428,0.00039789546,0.00013345106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068679175,0.000026557009,0.00094150484,0.00018856818,0.00007077115,0.00022087796,0.0001577555,0.7786448,0.006535446,0.132224,0.0011837825,0.0797373],"study_design_scores_gemma":[0.000007414128,0.00008464105,0.00035442246,0.000019899964,0.000025390787,0.00012340912,0.00003426598,0.9521153,0.0022514577,0.042541023,0.0024300641,0.00001270549],"about_ca_topic_score_codex":0.00077774946,"about_ca_topic_score_gemma":0.0012356403,"teacher_disagreement_score":0.0012670386,"about_ca_system_score_codex":0.000832566,"about_ca_system_score_gemma":0.00053295546,"threshold_uncertainty_score":0.0067008734},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01558987,0.002410114,0.94772214,0.0020513006,0.00026178375,0.00016886627,0.0009893975,0.00035709512,0.030449532],"genre_scores_gemma":[0.40442073,0.005128937,0.5466111,0.0010703751,0.00068108493,0.0009252019,0.0024149506,0.0010667412,0.037680853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99665594,0.0013550712,0.00016008118,0.0005719556,0.0006462245,0.0006107533],"domain_scores_gemma":[0.98916537,0.008191021,0.00060927944,0.0005518031,0.0010947979,0.00038780822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00562187,0.0031129152,0.0028123027,0.002044303,0.001089881,0.0041204975,0.0034474798,0.0034528326,0.015034012],"category_scores_gemma":[0.027375285,0.001233872,0.0020732158,0.0036341508,0.0021084202,0.0042895847,0.0032610046,0.003965765,0.003054648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000321744,0.00021477908,0.0006288877,0.00066789275,0.00015292599,0.0002530237,0.00023060183,0.6586732,0.0008698777,0.2573522,0.026223093,0.054411776],"study_design_scores_gemma":[0.00005899077,0.00005840974,0.00021192964,0.00009358209,0.000034501543,0.00012170282,0.000104120874,0.8217755,0.00038854493,0.1736357,0.0034833776,0.000033601573],"about_ca_topic_score_codex":0.004720665,"about_ca_topic_score_gemma":0.0057237274,"teacher_disagreement_score":0.015034012,"about_ca_system_score_codex":0.0033578007,"about_ca_system_score_gemma":0.0042104307,"threshold_uncertainty_score":0.050293803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24832718,0.001023308,0.73489034,0.0008331047,0.000060344897,0.00008953235,0.0002442044,0.00019805133,0.014333925],"genre_scores_gemma":[0.98437065,0.0006296838,0.013355329,0.000048435664,0.00004465576,0.00004852744,0.000095122996,0.000026856018,0.001380687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978688,0.00069688604,0.00006806048,0.00022085036,0.00072331843,0.0004221083],"domain_scores_gemma":[0.99039465,0.0057977107,0.00083693466,0.00091702584,0.0018294415,0.00022422547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017603239,0.0006779559,0.00065298827,0.0014441822,0.000800746,0.0011001088,0.00057335646,0.0007298653,0.0017955952],"category_scores_gemma":[0.009714364,0.00031946664,0.000572781,0.0010752073,0.0026144623,0.0032887864,0.0015848655,0.0013806354,0.00025065854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000247241,0.000028909715,0.0013134122,0.00008526399,0.000050413477,0.00016436036,0.00019949082,0.52476454,0.009924374,0.44698793,0.0009873516,0.015246614],"study_design_scores_gemma":[0.0000061091932,0.000049814276,0.0002624113,0.000014970571,0.000009689244,0.00009653867,0.00003823161,0.9198952,0.0026049302,0.076400824,0.00059500634,0.000026265203],"about_ca_topic_score_codex":0.0022988534,"about_ca_topic_score_gemma":0.00075406465,"teacher_disagreement_score":0.0022988534,"about_ca_system_score_codex":0.0018291665,"about_ca_system_score_gemma":0.0017678797,"threshold_uncertainty_score":0.01327157},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0653527,0.0013123367,0.9147131,0.0009375149,0.00040702766,0.000321628,0.00052194204,0.0013450822,0.015088584],"genre_scores_gemma":[0.82055783,0.0007373724,0.1653153,0.00035903536,0.00012646176,0.00022409011,0.00036549155,0.000066616645,0.0122477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945515,0.00007702153,0.000030098847,0.00009889195,0.00021390076,0.00012490817],"domain_scores_gemma":[0.99940383,0.000071413255,0.000065347136,0.00018590101,0.00022398467,0.000049578168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029480614,0.00048058206,0.0006530306,0.0006449647,0.0013233501,0.00090877275,0.0016510873,0.00057695067,0.0032374398],"category_scores_gemma":[0.0008172013,0.00016582424,0.00034588162,0.0015921231,0.00063136074,0.0023637402,0.0017087945,0.00061633537,0.0006429162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011555976,0.00027970172,0.0012369468,0.0005185562,0.0000940644,0.001029448,0.00036685733,0.24769765,0.09165768,0.24464402,0.02956777,0.38175175],"study_design_scores_gemma":[0.00008583175,0.00016806643,0.00041076326,0.000052523472,0.00005588423,0.0008134858,0.000112292364,0.9085098,0.034964934,0.03215281,0.022583209,0.00009046648],"about_ca_topic_score_codex":0.00632694,"about_ca_topic_score_gemma":0.0047661434,"teacher_disagreement_score":0.00632694,"about_ca_system_score_codex":0.0015911214,"about_ca_system_score_gemma":0.0020100418,"threshold_uncertainty_score":0.012580216},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005895718,0.00035194933,0.9919742,0.00013175352,0.000045458342,0.000041113803,0.00002193872,0.00009181121,0.0014459754],"genre_scores_gemma":[0.6154091,0.0011813288,0.3769065,0.00019727973,0.00018427185,0.00028734212,0.00013033266,0.000048131373,0.0056556263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994147,0.00020627142,0.0000286212,0.0001128976,0.00018954271,0.000047973655],"domain_scores_gemma":[0.9995271,0.0002203646,0.00005652613,0.000056299956,0.000108153705,0.00003161034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005430109,0.0007649809,0.0007531629,0.0006367778,0.00069188,0.0005536943,0.0011646143,0.00065833284,0.0011645516],"category_scores_gemma":[0.0013850051,0.0002538866,0.00069362856,0.0009643725,0.0004436748,0.0010284538,0.0010243957,0.0005342591,0.00039292307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001927782,0.00014971104,0.0011507948,0.00032338646,0.00014872797,0.00037257155,0.00038103198,0.56814533,0.026830826,0.043773483,0.007824915,0.3507065],"study_design_scores_gemma":[0.000016093483,0.000060238977,0.00015892077,0.000006755759,0.000026548043,0.00016489977,0.000045204128,0.9883477,0.0023492714,0.0064644814,0.0023417377,0.000018187899],"about_ca_topic_score_codex":0.0014874054,"about_ca_topic_score_gemma":0.002135213,"teacher_disagreement_score":0.0014874054,"about_ca_system_score_codex":0.00054205424,"about_ca_system_score_gemma":0.0008001941,"threshold_uncertainty_score":0.003932953},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007636209,0.74424666,0.21843015,0.0017115957,0.0007823636,0.00014484685,0.00011588599,0.00016167804,0.02677061],"genre_scores_gemma":[0.086938016,0.8447854,0.059126772,0.0007052285,0.0023719028,0.0002319333,0.0003094673,0.00006407705,0.005467319],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99929476,0.00017879317,0.00006457199,0.00010736694,0.00029231072,0.00006217805],"domain_scores_gemma":[0.9988794,0.00074149703,0.00006984741,0.00007519298,0.00019928992,0.000034668807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013704938,0.00072463683,0.0009877048,0.0017473232,0.00053626084,0.0014804848,0.0010427982,0.0012082574,0.0012385118],"category_scores_gemma":[0.0019302848,0.00059443375,0.00053940556,0.0035926346,0.0008506439,0.0031951228,0.0012350501,0.0014434616,0.00049923896],"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.00006472778,0.00016990448,0.0016563699,0.0045142523,0.00010236964,0.0001699351,0.00032317918,0.025834002,0.0023415613,0.1690484,0.013002789,0.7827725],"study_design_scores_gemma":[0.000028507513,0.0005422381,0.0031754985,0.0033127454,0.00020997591,0.002222133,0.00086256285,0.1376531,0.0043347846,0.2383152,0.60915875,0.00018447578],"about_ca_topic_score_codex":0.0013055557,"about_ca_topic_score_gemma":0.0010035258,"teacher_disagreement_score":0.0017473232,"about_ca_system_score_codex":0.0007608972,"about_ca_system_score_gemma":0.0012120664,"threshold_uncertainty_score":0.007247925},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42364702,0.003428244,0.53815454,0.001030651,0.00015577035,0.00016065127,0.00035221546,0.00055125065,0.03251965],"genre_scores_gemma":[0.9902744,0.00047878062,0.00733718,0.000052137028,0.00005116587,0.00003990019,0.000047256923,0.000027047945,0.0016920201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982291,0.0006901548,0.000051797113,0.00016056445,0.00043446108,0.0004339658],"domain_scores_gemma":[0.99286276,0.004495867,0.000576945,0.0003650679,0.001536337,0.00016307832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027621514,0.0012695343,0.0009729809,0.0011359801,0.00089487,0.0018508055,0.0010545147,0.0009380745,0.0030676648],"category_scores_gemma":[0.007918892,0.00040613575,0.0006536467,0.001590156,0.0012994775,0.0011673155,0.0014553755,0.00065794546,0.00041473046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004384541,0.00004926739,0.0017554763,0.0001387445,0.000094225274,0.00020111687,0.0001839755,0.919003,0.009816721,0.052885417,0.00083835074,0.014595247],"study_design_scores_gemma":[0.0000092807295,0.00012690996,0.00034742052,0.000015660435,0.000043119722,0.00008867562,0.00006414589,0.9926892,0.0013714285,0.0049001486,0.00033077865,0.000013218936],"about_ca_topic_score_codex":0.005581709,"about_ca_topic_score_gemma":0.0046418617,"teacher_disagreement_score":0.005581709,"about_ca_system_score_codex":0.002495265,"about_ca_system_score_gemma":0.0017716121,"threshold_uncertainty_score":0.018104434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07958427,0.0003853683,0.91140735,0.00032404583,0.000033053268,0.000037724665,0.00008771673,0.00011217771,0.008028304],"genre_scores_gemma":[0.94488394,0.00038522496,0.051181458,0.00007420935,0.000036888232,0.00005476333,0.0000545257,0.0000162284,0.0033127856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958116,0.00018672654,0.000014732294,0.00007889649,0.000086256085,0.00005217476],"domain_scores_gemma":[0.9990552,0.000641063,0.000119305485,0.00009503094,0.000064930005,0.000024475052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060686906,0.0007101633,0.0009559318,0.00023707493,0.00036692768,0.0009092491,0.0008226321,0.0011659702,0.0008772631],"category_scores_gemma":[0.0017460522,0.00035600158,0.0004085986,0.0005474584,0.0007392812,0.0015606773,0.00083525386,0.0005988366,0.00026336507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007185877,0.000041127278,0.00051203574,0.000096798314,0.000034330307,0.00072661147,0.00007638341,0.9377803,0.006667959,0.04171099,0.00046769367,0.011813859],"study_design_scores_gemma":[0.000007849895,0.000044821914,0.00012380013,0.0000034277825,0.00000687824,0.00013140579,0.000020599084,0.99079984,0.0008948372,0.007669256,0.0002890394,0.000008126498],"about_ca_topic_score_codex":0.0011180685,"about_ca_topic_score_gemma":0.0013880857,"teacher_disagreement_score":0.0011659702,"about_ca_system_score_codex":0.0006993185,"about_ca_system_score_gemma":0.0003732656,"threshold_uncertainty_score":0.005073905},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011482556,0.00020359673,0.9842866,0.00015769133,0.000026672027,0.000019347914,0.00007008477,0.000073058116,0.0036804308],"genre_scores_gemma":[0.81937206,0.0015475807,0.16800489,0.00018942106,0.000088395296,0.00023925777,0.0002189489,0.00005815017,0.010281319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996728,0.00014885706,0.000011297539,0.00004943936,0.0000776061,0.000040083974],"domain_scores_gemma":[0.9993861,0.00041759212,0.000063465915,0.000027441025,0.000084091014,0.000021285701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005021919,0.0007173714,0.00050241884,0.00028218253,0.00027912657,0.00067022495,0.00056091655,0.0007323118,0.003006536],"category_scores_gemma":[0.0014473724,0.0002546,0.00028669962,0.0007083572,0.0004984019,0.0011218821,0.0004367037,0.0006401724,0.0007172464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025462616,0.000012478199,0.000120737335,0.00004245613,0.0000065155855,0.000055564942,0.000024465962,0.95993257,0.002358837,0.02970998,0.00051578076,0.0071951314],"study_design_scores_gemma":[0.0000051777824,0.000013722814,0.00004641496,0.0000030362855,0.000002072323,0.000013510293,0.000009090082,0.99226284,0.00026204067,0.007013763,0.0003645128,0.0000038423227],"about_ca_topic_score_codex":0.00205033,"about_ca_topic_score_gemma":0.002617361,"teacher_disagreement_score":0.003006536,"about_ca_system_score_codex":0.00076390355,"about_ca_system_score_gemma":0.00041118532,"threshold_uncertainty_score":0.010057926},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042058688,0.0004529147,0.9548043,0.00015150441,0.00003527224,0.00004935794,0.00004615414,0.00017840555,0.0022235054],"genre_scores_gemma":[0.8979916,0.00045228642,0.099660955,0.00006250198,0.00002797387,0.000086329346,0.000094072435,0.000021520862,0.0016028769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943155,0.00016036618,0.000027278644,0.0001041262,0.00019560005,0.000081067585],"domain_scores_gemma":[0.99918777,0.00044856753,0.00010216221,0.0000905429,0.00013290363,0.000037999893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061442715,0.00052694074,0.0006006526,0.00046048255,0.0003850851,0.00052289077,0.0009215316,0.00050683564,0.00072980684],"category_scores_gemma":[0.0019592042,0.00019296058,0.00028649604,0.0008865974,0.0004371383,0.00095038716,0.000793602,0.0005764285,0.000116833304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013600494,0.000059996422,0.00046396808,0.00011104941,0.000025235277,0.00015486444,0.00008989145,0.89332646,0.012669536,0.015823469,0.0014656328,0.0756738],"study_design_scores_gemma":[0.000006681221,0.000021339512,0.00006647558,0.00000244279,0.0000043145187,0.000026981332,0.0000113591905,0.9954513,0.0019175009,0.0022312396,0.00025585285,0.000004522008],"about_ca_topic_score_codex":0.005067602,"about_ca_topic_score_gemma":0.0055768653,"teacher_disagreement_score":0.005067602,"about_ca_system_score_codex":0.0008197407,"about_ca_system_score_gemma":0.0012146698,"threshold_uncertainty_score":0.010076165},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010394976,0.0009779397,0.97402364,0.00025761532,0.00028676563,0.00010918307,0.00025664744,0.0003444129,0.013348774],"genre_scores_gemma":[0.45063457,0.0032803414,0.5086137,0.0010291851,0.0009854933,0.0006225709,0.0016302689,0.0002695096,0.03293433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984804,0.00024844625,0.00007609479,0.00032085503,0.0007013829,0.00017282095],"domain_scores_gemma":[0.9978815,0.000635622,0.00020405056,0.0005147559,0.0006398309,0.00012423997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089076255,0.00062324334,0.00066965003,0.00093865243,0.00060996617,0.0014404168,0.0011416782,0.000919746,0.002888253],"category_scores_gemma":[0.0027666867,0.0002517723,0.00064934784,0.0009338155,0.0009211584,0.0018735924,0.0009598681,0.0018326063,0.0013538264],"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.00033478808,0.0001674377,0.001260497,0.00025227715,0.00008244241,0.00031896844,0.00013133066,0.17405336,0.034831516,0.54154795,0.012004852,0.23501462],"study_design_scores_gemma":[0.00013335838,0.00029570516,0.00043078428,0.000056542875,0.000031848198,0.0010423602,0.00004128725,0.7753523,0.019506387,0.11920053,0.08381973,0.000089247755],"about_ca_topic_score_codex":0.0014120222,"about_ca_topic_score_gemma":0.001377984,"teacher_disagreement_score":0.002888253,"about_ca_system_score_codex":0.0010513299,"about_ca_system_score_gemma":0.0014453826,"threshold_uncertainty_score":0.009662211},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10108612,0.0024765097,0.8850405,0.00033843817,0.00005290616,0.000054089254,0.000078238205,0.00015907483,0.010714066],"genre_scores_gemma":[0.9592113,0.0016906161,0.035638865,0.00009313277,0.00003358175,0.0000655439,0.000050606777,0.00004887066,0.003167393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996494,0.000084344596,0.00001263255,0.000039005663,0.00015227153,0.00006229396],"domain_scores_gemma":[0.9985519,0.0010101123,0.00010675772,0.000079187594,0.00023230333,0.000019635365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093280745,0.00057177874,0.0003901089,0.0005569256,0.00034801653,0.00057412504,0.0005084496,0.00038617107,0.0017618085],"category_scores_gemma":[0.0028336586,0.00020201865,0.0003486182,0.0005391329,0.00061831344,0.0010354582,0.00050536357,0.00062021834,0.00028824457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045549856,0.000037386373,0.00049088115,0.00009522974,0.000021606085,0.00009679612,0.00010766889,0.9233586,0.009984328,0.050282158,0.00047568214,0.015004056],"study_design_scores_gemma":[0.0000022436786,0.000020194515,0.0001718937,0.000005567629,0.0000041471853,0.00003072209,0.000020908428,0.9941968,0.0009372604,0.004281001,0.00032324356,0.0000059878807],"about_ca_topic_score_codex":0.0026361058,"about_ca_topic_score_gemma":0.0017961569,"teacher_disagreement_score":0.0026361058,"about_ca_system_score_codex":0.0013152093,"about_ca_system_score_gemma":0.00061843893,"threshold_uncertainty_score":0.009542525},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004181006,0.00032254864,0.99111193,0.00018240741,0.000045538272,0.000063982865,0.00007036317,0.0003862427,0.0036358584],"genre_scores_gemma":[0.16188271,0.00062900764,0.8328927,0.00015783984,0.000096787095,0.00035523856,0.00034841045,0.00019313063,0.003444182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985979,0.00043471818,0.0000656171,0.00020477471,0.0004632609,0.00023369907],"domain_scores_gemma":[0.9967662,0.002083412,0.00021697476,0.00046443156,0.0003923895,0.00007662218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018991377,0.0013026003,0.0011562638,0.001962602,0.0011680545,0.002105032,0.0018679163,0.0017847652,0.006253343],"category_scores_gemma":[0.008357703,0.0005164539,0.0012151055,0.0026840586,0.0015272805,0.0038025395,0.0018890954,0.0019660532,0.00097159925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081922844,0.00007159256,0.00038868838,0.00013949427,0.000029505447,0.000043759446,0.00014313209,0.678004,0.0007952128,0.15889677,0.0050482973,0.15635765],"study_design_scores_gemma":[0.000018574308,0.000023073175,0.00005782573,0.000018119757,0.000006039248,0.00003154848,0.00003660117,0.9162271,0.0005280949,0.080825485,0.0022183512,0.000009181114],"about_ca_topic_score_codex":0.0063501764,"about_ca_topic_score_gemma":0.0046889763,"teacher_disagreement_score":0.0063501764,"about_ca_system_score_codex":0.0029160813,"about_ca_system_score_gemma":0.0027489655,"threshold_uncertainty_score":0.021157742},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05365359,0.0013145738,0.93998516,0.00019998792,0.00005450768,0.00004818587,0.000035897807,0.00026794974,0.0044402145],"genre_scores_gemma":[0.9769697,0.0006469292,0.02149597,0.00004904535,0.000027595455,0.000049963477,0.000023188335,0.000011616762,0.0007258688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991085,0.00031925458,0.000026300677,0.00011962003,0.00030833692,0.0001179469],"domain_scores_gemma":[0.9989976,0.00047168377,0.00010780969,0.0001237305,0.00027142515,0.000027797352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008400384,0.0006098415,0.0005396298,0.00054126146,0.0007326961,0.0007682051,0.00083462574,0.0006497855,0.0007857689],"category_scores_gemma":[0.0018920582,0.00023642326,0.00048269765,0.0008115608,0.0007620077,0.0007745078,0.0007430628,0.00045125966,0.00018494815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104958606,0.000065197324,0.0013771703,0.00019687548,0.000055039793,0.0004525876,0.00034120254,0.8740165,0.019810446,0.058446724,0.0020007885,0.0431325],"study_design_scores_gemma":[0.000003430956,0.0000623712,0.00013291473,0.0000068996333,0.000014910331,0.00008531061,0.00003474057,0.9941432,0.0012959875,0.0035792014,0.0006298875,0.000011134355],"about_ca_topic_score_codex":0.005355175,"about_ca_topic_score_gemma":0.0053063654,"teacher_disagreement_score":0.005355175,"about_ca_system_score_codex":0.0010538116,"about_ca_system_score_gemma":0.00096979307,"threshold_uncertainty_score":0.010648012},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003616657,0.0001811184,0.99355704,0.00009208285,0.000016673694,0.000018501776,0.000012896061,0.000049432638,0.002455598],"genre_scores_gemma":[0.37077525,0.0006706474,0.6249212,0.00018411997,0.00006442763,0.0001949712,0.00007513714,0.00004799934,0.0030662983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932754,0.000255749,0.000025342559,0.00008335626,0.00025132025,0.00005661804],"domain_scores_gemma":[0.99891984,0.000459095,0.0001510585,0.0001355616,0.0002867098,0.000047697235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001003663,0.0007722442,0.00049421866,0.00047960822,0.00035193664,0.0008121085,0.0007242775,0.0007623575,0.0022866488],"category_scores_gemma":[0.0024035173,0.00030841923,0.00026612217,0.00070358446,0.000694194,0.0009855279,0.00071647036,0.0007818409,0.00097485754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024303384,0.0002235444,0.0009029267,0.00034824444,0.00008968503,0.00014448247,0.00016601926,0.45587346,0.09413557,0.15974061,0.004287827,0.28384453],"study_design_scores_gemma":[0.000065646236,0.0003184551,0.00033835936,0.00005003375,0.00003291313,0.00034849084,0.0000867042,0.9202836,0.021926975,0.046666436,0.009836997,0.00004538301],"about_ca_topic_score_codex":0.00029735203,"about_ca_topic_score_gemma":0.0009059617,"teacher_disagreement_score":0.0022866488,"about_ca_system_score_codex":0.00053368165,"about_ca_system_score_gemma":0.00063279696,"threshold_uncertainty_score":0.0076496005},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073427215,0.0016241526,0.9204314,0.00039089387,0.00006244244,0.00007104027,0.000034393084,0.0005932391,0.003365287],"genre_scores_gemma":[0.92127705,0.0008532453,0.07594434,0.00006795713,0.00004524323,0.00009433438,0.000044831333,0.000027861399,0.0016450161],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999539,0.00013198859,0.000020094258,0.000051329127,0.00019597773,0.00006149224],"domain_scores_gemma":[0.99880254,0.00052090234,0.00021615505,0.00016651508,0.0002549123,0.000038990725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008941154,0.00042055137,0.00029829302,0.0006172115,0.0005398052,0.00048761905,0.00074224576,0.00038985984,0.00051281875],"category_scores_gemma":[0.002445097,0.00020087254,0.00024886636,0.00070146145,0.00055440224,0.0010709893,0.0007856367,0.0005014273,0.00011084897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001746729,0.00006810074,0.0015187016,0.00022803227,0.00005589588,0.0003383301,0.00036740696,0.73330545,0.048881866,0.057581227,0.0026685135,0.15481184],"study_design_scores_gemma":[0.000009451618,0.00010565336,0.00026247773,0.000011156287,0.000022785014,0.00011944097,0.000048787526,0.9812438,0.0059296694,0.009453299,0.0027704884,0.000023049772],"about_ca_topic_score_codex":0.003175602,"about_ca_topic_score_gemma":0.004346381,"teacher_disagreement_score":0.003175602,"about_ca_system_score_codex":0.00089035823,"about_ca_system_score_gemma":0.0011757761,"threshold_uncertainty_score":0.006460011},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066199474,0.0003016152,0.9262267,0.000326111,0.000038895807,0.000066657754,0.00009126845,0.00029730913,0.0064518927],"genre_scores_gemma":[0.9398984,0.00034189655,0.055910144,0.00007069767,0.000040520157,0.0000939822,0.000105143205,0.00003300275,0.003506171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861515,0.00042213828,0.000044021497,0.00015786596,0.00054471695,0.00021609841],"domain_scores_gemma":[0.9968622,0.0017239193,0.0005046845,0.00043203394,0.00037808515,0.00009903899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012245983,0.00081836584,0.0006339364,0.0006753703,0.0005206976,0.0011369516,0.0009342813,0.0009159981,0.0011873352],"category_scores_gemma":[0.0039618975,0.00035930632,0.00048512465,0.0007296511,0.0018546176,0.0020869907,0.0022416958,0.0013671442,0.0004370337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032780456,0.00004234065,0.00041827958,0.00012832947,0.00004170422,0.00040278604,0.0002996848,0.7406043,0.024258194,0.20229681,0.0011732954,0.030006401],"study_design_scores_gemma":[0.000015552087,0.000074896394,0.00006594045,0.0000216982,0.00000859243,0.00008872774,0.000033746794,0.9616247,0.005945321,0.031499792,0.0005952552,0.000025732355],"about_ca_topic_score_codex":0.0015022634,"about_ca_topic_score_gemma":0.001150352,"teacher_disagreement_score":0.0015022634,"about_ca_system_score_codex":0.0012618924,"about_ca_system_score_gemma":0.0011057137,"threshold_uncertainty_score":0.009155691},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18000908,0.00068794197,0.80332106,0.00073037704,0.00011039703,0.00011967928,0.0003408926,0.0002068624,0.014473615],"genre_scores_gemma":[0.9723024,0.00047165732,0.023868388,0.000069610534,0.000060256803,0.000054541262,0.00005935787,0.000011681872,0.0031021377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995024,0.00022285251,0.000016681328,0.00009653615,0.0000816634,0.00007984427],"domain_scores_gemma":[0.99909556,0.0005374343,0.0001225673,0.000088319066,0.00010177733,0.000054297652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059943245,0.0009040241,0.0007453734,0.00028353525,0.0006559304,0.0011913702,0.0012703369,0.0018074258,0.0021308642],"category_scores_gemma":[0.0014076775,0.0003053932,0.000565664,0.00061234535,0.00070511794,0.002011633,0.0007036009,0.0008011108,0.0005072114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011104886,0.000045985144,0.00039459212,0.00006691935,0.000019016836,0.00074427837,0.000057898407,0.95616525,0.0060445815,0.031874783,0.00047850425,0.003997157],"study_design_scores_gemma":[0.00001691121,0.00006796616,0.00011697637,0.0000032355613,0.000013682935,0.00011913494,0.000025045021,0.99214584,0.0008672208,0.0062758927,0.00033575363,0.000012256324],"about_ca_topic_score_codex":0.0022469414,"about_ca_topic_score_gemma":0.0026264864,"teacher_disagreement_score":0.0022469414,"about_ca_system_score_codex":0.00070599,"about_ca_system_score_gemma":0.0003579644,"threshold_uncertainty_score":0.007128477},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22322021,0.0032053625,0.76392853,0.00046244566,0.00009512185,0.00007611635,0.000075946096,0.0007313796,0.008204862],"genre_scores_gemma":[0.93481714,0.0009912162,0.062182836,0.00007525476,0.00008794758,0.00008614681,0.00004418838,0.000047661113,0.0016675399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988028,0.00057172996,0.000037784663,0.000113894,0.00030242134,0.00017139176],"domain_scores_gemma":[0.99625117,0.0026450641,0.00025743674,0.00031945892,0.00046855674,0.000058343252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022727198,0.0007207951,0.0007787276,0.00094239006,0.000771169,0.0008470849,0.0013285499,0.0009345155,0.0012330079],"category_scores_gemma":[0.007936079,0.0003943855,0.00032908274,0.0009109877,0.0007193403,0.0015720475,0.0011612882,0.00086260115,0.0005276617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009827462,0.00024276621,0.0034887008,0.00059434684,0.00010982842,0.0008153622,0.00093082123,0.6418522,0.07487392,0.0670549,0.0027656122,0.2062888],"study_design_scores_gemma":[0.00003788078,0.00028253524,0.0004994728,0.000042202963,0.00004838239,0.00033140025,0.000118546974,0.9591114,0.020938428,0.016046843,0.0025143328,0.000028601715],"about_ca_topic_score_codex":0.0005343627,"about_ca_topic_score_gemma":0.0006241448,"teacher_disagreement_score":0.0022727198,"about_ca_system_score_codex":0.00065372087,"about_ca_system_score_gemma":0.00028051462,"threshold_uncertainty_score":0.012019455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052849412,0.0006917001,0.93999887,0.00016446594,0.000027945225,0.00005036073,0.00009810028,0.0003207831,0.00579842],"genre_scores_gemma":[0.75828,0.0004584442,0.23886734,0.000058784957,0.000040260416,0.000044904235,0.00009949593,0.000015566378,0.0021352926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913317,0.0002822037,0.000060205824,0.00012212832,0.00029756405,0.00010487493],"domain_scores_gemma":[0.9993698,0.00020461349,0.0001427637,0.00013731612,0.00012249952,0.000023043727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010043316,0.000554058,0.00078351225,0.0005742419,0.00038024157,0.0008001587,0.0008579983,0.00057287986,0.0010200274],"category_scores_gemma":[0.0012141296,0.00027904593,0.00049170566,0.00091254414,0.00054421404,0.00086743163,0.00073646393,0.00042789668,0.0003959277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095046335,0.00013605389,0.0029929343,0.00025500788,0.00036219737,0.00060961914,0.0004820211,0.5355043,0.10820582,0.08598731,0.00248359,0.2620307],"study_design_scores_gemma":[0.000057820962,0.00026779037,0.0006766528,0.00001785374,0.00013804492,0.00072840473,0.000031158,0.94163626,0.037960697,0.014044052,0.0043737055,0.000067518056],"about_ca_topic_score_codex":0.00070276984,"about_ca_topic_score_gemma":0.0010463484,"teacher_disagreement_score":0.0010200274,"about_ca_system_score_codex":0.00056818716,"about_ca_system_score_gemma":0.0005528911,"threshold_uncertainty_score":0.005311489},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29475218,0.0018410143,0.67961264,0.00043016928,0.00005241141,0.0000687598,0.00015914267,0.00039709176,0.02268663],"genre_scores_gemma":[0.95757324,0.000584974,0.03954289,0.00006790818,0.000021947793,0.000034204197,0.00009990094,0.00006743848,0.0020074407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871397,0.00041553192,0.00003629846,0.0001360378,0.00050261174,0.00019554574],"domain_scores_gemma":[0.9978346,0.0010590097,0.00029795148,0.0001980838,0.0005666649,0.000043615524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000996703,0.00095164357,0.00053297327,0.00053056993,0.0003336342,0.00081775006,0.00052352785,0.00047027136,0.0011307229],"category_scores_gemma":[0.0036932603,0.0002292976,0.000352612,0.00061785546,0.0007707488,0.00092938764,0.0007898927,0.00058028137,0.00029445504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022088685,0.00003757385,0.0022915597,0.00012710717,0.00006499061,0.00015170968,0.000103037164,0.9069677,0.035443336,0.035685524,0.0005015062,0.018405063],"study_design_scores_gemma":[0.000004557271,0.000050827355,0.00029958686,0.000008423252,0.000012642617,0.000056592344,0.000012910008,0.9875814,0.009687328,0.0019236021,0.00034983756,0.000012240085],"about_ca_topic_score_codex":0.0024250294,"about_ca_topic_score_gemma":0.0027107862,"teacher_disagreement_score":0.0024250294,"about_ca_system_score_codex":0.00110044,"about_ca_system_score_gemma":0.0011412416,"threshold_uncertainty_score":0.007984281},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65213,0.001640852,0.32522476,0.0005958497,0.00010368802,0.00008360395,0.00026806537,0.00030791055,0.019645218],"genre_scores_gemma":[0.99366415,0.00022384747,0.0054903314,0.000032525277,0.000009352746,0.000018977109,0.000033111846,0.0000072170074,0.0005206235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838376,0.00067675783,0.000064206,0.0001425217,0.00042440425,0.0003083931],"domain_scores_gemma":[0.9847882,0.011338175,0.0010915537,0.0008872551,0.001720536,0.0001742592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027516913,0.0010719238,0.0008432094,0.00053949194,0.00051075715,0.00080553885,0.0010222314,0.00075419113,0.00056665234],"category_scores_gemma":[0.010949864,0.00027404548,0.00027333465,0.0009784083,0.0014339822,0.0014060155,0.0011873291,0.00050466537,0.00010487308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036251583,0.000032824224,0.0013403809,0.0001343622,0.000051823874,0.00064485124,0.0001687676,0.9685763,0.0061029512,0.014000015,0.00046691246,0.0081183165],"study_design_scores_gemma":[0.000015788455,0.00009011219,0.00032563737,0.000014724967,0.000026360396,0.00020658759,0.000040448016,0.9916135,0.0034904073,0.0039811176,0.00017760099,0.000017788381],"about_ca_topic_score_codex":0.005677405,"about_ca_topic_score_gemma":0.006395768,"teacher_disagreement_score":0.005677405,"about_ca_system_score_codex":0.001380345,"about_ca_system_score_gemma":0.0015852368,"threshold_uncertainty_score":0.014552534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15548937,0.0005506153,0.8345873,0.0005555256,0.00006920283,0.000087629116,0.000048873524,0.00026894978,0.008342569],"genre_scores_gemma":[0.93463105,0.0002515994,0.06276646,0.00012178195,0.000049687507,0.000060319566,0.000033102202,0.00002144499,0.0020645172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937904,0.00019402326,0.000023742921,0.000091164555,0.00018893841,0.00012303618],"domain_scores_gemma":[0.99912256,0.00042670543,0.00014975891,0.00013506475,0.00012006872,0.000045844386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082502444,0.00036735972,0.0004948357,0.00033910325,0.00050730904,0.0007192488,0.0007030382,0.00052473764,0.0014560831],"category_scores_gemma":[0.0021141013,0.0002243629,0.0002127575,0.0003954453,0.000550113,0.0009992808,0.0010867158,0.0006901901,0.00021749196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050256104,0.00017535443,0.0025341806,0.00029636812,0.000053236894,0.0010702781,0.0003760442,0.5909959,0.07539254,0.15263024,0.0040351218,0.17193818],"study_design_scores_gemma":[0.000028263039,0.0003529625,0.0006100298,0.000023154016,0.000023318353,0.00052910834,0.0001026631,0.96098423,0.012545817,0.020721521,0.0040583857,0.000020538846],"about_ca_topic_score_codex":0.0007023769,"about_ca_topic_score_gemma":0.0012714427,"teacher_disagreement_score":0.0014560831,"about_ca_system_score_codex":0.0007693527,"about_ca_system_score_gemma":0.0010176338,"threshold_uncertainty_score":0.0055820346},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48943436,0.0016796058,0.49166897,0.00052585534,0.00004787652,0.000062581836,0.0004280316,0.00032445334,0.015828172],"genre_scores_gemma":[0.9965804,0.0002760351,0.0024171988,0.000019699994,0.000016041817,0.000016862645,0.00005588379,0.000013157487,0.0006047116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989409,0.00040508792,0.00004179984,0.000121945835,0.00027793826,0.0002124063],"domain_scores_gemma":[0.99272376,0.0054122796,0.00069031474,0.00037900943,0.0006460693,0.00014868815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018677998,0.00063233875,0.00078838685,0.00094142545,0.00053965265,0.0008185987,0.0008581783,0.00055347034,0.0014256447],"category_scores_gemma":[0.00818001,0.0002614472,0.0003916725,0.0010272689,0.0011932759,0.001148697,0.00087467226,0.0005973319,0.00016092637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006702528,0.000017300608,0.0017967223,0.00004142517,0.000029945186,0.0002756956,0.00011138514,0.9644373,0.0016570005,0.026539065,0.0005457466,0.004481544],"study_design_scores_gemma":[0.0000041783806,0.000023349494,0.0008418947,0.0000054113007,0.000013819981,0.00006804762,0.00005675943,0.99287194,0.00036903453,0.00557845,0.00015763202,0.000009500118],"about_ca_topic_score_codex":0.004589786,"about_ca_topic_score_gemma":0.001886505,"teacher_disagreement_score":0.004589786,"about_ca_system_score_codex":0.001669987,"about_ca_system_score_gemma":0.00050646596,"threshold_uncertainty_score":0.012116671},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044200584,0.0005514356,0.9502206,0.00026503197,0.00006876789,0.00006602441,0.00008495443,0.00022989271,0.004312746],"genre_scores_gemma":[0.8243238,0.00066858303,0.17198339,0.00015914883,0.000030669235,0.00015768608,0.00010265058,0.00002396458,0.002550086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992454,0.0002651935,0.0000347697,0.00008179265,0.0002520595,0.000120747354],"domain_scores_gemma":[0.9987785,0.00048214075,0.00020914328,0.00029842963,0.0001970014,0.000034659945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087267434,0.00055707694,0.0004023989,0.0004615038,0.00042499925,0.0007098426,0.00079413195,0.0007209524,0.0007192269],"category_scores_gemma":[0.002729004,0.00021243619,0.00034964652,0.00064674765,0.0009860257,0.001268832,0.0013438514,0.0008787459,0.0002338226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023122953,0.000064452455,0.0009806354,0.00025340772,0.000066038374,0.0005693242,0.00041728865,0.54135364,0.04771623,0.3070074,0.0020360728,0.09930432],"study_design_scores_gemma":[0.000023227758,0.000079829704,0.00017453781,0.000032420958,0.00002061682,0.00018365412,0.000026229289,0.95727265,0.019441884,0.01960342,0.0031033633,0.00003822349],"about_ca_topic_score_codex":0.0023936431,"about_ca_topic_score_gemma":0.0031626325,"teacher_disagreement_score":0.0023936431,"about_ca_system_score_codex":0.0007230107,"about_ca_system_score_gemma":0.0011070853,"threshold_uncertainty_score":0.005245805},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30315632,0.00071514637,0.668018,0.0003670944,0.00004926533,0.00011160159,0.0007682524,0.00035953033,0.026454829],"genre_scores_gemma":[0.9853977,0.00026939745,0.012676083,0.000051706305,0.000027490069,0.00010226812,0.00013993145,0.000034428977,0.0013009424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833775,0.00040661474,0.00006374169,0.00021259492,0.0005005347,0.00047862882],"domain_scores_gemma":[0.9897054,0.006820176,0.0010142107,0.0010800002,0.0011356472,0.00024454546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014648387,0.0005778238,0.00079767575,0.0010661646,0.00058890675,0.0017358656,0.0011088485,0.0006615606,0.002862529],"category_scores_gemma":[0.007860908,0.00034212103,0.0006996025,0.0010097029,0.002338492,0.0024263058,0.0016039464,0.0010667924,0.00046829417],"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.00033139446,0.00006623258,0.0009865139,0.00019381626,0.000049154627,0.00031598672,0.00025339084,0.36775696,0.012748746,0.6043731,0.001213323,0.011711385],"study_design_scores_gemma":[0.000038817325,0.000079436795,0.00050434744,0.000026561649,0.000020053454,0.0002851942,0.00008880664,0.77453965,0.009379892,0.21371308,0.0012634897,0.000060677354],"about_ca_topic_score_codex":0.0018289933,"about_ca_topic_score_gemma":0.0007810758,"teacher_disagreement_score":0.002862529,"about_ca_system_score_codex":0.0014661261,"about_ca_system_score_gemma":0.001328841,"threshold_uncertainty_score":0.010637522},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009220508,0.53864527,0.4045797,0.0030221133,0.0020737667,0.0004242083,0.00036583672,0.00064544374,0.041023165],"genre_scores_gemma":[0.101354994,0.7257135,0.1545225,0.0014940613,0.0023933449,0.00074466626,0.0010054843,0.00020807855,0.012563358],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979778,0.00042309755,0.00030749023,0.00021798581,0.0009399146,0.0001336875],"domain_scores_gemma":[0.99794894,0.001115088,0.00015814822,0.00028608553,0.00044704875,0.000044715252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017197955,0.0010941171,0.0011137335,0.0026550537,0.0010139829,0.0025069162,0.0015011566,0.0018544606,0.002534118],"category_scores_gemma":[0.0036175034,0.00083776546,0.0008625022,0.005715362,0.00089899654,0.0048735947,0.0012999839,0.0022842404,0.0016502882],"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.000096769174,0.00013628889,0.0010304077,0.004927349,0.00009107257,0.0004203201,0.00036949667,0.028200282,0.004866366,0.23731537,0.020589476,0.70195675],"study_design_scores_gemma":[0.0000310605,0.0004038965,0.0012877773,0.002557284,0.00015307216,0.0029129956,0.0003320556,0.084624946,0.006643571,0.15867636,0.7422163,0.00016072697],"about_ca_topic_score_codex":0.0010930247,"about_ca_topic_score_gemma":0.0006643767,"teacher_disagreement_score":0.0026550537,"about_ca_system_score_codex":0.0013630269,"about_ca_system_score_gemma":0.0015125435,"threshold_uncertainty_score":0.009889483},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09360473,0.0004884479,0.903981,0.00014014113,0.000016995795,0.000031764437,0.00004183464,0.00017162428,0.0015235464],"genre_scores_gemma":[0.9264027,0.0003262657,0.071851075,0.00003673907,0.000024163473,0.000053030548,0.000027364513,0.00001489222,0.001263743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998944,0.00053949887,0.00003860523,0.00012907964,0.00025742187,0.000091435984],"domain_scores_gemma":[0.9980253,0.0014024293,0.0002029264,0.00012969329,0.00019747597,0.000042126776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012929345,0.00057952275,0.0009569606,0.00030268237,0.0002531291,0.0007287546,0.000501057,0.0011180339,0.00046382868],"category_scores_gemma":[0.0040044277,0.00042271477,0.00044612525,0.00042029284,0.000983589,0.0010355484,0.0009332338,0.00054843375,0.00014931468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001606336,0.00003144242,0.0004519204,0.00008219838,0.000043309636,0.00015906892,0.000116682146,0.95353806,0.009553934,0.021359885,0.00021741937,0.014285483],"study_design_scores_gemma":[0.000007757544,0.000025802266,0.000073303185,0.0000015801944,0.000004798411,0.000026064872,0.000006298196,0.9961366,0.0012967837,0.0023516412,0.00006262753,0.0000066965727],"about_ca_topic_score_codex":0.0020059615,"about_ca_topic_score_gemma":0.0010027121,"teacher_disagreement_score":0.0020059615,"about_ca_system_score_codex":0.00046761055,"about_ca_system_score_gemma":0.00062813686,"threshold_uncertainty_score":0.0068377256},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08340348,0.0018423407,0.8889795,0.0030883166,0.0004300248,0.00008409714,0.00008399183,0.00017897796,0.021909188],"genre_scores_gemma":[0.88624907,0.0018618795,0.10672741,0.00035031905,0.00047838158,0.000102781865,0.00006152875,0.00005114815,0.0041174176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988092,0.00052623276,0.000046037563,0.00010378307,0.00033158014,0.00018311682],"domain_scores_gemma":[0.9916721,0.006448863,0.00035061088,0.0006999066,0.0007126724,0.00011579675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030875206,0.00044998256,0.00080179283,0.000953143,0.0009211184,0.002052915,0.0012335483,0.002064618,0.0019352667],"category_scores_gemma":[0.010776899,0.0002971494,0.0003402058,0.0012481759,0.0013962121,0.0039816783,0.0013749335,0.0013400153,0.0002087708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031618914,0.0000921572,0.0007440415,0.00014053567,0.000039149254,0.00010228127,0.00029607164,0.14053987,0.008476902,0.7086582,0.002567072,0.13802744],"study_design_scores_gemma":[0.000039367525,0.00010333694,0.00018918682,0.000054817283,0.00004872166,0.00014198317,0.00010672319,0.6649728,0.003617177,0.32703722,0.00366291,0.000025760597],"about_ca_topic_score_codex":0.0013965593,"about_ca_topic_score_gemma":0.0015712619,"teacher_disagreement_score":0.0030875206,"about_ca_system_score_codex":0.0011211396,"about_ca_system_score_gemma":0.0012298697,"threshold_uncertainty_score":0.016328573},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008266483,0.004351522,0.9634436,0.0016223645,0.0005019107,0.00009680188,0.00030752958,0.0009848335,0.020424886],"genre_scores_gemma":[0.6515458,0.011762534,0.29850128,0.0025997572,0.0024001645,0.0017631666,0.0015000142,0.002411339,0.02751595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9917208,0.002305361,0.00034563697,0.0016216009,0.0028398074,0.0011667412],"domain_scores_gemma":[0.9639741,0.025277076,0.0021011466,0.0033943907,0.0042768456,0.0009763573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009847066,0.0040919348,0.002698262,0.0038494347,0.002124215,0.0044886554,0.005191126,0.0027173648,0.011937082],"category_scores_gemma":[0.05834697,0.0014667057,0.0024121108,0.0036412522,0.0038321996,0.013332761,0.0065284967,0.0100293,0.0039698635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045718384,0.000103798746,0.0007489999,0.000573971,0.00014760559,0.00018955715,0.0005540042,0.48027357,0.003810027,0.4498911,0.014332665,0.0489176],"study_design_scores_gemma":[0.00003238827,0.000084729465,0.00024771583,0.00011241211,0.0000544913,0.000073444404,0.000070304784,0.74755615,0.0013240799,0.24427631,0.006127989,0.0000399444],"about_ca_topic_score_codex":0.0038279805,"about_ca_topic_score_gemma":0.0033402105,"teacher_disagreement_score":0.011937082,"about_ca_system_score_codex":0.0060466304,"about_ca_system_score_gemma":0.0026948943,"threshold_uncertainty_score":0.052076876},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15907076,0.0015594771,0.83420956,0.00016698682,0.000068923066,0.000057232814,0.000035949248,0.0003266314,0.0045045204],"genre_scores_gemma":[0.95986193,0.0002695482,0.039337277,0.00003368153,0.000025522004,0.000027372289,0.000015023972,0.000006290147,0.00042338687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994836,0.00016628859,0.000023593826,0.00009957007,0.0001395201,0.0000873805],"domain_scores_gemma":[0.9993056,0.0002673928,0.00014948567,0.000116760355,0.00012411353,0.00003660182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005658754,0.0004553873,0.00057517167,0.0004237302,0.0005957908,0.0005943451,0.00082437566,0.00046375243,0.0003862079],"category_scores_gemma":[0.0011202268,0.00016944548,0.00032148525,0.0005992936,0.0005449091,0.0005039611,0.00043327798,0.00034940062,0.00010977038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046263254,0.00013741005,0.002669599,0.00016938323,0.00014542101,0.00091810356,0.00038007135,0.7115592,0.06806255,0.024832087,0.0015828433,0.18908082],"study_design_scores_gemma":[0.000024580311,0.00023426586,0.0008009153,0.00001234516,0.00005135504,0.0005388258,0.00005332695,0.9786633,0.014429165,0.003673077,0.0014889991,0.000029847082],"about_ca_topic_score_codex":0.003396304,"about_ca_topic_score_gemma":0.0031871826,"teacher_disagreement_score":0.003396304,"about_ca_system_score_codex":0.0006365424,"about_ca_system_score_gemma":0.00055418804,"threshold_uncertainty_score":0.006753087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4128332,0.0028253542,0.5663234,0.0009824381,0.00013913515,0.00015400078,0.00054563093,0.0008457782,0.01535102],"genre_scores_gemma":[0.979185,0.00043350545,0.018963303,0.00006908611,0.000024735626,0.00007543181,0.00017957482,0.000030173142,0.0010392835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979929,0.00086966105,0.00007199207,0.00014805859,0.0006519924,0.00026547228],"domain_scores_gemma":[0.9885548,0.007995221,0.0008955815,0.0007164754,0.0015757674,0.00026204268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002760954,0.0009206846,0.00070960616,0.0008530875,0.00055301626,0.001027358,0.00068391644,0.00076454005,0.0012399808],"category_scores_gemma":[0.013533772,0.00026987612,0.00023518469,0.000911524,0.0012329327,0.001166519,0.0014569287,0.00061793695,0.00023192889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005973765,0.000055572196,0.001315818,0.0001626163,0.000043720695,0.0001007599,0.00015448165,0.9192442,0.0074777533,0.036119472,0.0013596,0.03336862],"study_design_scores_gemma":[0.000010794007,0.00013176393,0.0002227138,0.000010546247,0.000005491389,0.000043801945,0.00002970891,0.9895788,0.0018295486,0.007902207,0.00022029446,0.000014312997],"about_ca_topic_score_codex":0.0034760628,"about_ca_topic_score_gemma":0.002297771,"teacher_disagreement_score":0.0034760628,"about_ca_system_score_codex":0.0015064046,"about_ca_system_score_gemma":0.0021440855,"threshold_uncertainty_score":0.014601469},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09608378,0.00062976044,0.89362586,0.00030058163,0.000050812716,0.000060748953,0.00005044153,0.00020998473,0.008987927],"genre_scores_gemma":[0.9619296,0.0004042947,0.03408881,0.000039953557,0.000030395786,0.000068419555,0.000027079031,0.000016387026,0.0033950356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994374,0.00022022634,0.000017380487,0.000091932256,0.0001465442,0.0000865062],"domain_scores_gemma":[0.9990097,0.00059191557,0.00012389482,0.000087784734,0.0001359948,0.00005072772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060556264,0.00062548526,0.0008029649,0.0002693877,0.0005496549,0.00075300754,0.0014392937,0.0008632257,0.0011979892],"category_scores_gemma":[0.0018523575,0.0003164719,0.00036749162,0.0006025284,0.0006503871,0.0013676117,0.0012132816,0.00054170535,0.0004278651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011081086,0.00006570801,0.0005254017,0.00016084139,0.00005574232,0.0008958538,0.00026710267,0.9056135,0.013352486,0.06054401,0.00093093124,0.017477546],"study_design_scores_gemma":[0.000008176219,0.000044329907,0.000060201743,0.0000034034117,0.00000831049,0.000078543635,0.00003975337,0.9908511,0.0010827616,0.007369642,0.00044603774,0.000007650947],"about_ca_topic_score_codex":0.0012851458,"about_ca_topic_score_gemma":0.0012413332,"teacher_disagreement_score":0.0014392937,"about_ca_system_score_codex":0.0004495667,"about_ca_system_score_gemma":0.0004155898,"threshold_uncertainty_score":0.004007697},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47209007,0.0026216437,0.52096343,0.0004160255,0.00007332593,0.00006142084,0.00018543474,0.00023059467,0.0033580216],"genre_scores_gemma":[0.99372876,0.00030081984,0.0056868633,0.000021715678,0.000011168758,0.000014634506,0.000017821229,0.00000403761,0.00021434222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891615,0.00043548006,0.0000614251,0.00014968515,0.0002097648,0.00022738159],"domain_scores_gemma":[0.99559444,0.0033097598,0.00038076466,0.00026010457,0.00031997406,0.00013497045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00121895,0.0010791436,0.0008424317,0.0005608564,0.0007661913,0.001056337,0.0009452353,0.000722215,0.00050398347],"category_scores_gemma":[0.0052011185,0.0005010401,0.0003747779,0.0009480642,0.00097404525,0.0013782779,0.0013742769,0.00052548916,0.00009199608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005936985,0.000058699585,0.003000819,0.00020644783,0.00010243952,0.0010392077,0.00027307332,0.9286611,0.011769344,0.012311427,0.00049650716,0.04148719],"study_design_scores_gemma":[0.000016578166,0.00016814722,0.0004598183,0.0000116542005,0.000042894328,0.00026126936,0.00008699685,0.99204516,0.003043886,0.0035932404,0.00025379282,0.000016601329],"about_ca_topic_score_codex":0.0033557315,"about_ca_topic_score_gemma":0.005279175,"teacher_disagreement_score":0.0033557315,"about_ca_system_score_codex":0.00096797507,"about_ca_system_score_gemma":0.0007690119,"threshold_uncertainty_score":0.0070232153},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021261894,0.0001591759,0.9930235,0.00018733964,0.000020864307,0.000024068135,0.00003114565,0.00008917037,0.0043385536],"genre_scores_gemma":[0.46270588,0.001174195,0.52575064,0.00045175443,0.00026791487,0.00038781462,0.00016127029,0.00026994338,0.008830615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960679,0.001508969,0.00018638691,0.0005651668,0.0013676665,0.00030391116],"domain_scores_gemma":[0.99299943,0.004545814,0.0004421585,0.0009877314,0.0008335077,0.00019142113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039460068,0.0014653411,0.0012918451,0.0013795149,0.0011029826,0.0027249102,0.0024328423,0.001553872,0.0033371544],"category_scores_gemma":[0.012275605,0.0007426215,0.0012830757,0.0014666085,0.0038110763,0.005519886,0.0036519591,0.0037194744,0.00097387534],"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.000052898456,0.000022390095,0.00009690752,0.0000589042,0.000017631835,0.00007584866,0.00011411539,0.09188347,0.0015900162,0.8927175,0.00065086666,0.012719426],"study_design_scores_gemma":[0.000014370565,0.00005144717,0.000029430968,0.000024925721,0.000014809664,0.00016793996,0.000024663372,0.4813358,0.0028872048,0.51167494,0.0037444162,0.000030173647],"about_ca_topic_score_codex":0.0013093693,"about_ca_topic_score_gemma":0.0011646599,"teacher_disagreement_score":0.0039460068,"about_ca_system_score_codex":0.0023596382,"about_ca_system_score_gemma":0.0019662664,"threshold_uncertainty_score":0.020868719},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15255795,0.0007092723,0.8399976,0.00048276252,0.0000526019,0.000052974487,0.00008981038,0.0001091089,0.0059479536],"genre_scores_gemma":[0.96765715,0.00062065234,0.02723992,0.00010308133,0.00006497898,0.00006486364,0.000050301685,0.00002488222,0.0041742367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882966,0.00052721094,0.000033294076,0.00017220806,0.00016074887,0.00027682702],"domain_scores_gemma":[0.9949734,0.0035517658,0.0008292361,0.00012200565,0.00038646135,0.00013714467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014619068,0.00079575647,0.0008519815,0.00061037875,0.00062420726,0.0013978939,0.0007125139,0.001253517,0.0011322654],"category_scores_gemma":[0.0050948365,0.00057962496,0.00043930972,0.0011364456,0.0016316451,0.0019212553,0.0008994815,0.0007687247,0.00024579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010349528,0.00004121971,0.0007762294,0.000057662775,0.000024803523,0.00026155965,0.00008615678,0.94932693,0.0020438032,0.04138893,0.00033933972,0.0055499882],"study_design_scores_gemma":[0.00001527057,0.00005037128,0.00021624322,0.000005829304,0.000007650296,0.00006676517,0.00005855047,0.9880889,0.0006478456,0.010629491,0.00020260985,0.00001047496],"about_ca_topic_score_codex":0.0041843834,"about_ca_topic_score_gemma":0.0022906666,"teacher_disagreement_score":0.0041843834,"about_ca_system_score_codex":0.0011620235,"about_ca_system_score_gemma":0.00085314247,"threshold_uncertainty_score":0.008431077},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009954878,0.54452837,0.41080955,0.0015851195,0.0006899801,0.00016556989,0.0000714807,0.00015914987,0.032035783],"genre_scores_gemma":[0.20905279,0.67812276,0.10279155,0.0007254796,0.002367612,0.00036451188,0.00020777265,0.00008128924,0.0062861964],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914134,0.00024861685,0.00006626758,0.0001245975,0.00034679106,0.0000723479],"domain_scores_gemma":[0.998494,0.0010470086,0.000086374865,0.00010771784,0.00022227383,0.000042627475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001396308,0.0008034751,0.0009719298,0.0015108933,0.0005910945,0.0016946394,0.0012610309,0.0015238944,0.0010403274],"category_scores_gemma":[0.002014135,0.00054376014,0.0005399359,0.0035631033,0.0013757856,0.0028490736,0.0010438254,0.0012839015,0.0004106565],"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.00008720691,0.00023751211,0.0020225297,0.0032666014,0.00010065415,0.00027858373,0.00030093244,0.06279334,0.0025141495,0.1959415,0.0076097976,0.72484726],"study_design_scores_gemma":[0.000054421587,0.0006949928,0.002980603,0.0019509214,0.00022998116,0.0030759433,0.00067743845,0.34995344,0.006972527,0.25123513,0.38192055,0.0002541073],"about_ca_topic_score_codex":0.0016210382,"about_ca_topic_score_gemma":0.0011730113,"teacher_disagreement_score":0.0016946394,"about_ca_system_score_codex":0.0008952637,"about_ca_system_score_gemma":0.0010818456,"threshold_uncertainty_score":0.007384479},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033466283,0.00048498556,0.9620724,0.00019215871,0.000056965837,0.000047330403,0.000059567286,0.00021415151,0.0034063058],"genre_scores_gemma":[0.89941615,0.0007851825,0.0955496,0.00010107729,0.000055391014,0.00014810037,0.000113086055,0.000078527795,0.003752765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990675,0.0002797895,0.00003053263,0.00014888415,0.00030831073,0.00016498372],"domain_scores_gemma":[0.99771047,0.0016713467,0.00017763562,0.00016701716,0.00021869839,0.00005470798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011578839,0.001182789,0.0008480395,0.0007056298,0.0005326914,0.00078619923,0.0014417775,0.00091628404,0.0010083099],"category_scores_gemma":[0.0039701858,0.00042669324,0.0004924318,0.0010434397,0.0011460568,0.0017079854,0.0013743672,0.0009950537,0.00025317667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013402809,0.00003564971,0.00018943254,0.000099607685,0.000027656783,0.000098192075,0.00010113845,0.9305946,0.00688376,0.036941484,0.0007187772,0.024175659],"study_design_scores_gemma":[0.000010451489,0.000052104577,0.00005457623,0.000008093479,0.000010333982,0.00003921737,0.000019182246,0.98516256,0.0021908674,0.011941789,0.0005012346,0.000009627904],"about_ca_topic_score_codex":0.0028485805,"about_ca_topic_score_gemma":0.0029163668,"teacher_disagreement_score":0.0028485805,"about_ca_system_score_codex":0.0015397047,"about_ca_system_score_gemma":0.0014778678,"threshold_uncertainty_score":0.011171401},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028165404,0.00053834566,0.95798093,0.00066064746,0.000098834316,0.00017047262,0.000055497203,0.000080758895,0.012249093],"genre_scores_gemma":[0.8852802,0.0006483234,0.10870884,0.00020302967,0.000070330854,0.00021541509,0.000055559936,0.000025902209,0.0047923597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866724,0.0005659636,0.000055652403,0.00022086776,0.00032338704,0.00016700347],"domain_scores_gemma":[0.9990627,0.0004871497,0.000100151985,0.000082547136,0.00013431846,0.00013312699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012132031,0.0008819196,0.00095333054,0.00071289565,0.0011490379,0.0015003406,0.0019566948,0.0013700448,0.0020167085],"category_scores_gemma":[0.002251577,0.00037734068,0.0008380552,0.0009989733,0.0013181781,0.0030559811,0.0022590775,0.0013671792,0.00017230224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115791176,0.00016759604,0.0012865835,0.00021364307,0.0001224962,0.0005341433,0.0004754307,0.6039532,0.0040980796,0.3421921,0.0025397092,0.044301268],"study_design_scores_gemma":[0.00002473935,0.00006565377,0.00016514234,0.000011399026,0.00003217726,0.00012026833,0.000121691686,0.945106,0.0005698408,0.05069201,0.0030684588,0.00002263068],"about_ca_topic_score_codex":0.0048634927,"about_ca_topic_score_gemma":0.004138203,"teacher_disagreement_score":0.0048634927,"about_ca_system_score_codex":0.0016709922,"about_ca_system_score_gemma":0.0015337777,"threshold_uncertainty_score":0.012123883},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017707225,0.00034328658,0.97498953,0.00038434617,0.00017701172,0.00033588966,0.00011096819,0.0005935518,0.0053581577],"genre_scores_gemma":[0.81238943,0.00045589363,0.17952175,0.0003909403,0.000094442854,0.0005617238,0.0001559849,0.00004496643,0.006384851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829024,0.00037223753,0.000087694585,0.00019171071,0.00077316246,0.000284891],"domain_scores_gemma":[0.9975931,0.0010027776,0.00020519391,0.00049611274,0.00060999807,0.00009285198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017326856,0.0008409406,0.000950307,0.0009953888,0.0013852135,0.001109019,0.0016385901,0.0010207682,0.0014340954],"category_scores_gemma":[0.0034786356,0.00038511743,0.00053781335,0.0011841469,0.0012968217,0.0013226111,0.0029692547,0.0012222577,0.00035395063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00098476,0.0004978779,0.0019617302,0.0004362663,0.00027038887,0.0014865447,0.0009145437,0.33944544,0.104523785,0.27424392,0.011420546,0.2638142],"study_design_scores_gemma":[0.00006564524,0.00018602276,0.0002359957,0.000026187008,0.00010044942,0.0004908606,0.000053481745,0.96422076,0.010996538,0.018689118,0.00487161,0.00006333628],"about_ca_topic_score_codex":0.0042112004,"about_ca_topic_score_gemma":0.008126504,"teacher_disagreement_score":0.0042112004,"about_ca_system_score_codex":0.0011497418,"about_ca_system_score_gemma":0.003277249,"threshold_uncertainty_score":0.009163439},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006216686,0.02131948,0.017512748,0.033624586,0.12046987,0.0020383107,0.026663799,0.0023152386,0.76983917],"genre_scores_gemma":[0.040868416,0.014866822,0.00341176,0.002795,0.030047735,0.00094687863,0.011927534,0.0008807482,0.89425516],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99949634,0.000088370754,0.000026438538,0.00013034444,0.00014716266,0.000111367626],"domain_scores_gemma":[0.99722505,0.0006981085,0.00010134149,0.0002998048,0.00088249566,0.0007932439],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001152392,0.0017498095,0.0021278812,0.00065149606,0.0019088165,0.004003631,0.001266009,0.0037133533,0.5950185],"category_scores_gemma":[0.002966014,0.00021895822,0.0010043622,0.0013566008,0.00038520538,0.0016701897,0.0017447543,0.0024084295,0.3012659],"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.00037755494,0.000112252645,0.00029470853,0.00045096877,0.000029436454,0.000077955454,0.000033002972,0.00024084673,0.0019284098,0.002417399,0.9422166,0.05182086],"study_design_scores_gemma":[0.00012482693,0.00023194226,0.0012214802,0.00020444233,0.000040698225,0.00018596747,0.00006701095,0.0010163317,0.0016031183,0.00380713,0.9914682,0.00002882968],"about_ca_topic_score_codex":0.00089571805,"about_ca_topic_score_gemma":0.0016771667,"teacher_disagreement_score":0.4049815,"about_ca_system_score_codex":0.0010108814,"about_ca_system_score_gemma":0.0012705044,"threshold_uncertainty_score":0.5776569},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01652678,0.00026329383,0.9790436,0.00012890373,0.00004484183,0.00005271911,0.00004886203,0.00013722108,0.0037537122],"genre_scores_gemma":[0.6525078,0.0012133296,0.33925068,0.00021584328,0.00014317618,0.00034821205,0.00021630486,0.00016307534,0.005941629],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985511,0.0004975253,0.00007174214,0.00020210254,0.00047004098,0.00020745026],"domain_scores_gemma":[0.99729025,0.0018165727,0.00024215563,0.00030707594,0.00027322661,0.00007078201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015624326,0.0015580766,0.0012115533,0.0005360993,0.00056038296,0.0015276414,0.0012981807,0.0012948372,0.001982582],"category_scores_gemma":[0.0064411224,0.00047923467,0.0007420205,0.0014125408,0.0016325356,0.0032560194,0.0023019898,0.0015862951,0.00072961947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030426908,0.000083133455,0.00052863476,0.00017339573,0.00006574209,0.00034956672,0.0003035099,0.62591296,0.017131459,0.30641228,0.0013986457,0.047336288],"study_design_scores_gemma":[0.000017437498,0.000090040354,0.000043150692,0.000012107238,0.00001389597,0.00008301411,0.000019685864,0.9493005,0.006903565,0.04236544,0.0011286625,0.000022405273],"about_ca_topic_score_codex":0.0014768771,"about_ca_topic_score_gemma":0.00095659867,"teacher_disagreement_score":0.001982582,"about_ca_system_score_codex":0.0009639996,"about_ca_system_score_gemma":0.0010620792,"threshold_uncertainty_score":0.0082630515},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011886486,0.00029993439,0.9857416,0.00006847242,0.0000292486,0.000017552631,0.000018439123,0.00006482739,0.0018734176],"genre_scores_gemma":[0.6174536,0.0005134174,0.37850362,0.000112397574,0.00009428627,0.00010890518,0.0000958246,0.000030885672,0.0030870878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927324,0.00023728717,0.000020216145,0.000081263104,0.00031272238,0.000075303884],"domain_scores_gemma":[0.99916875,0.00031147568,0.00012549364,0.0001660266,0.00018665056,0.00004159109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005350949,0.00042029546,0.00033386043,0.00041252314,0.00031611396,0.0005341203,0.0005436005,0.00041303688,0.00080544286],"category_scores_gemma":[0.0019400599,0.00014529371,0.00023003007,0.0008050301,0.00054059795,0.0007482654,0.0007690709,0.00056386634,0.0003299353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019720406,0.00007168215,0.001120997,0.00013109102,0.00005789352,0.00017020818,0.00014856215,0.459243,0.03771018,0.19141886,0.0020035154,0.3077268],"study_design_scores_gemma":[0.000014182403,0.00006631453,0.00017832397,0.000007948364,0.000010189602,0.00008524136,0.000015700301,0.9771648,0.0068334225,0.01229102,0.0033214139,0.000011471172],"about_ca_topic_score_codex":0.0016849908,"about_ca_topic_score_gemma":0.0023357337,"teacher_disagreement_score":0.0016849908,"about_ca_system_score_codex":0.00053089345,"about_ca_system_score_gemma":0.0009226051,"threshold_uncertainty_score":0.0038519502},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008270179,0.020556735,0.017004259,0.0060351854,0.04818787,0.0004602587,0.0062660016,0.0031265817,0.897536],"genre_scores_gemma":[0.0024932008,0.008719654,0.0036858208,0.0016586533,0.005621342,0.00018241699,0.0047630398,0.0007087139,0.9721673],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994804,0.00004816532,0.000032740907,0.000140299,0.00022772103,0.000070638525],"domain_scores_gemma":[0.9991912,0.00009548506,0.00004125572,0.000079197795,0.00038629558,0.00020659361],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000551815,0.0015721635,0.001191584,0.0017762977,0.00096000015,0.0033987358,0.0018097811,0.0017950108,0.6241691],"category_scores_gemma":[0.0022876845,0.00047987507,0.00084388896,0.00187433,0.00029588095,0.0030091687,0.0018850035,0.0018784694,0.55544424],"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.00002770178,0.000033118413,0.0000492961,0.0002539392,0.0000056575072,0.00004019983,0.000023646597,0.00025531263,0.0005018293,0.005841275,0.88103795,0.11193008],"study_design_scores_gemma":[0.0000028591166,0.00001898988,0.000073151336,0.0000810617,0.0000028064994,0.000055029483,0.000012043991,0.000103568316,0.000082410115,0.0012258117,0.99833786,0.0000043163345],"about_ca_topic_score_codex":0.0014644301,"about_ca_topic_score_gemma":0.0024962102,"teacher_disagreement_score":0.3758309,"about_ca_system_score_codex":0.0013175255,"about_ca_system_score_gemma":0.0013652855,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24021675,0.0025494285,0.74111503,0.0006177247,0.000059782527,0.00006273316,0.0002187217,0.00040335528,0.014756447],"genre_scores_gemma":[0.9885943,0.0005207972,0.009800111,0.000035809084,0.00002320818,0.000024714967,0.00003471814,0.000012592271,0.00095377525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988129,0.00048449892,0.00004487932,0.00015057751,0.00032080428,0.00018637549],"domain_scores_gemma":[0.99608177,0.002593604,0.0004062203,0.00031317925,0.00052102463,0.000084264924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017094194,0.001046463,0.0008521228,0.0005688754,0.00040404487,0.0012788245,0.000919258,0.0008248829,0.0012401922],"category_scores_gemma":[0.0057998397,0.00035261133,0.0003718249,0.00065440626,0.0010814179,0.0014672952,0.0010628003,0.0006838307,0.00031473217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015071357,0.000028834362,0.00071156316,0.00012632694,0.00003988876,0.00023527625,0.00010055,0.9447476,0.009079874,0.035191692,0.0003593633,0.009228308],"study_design_scores_gemma":[0.0000048445213,0.00006460599,0.00021703079,0.000009789329,0.000011772439,0.00009497245,0.000029315757,0.9934273,0.0019947847,0.0039874106,0.0001478389,0.000010304126],"about_ca_topic_score_codex":0.001663237,"about_ca_topic_score_gemma":0.0012690454,"teacher_disagreement_score":0.0017094194,"about_ca_system_score_codex":0.0011617269,"about_ca_system_score_gemma":0.00051483,"threshold_uncertainty_score":0.009040356},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018616717,0.00014033297,0.980027,0.00004565465,0.000014181401,0.000016256065,0.000013197231,0.000064887114,0.0010617299],"genre_scores_gemma":[0.8733866,0.000359444,0.12438146,0.000045122248,0.000048017955,0.00006081053,0.000037897295,0.00002647422,0.0016542405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995814,0.00014721588,0.00001510262,0.00008324682,0.00013595897,0.00003701164],"domain_scores_gemma":[0.9987872,0.00083697663,0.00015836848,0.00008143191,0.000114901486,0.000021076465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006913023,0.0005060346,0.0004354452,0.00017738891,0.00023056431,0.00039924812,0.0004056492,0.0004816284,0.0007004157],"category_scores_gemma":[0.002931655,0.0002300327,0.00028537234,0.00030779472,0.0005035993,0.0008038208,0.00051133806,0.00046516382,0.00022017852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008595306,0.000026094676,0.0008143629,0.0000823914,0.000029741093,0.00012549885,0.00015028985,0.92378265,0.019132713,0.020389238,0.00024222994,0.035138886],"study_design_scores_gemma":[0.0000069411294,0.00007292173,0.00017722389,0.0000047856834,0.000008527165,0.000049002545,0.000018233057,0.993628,0.004119626,0.0015285793,0.00037940644,0.000006794294],"about_ca_topic_score_codex":0.000954037,"about_ca_topic_score_gemma":0.0012432288,"teacher_disagreement_score":0.000954037,"about_ca_system_score_codex":0.0004832515,"about_ca_system_score_gemma":0.00044958922,"threshold_uncertainty_score":0.0036560297},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10455211,0.0010916638,0.8852667,0.0002446678,0.00006129279,0.000041117124,0.0000853725,0.00018133645,0.008475653],"genre_scores_gemma":[0.94413286,0.0005381962,0.053288355,0.000062036655,0.00003597048,0.00003467723,0.000047849237,0.000010511583,0.0018495034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992816,0.00026735553,0.00003018364,0.00008372224,0.0002356917,0.00010149161],"domain_scores_gemma":[0.999127,0.000462334,0.00011924888,0.000102168946,0.00015629725,0.000033029562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007012378,0.00069050724,0.00053899654,0.0004077262,0.00046112714,0.0008505454,0.0007730338,0.000595719,0.00078469433],"category_scores_gemma":[0.0013231762,0.00026400542,0.00036893663,0.00076938124,0.00089522876,0.0010452839,0.0007753644,0.00052456185,0.00018256633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041929117,0.00008218715,0.0015576085,0.00024125849,0.00009868715,0.0008458529,0.00056631205,0.67789644,0.05116232,0.15339193,0.0012913421,0.11244678],"study_design_scores_gemma":[0.00001829639,0.00011591853,0.00021610342,0.00001399826,0.00002870942,0.0002606839,0.00004054388,0.9801563,0.004606374,0.013370578,0.0011504645,0.000022139942],"about_ca_topic_score_codex":0.002530122,"about_ca_topic_score_gemma":0.003602107,"teacher_disagreement_score":0.002530122,"about_ca_system_score_codex":0.0008171693,"about_ca_system_score_gemma":0.0007862969,"threshold_uncertainty_score":0.005928993},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19971938,0.0032210085,0.79205465,0.00021649364,0.00012117387,0.00006385652,0.00006634976,0.00041743816,0.0041195774],"genre_scores_gemma":[0.93052053,0.0005364143,0.06816021,0.0000670556,0.000040618484,0.00003190237,0.000033123906,0.000011398229,0.00059883704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997062,0.00008826802,0.000020521938,0.00004992344,0.000084009174,0.0000510264],"domain_scores_gemma":[0.99968624,0.000091846734,0.00006232811,0.00007341799,0.00006959366,0.000016536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003035699,0.00042553802,0.00037970132,0.0003482691,0.00048870326,0.0003108401,0.0007494171,0.00037037476,0.0004936643],"category_scores_gemma":[0.0007949512,0.00013978181,0.00041221065,0.00042620866,0.00032405532,0.0004314287,0.0003078901,0.00030134062,0.00020033601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006784438,0.0001773782,0.003655524,0.00030826312,0.00016517077,0.0010666185,0.0005049894,0.1903815,0.24817367,0.018707484,0.0025811833,0.5335998],"study_design_scores_gemma":[0.00007409423,0.00077971065,0.0029849852,0.000052184725,0.00013385828,0.0031763536,0.000116035735,0.892444,0.086976476,0.0055399705,0.007625241,0.00009703762],"about_ca_topic_score_codex":0.0016921222,"about_ca_topic_score_gemma":0.002201667,"teacher_disagreement_score":0.0016921222,"about_ca_system_score_codex":0.00030710822,"about_ca_system_score_gemma":0.00034985394,"threshold_uncertainty_score":0.003364563},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016790666,0.0043371916,0.53244275,0.0015597324,0.0017492662,0.000148054,0.002238826,0.0018650024,0.43886852],"genre_scores_gemma":[0.28483045,0.008700126,0.22503261,0.0020311482,0.0016478492,0.0004650989,0.006615993,0.0017354115,0.46894136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994967,0.000089732304,0.000021018006,0.00008121216,0.00024352208,0.00006787898],"domain_scores_gemma":[0.999443,0.00010537993,0.00003723556,0.00018495337,0.00018146342,0.000047857484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034735393,0.00070200686,0.00055706286,0.0012946677,0.00070497143,0.0013151967,0.0005580641,0.0007487033,0.031437695],"category_scores_gemma":[0.0014648136,0.00027100186,0.00041494676,0.0015712425,0.0008492364,0.0015697059,0.0017048831,0.0016525979,0.017334143],"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.00006670956,0.00002330164,0.00012143612,0.000105570645,0.0000119457745,0.00003381637,0.00007091964,0.005258884,0.002629536,0.7693104,0.036398266,0.18596917],"study_design_scores_gemma":[0.000021194113,0.000058836446,0.00021703598,0.000093061404,0.000011678733,0.00033044018,0.000053650238,0.018098062,0.006267069,0.7897222,0.18508905,0.00003768112],"about_ca_topic_score_codex":0.00045121065,"about_ca_topic_score_gemma":0.00053544255,"teacher_disagreement_score":0.031437695,"about_ca_system_score_codex":0.0005022735,"about_ca_system_score_gemma":0.00083538995,"threshold_uncertainty_score":0.105169594},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1816228,0.0036957127,0.7847737,0.0009763675,0.00008441178,0.00007077192,0.00016477829,0.0001523392,0.028459132],"genre_scores_gemma":[0.98355836,0.0011396561,0.013442204,0.00011337053,0.00006728836,0.000046130634,0.00004580614,0.000026807766,0.0015603368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987556,0.0005018041,0.00003218693,0.0000720853,0.0004728076,0.00016560711],"domain_scores_gemma":[0.9931605,0.005094766,0.0005203342,0.0002790034,0.00085418567,0.000091144284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021662258,0.0006932014,0.0007935279,0.00082968414,0.00052179245,0.0010085232,0.0006850923,0.0010126011,0.0010272454],"category_scores_gemma":[0.009025591,0.0002908724,0.00037024097,0.0010293905,0.0016553759,0.0013196397,0.0010610451,0.000868986,0.00020432721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056781613,0.00003411408,0.0011940188,0.00015269665,0.000034803612,0.0004210135,0.00027803844,0.8686118,0.004218879,0.11534285,0.0008997456,0.008755257],"study_design_scores_gemma":[0.0000033214535,0.000020736194,0.00025936848,0.000016226708,0.0000065076197,0.00015424233,0.000039605227,0.9867736,0.0006872155,0.011715074,0.00031502603,0.000009115771],"about_ca_topic_score_codex":0.0024089427,"about_ca_topic_score_gemma":0.0018560968,"teacher_disagreement_score":0.0024089427,"about_ca_system_score_codex":0.0017865024,"about_ca_system_score_gemma":0.0008369121,"threshold_uncertainty_score":0.012962043},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021998525,0.00053292833,0.9699943,0.00026202583,0.00007393985,0.000051262916,0.00010264465,0.0004829045,0.0065014786],"genre_scores_gemma":[0.72169363,0.0008460714,0.26835734,0.0003254586,0.00007956197,0.00009447173,0.00017995208,0.000052816336,0.00837075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995189,0.00009086326,0.000026550613,0.00006503545,0.00026854986,0.000030119976],"domain_scores_gemma":[0.9995877,0.00014701702,0.000041837844,0.000044647142,0.00016369495,0.000015097358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030048226,0.00033693304,0.00038769227,0.00029082305,0.00039358178,0.0005726926,0.00042662414,0.00050376804,0.0017572389],"category_scores_gemma":[0.0010516845,0.00013079462,0.00022200638,0.00038238283,0.0003276861,0.00048565416,0.00035623394,0.0005539575,0.00058694964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026742704,0.00009441744,0.0010924533,0.00036689587,0.00007677731,0.00026125426,0.00015154529,0.5002527,0.11084271,0.11018644,0.0047069113,0.2717004],"study_design_scores_gemma":[0.000009965712,0.0000838791,0.00022316772,0.000016415863,0.000013704645,0.00016167319,0.000010071132,0.9642668,0.022290716,0.008540579,0.004367754,0.000015269648],"about_ca_topic_score_codex":0.0018475498,"about_ca_topic_score_gemma":0.003558481,"teacher_disagreement_score":0.0018475498,"about_ca_system_score_codex":0.0006115536,"about_ca_system_score_gemma":0.0012955873,"threshold_uncertainty_score":0.005878508},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028539028,0.00044149783,0.9690841,0.00018977361,0.000037953418,0.000031130763,0.000038245984,0.000108796194,0.0015294543],"genre_scores_gemma":[0.8812868,0.00050293637,0.114416525,0.00010798645,0.00007947408,0.00013799655,0.000086322776,0.00007362597,0.0033083507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945587,0.00020840917,0.000030430498,0.000096144766,0.00013733686,0.00007178194],"domain_scores_gemma":[0.9988263,0.0008056979,0.00008723722,0.000055757435,0.00019822131,0.00002665568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012044584,0.0007715601,0.0009253451,0.00035770953,0.00027099697,0.00049689465,0.0009808812,0.00081395236,0.00097301154],"category_scores_gemma":[0.003598759,0.00041557776,0.00038108643,0.00055417,0.0005878541,0.0008828596,0.00092672993,0.00057017116,0.00016609135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011319412,0.0000591245,0.00041695737,0.00010116895,0.00005830748,0.000054421307,0.00009395029,0.9313068,0.00608454,0.008332899,0.0008356052,0.052543096],"study_design_scores_gemma":[0.0000037691661,0.000026137288,0.00009914745,0.0000042333922,0.0000058243522,0.000013341589,0.0000055823257,0.9973031,0.0007873738,0.0016512013,0.00009728189,0.0000029250562],"about_ca_topic_score_codex":0.0018579954,"about_ca_topic_score_gemma":0.0022667225,"teacher_disagreement_score":0.0018579954,"about_ca_system_score_codex":0.00057890423,"about_ca_system_score_gemma":0.00090519246,"threshold_uncertainty_score":0.006369889},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109914616,0.00050824165,0.8865716,0.00009320297,0.000027055667,0.000027968917,0.000033444452,0.00009077967,0.0027332096],"genre_scores_gemma":[0.96593565,0.00030470503,0.032507315,0.000025922263,0.000025604288,0.00002726329,0.000016060692,0.000009497876,0.0011479938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990363,0.00055595906,0.000028688943,0.00012367808,0.00016291445,0.00009251088],"domain_scores_gemma":[0.9990687,0.00055179273,0.00012830336,0.00012846438,0.00009071066,0.000032108466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010452793,0.00069981423,0.00047983573,0.00033153172,0.0003430965,0.00062064885,0.0006067163,0.00040381475,0.00039828938],"category_scores_gemma":[0.0021341802,0.0002749245,0.0002812095,0.00061001006,0.0006877335,0.00079198944,0.00050056604,0.00025375953,0.00016840898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016107202,0.000031258754,0.0011717858,0.00006007261,0.000055703604,0.00044957708,0.00014280944,0.89922816,0.016384648,0.04296233,0.0003122936,0.039040282],"study_design_scores_gemma":[0.000008166723,0.00008557866,0.0002119446,0.0000038104172,0.000021043898,0.00011472557,0.000027625247,0.9865905,0.0041400255,0.0082867835,0.0005010775,0.000008667867],"about_ca_topic_score_codex":0.00083604414,"about_ca_topic_score_gemma":0.0010549412,"teacher_disagreement_score":0.0010452793,"about_ca_system_score_codex":0.00051215925,"about_ca_system_score_gemma":0.00034615872,"threshold_uncertainty_score":0.0055280924},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031022446,0.00019147238,0.99372673,0.000076592194,0.00001318916,0.000024023358,0.00002308599,0.000038187074,0.0028044116],"genre_scores_gemma":[0.5406964,0.002002299,0.44483033,0.0002577388,0.00012788623,0.0005911381,0.00017194668,0.00013432022,0.011187942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966526,0.00014360281,0.000011540024,0.000049889695,0.000099243814,0.000030423842],"domain_scores_gemma":[0.9996363,0.00023890087,0.000032866592,0.00001974597,0.000060882114,0.000011255552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071322353,0.0009599613,0.0006885818,0.0003296055,0.00028131407,0.000815788,0.0006992395,0.0006492996,0.0028040186],"category_scores_gemma":[0.0012294393,0.0002928215,0.00042333838,0.00069182954,0.0005846761,0.0007383469,0.0006253568,0.00068886933,0.00060928636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002438016,0.000025147401,0.00011002626,0.000110755725,0.000015564377,0.000054835382,0.000047581278,0.9395587,0.002947348,0.03575794,0.00092688925,0.020420784],"study_design_scores_gemma":[0.000004262654,0.000025283789,0.000036656926,0.000007725017,0.0000036368485,0.00001558631,0.000009677548,0.9911163,0.00043751343,0.00781097,0.0005285965,0.0000038365806],"about_ca_topic_score_codex":0.0011960987,"about_ca_topic_score_gemma":0.0019876086,"teacher_disagreement_score":0.0028040186,"about_ca_system_score_codex":0.0007453962,"about_ca_system_score_gemma":0.00076945935,"threshold_uncertainty_score":0.009380341},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03529044,0.00026088092,0.95969725,0.00020107874,0.00004615004,0.00003930379,0.000067053385,0.00019230485,0.004205601],"genre_scores_gemma":[0.51077265,0.00085070485,0.48366395,0.00019250617,0.0001188581,0.00014902488,0.0002072938,0.00018129472,0.0038637384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994417,0.00016562434,0.000025548308,0.000060358678,0.00023910735,0.00006771517],"domain_scores_gemma":[0.9985399,0.00070873,0.00013994273,0.00035526342,0.00017161175,0.000084475214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081199355,0.0006203992,0.0005869371,0.0005601272,0.00047053947,0.00055406464,0.00077743526,0.00078199175,0.0010905287],"category_scores_gemma":[0.0032219759,0.0004220345,0.0004418475,0.00048336593,0.0013125569,0.0013797369,0.002004761,0.001594747,0.00028820772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009943562,0.000048461745,0.00040388893,0.00018814903,0.000021535494,0.00015526597,0.00020834601,0.12729761,0.020181332,0.80348545,0.0016804474,0.046230137],"study_design_scores_gemma":[0.000038663275,0.000112087466,0.00019286227,0.000061027662,0.000017647955,0.00027098626,0.00003868216,0.7196581,0.018712176,0.25427544,0.006574926,0.00004750356],"about_ca_topic_score_codex":0.00029510536,"about_ca_topic_score_gemma":0.0003470977,"teacher_disagreement_score":0.0010905287,"about_ca_system_score_codex":0.00054071436,"about_ca_system_score_gemma":0.0010582005,"threshold_uncertainty_score":0.0042942762},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01574369,0.0069436654,0.8767674,0.0014545153,0.000859502,0.00007402946,0.000058719048,0.0005228862,0.09757554],"genre_scores_gemma":[0.79700536,0.007757411,0.10893259,0.00038835505,0.00081109756,0.00017724169,0.00020980676,0.00016455958,0.08455358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995042,0.00014992374,0.000018472045,0.00009346462,0.00017601279,0.000057987974],"domain_scores_gemma":[0.9990158,0.00048150483,0.00006661558,0.00021926728,0.00015230205,0.000064478976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007902767,0.0006870214,0.00043507467,0.00038649002,0.00051732326,0.0012817913,0.0012279208,0.00085046684,0.003916886],"category_scores_gemma":[0.0022381863,0.0003245828,0.00028181716,0.0005740966,0.00069943815,0.0022644934,0.001650274,0.0012846452,0.0011028716],"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.00018540613,0.00012276827,0.00038850526,0.0003262572,0.000057421872,0.00031864035,0.00049979443,0.11074289,0.010973642,0.4745827,0.0304,0.37140203],"study_design_scores_gemma":[0.000018502737,0.000105143525,0.00031231632,0.00009404417,0.000035911686,0.00041366176,0.00014102712,0.56022835,0.0055315807,0.37032133,0.06276083,0.000037288577],"about_ca_topic_score_codex":0.00051441276,"about_ca_topic_score_gemma":0.00064158207,"teacher_disagreement_score":0.003916886,"about_ca_system_score_codex":0.00059258146,"about_ca_system_score_gemma":0.00040813902,"threshold_uncertainty_score":0.013103306},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16880691,0.0051979343,0.81069624,0.0008469597,0.000094186806,0.00006242478,0.00030935783,0.00031856727,0.013667446],"genre_scores_gemma":[0.98719144,0.0016399253,0.009433371,0.00006803688,0.00008464527,0.000059190224,0.00010698266,0.000024898527,0.0013914321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985362,0.0004917667,0.00006156803,0.00015620646,0.0005059104,0.00024834188],"domain_scores_gemma":[0.9948127,0.003781809,0.00046584968,0.00022413871,0.0006420307,0.000073446325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017916706,0.0010257693,0.0012631442,0.0011179274,0.0007500123,0.0011336845,0.0010612023,0.0009809554,0.0014155229],"category_scores_gemma":[0.008158899,0.0003787742,0.0005249247,0.0012390387,0.001142862,0.0016262146,0.0011257012,0.00090549747,0.00019202323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011299959,0.000021681522,0.0014437775,0.00019013742,0.000043574615,0.0004116534,0.00024608118,0.9242553,0.0035831623,0.055677373,0.0011329445,0.0128812585],"study_design_scores_gemma":[0.000004380774,0.000028935841,0.00047549026,0.000013555336,0.000015218004,0.00015771389,0.000037759437,0.9915421,0.000586595,0.00681484,0.00030980085,0.000013480834],"about_ca_topic_score_codex":0.004109703,"about_ca_topic_score_gemma":0.0019257307,"teacher_disagreement_score":0.004109703,"about_ca_system_score_codex":0.0018412365,"about_ca_system_score_gemma":0.00083124894,"threshold_uncertainty_score":0.013359129},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115563504,0.000513122,0.87737393,0.00015207096,0.000047334554,0.00008833515,0.000025638687,0.00015775957,0.006078341],"genre_scores_gemma":[0.972011,0.00015002784,0.027029067,0.00003577496,0.000016375923,0.000045250494,0.0000100182515,0.0000083604,0.00069410494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904126,0.00031332826,0.00004206013,0.00014570465,0.0002846348,0.00017301353],"domain_scores_gemma":[0.99888176,0.00043291357,0.00018162842,0.00007848914,0.00037993296,0.000045295215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014038386,0.00075969845,0.00053718296,0.00035827933,0.00041884184,0.0010218385,0.0007787863,0.00062328734,0.00084700953],"category_scores_gemma":[0.0017346761,0.00033014422,0.0005111624,0.00033749195,0.00056351424,0.0005510687,0.0007294898,0.0004214411,0.00020636639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025678522,0.00008582735,0.0015491605,0.00009872649,0.00015577486,0.0003636074,0.00018161073,0.8929597,0.04732987,0.01827593,0.0004593284,0.038283713],"study_design_scores_gemma":[0.0000074528157,0.00010572297,0.00019179737,0.0000054284133,0.000027635802,0.000060036913,0.0000131479965,0.99623966,0.0024066407,0.00069850497,0.0002366467,0.0000073875713],"about_ca_topic_score_codex":0.002678293,"about_ca_topic_score_gemma":0.0021819305,"teacher_disagreement_score":0.002678293,"about_ca_system_score_codex":0.00075716013,"about_ca_system_score_gemma":0.0009876183,"threshold_uncertainty_score":0.007424295},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121426366,0.0010093452,0.86951745,0.00048608446,0.000048087768,0.00003171035,0.00013993745,0.0001347404,0.0072062486],"genre_scores_gemma":[0.9815692,0.0012071674,0.01523134,0.000050001705,0.000066446686,0.000042272313,0.00011407234,0.000052585416,0.0016668945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917954,0.00029889273,0.00002210113,0.000103330625,0.00028318763,0.00011278539],"domain_scores_gemma":[0.9955214,0.0029019061,0.0005007358,0.0003266147,0.00065833423,0.0000911234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011944313,0.0005589321,0.0004777921,0.00091504684,0.00032636826,0.00056863064,0.00073842576,0.0003939767,0.0009943836],"category_scores_gemma":[0.009622744,0.0002206966,0.00037763017,0.000892448,0.0010324297,0.0018502771,0.00071070995,0.00071608904,0.00018213478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022484628,0.0000085756565,0.0006890412,0.000066293804,0.000013908677,0.00019313372,0.000089870184,0.913634,0.0015868266,0.07685916,0.00067257043,0.0061641065],"study_design_scores_gemma":[0.000001339265,0.000012565757,0.00031366554,0.000005896111,0.0000045076094,0.00008028218,0.000031730648,0.9727032,0.00025257346,0.02619904,0.00039090493,0.0000042635324],"about_ca_topic_score_codex":0.0022872668,"about_ca_topic_score_gemma":0.0011574328,"teacher_disagreement_score":0.0022872668,"about_ca_system_score_codex":0.0008752262,"about_ca_system_score_gemma":0.00038888288,"threshold_uncertainty_score":0.0063502192},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76533765,0.008527786,0.19139278,0.0017641096,0.00046162074,0.00010851331,0.00058711163,0.00055062794,0.03126971],"genre_scores_gemma":[0.9943574,0.00083846186,0.0035494277,0.00006477715,0.000068355315,0.00001931232,0.00006906326,0.000037252743,0.0009959076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970584,0.001162345,0.00007950363,0.00027294434,0.0005673306,0.00085953553],"domain_scores_gemma":[0.97329265,0.021901248,0.0008680969,0.0008761111,0.0026409405,0.0004208918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005155951,0.0020750891,0.0019527875,0.0016341918,0.001080676,0.0025438454,0.0017024777,0.0013500976,0.0024032497],"category_scores_gemma":[0.01889976,0.0005941409,0.0005364392,0.0020390907,0.0027186403,0.002253247,0.0021234066,0.0010503958,0.0002832653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010576316,0.000103570484,0.0009929837,0.0001827095,0.000099456396,0.00014016655,0.00016268491,0.96982366,0.0039712074,0.009849119,0.0010173433,0.012599463],"study_design_scores_gemma":[0.000044698445,0.00024264849,0.0007016728,0.0000246672,0.0000695506,0.00010197841,0.000114255825,0.99136084,0.0018417311,0.0052366187,0.00022606544,0.000035222438],"about_ca_topic_score_codex":0.014268943,"about_ca_topic_score_gemma":0.010922018,"teacher_disagreement_score":0.014268943,"about_ca_system_score_codex":0.0034912522,"about_ca_system_score_gemma":0.0029506595,"threshold_uncertainty_score":0.028371751},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5167481,0.0012161032,0.45206565,0.0007709408,0.00005967869,0.00004923743,0.00025401288,0.0004175765,0.028418642],"genre_scores_gemma":[0.99433076,0.00018119895,0.0044695255,0.000032535612,0.0000105199315,0.00001559421,0.000035327786,0.000010665305,0.0009137901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927753,0.00031921634,0.00002172048,0.000080396094,0.00019594235,0.00010525965],"domain_scores_gemma":[0.9974317,0.001924312,0.00018778692,0.00022185064,0.00018571438,0.000048712653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013038303,0.0007354263,0.0006332832,0.00043121327,0.0003017808,0.0009061508,0.00068585697,0.000803603,0.000899686],"category_scores_gemma":[0.0035977708,0.0003065989,0.00034318402,0.0004932565,0.0009540001,0.001012738,0.0007949856,0.0003703792,0.0002996309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001776553,0.000044304976,0.0009066349,0.00008079828,0.000038920432,0.0002731518,0.00009924511,0.9456914,0.011359746,0.03281455,0.0004477807,0.00806589],"study_design_scores_gemma":[0.00001096072,0.00004128548,0.00037871653,0.0000074742766,0.000009714884,0.00007639541,0.000023322847,0.98895276,0.0023624625,0.007977853,0.00014825788,0.000010850911],"about_ca_topic_score_codex":0.0009895638,"about_ca_topic_score_gemma":0.0006872012,"teacher_disagreement_score":0.0013038303,"about_ca_system_score_codex":0.00089673593,"about_ca_system_score_gemma":0.00047846622,"threshold_uncertainty_score":0.006895423},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043053776,0.00046623388,0.99034905,0.00031402524,0.000095283795,0.00002116276,0.000030847095,0.000043523203,0.0043745358],"genre_scores_gemma":[0.74368554,0.0050411657,0.22363265,0.0007139424,0.0013553188,0.0005789285,0.00027727216,0.00033882406,0.024376374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855536,0.0006875472,0.000055287634,0.0001399449,0.00044885106,0.00011299982],"domain_scores_gemma":[0.99662244,0.0022602268,0.00032389376,0.00025210515,0.00041957063,0.000121692516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017304996,0.0013169722,0.0014290995,0.0017700258,0.00077565335,0.0019236534,0.0018150372,0.0018089078,0.0027732658],"category_scores_gemma":[0.005246949,0.0007778525,0.0014485153,0.0020388444,0.0031550722,0.0032205766,0.0022812462,0.0020505514,0.0006433888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_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.000016580303,0.00012281555,0.00005456194,0.000026455484,0.00007145004,0.000080960875,0.33418715,0.001026035,0.658657,0.00090709724,0.0048331483],"study_design_scores_gemma":[0.0000068189493,0.000021315509,0.000071610804,0.00001132585,0.000010197607,0.00005298899,0.000018476208,0.8234121,0.00014393397,0.17509782,0.0011340778,0.000019320163],"about_ca_topic_score_codex":0.0020867605,"about_ca_topic_score_gemma":0.0021779,"teacher_disagreement_score":0.0027732658,"about_ca_system_score_codex":0.002079475,"about_ca_system_score_gemma":0.0011151631,"threshold_uncertainty_score":0.015087724},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101739615,0.0010444493,0.86697507,0.0010190697,0.00014102121,0.00009916756,0.00033749864,0.0003697756,0.028274307],"genre_scores_gemma":[0.8807509,0.0011224126,0.10691146,0.00047208628,0.0002452669,0.00030582878,0.00057041825,0.00012349177,0.009498144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789196,0.0006523565,0.00008315162,0.00033168125,0.0008140956,0.00022665985],"domain_scores_gemma":[0.99554646,0.0020042981,0.00063076906,0.0008154138,0.00073275657,0.0002703436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012210865,0.00061119435,0.00059170526,0.0010612145,0.0008873685,0.0020216492,0.00085682195,0.0009604123,0.0033557205],"category_scores_gemma":[0.006467867,0.00026399788,0.0004344354,0.0012105411,0.0024480647,0.0028207104,0.0028638889,0.0025390089,0.00071523857],"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.000037067828,0.0000100372035,0.00013925081,0.000026935057,0.0000066308908,0.000040048468,0.0001024202,0.012628574,0.0013333091,0.9759612,0.0008451569,0.0088695],"study_design_scores_gemma":[0.000033455435,0.00011539744,0.0003456679,0.000036462745,0.00001441917,0.00023378088,0.00007786223,0.16718121,0.007507171,0.8123973,0.012004528,0.000052785093],"about_ca_topic_score_codex":0.0007684211,"about_ca_topic_score_gemma":0.00047889305,"teacher_disagreement_score":0.0033557205,"about_ca_system_score_codex":0.0014258438,"about_ca_system_score_gemma":0.0011066709,"threshold_uncertainty_score":0.011225998},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021518229,0.00021439734,0.9774147,0.00013233148,0.000011324779,0.000012376238,0.000032015487,0.000052872278,0.00061172945],"genre_scores_gemma":[0.8014193,0.0007651233,0.19601797,0.000070727685,0.0000792832,0.0000785668,0.00009099127,0.000028760298,0.0014493017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991429,0.000438427,0.000035207726,0.000120189274,0.00021305023,0.000050121558],"domain_scores_gemma":[0.99633044,0.0027678085,0.00035685554,0.00025574813,0.00024162098,0.000047496073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016168971,0.00067619875,0.00075477344,0.00045848812,0.0003622228,0.0008454311,0.0006548061,0.0010947312,0.0005391098],"category_scores_gemma":[0.011598226,0.0004298099,0.00041254616,0.0005986896,0.001333434,0.0013907069,0.0011643547,0.0006698607,0.00017919038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015616223,0.000031352054,0.000788327,0.00014529319,0.000060590963,0.00013849913,0.0001867672,0.8948431,0.006634022,0.058708213,0.000649215,0.03765847],"study_design_scores_gemma":[0.00000792486,0.000022110198,0.00012576579,0.0000063131897,0.000007678116,0.000049287475,0.000013911971,0.98138565,0.0017624359,0.016384862,0.0002222937,0.000011852447],"about_ca_topic_score_codex":0.0010372191,"about_ca_topic_score_gemma":0.00090970105,"teacher_disagreement_score":0.0016168971,"about_ca_system_score_codex":0.000451018,"about_ca_system_score_gemma":0.00068183395,"threshold_uncertainty_score":0.008551061},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051346306,0.0008261441,0.9433042,0.0003861964,0.000047839345,0.00004117804,0.000025844163,0.00011715047,0.0039050789],"genre_scores_gemma":[0.9092496,0.0009404603,0.08579547,0.00012584252,0.00009135693,0.00008519537,0.000040587514,0.000031625328,0.0036398778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928087,0.00028195107,0.000021186945,0.00010182183,0.00025062112,0.00006351548],"domain_scores_gemma":[0.99802387,0.0014487775,0.00012652275,0.00021214779,0.00016159605,0.000027235157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010619826,0.00044046075,0.0004242957,0.0003321328,0.00030367004,0.00074560044,0.00087154127,0.00070545933,0.0009434475],"category_scores_gemma":[0.003219964,0.00018012724,0.00020377195,0.00069513405,0.0013137964,0.0017802448,0.00090224715,0.0007977377,0.00014180836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014643195,0.0000494168,0.000535001,0.00011754059,0.000024932739,0.00020608607,0.00023180935,0.71247673,0.013719794,0.21517701,0.00093783636,0.05637737],"study_design_scores_gemma":[0.000011303277,0.000040965624,0.00014205617,0.000007869007,0.0000051084285,0.000071755734,0.00003356741,0.9598263,0.0021656435,0.036890324,0.0007974654,0.00000771683],"about_ca_topic_score_codex":0.0009395933,"about_ca_topic_score_gemma":0.00079648773,"teacher_disagreement_score":0.0010619826,"about_ca_system_score_codex":0.0009991132,"about_ca_system_score_gemma":0.0004518724,"threshold_uncertainty_score":0.0072490573},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27955258,0.0009854039,0.70856893,0.000537916,0.00005589525,0.00011718521,0.00017744495,0.00027557104,0.009729061],"genre_scores_gemma":[0.97140086,0.0003423951,0.025740981,0.00007242779,0.000041145344,0.00012587965,0.00008004008,0.000057722445,0.002138635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913174,0.00024472692,0.00002292353,0.00007400328,0.00031375702,0.00021300884],"domain_scores_gemma":[0.98757637,0.009442784,0.00086927967,0.00051064906,0.0013080434,0.00029277077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013750042,0.0006306977,0.0006291074,0.000936579,0.00059474853,0.0010115018,0.00095337315,0.00076075655,0.0022978177],"category_scores_gemma":[0.012432089,0.00040210423,0.00027519488,0.00082817266,0.0015273853,0.0017504084,0.0013031345,0.0010914234,0.00020507259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001821296,0.000027485108,0.0006307562,0.00007707802,0.000022144886,0.00014786245,0.00017271383,0.91562456,0.0035910131,0.07114335,0.00096284,0.0074180965],"study_design_scores_gemma":[0.000007126476,0.000025241876,0.00009364043,0.000008095064,0.0000034260183,0.000025293686,0.000029141826,0.9861545,0.00067193434,0.012725345,0.00024952355,0.0000067432943],"about_ca_topic_score_codex":0.0048193596,"about_ca_topic_score_gemma":0.002380282,"teacher_disagreement_score":0.0048193596,"about_ca_system_score_codex":0.0026162174,"about_ca_system_score_gemma":0.0014339165,"threshold_uncertainty_score":0.018982053},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123452045,0.0019844123,0.8505426,0.00087735715,0.00018669147,0.0001051755,0.0004616297,0.00019937518,0.022190774],"genre_scores_gemma":[0.956792,0.0017957409,0.03505052,0.00015762814,0.00020025221,0.00008526097,0.00013812822,0.000032820288,0.0057476014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952304,0.00015619467,0.000015565687,0.00007358333,0.00010577927,0.0001257362],"domain_scores_gemma":[0.99851865,0.0009286336,0.00018172142,0.000111548725,0.0001662688,0.0000930813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078006636,0.00081707316,0.0005033161,0.00032927727,0.00051230186,0.00081785716,0.0007139665,0.0008109192,0.001941815],"category_scores_gemma":[0.0034511413,0.000310156,0.0003706448,0.0006191912,0.0012432614,0.0016074231,0.0009031959,0.00071664545,0.0002628581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015628003,0.000031021646,0.0010103385,0.00017927268,0.000028635306,0.0005702161,0.000118171854,0.67748535,0.0060228747,0.299897,0.0015785471,0.012922389],"study_design_scores_gemma":[0.00001782894,0.00005913417,0.00018768887,0.000009093755,0.0000091673855,0.0001761594,0.000025653135,0.94869435,0.0009517585,0.048957527,0.0008987022,0.000012966536],"about_ca_topic_score_codex":0.002630778,"about_ca_topic_score_gemma":0.0014409092,"teacher_disagreement_score":0.002630778,"about_ca_system_score_codex":0.0010666827,"about_ca_system_score_gemma":0.0006716506,"threshold_uncertainty_score":0.007739365},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22795594,0.002106321,0.7524016,0.001999368,0.00018804503,0.00008449616,0.00029643622,0.0006825612,0.014285262],"genre_scores_gemma":[0.94943345,0.0012154136,0.04606354,0.0003503039,0.00007217392,0.00012104287,0.00016749409,0.00017091738,0.002405668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992705,0.000228444,0.000015389332,0.00011648854,0.00017609974,0.00019316607],"domain_scores_gemma":[0.98586917,0.011226115,0.0007873308,0.00076794275,0.0009811053,0.0003683732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017600367,0.0005715826,0.00068302214,0.0006365408,0.0006223317,0.0016146393,0.0014098791,0.0011984761,0.0030156532],"category_scores_gemma":[0.027296461,0.00042580828,0.00025859845,0.00070184795,0.0016274241,0.005450595,0.0011201474,0.0019946897,0.00054823176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030886533,0.00008312649,0.0015836142,0.00026759677,0.000045083118,0.000105226434,0.00044604184,0.54797685,0.008082963,0.37890184,0.005431322,0.05676749],"study_design_scores_gemma":[0.000021586098,0.00009952044,0.0002847541,0.00005350269,0.000010741271,0.00011365938,0.00018499109,0.78206116,0.005627739,0.2081266,0.00338786,0.000027872988],"about_ca_topic_score_codex":0.0029329292,"about_ca_topic_score_gemma":0.0017196997,"teacher_disagreement_score":0.0030156532,"about_ca_system_score_codex":0.0016749359,"about_ca_system_score_gemma":0.0009435199,"threshold_uncertainty_score":0.012152553},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1536671,0.0014111488,0.8211069,0.00046218347,0.00018033685,0.0000798236,0.00040436917,0.0003172692,0.022370912],"genre_scores_gemma":[0.973375,0.0007915795,0.020901073,0.00006708505,0.000071594965,0.00006429922,0.00006814643,0.000012630923,0.0046486566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994529,0.00018694969,0.000014928992,0.000114071,0.000106516156,0.0001246556],"domain_scores_gemma":[0.999276,0.0003035348,0.00012667086,0.00013270664,0.00012346685,0.000037727074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005250193,0.00079623243,0.0007080333,0.0003543247,0.00036081357,0.0009792392,0.00084294996,0.0010626612,0.002305532],"category_scores_gemma":[0.001429062,0.00025707652,0.00042704443,0.00059158826,0.00087859563,0.0009306325,0.00087238086,0.0006828542,0.00056911376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042201468,0.00009528054,0.0013184382,0.00020101374,0.000074487245,0.0010690625,0.00019090861,0.6315114,0.029043188,0.3098992,0.0027128835,0.02346217],"study_design_scores_gemma":[0.000027380138,0.00008435043,0.00029772645,0.000010491371,0.000027533422,0.00032125754,0.000042931504,0.97473085,0.0032387648,0.01881059,0.0023812156,0.00002696974],"about_ca_topic_score_codex":0.0011722584,"about_ca_topic_score_gemma":0.0010745253,"teacher_disagreement_score":0.002305532,"about_ca_system_score_codex":0.00061254116,"about_ca_system_score_gemma":0.0003463581,"threshold_uncertainty_score":0.0077127814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10098093,0.00097279245,0.8933716,0.0005651366,0.00007396857,0.000059583028,0.000066583874,0.00018254798,0.0037269436],"genre_scores_gemma":[0.9575101,0.00057202013,0.039424255,0.00007812174,0.000058185953,0.00006799404,0.000037693175,0.000049886698,0.0022017374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896586,0.0004995505,0.000029743605,0.00015608482,0.00016778322,0.0001809956],"domain_scores_gemma":[0.9980767,0.0013606143,0.00022509853,0.00007575534,0.00016841167,0.00009352359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023387023,0.0007288025,0.0009780825,0.0005126401,0.00037765483,0.0010713572,0.0010923877,0.0008131845,0.0010092421],"category_scores_gemma":[0.0049680783,0.0005588133,0.00032828492,0.0006647583,0.0010166634,0.0013856937,0.0008003009,0.0008058778,0.00015257689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003846514,0.000019481215,0.0001640471,0.000020462432,0.000015813574,0.000036428864,0.000022570475,0.97848344,0.0008890985,0.016795836,0.00024336048,0.0032709932],"study_design_scores_gemma":[0.000006548283,0.000010836875,0.000026976722,0.0000010462226,0.0000027261274,0.0000033111112,0.000004918086,0.9959896,0.00014237015,0.0037101666,0.000099605306,0.0000018619904],"about_ca_topic_score_codex":0.003985087,"about_ca_topic_score_gemma":0.0021106044,"teacher_disagreement_score":0.003985087,"about_ca_system_score_codex":0.0019735938,"about_ca_system_score_gemma":0.0014574989,"threshold_uncertainty_score":0.014319539},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13331228,0.00067296653,0.8530294,0.00057511474,0.000042268297,0.00006399565,0.0001888104,0.0003448065,0.011770328],"genre_scores_gemma":[0.9094192,0.0005740113,0.08623883,0.00012990177,0.000043169828,0.00009445753,0.00015585969,0.00006727875,0.0032772508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987631,0.00033601836,0.00003560435,0.00011060105,0.00057767454,0.00017707166],"domain_scores_gemma":[0.9963438,0.0025175398,0.00029081307,0.0002258666,0.00053588353,0.000086094224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013785732,0.0007127839,0.000694373,0.00052676594,0.00047939594,0.0013455118,0.00064621994,0.00088438176,0.0021785672],"category_scores_gemma":[0.005824359,0.00030242422,0.00033385534,0.0007273919,0.0013773127,0.0016216564,0.00091242074,0.0009790363,0.00047602627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033906734,0.00006747807,0.0014005508,0.00019330718,0.000047767957,0.0002792496,0.00016483788,0.770255,0.026193542,0.1804236,0.0012446059,0.019391017],"study_design_scores_gemma":[0.0000079303245,0.000034461096,0.00009058507,0.000010246485,0.0000039031725,0.00007731426,0.000014363879,0.9825785,0.0043531954,0.012574814,0.00024402449,0.000010650067],"about_ca_topic_score_codex":0.002296655,"about_ca_topic_score_gemma":0.0022334175,"teacher_disagreement_score":0.002296655,"about_ca_system_score_codex":0.0017370022,"about_ca_system_score_gemma":0.0017970435,"threshold_uncertainty_score":0.012602866},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043903193,0.00027146473,0.9928087,0.0001633278,0.000039762876,0.000091494076,0.0000402487,0.00020999645,0.0019847255],"genre_scores_gemma":[0.59257185,0.0011611416,0.40029365,0.00025166338,0.0001307739,0.0006863167,0.00021904516,0.000081938204,0.00460365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753153,0.00089598546,0.0001448794,0.0003673906,0.0007279595,0.00033220332],"domain_scores_gemma":[0.9978301,0.0010312167,0.00024260371,0.0002916502,0.0004967211,0.00010760383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001898861,0.0015309032,0.0018627972,0.0009826729,0.0009391042,0.0017164104,0.0019228634,0.0011894947,0.0029533415],"category_scores_gemma":[0.0048669507,0.0005322684,0.0007645338,0.0014647928,0.0016494729,0.002537068,0.0021673474,0.0016327734,0.00092249346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028858316,0.00008607466,0.0004819635,0.0002585474,0.00010330929,0.00023427392,0.0002586717,0.7454195,0.011480928,0.16899104,0.0040313075,0.0683658],"study_design_scores_gemma":[0.000032174128,0.0000770958,0.00003139817,0.00001103453,0.000015983343,0.00006765326,0.00001921502,0.98354787,0.0026439256,0.012398242,0.0011371652,0.000018252125],"about_ca_topic_score_codex":0.0034805636,"about_ca_topic_score_gemma":0.0041135573,"teacher_disagreement_score":0.0034805636,"about_ca_system_score_codex":0.0015572743,"about_ca_system_score_gemma":0.0038124362,"threshold_uncertainty_score":0.011298895},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31288752,0.0006844934,0.65659285,0.000414052,0.000050704464,0.00011332123,0.00080494775,0.00034382334,0.028108329],"genre_scores_gemma":[0.98501325,0.00026780867,0.012965466,0.000057676873,0.00002922902,0.000111414534,0.0001504394,0.000035356596,0.0013693817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829704,0.00043640047,0.000064010346,0.0002273035,0.000487277,0.00048794382],"domain_scores_gemma":[0.98994774,0.0066627637,0.00097518606,0.0010827814,0.0010805181,0.00025100537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014914938,0.0006242126,0.00078717706,0.001067355,0.0006021911,0.0017762952,0.0011245802,0.00070660014,0.0028712936],"category_scores_gemma":[0.00810992,0.0003515202,0.00070181116,0.0010581319,0.002472703,0.0024069771,0.0016277202,0.0011358226,0.00044884498],"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.00029297103,0.000061139246,0.00090590527,0.00018200399,0.00004466627,0.00028474437,0.00026302872,0.32614583,0.010884702,0.6493745,0.0011783224,0.010382125],"study_design_scores_gemma":[0.000038829487,0.00007430117,0.00045318235,0.000027110375,0.00001985237,0.00027287082,0.00009209843,0.7374533,0.008275444,0.25198144,0.0012566563,0.000054951866],"about_ca_topic_score_codex":0.0017905734,"about_ca_topic_score_gemma":0.0007353829,"teacher_disagreement_score":0.0028712936,"about_ca_system_score_codex":0.0015233634,"about_ca_system_score_gemma":0.0013678735,"threshold_uncertainty_score":0.011052787},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020951414,0.0006477575,0.9702461,0.0006141902,0.000041211428,0.00009994613,0.000042636846,0.000027850256,0.0073288274],"genre_scores_gemma":[0.87884295,0.0014573309,0.112338014,0.0001486849,0.00012227267,0.00029208531,0.00006052578,0.000031165095,0.0067069195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788326,0.001307685,0.000058786063,0.00013330045,0.00045437398,0.00016251674],"domain_scores_gemma":[0.9969885,0.002222725,0.00026573095,0.00014613301,0.0002693892,0.000107521584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037810276,0.0006375299,0.0010509293,0.000696945,0.0007210098,0.0016071162,0.0012384356,0.0014225872,0.0025383232],"category_scores_gemma":[0.005854968,0.00044203136,0.00069962686,0.0009593067,0.0017250781,0.002041412,0.0012169494,0.0014181081,0.0002483184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004857733,0.00004963214,0.0003598908,0.000075492986,0.000025683994,0.00017344858,0.000097413096,0.78921187,0.00084820867,0.19429898,0.000816889,0.013993783],"study_design_scores_gemma":[0.00000953204,0.00001807427,0.0000576324,0.000007805083,0.0000040100113,0.000027944203,0.000019828658,0.96563995,0.0001223032,0.033538353,0.00054838037,0.000006162035],"about_ca_topic_score_codex":0.0023975908,"about_ca_topic_score_gemma":0.0014355917,"teacher_disagreement_score":0.0037810276,"about_ca_system_score_codex":0.002165044,"about_ca_system_score_gemma":0.002177905,"threshold_uncertainty_score":0.019996166},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09664144,0.0016515516,0.8929499,0.0008615287,0.00004419372,0.00004485077,0.0000670917,0.00010662369,0.0076328265],"genre_scores_gemma":[0.9731644,0.0010474441,0.023693249,0.00007105684,0.00006573502,0.00008188536,0.000026640297,0.000013254149,0.0018362707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990243,0.0005750648,0.000024757452,0.000109305656,0.00016845057,0.00009824107],"domain_scores_gemma":[0.99880874,0.00090346386,0.00010554492,0.00006910638,0.000081115715,0.000032140546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009414115,0.00071104366,0.00060675165,0.00050864235,0.00048120803,0.0010034813,0.0008673746,0.0013853018,0.0005187513],"category_scores_gemma":[0.004136089,0.00039618262,0.00024989448,0.0014678423,0.0016687186,0.0009955856,0.0008750807,0.00051150407,0.00015841493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046627752,0.000022355049,0.00046017856,0.00004050544,0.000018166382,0.00020151155,0.00014966413,0.91654056,0.0015415588,0.06627685,0.00061760895,0.014084405],"study_design_scores_gemma":[0.000014173955,0.000031071366,0.00011602778,0.0000069109506,0.000009622184,0.000050313658,0.000039414885,0.9357614,0.000454546,0.06281684,0.0006919593,0.000007721061],"about_ca_topic_score_codex":0.0027643838,"about_ca_topic_score_gemma":0.0021127407,"teacher_disagreement_score":0.0027643838,"about_ca_system_score_codex":0.0011040674,"about_ca_system_score_gemma":0.00055892486,"threshold_uncertainty_score":0.008010626},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022744799,0.00014311097,0.97417563,0.00020741284,0.000023929908,0.000028537754,0.000052127445,0.000075359756,0.0025490946],"genre_scores_gemma":[0.8744557,0.0005807834,0.121136315,0.00024059169,0.00011663293,0.00022170604,0.00016137843,0.00009481322,0.0029920526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781203,0.00079808163,0.000080597776,0.00032744178,0.00079177803,0.0001899903],"domain_scores_gemma":[0.9937716,0.004047579,0.00073681143,0.00068496895,0.00064030394,0.000118650765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022467417,0.0007083508,0.0006717476,0.00062416267,0.00031267334,0.0010273341,0.0009491203,0.00080805505,0.0015822847],"category_scores_gemma":[0.015507287,0.00034765457,0.00038384393,0.00074006076,0.0024088155,0.0025192448,0.0013270653,0.0016654246,0.00029463417],"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.0002131412,0.000056293164,0.0005814098,0.0002047807,0.000036950292,0.00019760827,0.00034046228,0.45567414,0.016804224,0.49542767,0.0010309947,0.029432343],"study_design_scores_gemma":[0.000019082869,0.000080693564,0.0001814423,0.00001378733,0.0000059023923,0.00008639077,0.000045128436,0.9003359,0.003754325,0.09477893,0.00068003725,0.00001832226],"about_ca_topic_score_codex":0.00082660763,"about_ca_topic_score_gemma":0.0004861564,"teacher_disagreement_score":0.0022467417,"about_ca_system_score_codex":0.0008432447,"about_ca_system_score_gemma":0.00084324117,"threshold_uncertainty_score":0.011882007},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16576572,0.0026498046,0.81509125,0.0007504972,0.00007988327,0.00008439995,0.00013250968,0.00019126176,0.015254576],"genre_scores_gemma":[0.9805582,0.0015584178,0.016009027,0.000098313205,0.000081751205,0.00009242852,0.000039591232,0.000025120304,0.0015371104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889696,0.0005397907,0.00003158035,0.00013189513,0.00020133385,0.00019847123],"domain_scores_gemma":[0.9963648,0.0025732948,0.00047878205,0.000181131,0.00028644266,0.00011552235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013122138,0.0010773122,0.0010152541,0.0005618867,0.00049269,0.0013449974,0.0013228751,0.00091957685,0.00096138497],"category_scores_gemma":[0.0066038435,0.00047320407,0.00044912103,0.0010445461,0.0015618503,0.0017466473,0.0010237639,0.000963573,0.00018624938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009643363,0.00003240702,0.0005471007,0.00010720586,0.000042544634,0.00033417513,0.000116620286,0.9158907,0.003200063,0.072880365,0.00058304885,0.006169425],"study_design_scores_gemma":[0.000007788576,0.000023705848,0.00018818396,0.000009959612,0.000011650776,0.000061022467,0.000023920069,0.9873399,0.0003446156,0.011718052,0.0002619549,0.0000091843385],"about_ca_topic_score_codex":0.0022173242,"about_ca_topic_score_gemma":0.0015209892,"teacher_disagreement_score":0.0022173242,"about_ca_system_score_codex":0.00096949603,"about_ca_system_score_gemma":0.0005118194,"threshold_uncertainty_score":0.007034242},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021903219,0.0005135138,0.9698607,0.00044709965,0.0000445288,0.00005225921,0.000049520226,0.000075469805,0.0070537766],"genre_scores_gemma":[0.8521582,0.00081887876,0.1401956,0.00016132793,0.0001302059,0.00025972663,0.00007524113,0.000061559076,0.0061392253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972632,0.0015842178,0.00006478233,0.00034689577,0.000407915,0.00033298766],"domain_scores_gemma":[0.9915338,0.0070133535,0.00054327655,0.00039707325,0.00034314214,0.00016944329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036709704,0.0011977581,0.0013224152,0.0007228702,0.00090192445,0.0015594444,0.0017473167,0.0017884534,0.0030125268],"category_scores_gemma":[0.012568847,0.00051537645,0.0007628738,0.0012640541,0.001973824,0.0023970888,0.0015976242,0.001104996,0.0005770227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016520702,0.00006820407,0.00034155123,0.00011816603,0.000050101247,0.0002249401,0.00012937206,0.84930426,0.002176871,0.13003297,0.0016663215,0.01572199],"study_design_scores_gemma":[0.000029851855,0.00005801311,0.00009025955,0.0000094007055,0.000014491344,0.00008212271,0.000030207686,0.9428482,0.0007616736,0.055006042,0.0010568076,0.000012808218],"about_ca_topic_score_codex":0.0018800102,"about_ca_topic_score_gemma":0.0012756342,"teacher_disagreement_score":0.0036709704,"about_ca_system_score_codex":0.0017976159,"about_ca_system_score_gemma":0.0010314097,"threshold_uncertainty_score":0.019414186},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018301046,0.000427668,0.9776382,0.000343362,0.00005480873,0.000042333482,0.000116448784,0.00015516001,0.0029210912],"genre_scores_gemma":[0.6775493,0.0010210653,0.31574827,0.00033330297,0.00021123081,0.00030498597,0.00041695984,0.00008774144,0.004327183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981273,0.00069895975,0.00007677739,0.00026336775,0.0006037587,0.00022988261],"domain_scores_gemma":[0.9961428,0.0022739053,0.00035639538,0.00034065833,0.00078371365,0.0001025014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017373296,0.00072712713,0.0008985645,0.0006810095,0.00048360284,0.0012858148,0.0008038239,0.0013344251,0.0015461411],"category_scores_gemma":[0.0076182284,0.00041146725,0.00036617846,0.0009044024,0.0011156959,0.0013950445,0.0012157722,0.0009192843,0.00047745978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035014027,0.000047460366,0.00079607964,0.00032173266,0.000058257287,0.00031364648,0.00025532505,0.62905794,0.0104065435,0.2747718,0.0045409827,0.07908003],"study_design_scores_gemma":[0.00006857985,0.00006689135,0.00011180965,0.000036491492,0.00002162464,0.00014028607,0.000029016055,0.92678356,0.0057956288,0.06492916,0.0019850892,0.000031903204],"about_ca_topic_score_codex":0.0015740261,"about_ca_topic_score_gemma":0.001398882,"teacher_disagreement_score":0.0017373296,"about_ca_system_score_codex":0.0010999695,"about_ca_system_score_gemma":0.0022504549,"threshold_uncertainty_score":0.009187996},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060729276,0.0024465472,0.86173683,0.0011866278,0.00014035043,0.00022294014,0.00019880207,0.00015370162,0.07318495],"genre_scores_gemma":[0.9086322,0.0026963772,0.0824683,0.00042104087,0.0002617585,0.00044811703,0.00011853294,0.00007093697,0.0048826905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954726,0.001792888,0.00035818966,0.0008267475,0.0011614508,0.00038814306],"domain_scores_gemma":[0.97910357,0.016504008,0.0016851829,0.0012515072,0.001141515,0.0003142353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046360027,0.0010230805,0.00065316504,0.0013579581,0.00061791926,0.0033035667,0.0020946993,0.0023267083,0.0035650237],"category_scores_gemma":[0.02752366,0.00041533183,0.00041236175,0.0010432662,0.0033804805,0.0039898218,0.002175815,0.002265837,0.00060405384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006843346,0.000057052475,0.00052905065,0.00012349147,0.000022196507,0.000092593116,0.00031717,0.03695347,0.0034107347,0.9262264,0.00058718806,0.031612188],"study_design_scores_gemma":[0.00005702556,0.0003196528,0.0011658887,0.00013466313,0.00005568672,0.0006974686,0.00025927188,0.30526942,0.004676388,0.6833489,0.0039401487,0.00007543234],"about_ca_topic_score_codex":0.00049836794,"about_ca_topic_score_gemma":0.0003190533,"teacher_disagreement_score":0.0046360027,"about_ca_system_score_codex":0.0012657691,"about_ca_system_score_gemma":0.00089687825,"threshold_uncertainty_score":0.024517834},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11479367,0.0032788247,0.8422178,0.0015444206,0.00011406762,0.00009881874,0.00038888675,0.0005973055,0.036966264],"genre_scores_gemma":[0.96447146,0.002617992,0.023355667,0.00023367186,0.00018432035,0.0001922919,0.00023047448,0.00008808351,0.008626172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991487,0.0002999509,0.00002447426,0.0001031326,0.00028927648,0.00013448899],"domain_scores_gemma":[0.9938269,0.004357348,0.0005705551,0.00032026888,0.0007454301,0.00017942804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020636555,0.001262193,0.0011362837,0.0013275386,0.0007523976,0.0012631814,0.0012413865,0.00133096,0.003611232],"category_scores_gemma":[0.012986972,0.000586889,0.0005579936,0.0010424753,0.0021623415,0.0027116335,0.002025952,0.0015428115,0.0006351516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014663939,0.00005257589,0.0011589172,0.00023976526,0.00006503187,0.00062470767,0.00030365732,0.700242,0.006872519,0.27682984,0.0029660047,0.010498355],"study_design_scores_gemma":[0.000010431124,0.000040467272,0.00038799783,0.000024471532,0.000022501701,0.00018910882,0.00008185308,0.9496168,0.0006811711,0.04824459,0.00068388926,0.000016705237],"about_ca_topic_score_codex":0.0037586102,"about_ca_topic_score_gemma":0.0026266663,"teacher_disagreement_score":0.0037586102,"about_ca_system_score_codex":0.002037592,"about_ca_system_score_gemma":0.0011786232,"threshold_uncertainty_score":0.0147838},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5410145,0.0015585398,0.4500228,0.00016408609,0.00003859647,0.00003753549,0.00008135114,0.00015133021,0.0069314493],"genre_scores_gemma":[0.9924817,0.0005837907,0.006197614,0.0000113984115,0.000012473064,0.000008652809,0.000015268522,0.000008073646,0.000681091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945885,0.0002251123,0.000018205852,0.000069666276,0.00014637347,0.00008174835],"domain_scores_gemma":[0.99857724,0.0010377272,0.00015134682,0.000061791674,0.00014774162,0.00002420556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007441417,0.0011635559,0.0005950077,0.0003694718,0.00032029278,0.0007319354,0.0005710283,0.00080600986,0.00039075955],"category_scores_gemma":[0.0022801547,0.00019276401,0.0003526927,0.00068150746,0.0008462024,0.0008612108,0.0005090015,0.00041837708,0.00011160178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059068632,0.0000145087,0.00065318233,0.00003672096,0.000028446208,0.0002401565,0.000036888738,0.9814229,0.0058102612,0.006381546,0.00006788185,0.0052485154],"study_design_scores_gemma":[0.000004562692,0.000054397064,0.0003148232,0.000002933476,0.000016579525,0.00007601783,0.000016364924,0.9955432,0.0021486399,0.0017113833,0.00010452731,0.0000066397038],"about_ca_topic_score_codex":0.0030700034,"about_ca_topic_score_gemma":0.0022870132,"teacher_disagreement_score":0.0030700034,"about_ca_system_score_codex":0.0008532001,"about_ca_system_score_gemma":0.00037319548,"threshold_uncertainty_score":0.006190419},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08717081,0.0011746901,0.90534675,0.00026037442,0.000092460126,0.00010413094,0.000059794227,0.00018027303,0.005610748],"genre_scores_gemma":[0.97693217,0.00029372468,0.021072261,0.000048265803,0.000024295552,0.000042001895,0.00001843198,0.000010814532,0.0015580206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876034,0.00062707183,0.000041304527,0.00017054383,0.0001957877,0.00020503001],"domain_scores_gemma":[0.99909365,0.0004983776,0.0001127402,0.00006644108,0.00015602828,0.0000727646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013730426,0.0006069995,0.0010249907,0.00048676482,0.00051886204,0.0011946111,0.0013470587,0.0007233067,0.0009001851],"category_scores_gemma":[0.0023998339,0.000318241,0.00048127407,0.0007222232,0.0009267764,0.0011479318,0.00061705033,0.0005716597,0.00015431688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028217753,0.00010974813,0.00096522964,0.00009112976,0.00007980868,0.00048531307,0.00012964806,0.90999514,0.0063210283,0.0455683,0.0014578509,0.0345146],"study_design_scores_gemma":[0.000020991223,0.000049972987,0.00012681972,0.000003546907,0.000016612108,0.00008961941,0.00001929948,0.98977405,0.00063787546,0.008717598,0.0005324422,0.00001118917],"about_ca_topic_score_codex":0.0034358092,"about_ca_topic_score_gemma":0.0024955808,"teacher_disagreement_score":0.0034358092,"about_ca_system_score_codex":0.0011981078,"about_ca_system_score_gemma":0.000959665,"threshold_uncertainty_score":0.00869298},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026982324,0.00043633708,0.9661062,0.0001934442,0.000021980146,0.000030433406,0.00005819065,0.00009077111,0.006080419],"genre_scores_gemma":[0.95475924,0.00054849556,0.041371897,0.00006217299,0.000027937747,0.00007971318,0.000065380074,0.000039446735,0.0030458337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946314,0.0002312634,0.000025637359,0.00008360803,0.00013980333,0.000056644192],"domain_scores_gemma":[0.99920565,0.00053453504,0.000101518366,0.000046670506,0.00009296439,0.000018729286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011670057,0.0010891503,0.00096314953,0.00036042026,0.00024513496,0.001126098,0.00059088104,0.00080652075,0.0013936701],"category_scores_gemma":[0.002202125,0.00032671445,0.000440609,0.00048957,0.0007521191,0.0009433131,0.0008407095,0.0005828372,0.00024486583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033564902,0.000017382796,0.00011900348,0.00005151158,0.00002821611,0.000053639273,0.00003042469,0.9708402,0.002511797,0.018753527,0.0002516979,0.00730898],"study_design_scores_gemma":[0.0000036268202,0.00001888099,0.000036009253,0.0000026669652,0.000004734589,0.000009262929,0.000005756785,0.9956956,0.0005179789,0.0035580539,0.00014460464,0.000002893142],"about_ca_topic_score_codex":0.001461304,"about_ca_topic_score_gemma":0.0007998923,"teacher_disagreement_score":0.001461304,"about_ca_system_score_codex":0.00086232467,"about_ca_system_score_gemma":0.0005810626,"threshold_uncertainty_score":0.0062566996},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22390965,0.0005803362,0.7555278,0.000863175,0.00006425333,0.000099973426,0.00041658335,0.00062848424,0.017909756],"genre_scores_gemma":[0.9140793,0.00052220025,0.0774575,0.00025369183,0.00010344852,0.00013152361,0.00027777936,0.00010965999,0.0070649753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925333,0.0001809393,0.00003647509,0.00010019479,0.00031065624,0.000118387085],"domain_scores_gemma":[0.99665475,0.0015384954,0.0004767641,0.00056168396,0.0005248473,0.00024337265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007402047,0.0006476272,0.000378399,0.0006113683,0.00041667913,0.0010417555,0.0005056091,0.00069992227,0.0020281968],"category_scores_gemma":[0.0067072394,0.00026757643,0.00027975053,0.0007377329,0.0013535061,0.0015703794,0.0012072749,0.0013985303,0.0003576347],"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.00020272852,0.00007117519,0.0010285462,0.0001048994,0.000025380086,0.00020666567,0.00018167424,0.18035917,0.022009926,0.7561807,0.0033497838,0.03627928],"study_design_scores_gemma":[0.000025424948,0.00012825908,0.00040956456,0.000034459055,0.000010560486,0.00017815929,0.00004335787,0.67252946,0.017627068,0.30625135,0.0027269446,0.000035466448],"about_ca_topic_score_codex":0.0012995339,"about_ca_topic_score_gemma":0.0016207425,"teacher_disagreement_score":0.0020281968,"about_ca_system_score_codex":0.001029289,"about_ca_system_score_gemma":0.0010642776,"threshold_uncertainty_score":0.007467985},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051824255,0.00047049086,0.98602957,0.00075768336,0.00004876016,0.000030452806,0.00010452685,0.000047735226,0.007328369],"genre_scores_gemma":[0.5542988,0.004524864,0.4292109,0.0013204609,0.0007352336,0.0005714995,0.00044470033,0.00019504802,0.00869854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99670404,0.0014772216,0.00011319862,0.00039431942,0.0010302662,0.00028094577],"domain_scores_gemma":[0.9884906,0.00790268,0.00089532905,0.0009991404,0.0014104887,0.00030170794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045922482,0.0013036677,0.00131465,0.0018722061,0.0009888532,0.003156541,0.0023158432,0.001707448,0.0020700751],"category_scores_gemma":[0.018343296,0.00081313297,0.0010136019,0.0021977131,0.0049412246,0.007403778,0.0047307685,0.0056106006,0.00085465173],"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.000038788523,0.000017018425,0.00021000435,0.00007304676,0.000014769318,0.000076029384,0.00013896453,0.09568432,0.00086995086,0.8943727,0.0011817331,0.0073226304],"study_design_scores_gemma":[0.000007820383,0.000030643656,0.00006552861,0.0000351907,0.00000763698,0.00006251902,0.00003811752,0.40830985,0.0006008165,0.5886678,0.002151894,0.000022106786],"about_ca_topic_score_codex":0.0018782449,"about_ca_topic_score_gemma":0.0013846726,"teacher_disagreement_score":0.0045922482,"about_ca_system_score_codex":0.0031029226,"about_ca_system_score_gemma":0.002296405,"threshold_uncertainty_score":0.024286449},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58015704,0.0012845134,0.41130143,0.00018581565,0.000055889108,0.000051075574,0.00007686504,0.00012233749,0.006765018],"genre_scores_gemma":[0.99132204,0.00039638736,0.0073432126,0.000013661147,0.000014974545,0.000009147237,0.0000151465965,0.000004236941,0.0008811019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936146,0.00022205613,0.000020802501,0.000102128426,0.00017168857,0.00012188392],"domain_scores_gemma":[0.9980465,0.001319764,0.0002540636,0.00013614369,0.00019992483,0.00004369924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061375875,0.0009084854,0.00061552203,0.0004341657,0.00039678733,0.0006045452,0.00066262955,0.00068897865,0.0003769671],"category_scores_gemma":[0.0022476194,0.00022029801,0.00035442147,0.0006323077,0.0007630279,0.00096576783,0.0006785305,0.0004092513,0.00010395281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014092968,0.000064860826,0.0014761763,0.00008962094,0.000052640535,0.0006523033,0.00011520317,0.9536445,0.014930802,0.013674252,0.00016490025,0.0149938855],"study_design_scores_gemma":[0.0000067158194,0.00010260613,0.00031556812,0.000003916552,0.000020130374,0.00018510508,0.000027800854,0.99382544,0.0031392386,0.0021128235,0.00025101384,0.000009667432],"about_ca_topic_score_codex":0.0020577407,"about_ca_topic_score_gemma":0.002052535,"teacher_disagreement_score":0.0020577407,"about_ca_system_score_codex":0.0006591807,"about_ca_system_score_gemma":0.00036092466,"threshold_uncertainty_score":0.0047827363},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12298661,0.00046873133,0.87052935,0.00019571745,0.00006201014,0.00010878699,0.0000784287,0.00030569104,0.005264653],"genre_scores_gemma":[0.8536724,0.00024817264,0.14168051,0.0001430255,0.000037290833,0.00015929241,0.00006937249,0.00001348677,0.003976489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938095,0.00018274279,0.000035059486,0.0001262283,0.0002030219,0.00007198791],"domain_scores_gemma":[0.9993236,0.00019029263,0.000089278656,0.00021842534,0.00012713025,0.00005131493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072039064,0.00039294705,0.0005513471,0.00031233995,0.00042040585,0.00052516843,0.001191381,0.00065596163,0.00096157694],"category_scores_gemma":[0.00092943455,0.00021082236,0.00031653768,0.0003736565,0.0008147633,0.0011922444,0.0011051844,0.00038328156,0.0002827462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00097449636,0.0002809554,0.0016425764,0.0004244633,0.00018608852,0.0013049539,0.0012188986,0.2697063,0.25622395,0.24017961,0.0036179114,0.22423981],"study_design_scores_gemma":[0.00009570909,0.0005017811,0.00036685087,0.000018177581,0.00006638812,0.0009742182,0.00008054181,0.9355721,0.034074485,0.020389656,0.0077954326,0.00006462089],"about_ca_topic_score_codex":0.00050052576,"about_ca_topic_score_gemma":0.00061006355,"teacher_disagreement_score":0.001191381,"about_ca_system_score_codex":0.00038223414,"about_ca_system_score_gemma":0.0005789677,"threshold_uncertainty_score":0.0038098693},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021634609,0.0039267587,0.93847096,0.0047294,0.00034918232,0.00008199535,0.00016513738,0.0006362541,0.030005716],"genre_scores_gemma":[0.7490688,0.006166947,0.23430112,0.002341687,0.0007329202,0.00030183667,0.0003410343,0.00032836382,0.006417226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98992366,0.004617411,0.00043293243,0.0006976279,0.0038267511,0.00050152506],"domain_scores_gemma":[0.9635607,0.02642186,0.001040963,0.0051187444,0.0035805926,0.00027722042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076314765,0.001036972,0.0016472168,0.00092798827,0.0014060537,0.0031109538,0.002070737,0.0025624512,0.0030744371],"category_scores_gemma":[0.048338506,0.0007532914,0.00060586206,0.0013893156,0.00403189,0.007961283,0.0033545964,0.0038768325,0.0019970082],"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.0003369595,0.00007007876,0.0010933221,0.00039203564,0.000065746506,0.00023273908,0.00039226023,0.17063844,0.005264488,0.6974534,0.0060537914,0.118006796],"study_design_scores_gemma":[0.00006605317,0.00008868274,0.00014346896,0.00012329452,0.000019502762,0.00058955146,0.0000955261,0.47924644,0.0046922434,0.50864244,0.0062004603,0.00009232546],"about_ca_topic_score_codex":0.0021290418,"about_ca_topic_score_gemma":0.0017699029,"teacher_disagreement_score":0.0076314765,"about_ca_system_score_codex":0.0013783362,"about_ca_system_score_gemma":0.002324163,"threshold_uncertainty_score":0.040359616},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35255423,0.0073436135,0.59136975,0.001637492,0.00020347371,0.00007038921,0.00024199675,0.00028611132,0.046292912],"genre_scores_gemma":[0.98784155,0.0015959851,0.008867214,0.00007796045,0.0001283589,0.000030127745,0.000030391446,0.00001861889,0.0014097677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992525,0.00030521385,0.000017626482,0.000068784975,0.00023140525,0.00012439536],"domain_scores_gemma":[0.9966929,0.0026791566,0.00018681715,0.00014173589,0.00020500619,0.00009449825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013633741,0.0008194724,0.0005114711,0.00079198874,0.00044082617,0.0013390541,0.0007002515,0.00061705156,0.001394002],"category_scores_gemma":[0.005621993,0.00036925328,0.00031735023,0.00088425406,0.0012726142,0.0018544728,0.0009951711,0.00082822196,0.0002088106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022791135,0.0000643829,0.0009206436,0.000213142,0.00006363688,0.00037802005,0.00021735665,0.513848,0.014500556,0.4318035,0.0021289408,0.03563396],"study_design_scores_gemma":[0.000012740189,0.00007945142,0.0003935358,0.000023776944,0.000034925422,0.00021872898,0.00005325429,0.7964527,0.0028450463,0.19865832,0.001207953,0.000019543426],"about_ca_topic_score_codex":0.00065956876,"about_ca_topic_score_gemma":0.00068912044,"teacher_disagreement_score":0.0014056922,"about_ca_system_score_codex":0.0014056922,"about_ca_system_score_gemma":0.0004531604,"threshold_uncertainty_score":0.01019901},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07151476,0.0006526333,0.90425867,0.0012702293,0.000159096,0.00012612107,0.00021734319,0.0003264357,0.021474732],"genre_scores_gemma":[0.9719553,0.00032164896,0.021370659,0.00013296623,0.00006166268,0.00016097893,0.000089953755,0.000043979657,0.005862777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998838,0.00039496177,0.000034402834,0.00021070955,0.00022986624,0.00029200022],"domain_scores_gemma":[0.99485993,0.0039019352,0.00047743728,0.00012426251,0.0004697263,0.0001666175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018853499,0.0010539452,0.0009847995,0.0007399177,0.00056125456,0.0011966657,0.0009026784,0.0008995728,0.0029332973],"category_scores_gemma":[0.006776449,0.0003949305,0.00034192475,0.00071893324,0.0019273043,0.00094190094,0.0013029018,0.001496166,0.00025187148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013472931,0.00004177447,0.00019721453,0.00006454681,0.000017158454,0.00004369597,0.00006756711,0.9314744,0.001241483,0.058527023,0.001271401,0.0069190003],"study_design_scores_gemma":[0.000018589886,0.000015404194,0.00004338971,0.000004863666,0.0000030251651,0.0000038051335,0.000008031182,0.9881074,0.00017559767,0.011399056,0.0002163597,0.0000044800167],"about_ca_topic_score_codex":0.014685165,"about_ca_topic_score_gemma":0.0077611604,"teacher_disagreement_score":0.014685165,"about_ca_system_score_codex":0.0038222312,"about_ca_system_score_gemma":0.0023329563,"threshold_uncertainty_score":0.029199362},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11124136,0.0039150473,0.8693861,0.00050438347,0.0000733587,0.000039956733,0.00009317316,0.00009147479,0.014655186],"genre_scores_gemma":[0.9591817,0.0022195687,0.034240708,0.000088839486,0.00006542129,0.000037632653,0.000039880288,0.000012252327,0.0041139303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997602,0.00010918961,0.0000051415377,0.000030121819,0.00006753428,0.00002772746],"domain_scores_gemma":[0.99938095,0.0004307165,0.00005651592,0.000056185043,0.000063206404,0.000012376032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051831955,0.00034177987,0.0003082784,0.00023126489,0.00027313954,0.0005433611,0.00029917134,0.0004376858,0.0010990975],"category_scores_gemma":[0.0012905544,0.00011747297,0.00023174651,0.00031225928,0.00059341284,0.00081179553,0.00037802928,0.00049574126,0.00019193336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008892713,0.000025704827,0.0003666602,0.00016727304,0.000028622255,0.00029873484,0.00026791866,0.49559602,0.016617065,0.45561546,0.0013494898,0.029578065],"study_design_scores_gemma":[0.000007057408,0.00005939554,0.00019250378,0.000011642114,0.000009924618,0.00015874786,0.000034120512,0.93266666,0.0021851691,0.06216373,0.0024970935,0.000014016727],"about_ca_topic_score_codex":0.0010676149,"about_ca_topic_score_gemma":0.00088002416,"teacher_disagreement_score":0.0010990975,"about_ca_system_score_codex":0.00063308136,"about_ca_system_score_gemma":0.00035976307,"threshold_uncertainty_score":0.0045933127},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00085405586,0.000078634104,0.9954971,0.0003812603,0.000028385406,0.000030653187,0.00003325402,0.000045036126,0.0030516405],"genre_scores_gemma":[0.23621185,0.00079816993,0.7529751,0.00048001256,0.00018054905,0.00048122497,0.00019113369,0.00010491485,0.008577025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99694604,0.0015185591,0.00011493679,0.00033292145,0.0009321488,0.00015540687],"domain_scores_gemma":[0.99677795,0.0017725944,0.00017747199,0.0007728177,0.00042972947,0.00006941199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034452688,0.0009846203,0.0006541699,0.00097334065,0.00076780806,0.001650695,0.0019982841,0.0017593213,0.0041906927],"category_scores_gemma":[0.008858636,0.000530812,0.0007234294,0.0013749923,0.0025702212,0.0026007548,0.0033530707,0.003035762,0.0010358365],"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.000038054157,0.000022664135,0.0001207532,0.00008678131,0.000020237569,0.00008162743,0.000111271926,0.15481564,0.002013354,0.80845904,0.002191022,0.032039594],"study_design_scores_gemma":[0.00002216551,0.000041231917,0.000038720947,0.000031361033,0.000009349117,0.000107289765,0.00003241705,0.44818932,0.0015396101,0.5425062,0.0074632955,0.00001899279],"about_ca_topic_score_codex":0.0015629074,"about_ca_topic_score_gemma":0.0015450058,"teacher_disagreement_score":0.0041906927,"about_ca_system_score_codex":0.0014282566,"about_ca_system_score_gemma":0.002107657,"threshold_uncertainty_score":0.018220544},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045537733,0.00398358,0.9371406,0.0005320077,0.00006820845,0.000064088934,0.00010267679,0.00024054915,0.012330592],"genre_scores_gemma":[0.95597535,0.003235443,0.037184414,0.000102710925,0.00019372819,0.00011313156,0.00008743306,0.00005271789,0.003055157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976521,0.0011260648,0.00006810822,0.00025543786,0.0006659248,0.00023232675],"domain_scores_gemma":[0.99402434,0.00447775,0.00045942832,0.00025949656,0.000691471,0.00008763996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024711124,0.0012512173,0.0011203026,0.00095433067,0.0006115454,0.0016574536,0.0009937524,0.0010239986,0.0022430036],"category_scores_gemma":[0.012151118,0.0005301198,0.00039782305,0.001719234,0.0013494008,0.002218394,0.0011382413,0.000792191,0.000499812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000806083,0.000020741527,0.0006929979,0.0001334214,0.000034560522,0.00018797859,0.0001456524,0.8988495,0.0020970658,0.08000031,0.00090065,0.016856544],"study_design_scores_gemma":[0.000005078123,0.00003889348,0.00019212776,0.000013669207,0.000009721219,0.00008842626,0.0000265518,0.98115426,0.0005166506,0.017351404,0.00059241545,0.000010901389],"about_ca_topic_score_codex":0.0024038008,"about_ca_topic_score_gemma":0.0012186477,"teacher_disagreement_score":0.0024711124,"about_ca_system_score_codex":0.0017761531,"about_ca_system_score_gemma":0.0007689302,"threshold_uncertainty_score":0.013068676},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18706231,0.00026156765,0.8077806,0.00023564865,0.000013465048,0.000044853885,0.000085287465,0.00016087168,0.004355376],"genre_scores_gemma":[0.9385753,0.00015345105,0.059610303,0.000024497393,0.000008652262,0.000070323316,0.000032308286,0.000017077016,0.0015080349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963784,0.00019151108,0.00001398441,0.00005016676,0.000057524703,0.00004898932],"domain_scores_gemma":[0.9992518,0.00053957966,0.00007423668,0.00005140298,0.000059049195,0.000023972296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007980087,0.00046201568,0.0005385936,0.00030499513,0.00028322265,0.0005068845,0.000559049,0.0005199713,0.00075004227],"category_scores_gemma":[0.0024270224,0.0002505527,0.00016847339,0.00047337572,0.0007427609,0.00081979576,0.0006458576,0.00030096908,0.00015992214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008148247,0.000019730156,0.00023760342,0.000024284667,0.000008630794,0.00007624349,0.000105702886,0.96491367,0.0031933165,0.016620822,0.00033118314,0.014387251],"study_design_scores_gemma":[0.000016188396,0.000029806184,0.00007102789,0.0000025518189,0.000004366719,0.000021423144,0.000024696483,0.98710144,0.0015159807,0.010960253,0.0002482557,0.0000040469413],"about_ca_topic_score_codex":0.0017229223,"about_ca_topic_score_gemma":0.0018024157,"teacher_disagreement_score":0.0017229223,"about_ca_system_score_codex":0.00065616675,"about_ca_system_score_gemma":0.00045884508,"threshold_uncertainty_score":0.0047608614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028774455,0.0036131972,0.8966089,0.0013834799,0.0003380621,0.00006920742,0.00021803816,0.0001587295,0.068835944],"genre_scores_gemma":[0.81603366,0.0045225318,0.14744566,0.0005100518,0.00034442754,0.0002241969,0.00032314914,0.00007884122,0.030517474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995473,0.00018032198,0.00001462008,0.00006420351,0.00012775967,0.00006572567],"domain_scores_gemma":[0.99914575,0.0005558622,0.000042689808,0.000071480245,0.00014153995,0.00004275149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006650206,0.00036823264,0.00056489813,0.0006476035,0.0005622014,0.0010320521,0.00082571054,0.00093138526,0.0064932015],"category_scores_gemma":[0.0019628298,0.00024113414,0.00033467144,0.0006503778,0.00094138284,0.001242486,0.001316124,0.0013029719,0.0006679071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077640725,0.000022155667,0.00014644874,0.00013892556,0.000013457431,0.00011695359,0.00014690771,0.07406234,0.0016382223,0.89732444,0.00472077,0.02159181],"study_design_scores_gemma":[0.00004682124,0.00005653183,0.0000928138,0.000040152805,0.000009405309,0.0001557988,0.00011057138,0.49876904,0.0009961495,0.4866339,0.0130633265,0.000025400293],"about_ca_topic_score_codex":0.0014691917,"about_ca_topic_score_gemma":0.0012978003,"teacher_disagreement_score":0.0064932015,"about_ca_system_score_codex":0.0011026085,"about_ca_system_score_gemma":0.00077861006,"threshold_uncertainty_score":0.02172196},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6804236,0.0014690945,0.30581808,0.00025168457,0.000054300264,0.00003867431,0.00012969408,0.00033358886,0.011481304],"genre_scores_gemma":[0.98594576,0.00024915,0.013226026,0.000017386881,0.000010816721,0.000011819725,0.000036454636,0.000008548607,0.0004940197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994097,0.00022527324,0.00002276123,0.00005981615,0.00021358383,0.00006892851],"domain_scores_gemma":[0.9979996,0.0014004726,0.00017130718,0.00013791463,0.00025469498,0.00003598706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009481077,0.0006847594,0.0003853361,0.00040240216,0.00035413657,0.00052903756,0.00032259364,0.0005151844,0.00068979064],"category_scores_gemma":[0.0022859473,0.0001261792,0.0002500916,0.0005128024,0.00050672673,0.00046540133,0.0005111015,0.00027858154,0.00017291878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013719513,0.00012533795,0.007351505,0.00034763722,0.00024670022,0.0004951419,0.000433763,0.6379088,0.18036333,0.019569699,0.0008183394,0.15096776],"study_design_scores_gemma":[0.00003077467,0.00059059425,0.004058524,0.00002232481,0.000083361236,0.00046242398,0.00007114174,0.935369,0.05372314,0.004558183,0.0009873078,0.00004326015],"about_ca_topic_score_codex":0.0007597654,"about_ca_topic_score_gemma":0.0011636007,"teacher_disagreement_score":0.0009481077,"about_ca_system_score_codex":0.0004018787,"about_ca_system_score_gemma":0.00033942054,"threshold_uncertainty_score":0.0050141215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015177124,0.0002818112,0.981643,0.00018020974,0.00003277916,0.000021576008,0.000038179795,0.00004730325,0.0025779956],"genre_scores_gemma":[0.8551981,0.0008306426,0.13913701,0.00017378683,0.00007110797,0.00012585553,0.00010449504,0.000035611996,0.0043234653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937147,0.0002548343,0.000019829025,0.00010116686,0.00018837061,0.00006444529],"domain_scores_gemma":[0.9982095,0.0011587533,0.00021228522,0.00019192183,0.00019157403,0.00003593132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009753175,0.0005268787,0.0005489081,0.00047792558,0.00038373342,0.0007739194,0.0008144368,0.0006501569,0.0013145598],"category_scores_gemma":[0.003466771,0.00025238155,0.00035772522,0.0007608663,0.0012462046,0.0016620109,0.0012037904,0.0009937756,0.00017101508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011464944,0.000026206515,0.00039401295,0.000107473454,0.000027865286,0.00019485905,0.00019142174,0.58034956,0.010712902,0.37053636,0.0010048302,0.036339846],"study_design_scores_gemma":[0.000008324578,0.000023434344,0.00007088556,0.000009733792,0.000007831136,0.00005900216,0.000018191171,0.9515945,0.0015133267,0.045858774,0.0008242603,0.000011814033],"about_ca_topic_score_codex":0.0015504934,"about_ca_topic_score_gemma":0.001265126,"teacher_disagreement_score":0.0015504934,"about_ca_system_score_codex":0.0009362627,"about_ca_system_score_gemma":0.00071917137,"threshold_uncertainty_score":0.0067931414},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05463423,0.004608433,0.8742736,0.0021658344,0.00017074351,0.00015688057,0.00072916213,0.0003983802,0.06286286],"genre_scores_gemma":[0.928878,0.005731712,0.05523503,0.00055491517,0.00032395092,0.00092228275,0.0005466576,0.00021775579,0.007589624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969537,0.0012748992,0.00009412322,0.00033428476,0.00066811347,0.0006747839],"domain_scores_gemma":[0.98167586,0.01475118,0.0008485861,0.0007650706,0.0015929786,0.0003663494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046174005,0.0022354992,0.0018567665,0.0023264163,0.0012603675,0.003124703,0.0027704951,0.0017181933,0.007000387],"category_scores_gemma":[0.027909745,0.00082189596,0.0010231097,0.0024894406,0.003483853,0.004653254,0.0037391556,0.0027031011,0.0015632429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018312971,0.00005543104,0.00034310733,0.00038426818,0.00005732805,0.00028437568,0.00041063473,0.45181456,0.002354294,0.5258938,0.004293091,0.013926006],"study_design_scores_gemma":[0.00002215353,0.000046499008,0.00018027112,0.0001414917,0.00002387042,0.00018204907,0.00010519685,0.72718215,0.00085206446,0.26912296,0.0021014116,0.0000399866],"about_ca_topic_score_codex":0.0028031706,"about_ca_topic_score_gemma":0.0013285966,"teacher_disagreement_score":0.007000387,"about_ca_system_score_codex":0.0039265947,"about_ca_system_score_gemma":0.0019822,"threshold_uncertainty_score":0.02848953},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28181532,0.0014612118,0.7103808,0.0004057778,0.00008612691,0.00006167151,0.00019411625,0.00022272015,0.005372321],"genre_scores_gemma":[0.9818069,0.0005557653,0.015802586,0.00007673544,0.00003900775,0.000058685033,0.000073260235,0.000050052327,0.0015371345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930525,0.00016393846,0.000023758334,0.00010087249,0.00022223599,0.00018388132],"domain_scores_gemma":[0.9872636,0.009497635,0.000992261,0.0004449514,0.0015624844,0.00023904847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001357572,0.00066979777,0.00048574904,0.0008505458,0.0004328078,0.0009371249,0.0009776624,0.0006706761,0.001526345],"category_scores_gemma":[0.01181169,0.00030180695,0.00022810049,0.00076983345,0.0014620703,0.0022151077,0.0009182124,0.0009868804,0.00017646309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014756194,0.000018292023,0.00072393735,0.00006512902,0.000020892576,0.00011369745,0.00012282633,0.93154156,0.0054878034,0.05395099,0.0005775162,0.0072297356],"study_design_scores_gemma":[0.0000037752302,0.000029682935,0.00011901028,0.0000072368207,0.000005904651,0.000038875005,0.000028014825,0.98708934,0.0015264931,0.010847734,0.00029331565,0.000010616773],"about_ca_topic_score_codex":0.0037857166,"about_ca_topic_score_gemma":0.0015797294,"teacher_disagreement_score":0.0037857166,"about_ca_system_score_codex":0.0024443143,"about_ca_system_score_gemma":0.00087258744,"threshold_uncertainty_score":0.017734826},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09998592,0.00078527344,0.89172935,0.00027941912,0.00011877386,0.000119424105,0.00009596006,0.0006273258,0.0062584984],"genre_scores_gemma":[0.9245541,0.00027946386,0.07379299,0.000115451265,0.000028103233,0.00004646343,0.00007654025,0.0000442519,0.0010626506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905497,0.0002664512,0.000029314706,0.00014394347,0.00022397161,0.00028134134],"domain_scores_gemma":[0.998752,0.00063181686,0.00015793214,0.00017178543,0.00019597512,0.000090483554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001151704,0.0010774836,0.0010187479,0.00036560255,0.00068070384,0.0011765457,0.0014038567,0.0009302873,0.0010883232],"category_scores_gemma":[0.0026005048,0.00034224792,0.00057364395,0.0006686791,0.0009421773,0.0013391867,0.001492261,0.0010138062,0.0001648718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016655479,0.00006783521,0.00047731696,0.00007533815,0.00003038808,0.00023811367,0.0000708182,0.950527,0.004480541,0.013071091,0.0014689869,0.029326089],"study_design_scores_gemma":[0.000005305541,0.000022936916,0.00006623365,0.0000037401946,0.000003820097,0.000026079622,0.000017012044,0.99692756,0.0005516414,0.0021514592,0.00022016867,0.0000039260167],"about_ca_topic_score_codex":0.010090068,"about_ca_topic_score_gemma":0.010865265,"teacher_disagreement_score":0.010090068,"about_ca_system_score_codex":0.0011365165,"about_ca_system_score_gemma":0.0016957669,"threshold_uncertainty_score":0.020062625},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1736918,0.0040668864,0.8062357,0.00096703664,0.0000922542,0.00006213663,0.0001024322,0.00055318803,0.014228629],"genre_scores_gemma":[0.97176826,0.0014815305,0.024681218,0.00004914514,0.000087328815,0.000044753688,0.000065021544,0.000047980924,0.0017746936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990339,0.00040622483,0.000019421233,0.00008966364,0.0003065638,0.00014427537],"domain_scores_gemma":[0.9972351,0.0017943245,0.00027378398,0.00019216303,0.0004423813,0.00006231806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017732051,0.0009929735,0.0005046471,0.0009170054,0.00040268712,0.0010189358,0.00062598387,0.0007061559,0.0013547672],"category_scores_gemma":[0.005865358,0.0002961084,0.0002585755,0.0012375319,0.0009197237,0.0011578255,0.00071860413,0.00084420067,0.00029589166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001010806,0.00003417695,0.00060781266,0.000045862304,0.000023118422,0.00003982637,0.00004084294,0.95286834,0.0033611804,0.0185189,0.0007441287,0.023614747],"study_design_scores_gemma":[0.0000017830828,0.000018598745,0.00010804502,0.0000034385066,0.0000034360742,0.000015455913,0.000006263296,0.9967187,0.0004544169,0.0025399227,0.0001266919,0.0000031827653],"about_ca_topic_score_codex":0.0035859293,"about_ca_topic_score_gemma":0.0021922437,"teacher_disagreement_score":0.0035859293,"about_ca_system_score_codex":0.0020805162,"about_ca_system_score_gemma":0.00092016056,"threshold_uncertainty_score":0.015095234},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02154477,0.0010466767,0.9681111,0.0005052574,0.00006671698,0.000040654,0.00007459282,0.00014058204,0.008469701],"genre_scores_gemma":[0.8491106,0.0028780247,0.14245518,0.00023162161,0.00016812402,0.00023138979,0.00017779348,0.000050117444,0.00469716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940705,0.00021347209,0.000023394497,0.000067303234,0.00022716401,0.00006161842],"domain_scores_gemma":[0.9985669,0.00096147193,0.00009883836,0.00015131941,0.0001860139,0.000035491557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011884063,0.00043663188,0.00044584146,0.0006369447,0.00054377434,0.0011127605,0.00062051695,0.0007541078,0.0013460784],"category_scores_gemma":[0.004326257,0.00022367854,0.00029439692,0.0007106135,0.00087691616,0.0018667902,0.0009147065,0.0008157219,0.00031251748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005368485,0.000020790392,0.00025790586,0.00012599799,0.000014834947,0.00022681954,0.00023743341,0.16877148,0.005042098,0.7717648,0.002631459,0.050852686],"study_design_scores_gemma":[0.000012853236,0.000043454118,0.00008244939,0.000023723083,0.000010859686,0.00016021811,0.0000357238,0.6469165,0.0017192183,0.34488326,0.006096001,0.000015699317],"about_ca_topic_score_codex":0.0009163739,"about_ca_topic_score_gemma":0.00072960835,"teacher_disagreement_score":0.0013460784,"about_ca_system_score_codex":0.0011124796,"about_ca_system_score_gemma":0.00081381353,"threshold_uncertainty_score":0.008071601},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0683718,0.010015913,0.85103244,0.003017721,0.00027895573,0.00024200686,0.0007249997,0.00022947586,0.06608665],"genre_scores_gemma":[0.81573045,0.01493513,0.15056616,0.00073519634,0.00050231034,0.00050912553,0.00059608574,0.0001731753,0.016252324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835443,0.00077070546,0.00005897721,0.0002175876,0.0004125761,0.00018563587],"domain_scores_gemma":[0.99571073,0.003135851,0.00028589476,0.00039763446,0.0003796146,0.00009020735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025942235,0.0023000566,0.0013056634,0.0013429885,0.0007583491,0.0013255229,0.0012486028,0.0013234484,0.0040065297],"category_scores_gemma":[0.012121329,0.00062823744,0.000590434,0.0015932939,0.0027310173,0.0033033234,0.002280986,0.0026622126,0.001007354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033988393,0.000058944013,0.00027948624,0.0003199855,0.00005562476,0.00015398602,0.00025429644,0.18216453,0.0045673396,0.75601584,0.004482125,0.05130802],"study_design_scores_gemma":[0.00007880122,0.00020917623,0.00043347946,0.0002505977,0.00005670883,0.00033566344,0.00012644107,0.52709043,0.0055197496,0.459766,0.006039462,0.000093461465],"about_ca_topic_score_codex":0.0018566701,"about_ca_topic_score_gemma":0.001715863,"teacher_disagreement_score":0.0040065297,"about_ca_system_score_codex":0.0021338165,"about_ca_system_score_gemma":0.0018161028,"threshold_uncertainty_score":0.015482008},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031429086,0.00033549892,0.9567549,0.0001867949,0.000026184869,0.00003259282,0.0000382935,0.0001614218,0.011035256],"genre_scores_gemma":[0.92281103,0.00051219965,0.069923334,0.00012906574,0.00006133198,0.000076695535,0.000045057062,0.000029777946,0.0064114626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999204,0.00025431265,0.000021824231,0.00010270183,0.00029485734,0.00012237295],"domain_scores_gemma":[0.9992625,0.00037623034,0.0001023862,0.00010808631,0.00012450296,0.00002627863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006075134,0.0007064002,0.00060887623,0.00029072797,0.0005983028,0.00096176617,0.00092519494,0.0006817592,0.0013548472],"category_scores_gemma":[0.0013105976,0.0002687064,0.00045639876,0.0006105929,0.0009552808,0.001212261,0.0010512037,0.00089756976,0.00045019132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060424383,0.000061077444,0.00023941102,0.00007136353,0.00003307525,0.00018483956,0.00012067793,0.9002162,0.009402477,0.06332238,0.0009028973,0.025385153],"study_design_scores_gemma":[0.0000046331506,0.000031652748,0.00003761414,0.0000035446778,0.0000060123707,0.000043343764,0.000013899552,0.9907967,0.001730668,0.006776327,0.00054863497,0.0000069532725],"about_ca_topic_score_codex":0.0032524,"about_ca_topic_score_gemma":0.0038111743,"teacher_disagreement_score":0.0032524,"about_ca_system_score_codex":0.0010734857,"about_ca_system_score_gemma":0.0009376821,"threshold_uncertainty_score":0.007788658},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0612542,0.00096436386,0.9131073,0.0013124387,0.0001524875,0.00018273859,0.0003266982,0.0003850911,0.022314746],"genre_scores_gemma":[0.9601866,0.000982971,0.023244027,0.00014722598,0.00006563207,0.00020000269,0.00010200331,0.00007592166,0.014995755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931073,0.00017772282,0.00002044172,0.00009840513,0.0001313812,0.0002613101],"domain_scores_gemma":[0.9981688,0.0011285602,0.00023492101,0.000047343354,0.00033748033,0.000082866616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011937249,0.00095617224,0.0012295481,0.0008407339,0.0007084487,0.002057956,0.0022161987,0.0023097335,0.0057273027],"category_scores_gemma":[0.0033249806,0.0007794077,0.0006303278,0.0011205774,0.0015233982,0.0019150475,0.0009800134,0.001521586,0.00079818437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006589422,0.00003032049,0.00021025048,0.00006222239,0.000013601893,0.00023564367,0.000121396064,0.9330255,0.002017651,0.06054196,0.0011374827,0.0025380708],"study_design_scores_gemma":[0.000006247928,0.000014210532,0.000034699875,0.000005676209,0.0000042378615,0.000019939655,0.000020084988,0.99523216,0.000119944445,0.004326431,0.00021042052,0.000006006202],"about_ca_topic_score_codex":0.013901875,"about_ca_topic_score_gemma":0.0067331456,"teacher_disagreement_score":0.013901875,"about_ca_system_score_codex":0.0042588008,"about_ca_system_score_gemma":0.0021151667,"threshold_uncertainty_score":0.030899882},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033893615,0.0002664444,0.9602719,0.00013632562,0.0000717254,0.00008544679,0.0000318183,0.00025065226,0.004991945],"genre_scores_gemma":[0.7629795,0.00029847844,0.23144065,0.000101444624,0.00004238398,0.00014044878,0.00010807936,0.000044776825,0.0048442893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997558,0.00005440846,0.00001222743,0.000035060333,0.00010759456,0.00003489242],"domain_scores_gemma":[0.9997379,0.0001030297,0.000028521394,0.000012942102,0.00010194577,0.000015729933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041195276,0.00040301465,0.00044176134,0.000496713,0.00031454323,0.0004222025,0.0007383853,0.00038195495,0.0015459689],"category_scores_gemma":[0.0008911968,0.00017444367,0.00031738047,0.00039227732,0.0003502866,0.00059935136,0.00054012844,0.00043002202,0.00014628656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025404486,0.000073711824,0.0010443928,0.0001204429,0.00004705784,0.00020501825,0.00013784532,0.80038786,0.018307274,0.015476519,0.0015084611,0.16243736],"study_design_scores_gemma":[0.000006882037,0.000026238824,0.00005407466,0.000003266071,0.0000048794113,0.00002422387,0.0000095591195,0.9980611,0.0009088973,0.00055702496,0.00034026557,0.0000035714163],"about_ca_topic_score_codex":0.00725528,"about_ca_topic_score_gemma":0.005992497,"teacher_disagreement_score":0.00725528,"about_ca_system_score_codex":0.000577571,"about_ca_system_score_gemma":0.0007997806,"threshold_uncertainty_score":0.014426112},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21437229,0.0028188203,0.7680768,0.00036542417,0.00005865305,0.000058814145,0.00013375287,0.00053216435,0.013583379],"genre_scores_gemma":[0.98951995,0.00048545972,0.009066919,0.000024632785,0.000012054312,0.000016391283,0.000026721658,0.000011439654,0.00083647936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990865,0.00035668036,0.000034178363,0.00012277772,0.00025384733,0.00014607355],"domain_scores_gemma":[0.99745053,0.0015198999,0.00028005202,0.00020577988,0.00047955938,0.00006426134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012844403,0.0011397988,0.0008796209,0.00053555996,0.0004577608,0.0011318038,0.0008273614,0.0009300241,0.0012811328],"category_scores_gemma":[0.0045523974,0.00029279193,0.00039407695,0.00056732976,0.0009753202,0.0012316422,0.0007941296,0.0005813664,0.00037596852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019155435,0.000025794934,0.000859434,0.0001586561,0.000041680873,0.00033952203,0.00012126616,0.9550152,0.012301994,0.020044208,0.00033712745,0.0105635],"study_design_scores_gemma":[0.0000051502534,0.000103960665,0.00019473728,0.000010499184,0.000016745678,0.00012842486,0.00003503662,0.99461055,0.0031257789,0.0015566271,0.00020089227,0.000011586301],"about_ca_topic_score_codex":0.0026894826,"about_ca_topic_score_gemma":0.0016402425,"teacher_disagreement_score":0.0026894826,"about_ca_system_score_codex":0.0011066952,"about_ca_system_score_gemma":0.0006003312,"threshold_uncertainty_score":0.00802964},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5014532,0.0006954492,0.4907891,0.00023923937,0.000026333479,0.000055271477,0.000054320208,0.00017058618,0.0065164985],"genre_scores_gemma":[0.99344856,0.000118848846,0.0060749254,0.000016053684,0.000005192916,0.000014713662,0.000009603983,0.0000042039965,0.00030795895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895763,0.00060631306,0.00002560783,0.0000743232,0.00017636707,0.00015976545],"domain_scores_gemma":[0.99522614,0.0035400763,0.00046116838,0.000270203,0.0003850293,0.00011740425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018662518,0.0006461241,0.0006388851,0.0003692915,0.0003501676,0.00070923264,0.00059994025,0.0005437785,0.0004754551],"category_scores_gemma":[0.005409029,0.0001960525,0.0001930318,0.00092302717,0.0014418578,0.0006440851,0.00095353764,0.00036740737,0.0000908581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078849676,0.000016582337,0.0006993783,0.0000548225,0.000024992707,0.00024479604,0.00018208861,0.95462286,0.0041632317,0.0337578,0.0002800483,0.0058744377],"study_design_scores_gemma":[0.000007012115,0.000045768018,0.00015180898,0.000004754545,0.0000059052777,0.000062187355,0.00002349534,0.99215955,0.00090049295,0.0065391506,0.000092058894,0.000007821633],"about_ca_topic_score_codex":0.0020543614,"about_ca_topic_score_gemma":0.0016752062,"teacher_disagreement_score":0.0020543614,"about_ca_system_score_codex":0.00080649543,"about_ca_system_score_gemma":0.0006839621,"threshold_uncertainty_score":0.009869814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051993903,0.00060499954,0.9443861,0.00016123084,0.000049181726,0.000054439206,0.000024986915,0.00019327729,0.0025319485],"genre_scores_gemma":[0.94721574,0.00023729818,0.05149448,0.000107135595,0.000034631532,0.000046496385,0.000025471481,0.000016679181,0.0008220543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859256,0.0005053924,0.00003362443,0.00020930226,0.0002964793,0.00036262753],"domain_scores_gemma":[0.99893457,0.00048538743,0.0001589681,0.00013695912,0.00018296401,0.00010124499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015074743,0.00090575806,0.0009837436,0.000681373,0.00097042666,0.0008281277,0.0019299595,0.00060735253,0.0005593528],"category_scores_gemma":[0.0019107579,0.00025418765,0.0006892068,0.0009721896,0.0010282956,0.00093893235,0.0015603438,0.0006263198,0.0001363181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016981186,0.00011501008,0.0012395517,0.000069435235,0.000094507865,0.00033884725,0.00013857894,0.90631485,0.009330878,0.028313937,0.001392005,0.052482683],"study_design_scores_gemma":[0.000012081963,0.000045365192,0.00015066584,0.0000034267468,0.0000209072,0.000054169243,0.00002850506,0.993853,0.0012653357,0.0041085044,0.0004510354,0.000007054306],"about_ca_topic_score_codex":0.0066244868,"about_ca_topic_score_gemma":0.0065682526,"teacher_disagreement_score":0.0066244868,"about_ca_system_score_codex":0.001215924,"about_ca_system_score_gemma":0.001517528,"threshold_uncertainty_score":0.013171852},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53068244,0.0017251588,0.4597212,0.0005959681,0.00009333273,0.00003332607,0.00005277994,0.00013349854,0.0069622565],"genre_scores_gemma":[0.9952081,0.00028710367,0.0037871206,0.00002085182,0.00001644631,0.000007727153,0.0000079080755,0.0000028052273,0.00066184404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936146,0.00020097828,0.000022331751,0.00010642345,0.00012360253,0.0001851843],"domain_scores_gemma":[0.9989207,0.000558969,0.0001627948,0.0001263091,0.00018514288,0.00004611899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005171692,0.00078322453,0.00067286787,0.00029602993,0.0006925823,0.00075225165,0.0006823855,0.00080257026,0.0003905089],"category_scores_gemma":[0.0017094641,0.00028847717,0.0003524801,0.0004622009,0.00094771205,0.0011765525,0.00084232684,0.00044373973,0.00012622109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000533442,0.00007302342,0.0058032563,0.0002147553,0.00014836874,0.0039340504,0.0007648115,0.8060656,0.06936447,0.07591699,0.0008122594,0.036368966],"study_design_scores_gemma":[0.000016659551,0.00014305694,0.00068356976,0.000008882645,0.00004391979,0.0009434256,0.00010798751,0.98603034,0.0054485314,0.0057334127,0.00081727037,0.000022904067],"about_ca_topic_score_codex":0.0020500019,"about_ca_topic_score_gemma":0.0015733729,"teacher_disagreement_score":0.0020500019,"about_ca_system_score_codex":0.000836751,"about_ca_system_score_gemma":0.0005893107,"threshold_uncertainty_score":0.006071031},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04300095,0.0005251155,0.9512937,0.0001931838,0.000032752716,0.00003219033,0.00003290518,0.000108944296,0.0047801617],"genre_scores_gemma":[0.94314945,0.00032089208,0.05416991,0.00006067644,0.000044543784,0.000064135274,0.000021510938,0.00001598554,0.0021530036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994086,0.0002943322,0.000020444655,0.000080872065,0.00012504465,0.000070653536],"domain_scores_gemma":[0.9993279,0.0004424818,0.00008421847,0.00004645143,0.000077625504,0.000021295022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006660948,0.0007423189,0.0005210303,0.00029056557,0.00035434496,0.00074713107,0.000645369,0.0006500432,0.001195146],"category_scores_gemma":[0.0018860893,0.00030850185,0.0003081964,0.0004862341,0.00061622227,0.0009464771,0.0007032228,0.00044859282,0.000359263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013176745,0.000065334956,0.0004247741,0.00010413946,0.000040002233,0.0002910134,0.00012082497,0.92186034,0.010171106,0.027428355,0.0006277844,0.038734604],"study_design_scores_gemma":[0.0000076387605,0.000040757724,0.00006400939,0.0000028876273,0.000005348922,0.000043418735,0.000013696283,0.9944054,0.0006777268,0.0045109224,0.00022391087,0.000004353564],"about_ca_topic_score_codex":0.00083462766,"about_ca_topic_score_gemma":0.0010972171,"teacher_disagreement_score":0.001195146,"about_ca_system_score_codex":0.00058092497,"about_ca_system_score_gemma":0.00041609406,"threshold_uncertainty_score":0.004214883},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031110717,0.5525227,0.38090485,0.0034893607,0.0013694128,0.00020270719,0.00043484598,0.00032047086,0.05764453],"genre_scores_gemma":[0.053430285,0.83529353,0.096807316,0.0015132806,0.0032714645,0.00037214204,0.00072745857,0.0001553575,0.008429172],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99829787,0.0005732678,0.000116630035,0.00023529782,0.00068046147,0.00009651595],"domain_scores_gemma":[0.99564266,0.0032046859,0.00020833718,0.00033774754,0.0005373642,0.00006935554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017431563,0.0014649015,0.0014141358,0.0031763646,0.00078883546,0.0021646845,0.0018191248,0.0017121849,0.0052188137],"category_scores_gemma":[0.005700453,0.0007871017,0.0008352753,0.007420782,0.001335308,0.0053043445,0.0018158797,0.0019045487,0.0015736133],"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.000056054443,0.00007884991,0.0014174244,0.006274227,0.00008357474,0.00029620746,0.00023863828,0.029299343,0.001437512,0.24149951,0.038440146,0.6808785],"study_design_scores_gemma":[0.000018461518,0.0001766527,0.0015191659,0.0040333034,0.00014007965,0.0027117156,0.00035376783,0.08768822,0.002742187,0.20388508,0.6965778,0.0001536162],"about_ca_topic_score_codex":0.002228222,"about_ca_topic_score_gemma":0.0014580598,"teacher_disagreement_score":0.0052188137,"about_ca_system_score_codex":0.001584842,"about_ca_system_score_gemma":0.0015702329,"threshold_uncertainty_score":0.017458618},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01764854,0.00044153596,0.97824246,0.00039213873,0.00003232395,0.000055701472,0.000054667675,0.00007473817,0.0030579886],"genre_scores_gemma":[0.7029395,0.0011650444,0.2893103,0.0003213168,0.00013508185,0.0003566377,0.00027989745,0.00010549602,0.0053866943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977157,0.00081318914,0.000063774794,0.0002044288,0.00091542513,0.00028746936],"domain_scores_gemma":[0.9947745,0.0035962532,0.0005134315,0.0003649324,0.0006330281,0.00011783443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024137625,0.00072411256,0.0007558269,0.00085101643,0.00058239436,0.0012067695,0.0010596284,0.0009498893,0.0026996392],"category_scores_gemma":[0.013450915,0.0003177065,0.000372024,0.001011979,0.001467539,0.0020105164,0.0015933986,0.0015224795,0.0005178909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021337594,0.000068818874,0.00094615173,0.00024563028,0.000030511874,0.00016970056,0.00018865085,0.648137,0.005615414,0.27871367,0.0027500014,0.06292103],"study_design_scores_gemma":[0.000019875348,0.000040286963,0.000103314575,0.00001997408,0.000004932102,0.00008533419,0.000025588422,0.9516189,0.0014613016,0.04575164,0.0008567498,0.000012183716],"about_ca_topic_score_codex":0.0014787377,"about_ca_topic_score_gemma":0.0009840445,"teacher_disagreement_score":0.0026996392,"about_ca_system_score_codex":0.0014159124,"about_ca_system_score_gemma":0.0021935261,"threshold_uncertainty_score":0.012765348},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018698,0.000531612,0.9707365,0.000685143,0.00009799298,0.00014755591,0.00028210558,0.00047694863,0.008344179],"genre_scores_gemma":[0.7917719,0.0013615724,0.18875605,0.0008292344,0.00030599668,0.00079542986,0.00065543444,0.0002680461,0.015256381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99478674,0.0017259675,0.00020621617,0.0006994546,0.0017065462,0.0008749552],"domain_scores_gemma":[0.9818081,0.010431734,0.0019326808,0.0035523258,0.0015897949,0.0006853836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030489392,0.0014110738,0.0012461238,0.0010821203,0.00079585763,0.002526334,0.0024971317,0.0020508342,0.0047413977],"category_scores_gemma":[0.017935377,0.0007540984,0.0008889557,0.0011501373,0.0029023134,0.0041097947,0.004671078,0.0043040835,0.0014156516],"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.00026762992,0.000083452454,0.0004453547,0.00014907103,0.000046898025,0.00015758784,0.00020837176,0.28030917,0.004024423,0.68414646,0.0038048206,0.026356779],"study_design_scores_gemma":[0.000064688546,0.00012615604,0.00011899792,0.00007482386,0.00002276167,0.00013046637,0.000037834507,0.7062252,0.0030278633,0.2857953,0.004331735,0.000044111566],"about_ca_topic_score_codex":0.0014992023,"about_ca_topic_score_gemma":0.0016156413,"teacher_disagreement_score":0.0047413977,"about_ca_system_score_codex":0.0025118361,"about_ca_system_score_gemma":0.0030361272,"threshold_uncertainty_score":0.018224657},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049217045,0.00028171221,0.9442876,0.00024562073,0.0000348235,0.00005847422,0.00008160849,0.00020547741,0.00558772],"genre_scores_gemma":[0.9374181,0.00039833327,0.058300354,0.000059399135,0.00004386142,0.00010384666,0.00009675161,0.000032441494,0.0035469164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987161,0.0004230211,0.00004241811,0.00015828985,0.0004631995,0.00019699585],"domain_scores_gemma":[0.99729615,0.0015740977,0.00042132332,0.00033167072,0.0002884693,0.00008835383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011948444,0.0010205276,0.0006905102,0.0007030637,0.00055779715,0.0011843065,0.00094625674,0.00093407446,0.0011046991],"category_scores_gemma":[0.0038151718,0.00037920775,0.00050980994,0.0008004947,0.002089518,0.0019348963,0.0023311535,0.0014076883,0.00038961667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021825281,0.000031665644,0.00033195675,0.000119518554,0.00003709121,0.00036054017,0.00025208291,0.78399545,0.015643228,0.17847727,0.0008092134,0.019723676],"study_design_scores_gemma":[0.000010343899,0.00006058703,0.0000495261,0.000018881643,0.000007962849,0.00007606951,0.000031512787,0.9654794,0.003865736,0.029935997,0.00044266917,0.000021248241],"about_ca_topic_score_codex":0.0014440598,"about_ca_topic_score_gemma":0.0012280956,"teacher_disagreement_score":0.0014440598,"about_ca_system_score_codex":0.0012801101,"about_ca_system_score_gemma":0.001002509,"threshold_uncertainty_score":0.009287894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14985183,0.0021710817,0.83647686,0.0003821149,0.000075812626,0.00009648386,0.000070870585,0.000096883836,0.010778037],"genre_scores_gemma":[0.9567318,0.0009641346,0.041181315,0.000057828056,0.00002927971,0.000051758587,0.000019917106,0.000013698999,0.00095030945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994771,0.00026526762,0.000018115998,0.000060663904,0.00009302157,0.00008582815],"domain_scores_gemma":[0.99878186,0.00085209,0.00012555732,0.000100955214,0.00011069146,0.000028790984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010251572,0.000731196,0.000571851,0.00031922184,0.00028111486,0.00088725734,0.0007302803,0.0007128844,0.000930316],"category_scores_gemma":[0.0023430744,0.00016363,0.00041184886,0.00064839673,0.0010043996,0.0011958139,0.00060270703,0.00043355935,0.00014199656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000916586,0.000028871931,0.00040623464,0.000087946784,0.00002726398,0.00010994124,0.00003428133,0.9358104,0.005778711,0.04601609,0.00018421581,0.011424316],"study_design_scores_gemma":[0.000016189248,0.00010550355,0.00012499485,0.000009539803,0.000028005821,0.000077916906,0.000026361828,0.9911209,0.0022301131,0.0057650767,0.00048233694,0.000013004616],"about_ca_topic_score_codex":0.002335187,"about_ca_topic_score_gemma":0.0024875377,"teacher_disagreement_score":0.002335187,"about_ca_system_score_codex":0.0008610746,"about_ca_system_score_gemma":0.0006399329,"threshold_uncertainty_score":0.00624758},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040408745,0.0021339513,0.9180748,0.0018457052,0.00038685018,0.00012992878,0.00070760294,0.0010431089,0.035269376],"genre_scores_gemma":[0.6563102,0.004685204,0.3100886,0.0018893278,0.0010245421,0.00054343825,0.0026882612,0.0015511631,0.021219213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99673176,0.00083469076,0.00011005501,0.00051698956,0.0012995461,0.0005070251],"domain_scores_gemma":[0.9797791,0.014734155,0.0008014118,0.0021742187,0.0017120736,0.0007991897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00406745,0.0025978656,0.0025781929,0.004143917,0.0022080338,0.003964889,0.0051969085,0.0025601245,0.01655997],"category_scores_gemma":[0.029179197,0.0010275411,0.0024055268,0.0036713977,0.0036216767,0.010789524,0.006853878,0.006151589,0.0035593605],"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.00044691362,0.00021209505,0.001897698,0.0004792452,0.0001423545,0.00026928534,0.00028249164,0.21926822,0.0026587246,0.69320256,0.018112855,0.06302751],"study_design_scores_gemma":[0.00003185855,0.00007601458,0.0002332219,0.00006767798,0.000042326323,0.00012177949,0.000068952366,0.53893787,0.0010875775,0.4556224,0.0036753258,0.000035070218],"about_ca_topic_score_codex":0.0032829987,"about_ca_topic_score_gemma":0.0039892267,"teacher_disagreement_score":0.01655997,"about_ca_system_score_codex":0.0029781035,"about_ca_system_score_gemma":0.0025568777,"threshold_uncertainty_score":0.055398583},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0559642,0.0022856453,0.9263895,0.00048676445,0.000042852498,0.000057875513,0.00008841692,0.00017072822,0.014513918],"genre_scores_gemma":[0.9196488,0.0018032104,0.07429601,0.00011064047,0.00007881114,0.000078036916,0.00006867059,0.0000378158,0.0038779483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999305,0.00028704805,0.000025263926,0.000091554735,0.00020695159,0.00008418176],"domain_scores_gemma":[0.9990602,0.00053416577,0.0001161282,0.00010439828,0.00015933144,0.000025804875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009152688,0.0012438187,0.0007178652,0.0003507287,0.00032351236,0.0013871731,0.00074975076,0.0007994868,0.0020816687],"category_scores_gemma":[0.0021358228,0.00040608307,0.0003513649,0.0007933253,0.00071599183,0.0013678774,0.0008635811,0.0006755624,0.0005374144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011322871,0.00006307646,0.0005095965,0.00020212708,0.00005212533,0.0002410821,0.00009277407,0.8699102,0.01799943,0.073759265,0.0011342699,0.035922863],"study_design_scores_gemma":[0.0000045774636,0.000055774817,0.00011017158,0.000008480213,0.0000105105255,0.00008065492,0.000016864176,0.99086905,0.0020814524,0.0062470585,0.0005067001,0.000008768416],"about_ca_topic_score_codex":0.0008615322,"about_ca_topic_score_gemma":0.0012313249,"teacher_disagreement_score":0.0020816687,"about_ca_system_score_codex":0.00091563904,"about_ca_system_score_gemma":0.0005110579,"threshold_uncertainty_score":0.006963849},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025547769,0.00070623704,0.9646671,0.00022607937,0.000112738824,0.000107290085,0.0002102594,0.00022782407,0.008194817],"genre_scores_gemma":[0.81071204,0.0008094692,0.18139812,0.000238204,0.000106675674,0.00034397256,0.0002853351,0.000056635792,0.006049413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989219,0.0003229923,0.00004461493,0.00015398912,0.00032349786,0.00023292148],"domain_scores_gemma":[0.99697196,0.0012482862,0.0002494666,0.00061039085,0.0008197832,0.00010000532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010126247,0.0006829235,0.00077648944,0.0007851054,0.00065353024,0.0008924455,0.0011838796,0.0009622849,0.002414353],"category_scores_gemma":[0.0043220236,0.00026226832,0.00041588864,0.0012937203,0.0013941288,0.0015076445,0.0013353226,0.00094805117,0.00046904018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041955,0.000036279693,0.00061137613,0.00017856264,0.00005257874,0.0004669095,0.00023713688,0.63356787,0.010688072,0.27460524,0.004876429,0.07426003],"study_design_scores_gemma":[0.00002170491,0.00005436315,0.00013407462,0.000026880649,0.000012547686,0.00017887932,0.000033881435,0.9325758,0.0029347972,0.06015199,0.0038509273,0.000024138415],"about_ca_topic_score_codex":0.0043913587,"about_ca_topic_score_gemma":0.003908315,"teacher_disagreement_score":0.0043913587,"about_ca_system_score_codex":0.001329643,"about_ca_system_score_gemma":0.0014405072,"threshold_uncertainty_score":0.00964731},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08409607,0.0073232125,0.83324665,0.0028559277,0.00025811233,0.00018787547,0.00083095784,0.0003605928,0.07084059],"genre_scores_gemma":[0.8523108,0.010353333,0.12294835,0.00068493374,0.0004938627,0.00034554533,0.0007055668,0.00029646902,0.011861057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969206,0.0015479352,0.00011591088,0.00033953332,0.000706941,0.00036910424],"domain_scores_gemma":[0.9831907,0.014340006,0.00061917776,0.0008337611,0.00082552864,0.00019079504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046285866,0.0024617175,0.0017766764,0.0014382025,0.00095779664,0.0016365842,0.0015856783,0.0018150192,0.003934482],"category_scores_gemma":[0.020706126,0.000813921,0.0008593308,0.001768292,0.0036089676,0.0035407585,0.0023768921,0.0032245205,0.001103271],"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.0004537546,0.00006469318,0.0005782825,0.00036203497,0.00007233659,0.00021439309,0.00041764454,0.24031393,0.004487112,0.7194212,0.0047342055,0.028880432],"study_design_scores_gemma":[0.00007141314,0.000193443,0.00044561803,0.0001686926,0.00004945578,0.00022218232,0.00007929752,0.5269323,0.0034080157,0.4648851,0.003492287,0.00005224523],"about_ca_topic_score_codex":0.0029313036,"about_ca_topic_score_gemma":0.0023566934,"teacher_disagreement_score":0.0046285866,"about_ca_system_score_codex":0.0028639215,"about_ca_system_score_gemma":0.0023257558,"threshold_uncertainty_score":0.024478555},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005572703,0.0025855526,0.9844131,0.00045674073,0.0001417687,0.00008990294,0.00018242565,0.0004217845,0.0061359718],"genre_scores_gemma":[0.5849542,0.013799184,0.37366268,0.0015196071,0.0012677012,0.000862665,0.0015272178,0.0006719627,0.02173471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99587065,0.0012125251,0.00015745865,0.00054673926,0.0017441688,0.00046840165],"domain_scores_gemma":[0.9885462,0.0077797747,0.00063154934,0.00052939553,0.0023839255,0.00012915308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007164742,0.0039454424,0.002329893,0.0022439226,0.0008788576,0.003160841,0.0020352101,0.002034423,0.0059350347],"category_scores_gemma":[0.021807069,0.0011686996,0.001991409,0.0019008801,0.0025845487,0.0032908127,0.0025136874,0.003614237,0.003283395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017486175,0.00012198718,0.0008888804,0.0006578032,0.0001665541,0.0004594531,0.0003101026,0.8547951,0.0075124702,0.08905898,0.005416745,0.040437058],"study_design_scores_gemma":[0.0000138649,0.00006814248,0.00021186429,0.00009320282,0.00003679638,0.00017795732,0.000039836683,0.9828319,0.0018307772,0.013120723,0.0015429492,0.00003192309],"about_ca_topic_score_codex":0.0046092,"about_ca_topic_score_gemma":0.0041927844,"teacher_disagreement_score":0.007164742,"about_ca_system_score_codex":0.002728625,"about_ca_system_score_gemma":0.0036604654,"threshold_uncertainty_score":0.03789127},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017928796,0.0016316345,0.9617217,0.0007727185,0.000082756116,0.00012316335,0.00036415993,0.00030749358,0.01706768],"genre_scores_gemma":[0.78378326,0.003581979,0.20359352,0.000451509,0.00024845777,0.0007785589,0.00042104212,0.00020446857,0.006937338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966164,0.0015725478,0.00011586889,0.00042245796,0.00076306425,0.00050970115],"domain_scores_gemma":[0.9893785,0.008014442,0.0007870275,0.000662096,0.0009418309,0.00021614708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044706776,0.0021333892,0.001636913,0.0013615446,0.0010480094,0.0032751814,0.0016495443,0.0013499138,0.0037673605],"category_scores_gemma":[0.013114758,0.0006019217,0.0011973303,0.001537202,0.0028525884,0.003453537,0.0021440785,0.0029705807,0.001168532],"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.00018445078,0.000058823833,0.00020509599,0.00027175128,0.00005134127,0.000218264,0.00029170525,0.16381903,0.0073950402,0.8059589,0.003139152,0.018406495],"study_design_scores_gemma":[0.000049905637,0.00016269274,0.00015638802,0.00012827045,0.0000441161,0.0003715347,0.00008997015,0.5466301,0.0061505614,0.4412869,0.004843458,0.00008604315],"about_ca_topic_score_codex":0.0009109436,"about_ca_topic_score_gemma":0.0005509749,"teacher_disagreement_score":0.0044706776,"about_ca_system_score_codex":0.002445417,"about_ca_system_score_gemma":0.0017524635,"threshold_uncertainty_score":0.023643494},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106271006,0.00072640344,0.8817849,0.0005410003,0.00009534148,0.000033357373,0.00006662882,0.00033770432,0.010143597],"genre_scores_gemma":[0.97065365,0.00060156605,0.026218157,0.00017210552,0.00005886227,0.000047110567,0.000049906,0.00003325617,0.0021653448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989868,0.00031094058,0.000040240175,0.0001977486,0.0002827129,0.00018154309],"domain_scores_gemma":[0.99603635,0.002515303,0.0003766835,0.00076750526,0.0002153914,0.000088834975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008234913,0.00047174175,0.00059443095,0.00028695582,0.00043480084,0.0010209015,0.0005556438,0.000650735,0.0009845514],"category_scores_gemma":[0.005142484,0.00019901663,0.00038055636,0.0005119626,0.0020681757,0.001674515,0.0012088185,0.0013275854,0.00023198064],"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.0005626603,0.0000949128,0.0017990557,0.0004571343,0.000073437346,0.0012947328,0.0006272812,0.2696536,0.046147615,0.60281837,0.0024888,0.073982425],"study_design_scores_gemma":[0.000041313317,0.00012961676,0.00095227105,0.000039307095,0.000055874578,0.0011355152,0.00011603138,0.8241059,0.021329977,0.14727564,0.0047526495,0.00006582643],"about_ca_topic_score_codex":0.00072772644,"about_ca_topic_score_gemma":0.0003777436,"teacher_disagreement_score":0.0010209015,"about_ca_system_score_codex":0.00060627476,"about_ca_system_score_gemma":0.0005812412,"threshold_uncertainty_score":0.004398823},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026806425,0.00053669343,0.96304464,0.00041369634,0.000061102146,0.000084532876,0.000032715787,0.00007153723,0.008948693],"genre_scores_gemma":[0.91988826,0.000992943,0.07361298,0.00013291917,0.000113232025,0.0002228556,0.000032405806,0.000039702685,0.004964663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596196,0.002553268,0.00012451244,0.0003350659,0.0006197141,0.00040538103],"domain_scores_gemma":[0.99756265,0.0018103187,0.00021593283,0.00011427668,0.00016841084,0.00012845678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045714444,0.0015721605,0.0020210508,0.0010460687,0.0010973107,0.0035502005,0.0025147973,0.0026424557,0.0021827444],"category_scores_gemma":[0.0073017026,0.000924934,0.0014786477,0.0014939401,0.0026683626,0.004756753,0.00181352,0.001617452,0.00037185434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009110961,0.00005221328,0.0003020886,0.000063932486,0.000060476,0.0003083761,0.00019342707,0.7007864,0.0010314815,0.2865727,0.0006021188,0.009935658],"study_design_scores_gemma":[0.000020999245,0.000033576485,0.00004168865,0.0000075900693,0.000015133717,0.00004987366,0.00003589385,0.91619986,0.00027588528,0.082727514,0.0005765505,0.000015373183],"about_ca_topic_score_codex":0.0029026375,"about_ca_topic_score_gemma":0.0018931834,"teacher_disagreement_score":0.0045714444,"about_ca_system_score_codex":0.0024997948,"about_ca_system_score_gemma":0.0015159335,"threshold_uncertainty_score":0.02417636},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10646054,0.0025055632,0.84626675,0.0006006726,0.00010183566,0.00012673676,0.00025023433,0.0005563436,0.04313134],"genre_scores_gemma":[0.8724645,0.0032674477,0.11666176,0.00023906922,0.00014217924,0.00016741898,0.0001161476,0.00022832648,0.0067131356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799323,0.00097244553,0.0000695762,0.00024361278,0.00045919852,0.0002618536],"domain_scores_gemma":[0.9914057,0.006216883,0.00060739694,0.00089989236,0.0007017294,0.00016837008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028054363,0.0013942071,0.0011123593,0.00093121437,0.00066582795,0.001871042,0.0010830424,0.00086003327,0.004217324],"category_scores_gemma":[0.013388063,0.0005061928,0.00061500893,0.00092893204,0.0022673297,0.0023208868,0.001917948,0.001727559,0.0016316848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004226329,0.00011081074,0.0004747663,0.0003468618,0.000047882197,0.0002899661,0.0006853679,0.24837632,0.043878,0.6484341,0.002256308,0.054676928],"study_design_scores_gemma":[0.0001224808,0.0006040509,0.00061554596,0.00017689927,0.00010262876,0.0008602475,0.000289651,0.5412295,0.06598786,0.37970036,0.010184861,0.00012599475],"about_ca_topic_score_codex":0.0007227259,"about_ca_topic_score_gemma":0.00060568826,"teacher_disagreement_score":0.004217324,"about_ca_system_score_codex":0.001215913,"about_ca_system_score_gemma":0.0007604691,"threshold_uncertainty_score":0.014836788},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8338088,0.0014423734,0.15365426,0.00047479453,0.000044849912,0.000041408282,0.0004311761,0.00026716196,0.009835331],"genre_scores_gemma":[0.9980902,0.00021103708,0.0013217584,0.000021366517,0.0000073442848,0.000009258838,0.000040982595,0.000005268809,0.00029285403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857485,0.0005659577,0.00007267495,0.00013900377,0.0003235635,0.00032387715],"domain_scores_gemma":[0.9912048,0.00678142,0.0008137654,0.00042814913,0.0006011209,0.00017071363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021998095,0.00090675015,0.0009178809,0.00050418114,0.0005668403,0.00083310215,0.00049306115,0.000691081,0.00078846276],"category_scores_gemma":[0.00796493,0.00030353575,0.00041519804,0.0008194115,0.0012295177,0.001209925,0.001088822,0.00048072595,0.00017386844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045131188,0.000045352936,0.004451032,0.000091759546,0.000065577595,0.0006902256,0.000113618364,0.972639,0.005884042,0.007165148,0.0004643073,0.007938618],"study_design_scores_gemma":[0.000031100128,0.00016105932,0.0016315626,0.000014787196,0.00003995728,0.0003458865,0.000109160734,0.9892343,0.0036676407,0.004586886,0.00015064367,0.000027043845],"about_ca_topic_score_codex":0.004141751,"about_ca_topic_score_gemma":0.002805675,"teacher_disagreement_score":0.004141751,"about_ca_system_score_codex":0.001085572,"about_ca_system_score_gemma":0.0012480541,"threshold_uncertainty_score":0.011633873},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33683342,0.0009377384,0.65785515,0.00025325312,0.00002690209,0.000030632043,0.00005684526,0.00008677362,0.003919221],"genre_scores_gemma":[0.99174505,0.00048159974,0.007337674,0.000015156529,0.000010085136,0.000011355991,0.000012381102,0.000007327268,0.0003793556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985274,0.0007872153,0.000055128556,0.00012171438,0.00030375173,0.00020476336],"domain_scores_gemma":[0.9947044,0.0037744814,0.0007187803,0.0002903296,0.00041570942,0.00009622816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017641908,0.00086671155,0.0006559454,0.00041497388,0.00034593075,0.000931592,0.0005147468,0.00050097227,0.00040202335],"category_scores_gemma":[0.008149593,0.00028294977,0.00025749084,0.0007055737,0.0010591666,0.0012238037,0.0008497682,0.00043720668,0.00009551532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061915045,0.000010844599,0.0009891095,0.00003152831,0.000015224302,0.00011638047,0.00005632506,0.97653276,0.0036728662,0.0114374785,0.000066896784,0.007008688],"study_design_scores_gemma":[0.000006217891,0.00012578377,0.0008058975,0.000010222944,0.00002907323,0.00012257109,0.000049462684,0.9889902,0.0034465822,0.006152359,0.0002471467,0.0000144403975],"about_ca_topic_score_codex":0.0011684118,"about_ca_topic_score_gemma":0.0019562114,"teacher_disagreement_score":0.0017641908,"about_ca_system_score_codex":0.00085474463,"about_ca_system_score_gemma":0.0005866393,"threshold_uncertainty_score":0.009330034},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1613682,0.00055506686,0.83267397,0.00047444936,0.00006771772,0.000110727895,0.00020884206,0.0002938241,0.004247276],"genre_scores_gemma":[0.965125,0.00021897003,0.033067074,0.00004501858,0.000031469423,0.000094576644,0.00006701514,0.00005942526,0.001291351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992243,0.0002838281,0.000023667742,0.00008160657,0.00016659002,0.00021985499],"domain_scores_gemma":[0.99222565,0.006425839,0.00046243364,0.00016019685,0.0005695109,0.00015628336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001987497,0.0005333778,0.00086917856,0.0005258261,0.0004189768,0.0007649288,0.0009094372,0.00064120797,0.0014881833],"category_scores_gemma":[0.009221961,0.0003108321,0.00025599348,0.0005545021,0.000957392,0.0010225401,0.0006790005,0.00070926,0.0001542695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120795106,0.000021660344,0.00019586591,0.000050901108,0.0000092283235,0.000041149367,0.00005145227,0.98017395,0.0022009818,0.01307614,0.0004572248,0.0036006002],"study_design_scores_gemma":[0.000009041984,0.00001766186,0.000038918344,0.000002434715,0.0000022670115,0.000005113103,0.000009578332,0.9968791,0.0004108249,0.0025658922,0.000055927783,0.0000033068004],"about_ca_topic_score_codex":0.007994882,"about_ca_topic_score_gemma":0.004489753,"teacher_disagreement_score":0.007994882,"about_ca_system_score_codex":0.0025293182,"about_ca_system_score_gemma":0.0016388561,"threshold_uncertainty_score":0.018351614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11382183,0.00024717528,0.88237524,0.00006082784,0.00004439595,0.000041244148,0.000028524473,0.00022559178,0.003155203],"genre_scores_gemma":[0.9342788,0.00015232485,0.06417401,0.000049132082,0.000016556773,0.000027551956,0.000026547168,0.0000112393855,0.0012637752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946314,0.000157216,0.00003094763,0.00008663698,0.00018686231,0.000075181124],"domain_scores_gemma":[0.9987172,0.0005862647,0.00019657156,0.00029557894,0.00015867226,0.000045688896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083256245,0.000537616,0.00039056662,0.0002875811,0.00029577967,0.0004627134,0.0008924825,0.000415033,0.0006516513],"category_scores_gemma":[0.0017541292,0.00018019165,0.0003009688,0.00027812403,0.0008050615,0.0008675564,0.0007839866,0.0004667853,0.0001538215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006047941,0.00018149552,0.0027282976,0.00031438546,0.00012798907,0.0007031086,0.0006060961,0.5628291,0.15913065,0.10616399,0.0011286042,0.16548152],"study_design_scores_gemma":[0.000018051127,0.00015086087,0.00022143983,0.000008223447,0.000018809767,0.00022896203,0.000030863303,0.9728429,0.018892888,0.006744561,0.0008194571,0.000023003127],"about_ca_topic_score_codex":0.00093701814,"about_ca_topic_score_gemma":0.0014357475,"teacher_disagreement_score":0.00093701814,"about_ca_system_score_codex":0.0003740892,"about_ca_system_score_gemma":0.00056746305,"threshold_uncertainty_score":0.0044030547},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12868083,0.0018548309,0.856231,0.00034740637,0.00009025118,0.00004778116,0.00007532324,0.00016902211,0.012503488],"genre_scores_gemma":[0.9520603,0.0009297476,0.04503464,0.000113424954,0.00006855404,0.00005505069,0.00002567719,0.000015928419,0.0016966796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995214,0.00015365146,0.000016457916,0.000066419096,0.00013751979,0.00010467053],"domain_scores_gemma":[0.99887496,0.000681626,0.000120412515,0.00009766566,0.00016336543,0.000061946295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010211096,0.00078093103,0.00051666587,0.0005028872,0.00056169846,0.00091590954,0.0006731863,0.0004999335,0.00095317926],"category_scores_gemma":[0.0024308157,0.00028587395,0.0002784018,0.0009380906,0.0014720985,0.0011290739,0.0012696299,0.0005185036,0.00023040871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004662958,0.00013851986,0.0009855252,0.000380888,0.00005869216,0.0008445693,0.00091956585,0.4910963,0.07684733,0.35247892,0.0022027139,0.07358065],"study_design_scores_gemma":[0.00002759385,0.0002504854,0.00028154397,0.000030362993,0.000026309175,0.00029045396,0.00014848314,0.9163412,0.011180702,0.06865037,0.0027302117,0.000042279127],"about_ca_topic_score_codex":0.0012563929,"about_ca_topic_score_gemma":0.0018418351,"teacher_disagreement_score":0.0012563929,"about_ca_system_score_codex":0.0009809354,"about_ca_system_score_gemma":0.00083742023,"threshold_uncertainty_score":0.007117152},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05684594,0.0013816,0.9377686,0.00017315889,0.000087032655,0.000054522417,0.000021834532,0.0002644685,0.003402905],"genre_scores_gemma":[0.7904978,0.0013852756,0.2021267,0.00010495728,0.00020064284,0.000113867805,0.00007957803,0.000031544558,0.005459656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993481,0.0002392218,0.000020707534,0.00006182145,0.00027987393,0.00005031539],"domain_scores_gemma":[0.998992,0.00047567376,0.000097505384,0.00012752065,0.00026173447,0.00004543382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054054765,0.00025854397,0.00026332567,0.00052725774,0.00030181214,0.00040088253,0.0006054392,0.00048012947,0.00046460237],"category_scores_gemma":[0.0026255872,0.00018595092,0.00013256086,0.00074664596,0.0005232273,0.0006578339,0.00046743898,0.00045104336,0.00018193085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036703865,0.00012055277,0.0012653677,0.00024496103,0.000055016095,0.00038286194,0.00044328236,0.42679745,0.06271745,0.14282155,0.0028466377,0.36193788],"study_design_scores_gemma":[0.00005024419,0.00028025056,0.00041689567,0.000017308344,0.00002991766,0.0002813925,0.000047737853,0.9573562,0.010239245,0.022316212,0.00894215,0.000022420501],"about_ca_topic_score_codex":0.0018117729,"about_ca_topic_score_gemma":0.0014311451,"teacher_disagreement_score":0.0018117729,"about_ca_system_score_codex":0.0004186231,"about_ca_system_score_gemma":0.00061470474,"threshold_uncertainty_score":0.0036025047},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05517079,0.0017411691,0.91997814,0.00083425053,0.000091307105,0.000058291167,0.0002819595,0.00015700416,0.021687185],"genre_scores_gemma":[0.8526153,0.0034149014,0.13147755,0.0003310033,0.00024909092,0.00017465469,0.00047703768,0.000066461034,0.011194025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991284,0.0003299833,0.00002288776,0.00008938617,0.00028087327,0.00014846772],"domain_scores_gemma":[0.9967384,0.0024124251,0.0002301546,0.00024724525,0.00032150256,0.000050297454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013049596,0.00063791097,0.00070814794,0.0006507037,0.00049404724,0.0012551066,0.00071592734,0.0009232505,0.0018522084],"category_scores_gemma":[0.004141212,0.00026105862,0.00040621264,0.0011211637,0.0016496661,0.0018896294,0.0012992325,0.0014161296,0.00049123936],"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.00019650982,0.000031188916,0.0004641371,0.00017001544,0.00002521991,0.0002857755,0.00022243062,0.3057113,0.0038334958,0.6569444,0.0026161235,0.02949955],"study_design_scores_gemma":[0.000014652205,0.000040146104,0.0001398708,0.000021654989,0.000009861418,0.0001264821,0.000034077377,0.8935246,0.0021966991,0.10175372,0.0021157912,0.00002242958],"about_ca_topic_score_codex":0.004646309,"about_ca_topic_score_gemma":0.0026465948,"teacher_disagreement_score":0.004646309,"about_ca_system_score_codex":0.0015208002,"about_ca_system_score_gemma":0.0014712078,"threshold_uncertainty_score":0.011034191},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011561411,0.0001465953,0.9872421,0.000039091905,0.000023632085,0.000028338523,0.000007918218,0.00034684103,0.00060401857],"genre_scores_gemma":[0.60628307,0.0002669658,0.39118153,0.00006732068,0.00006564741,0.00009119144,0.000054048203,0.000063192856,0.0019270665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995407,0.00006930472,0.000026455802,0.00007142767,0.00025542275,0.000036732978],"domain_scores_gemma":[0.9988211,0.00053461344,0.00015026946,0.00015532647,0.00029355296,0.00004522578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006474019,0.000510445,0.00027046265,0.00035141548,0.0003642923,0.00039138584,0.0010764818,0.000414405,0.00075251155],"category_scores_gemma":[0.003097312,0.00011454759,0.00014237672,0.00030444172,0.0004400625,0.0007207834,0.00059557025,0.0008166377,0.00018335538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003253807,0.00015788164,0.0015028946,0.00016221342,0.00003775197,0.00027915684,0.00028463342,0.40898573,0.12428757,0.04748752,0.0015765468,0.4149127],"study_design_scores_gemma":[0.000008323308,0.000065163535,0.00009966355,0.000006676883,0.0000048507954,0.000069155714,0.000006823966,0.98379105,0.012178111,0.002565711,0.0011968857,0.0000075931725],"about_ca_topic_score_codex":0.0016122212,"about_ca_topic_score_gemma":0.0018112678,"teacher_disagreement_score":0.0016122212,"about_ca_system_score_codex":0.0004917917,"about_ca_system_score_gemma":0.00059587025,"threshold_uncertainty_score":0.003568232},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009201693,0.00012532383,0.98963064,0.000046934623,0.000013001991,0.000011401092,0.000013809432,0.00006335718,0.0008937928],"genre_scores_gemma":[0.8091992,0.00045375095,0.18780445,0.000056007015,0.00008612885,0.00008115361,0.00006949689,0.00004176187,0.0022080317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993825,0.00024151966,0.000025200237,0.00010478022,0.0002003936,0.000045492296],"domain_scores_gemma":[0.9982139,0.0012808372,0.00020552338,0.00012172828,0.00015186027,0.000026238713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095422013,0.0005497875,0.00046438698,0.00020398751,0.00020581049,0.0005262393,0.00040404775,0.0005456866,0.0009859528],"category_scores_gemma":[0.0045181513,0.00028201257,0.00029818492,0.0003555213,0.0005808353,0.00095049135,0.0006407379,0.00054958765,0.0003263838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013556589,0.000031684584,0.00083033164,0.00009332612,0.000039391092,0.000105020874,0.00014296916,0.8876617,0.020134801,0.039630104,0.00036489518,0.05083017],"study_design_scores_gemma":[0.000011332666,0.00007597599,0.00017819411,0.0000065977897,0.000008426253,0.000046531815,0.000014986964,0.99081284,0.0048484583,0.0034600424,0.0005283594,0.000008267137],"about_ca_topic_score_codex":0.0007896985,"about_ca_topic_score_gemma":0.0008796661,"teacher_disagreement_score":0.0009859528,"about_ca_system_score_codex":0.0004803613,"about_ca_system_score_gemma":0.0005589475,"threshold_uncertainty_score":0.005046487},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19911183,0.010039001,0.75816643,0.0013751214,0.00022771435,0.000075369804,0.000229983,0.00013715478,0.030637339],"genre_scores_gemma":[0.9834788,0.0046178754,0.010002259,0.00010981148,0.00012691572,0.000030426674,0.000036484893,0.000027702932,0.001569656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862456,0.00050505484,0.00004765595,0.00017993555,0.00041869978,0.00022414965],"domain_scores_gemma":[0.99198407,0.0061327694,0.00060394313,0.0005065676,0.0006904352,0.00008215181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018708907,0.0010127429,0.00093394227,0.00076763064,0.00060815155,0.0018380466,0.0005958436,0.0009518734,0.0014695618],"category_scores_gemma":[0.008391841,0.00041144624,0.00049384875,0.0007632897,0.0024319135,0.0026302026,0.0016163582,0.0014121083,0.00031633346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021557602,0.000048450034,0.0013247353,0.00045209067,0.00009410422,0.0005936366,0.00038527863,0.6594668,0.01952569,0.29299307,0.0014400232,0.02346061],"study_design_scores_gemma":[0.00001222255,0.00013289708,0.0007639623,0.00011809317,0.00003947881,0.00037198048,0.00012710344,0.9283989,0.004424554,0.06381802,0.0017436537,0.000049074202],"about_ca_topic_score_codex":0.0014966034,"about_ca_topic_score_gemma":0.0009428478,"teacher_disagreement_score":0.0018708907,"about_ca_system_score_codex":0.0013522356,"about_ca_system_score_gemma":0.00092063635,"threshold_uncertainty_score":0.009894311},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0903382,0.0016216283,0.73652136,0.0057584336,0.0007002515,0.00025760249,0.0012375112,0.0012039432,0.16236106],"genre_scores_gemma":[0.6966097,0.0016317012,0.25222602,0.0019749415,0.0005470361,0.0007022369,0.0010312718,0.0006544993,0.044622634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831426,0.00058531377,0.00008260583,0.00043006949,0.0002513855,0.00033642596],"domain_scores_gemma":[0.9965475,0.0014104552,0.00034253867,0.0009335079,0.0005116348,0.00025435595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016226078,0.00090155675,0.0007253088,0.0010302828,0.0021168867,0.003256575,0.002046568,0.002015139,0.0121457735],"category_scores_gemma":[0.007709785,0.0003884808,0.00078153436,0.0014752974,0.002230438,0.007832242,0.002972967,0.0025843214,0.0022111803],"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.000049205508,0.000010591705,0.00013272837,0.000051878476,0.0000072510743,0.0001488767,0.00008771847,0.003330261,0.00048817403,0.98180294,0.005415405,0.008474985],"study_design_scores_gemma":[0.000029524861,0.000034848425,0.0001728489,0.000057516078,0.00002564284,0.00044918398,0.00017110059,0.07608362,0.0012999435,0.8834021,0.038238104,0.00003556725],"about_ca_topic_score_codex":0.0024359028,"about_ca_topic_score_gemma":0.0031821053,"teacher_disagreement_score":0.0121457735,"about_ca_system_score_codex":0.002689938,"about_ca_system_score_gemma":0.00082775374,"threshold_uncertainty_score":0.04063171},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2694847,0.0016337953,0.7190755,0.0003126558,0.000082578365,0.00009331324,0.00007694391,0.00016727536,0.009073197],"genre_scores_gemma":[0.98988897,0.00025218338,0.009012129,0.000033068667,0.000018306473,0.00002768284,0.000013030438,0.000008184797,0.0007464818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914837,0.00035816515,0.000023979828,0.0000756698,0.0002313807,0.000162389],"domain_scores_gemma":[0.99495006,0.003767411,0.00048819542,0.00017508304,0.0005135536,0.000105671934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016442547,0.00058070297,0.0005983821,0.00040994206,0.00053882186,0.0007485364,0.00062036526,0.0005041521,0.00057585543],"category_scores_gemma":[0.0055900677,0.00025354503,0.00016193211,0.00088538893,0.00087665726,0.0007755432,0.0007242599,0.0003502205,0.00009511141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011014209,0.00003065085,0.0008264802,0.00008177318,0.00003281937,0.00031019296,0.00015749826,0.9634934,0.0026387747,0.021223739,0.00044439657,0.010650166],"study_design_scores_gemma":[0.000010543319,0.00003691812,0.00013268607,0.000004628443,0.000007278828,0.00006963822,0.000036363508,0.9951159,0.00056244154,0.003712562,0.00030429114,0.0000067133706],"about_ca_topic_score_codex":0.004128753,"about_ca_topic_score_gemma":0.0043248893,"teacher_disagreement_score":0.004128753,"about_ca_system_score_codex":0.0011251067,"about_ca_system_score_gemma":0.0010311543,"threshold_uncertainty_score":0.008695722},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13813311,0.0010734824,0.8520201,0.0008162727,0.00012821353,0.00012216464,0.000115512026,0.002733265,0.0048579606],"genre_scores_gemma":[0.85231596,0.00070667244,0.1427159,0.00026058237,0.00007293776,0.0001182157,0.00023447305,0.00015918526,0.0034160195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906546,0.00020399851,0.000031239197,0.00010887632,0.00044580322,0.0001446428],"domain_scores_gemma":[0.9965706,0.0019296649,0.00028271525,0.0005728138,0.00051321875,0.00013102294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018932275,0.0005459051,0.0005383285,0.0006929566,0.0007168401,0.00074160553,0.0009378855,0.00078049203,0.0010785738],"category_scores_gemma":[0.008037209,0.00027085515,0.00019158999,0.0006081527,0.0010232219,0.0017037075,0.001347411,0.0013978826,0.00033673042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011710547,0.0003608203,0.0026668473,0.00032270653,0.00007318288,0.0004065896,0.00065719127,0.5976547,0.068743125,0.037435982,0.0104533145,0.28005445],"study_design_scores_gemma":[0.00004093272,0.00013433512,0.00047415722,0.000029276851,0.000013178126,0.00013266956,0.000110198496,0.96600133,0.020929022,0.009976701,0.0021391853,0.000018975288],"about_ca_topic_score_codex":0.0049152495,"about_ca_topic_score_gemma":0.0052397116,"teacher_disagreement_score":0.0049152495,"about_ca_system_score_codex":0.001140286,"about_ca_system_score_gemma":0.0017681657,"threshold_uncertainty_score":0.010012448},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33787638,0.00131347,0.6524912,0.00039682258,0.00010092294,0.000064958906,0.000070609196,0.00022303991,0.0074625486],"genre_scores_gemma":[0.9577353,0.00023886259,0.041145995,0.00002940991,0.000008343399,0.000022452494,0.0000218004,0.000023333767,0.0007745188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993925,0.00029606244,0.00002909002,0.00005797702,0.00012782933,0.00009651623],"domain_scores_gemma":[0.9981085,0.0012857722,0.00022437444,0.00014450439,0.00014194152,0.00009482019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014307561,0.00077073043,0.0005352594,0.000506614,0.00039707852,0.0006897989,0.0006357524,0.00048372295,0.0007916386],"category_scores_gemma":[0.0043324213,0.00024877052,0.0003195367,0.0005124369,0.0007432357,0.0012137792,0.00092683063,0.00041010504,0.000136754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027634474,0.000045016845,0.0007887073,0.00007282002,0.000031327385,0.00007829364,0.00005292043,0.96171045,0.0059215724,0.01518831,0.00031365728,0.015520641],"study_design_scores_gemma":[0.000018799068,0.00016650629,0.00057878793,0.000008649802,0.000015569867,0.00006370115,0.00004715411,0.98848,0.0045806943,0.005593552,0.00042676454,0.000019791647],"about_ca_topic_score_codex":0.0009746036,"about_ca_topic_score_gemma":0.0011078776,"teacher_disagreement_score":0.0014307561,"about_ca_system_score_codex":0.0007436235,"about_ca_system_score_gemma":0.0006031127,"threshold_uncertainty_score":0.007566631},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015960453,0.00096655684,0.9800765,0.00032706463,0.000070876245,0.000042652813,0.000016286385,0.00007327137,0.0024663906],"genre_scores_gemma":[0.93139446,0.0012558518,0.065012075,0.00012251765,0.00017571916,0.000074789255,0.000027202019,0.00003998236,0.0018973415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980724,0.00069775316,0.000074797936,0.00023215612,0.0005884531,0.00033438802],"domain_scores_gemma":[0.9979006,0.0013305782,0.0003014045,0.00009011402,0.0002694264,0.00010786604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023241409,0.0011693873,0.0010672392,0.0007226546,0.00084855367,0.0016360763,0.0011861998,0.0007927264,0.0013852977],"category_scores_gemma":[0.005097305,0.00051088794,0.0006144178,0.0008115747,0.0021926558,0.0019019978,0.0013632067,0.0015876724,0.0001336227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009687337,0.000038235958,0.0003824608,0.00007826461,0.000033745753,0.000094787734,0.00016056556,0.86322516,0.0049999505,0.10425767,0.00075109734,0.025881149],"study_design_scores_gemma":[0.0000048581883,0.000016498592,0.000040904913,0.000005052777,0.00000627378,0.000011476636,0.000009849111,0.99062693,0.0005981438,0.00842487,0.0002491148,0.0000059258577],"about_ca_topic_score_codex":0.008223274,"about_ca_topic_score_gemma":0.0053413254,"teacher_disagreement_score":0.008223274,"about_ca_system_score_codex":0.0038033992,"about_ca_system_score_gemma":0.0028048893,"threshold_uncertainty_score":0.027595758},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013109844,0.00017487677,0.9902132,0.00018842604,0.00007229493,0.00009928702,0.00018251683,0.00014265855,0.007615824],"genre_scores_gemma":[0.1416094,0.0014459263,0.8331905,0.0005063353,0.00035138926,0.00085494784,0.0013951203,0.00037597958,0.020270387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988165,0.00037728954,0.00007511844,0.00027554674,0.00029151398,0.0001640947],"domain_scores_gemma":[0.9986394,0.00047250112,0.000115074174,0.00031519757,0.00035281302,0.000104871295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017869405,0.0014230941,0.00088994135,0.0012529268,0.00093327864,0.0028264995,0.0015782327,0.0010838779,0.0144135505],"category_scores_gemma":[0.003655245,0.0004939632,0.0011841136,0.001465872,0.0014737775,0.0032057741,0.002456919,0.0023259614,0.00277294],"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.00006917594,0.00006738898,0.00021233651,0.00014884063,0.00002270303,0.00011390847,0.00012110021,0.07333683,0.001634326,0.8387816,0.008823328,0.07666844],"study_design_scores_gemma":[0.00002930567,0.00006861511,0.00010009285,0.0000647262,0.000021569671,0.00015727726,0.00005712639,0.36685356,0.0016251841,0.6012171,0.029779995,0.000025598574],"about_ca_topic_score_codex":0.0018614375,"about_ca_topic_score_gemma":0.0013197485,"teacher_disagreement_score":0.0144135505,"about_ca_system_score_codex":0.0016356565,"about_ca_system_score_gemma":0.0022227764,"threshold_uncertainty_score":0.04821819},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08210041,0.0016947458,0.90560275,0.00056699547,0.000064043634,0.00006045849,0.0001518967,0.000105481806,0.009653199],"genre_scores_gemma":[0.9673662,0.0020692765,0.027331356,0.00010768339,0.00013728421,0.00010664993,0.00007353327,0.000024311543,0.0027838033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864334,0.0006257746,0.000038405375,0.00016643268,0.0003104367,0.0002155796],"domain_scores_gemma":[0.9932248,0.0056594233,0.00055158813,0.00015849632,0.00033838136,0.00006717719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014514059,0.0011143044,0.0011666312,0.00063745456,0.00064368406,0.0008593554,0.00089327246,0.0012742716,0.0013873072],"category_scores_gemma":[0.006210476,0.0003916729,0.000502615,0.0014037383,0.002115469,0.0016652009,0.001290405,0.0008639848,0.0002600141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008553478,0.000016866812,0.00031355338,0.000100399826,0.000036643585,0.00035374545,0.00012586344,0.9183199,0.0016657691,0.07321403,0.000434495,0.0053332658],"study_design_scores_gemma":[0.000018213868,0.000046434867,0.0001228061,0.000013148518,0.00001568106,0.00008247801,0.000033776483,0.9691159,0.00091072737,0.029104391,0.00051816064,0.000018226485],"about_ca_topic_score_codex":0.0035662213,"about_ca_topic_score_gemma":0.0021610209,"teacher_disagreement_score":0.0035662213,"about_ca_system_score_codex":0.0013373685,"about_ca_system_score_gemma":0.0009632366,"threshold_uncertainty_score":0.009703279},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043150038,0.0012808902,0.93829364,0.0005222514,0.00011421464,0.000063869666,0.00012024957,0.00032962667,0.016125137],"genre_scores_gemma":[0.8695345,0.0021864937,0.114995286,0.0002691708,0.00029143743,0.00021758072,0.00023051805,0.00043770013,0.0118373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991104,0.0002813795,0.000018235363,0.000084779145,0.00035564508,0.00014959123],"domain_scores_gemma":[0.9951599,0.0039461562,0.00016977207,0.0001880717,0.0004653909,0.00007067549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019248109,0.0010773815,0.00091131986,0.0011816791,0.00035160212,0.0011283198,0.0014992958,0.000972473,0.0029148683],"category_scores_gemma":[0.007982503,0.0005576594,0.0005623437,0.00080524985,0.0010628373,0.0016470067,0.0011317785,0.0016171363,0.00029800364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018467924,0.00009312675,0.00042477582,0.00017016403,0.000029415856,0.00007660376,0.000109567,0.827895,0.01891253,0.108831435,0.0024776922,0.04079504],"study_design_scores_gemma":[0.0000017245709,0.000010726415,0.000091596165,0.000006913636,0.0000040559844,0.000010391323,0.0000067156016,0.99042964,0.0009091661,0.008357403,0.0001673839,0.0000043495274],"about_ca_topic_score_codex":0.0021540103,"about_ca_topic_score_gemma":0.001857439,"teacher_disagreement_score":0.0029148683,"about_ca_system_score_codex":0.0027482375,"about_ca_system_score_gemma":0.0011484721,"threshold_uncertainty_score":0.019939959},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040696915,0.00026310427,0.9935929,0.00013977762,0.00003541534,0.000025553612,0.000028269846,0.00011225826,0.0017330028],"genre_scores_gemma":[0.5049527,0.0011064794,0.48478487,0.0003194264,0.00018279132,0.0005172214,0.00031864597,0.000257902,0.007559907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971145,0.00011420306,0.000011199293,0.000050749557,0.00006710393,0.000045329554],"domain_scores_gemma":[0.9991043,0.0006607899,0.00006395168,0.000023989522,0.00011210157,0.000034813827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085048995,0.0015084767,0.0010432681,0.0004914639,0.0004935495,0.00079774566,0.0010061,0.001316102,0.0022826141],"category_scores_gemma":[0.0020904078,0.00067265215,0.0006962141,0.0006354074,0.0007260017,0.0007714127,0.0011421628,0.0014626532,0.00042559704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031454765,0.00002366062,0.00015956965,0.000054668457,0.000021405778,0.000039500894,0.000033940014,0.9707509,0.0007094792,0.00887152,0.0011391788,0.018164717],"study_design_scores_gemma":[0.0000027666304,0.000006181626,0.00001615793,0.000002099407,0.000001254498,0.0000025233737,0.0000038787725,0.9977174,0.000053547974,0.002003044,0.000189662,0.0000016079957],"about_ca_topic_score_codex":0.007825516,"about_ca_topic_score_gemma":0.0062827854,"teacher_disagreement_score":0.007825516,"about_ca_system_score_codex":0.0008914597,"about_ca_system_score_gemma":0.0011686666,"threshold_uncertainty_score":0.015559971},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29384887,0.0013041018,0.6891775,0.0005038532,0.00006081139,0.000033626475,0.00004834963,0.00015068299,0.014872171],"genre_scores_gemma":[0.9932944,0.00027207995,0.0055305003,0.00003405967,0.00001689574,0.000013525255,0.000006159701,0.0000085274405,0.0008237302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963427,0.00015455461,0.000007746982,0.000031807303,0.00009308146,0.00007858956],"domain_scores_gemma":[0.9991836,0.0005859663,0.00008741152,0.00003785747,0.00008285544,0.000022279193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007671904,0.00065299135,0.0004922173,0.00033495584,0.00027993752,0.00068209355,0.0005770818,0.0005350212,0.00045156406],"category_scores_gemma":[0.0019511405,0.00024257675,0.0004333435,0.00047013868,0.0009793815,0.0006923272,0.00054407166,0.00034203427,0.00009201767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003574833,0.000025206744,0.00034576442,0.00002533085,0.000019941925,0.00011951161,0.000044858763,0.98028517,0.0032472287,0.012657136,0.00014947362,0.003044727],"study_design_scores_gemma":[0.0000030385866,0.000019166528,0.00012237618,0.0000021724288,0.0000059083613,0.000024137618,0.000011447934,0.9956832,0.00039530874,0.0036646673,0.00006536465,0.0000031648472],"about_ca_topic_score_codex":0.0018932349,"about_ca_topic_score_gemma":0.0016149414,"teacher_disagreement_score":0.0018932349,"about_ca_system_score_codex":0.00073405256,"about_ca_system_score_gemma":0.00041707818,"threshold_uncertainty_score":0.0053259134},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55422455,0.00096474827,0.41891605,0.0017724445,0.00017418378,0.00006579683,0.0005326558,0.00068828376,0.0226613],"genre_scores_gemma":[0.983949,0.00034297007,0.01224859,0.00014518859,0.00018324945,0.000059109854,0.00020613214,0.000094022194,0.0027717936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982589,0.00082052563,0.000050553936,0.00022943872,0.0004270776,0.00021348179],"domain_scores_gemma":[0.98005646,0.012450355,0.0021631573,0.0023243728,0.0021320188,0.00087364455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025749712,0.0005355066,0.0006103098,0.0015899205,0.00049388735,0.0013550112,0.0010299565,0.000788225,0.003138932],"category_scores_gemma":[0.030559452,0.0004513283,0.0002936899,0.0006312143,0.0029484567,0.0032552273,0.0012717993,0.0012356408,0.0005425748],"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.00028394622,0.00007127322,0.0029244535,0.00016386347,0.00003763472,0.00022061683,0.00021655718,0.13373365,0.013823266,0.8309419,0.0034637917,0.014119047],"study_design_scores_gemma":[0.000031153068,0.000094973126,0.0014451107,0.000057216806,0.000011984548,0.00024759996,0.000075870325,0.6095103,0.0060247676,0.381074,0.0013651702,0.0000618932],"about_ca_topic_score_codex":0.00086174556,"about_ca_topic_score_gemma":0.0006033053,"teacher_disagreement_score":0.003138932,"about_ca_system_score_codex":0.0011463412,"about_ca_system_score_gemma":0.000894579,"threshold_uncertainty_score":0.013617873},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015578762,0.00022327891,0.98093843,0.00008981915,0.000035130004,0.00004019076,0.000030157891,0.00015513586,0.0029090084],"genre_scores_gemma":[0.7586759,0.0006127962,0.23721184,0.00010189692,0.000066427936,0.00014913254,0.00009516052,0.00003385722,0.0030529848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994929,0.00014740822,0.000020572068,0.00006309338,0.00020800506,0.000067969864],"domain_scores_gemma":[0.99930465,0.00032007642,0.00009344516,0.00012396107,0.000121139994,0.000036766458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007631228,0.00067478954,0.0006270258,0.00039276562,0.0004360084,0.00059853157,0.00086644647,0.0006048621,0.0013977761],"category_scores_gemma":[0.0015397941,0.00025925215,0.00042933223,0.0009327706,0.0010669393,0.0008955491,0.0010745836,0.0009826884,0.00035825555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003842726,0.00014164054,0.0009221834,0.00020338364,0.00005816562,0.00048563033,0.00034098525,0.4088352,0.06731639,0.38260552,0.002051097,0.13665561],"study_design_scores_gemma":[0.0000152099665,0.00005365967,0.00009385987,0.000008449249,0.000008767214,0.00009966987,0.000008481639,0.98083204,0.008635997,0.00904773,0.0011806756,0.000015465323],"about_ca_topic_score_codex":0.0012667786,"about_ca_topic_score_gemma":0.0012031323,"teacher_disagreement_score":0.0013977761,"about_ca_system_score_codex":0.00060808606,"about_ca_system_score_gemma":0.0009454691,"threshold_uncertainty_score":0.004676044},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16905582,0.0010363335,0.82431614,0.0005023572,0.000085499596,0.00011297696,0.00021654672,0.00059602084,0.004078291],"genre_scores_gemma":[0.7666638,0.0008619564,0.22890793,0.00019233121,0.000089854664,0.0001465209,0.00029050052,0.00011229017,0.0027348385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993042,0.0001794936,0.000041716736,0.000092898044,0.00023523129,0.00014647633],"domain_scores_gemma":[0.9970095,0.0016788543,0.00034256367,0.00044108284,0.00040586936,0.00012213633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011487921,0.0006325877,0.0006420907,0.00052041456,0.0005032706,0.00056762184,0.0008681166,0.0006445325,0.00090623146],"category_scores_gemma":[0.0046419255,0.000355989,0.00045320494,0.00057077984,0.0009617585,0.0016616241,0.0010251636,0.00092240516,0.00023452034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060758664,0.00014402348,0.0015883663,0.00029493135,0.000080344435,0.00021597362,0.00025050653,0.6738257,0.035109725,0.20093934,0.002686386,0.08425715],"study_design_scores_gemma":[0.000051036575,0.00015916284,0.00020928147,0.00003536505,0.000019111047,0.00012331555,0.000032054522,0.9372403,0.0142234,0.045655217,0.0022214206,0.000030471636],"about_ca_topic_score_codex":0.0019502502,"about_ca_topic_score_gemma":0.0022168315,"teacher_disagreement_score":0.0019502502,"about_ca_system_score_codex":0.0011572234,"about_ca_system_score_gemma":0.0018179873,"threshold_uncertainty_score":0.008396268},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019976886,0.0004600629,0.9747121,0.00019728893,0.00007046055,0.000039552648,0.000012697318,0.00016841831,0.0043626265],"genre_scores_gemma":[0.77513343,0.00094170927,0.21921347,0.00032628136,0.00013088142,0.00016073899,0.00004568304,0.000079809295,0.0039679385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996755,0.00009994322,0.000011090451,0.000035691057,0.00015762326,0.00002010237],"domain_scores_gemma":[0.999374,0.0002975577,0.000077713004,0.00013723486,0.00008820603,0.000025426605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048520137,0.00028657005,0.00028125348,0.0003045921,0.00031445984,0.00039849448,0.0007178506,0.00043878952,0.0016095678],"category_scores_gemma":[0.0012913247,0.00016149343,0.00025374963,0.00034482343,0.00067675975,0.0007840758,0.0006063819,0.00063966954,0.00040935865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012076725,0.00010152576,0.00048659914,0.00031510883,0.00005792497,0.0002807355,0.0002624994,0.116994776,0.11011708,0.6748006,0.0020349768,0.09442739],"study_design_scores_gemma":[0.000026521682,0.00019385043,0.00022606102,0.000026404858,0.000027603603,0.0003617647,0.000032732918,0.88755953,0.020345004,0.08317393,0.007993044,0.000033534412],"about_ca_topic_score_codex":0.00018443797,"about_ca_topic_score_gemma":0.0003164713,"teacher_disagreement_score":0.0016095678,"about_ca_system_score_codex":0.00031584344,"about_ca_system_score_gemma":0.00032264835,"threshold_uncertainty_score":0.005384505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08872321,0.002180424,0.8961788,0.00035793716,0.00006575443,0.000098265584,0.0000836432,0.00035838463,0.011953574],"genre_scores_gemma":[0.9730407,0.0013287115,0.024045326,0.00006234614,0.000051392144,0.00006658323,0.00005842317,0.000035411726,0.0013110521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785644,0.00066817977,0.00009698867,0.00027982928,0.00084518775,0.00025342964],"domain_scores_gemma":[0.99573886,0.0023029621,0.00059975917,0.0005889901,0.00072076265,0.000048692535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018650725,0.0014069236,0.0009527212,0.0006613198,0.0005984192,0.0012154661,0.000980927,0.001022341,0.001541537],"category_scores_gemma":[0.008661209,0.00041645858,0.00062916166,0.00087660877,0.0013970268,0.0023983584,0.0017514352,0.0010989833,0.00046065287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020922623,0.00005567436,0.0022840085,0.0002747477,0.00007676419,0.00075407943,0.0003650018,0.85183775,0.028274663,0.059422713,0.00078909245,0.055656195],"study_design_scores_gemma":[0.00000969421,0.00021566545,0.00069923303,0.000031216332,0.00006206084,0.0008431397,0.00012371215,0.97116876,0.014209128,0.011073696,0.0015125797,0.00005106758],"about_ca_topic_score_codex":0.0011984725,"about_ca_topic_score_gemma":0.00085946673,"teacher_disagreement_score":0.0018650725,"about_ca_system_score_codex":0.0012398869,"about_ca_system_score_gemma":0.0006325862,"threshold_uncertainty_score":0.009863555},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05742943,0.00049270806,0.94016224,0.000083954066,0.000033169552,0.000030699328,0.000022233651,0.00021624994,0.0015293227],"genre_scores_gemma":[0.7760357,0.0006572895,0.2205356,0.00007913113,0.00006248777,0.000041112635,0.00004913631,0.00003235741,0.0025071122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977964,0.0000518563,0.0000133065,0.000045601308,0.00008667979,0.00002295647],"domain_scores_gemma":[0.9996861,0.00010958397,0.00006931626,0.00005467263,0.00006784027,0.000012463385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032895882,0.00034808286,0.00032499712,0.00014781083,0.0001378343,0.00045709714,0.00039444343,0.00044287424,0.0004391389],"category_scores_gemma":[0.00068412605,0.0001534222,0.0001970619,0.00017156417,0.0003276474,0.00039393408,0.00026786717,0.00049158855,0.00018934262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025580707,0.00013316965,0.0020182861,0.00027588528,0.000106603205,0.0004951313,0.00025564223,0.49339983,0.26639053,0.04842666,0.0013330226,0.1869094],"study_design_scores_gemma":[0.000012047758,0.00018076233,0.0002755831,0.000010320081,0.00001673066,0.00012396651,0.000013960019,0.9667478,0.027813451,0.00218971,0.0026008857,0.000014732392],"about_ca_topic_score_codex":0.00055193284,"about_ca_topic_score_gemma":0.00089137594,"teacher_disagreement_score":0.00055193284,"about_ca_system_score_codex":0.00030307684,"about_ca_system_score_gemma":0.00041865217,"threshold_uncertainty_score":0.0021989942},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044651303,0.0011660882,0.94595546,0.00030208996,0.00022234244,0.00013234098,0.00012286576,0.0003414289,0.0071060476],"genre_scores_gemma":[0.8828783,0.00067788776,0.113256335,0.0001620396,0.000065061984,0.00009545097,0.00007988837,0.000015059474,0.0027699908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995086,0.00015230947,0.000026936472,0.00007565825,0.00015731974,0.000079148725],"domain_scores_gemma":[0.9993228,0.00020929557,0.00007303827,0.00014569456,0.00021808236,0.00003112928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077470444,0.0006383385,0.00045794237,0.0003657371,0.0004655169,0.00050587225,0.0011271273,0.0006230447,0.0015504343],"category_scores_gemma":[0.0015488134,0.00016391579,0.00043043378,0.0005905007,0.00060999376,0.0009546216,0.000764708,0.00058232836,0.0004071925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005710579,0.0001789925,0.0010967088,0.00038525957,0.000156768,0.0015957977,0.00072049146,0.47059885,0.12780023,0.18807349,0.0076366668,0.20118563],"study_design_scores_gemma":[0.000045460216,0.00046474743,0.0002913459,0.000025791356,0.00006267332,0.0009336789,0.00006311309,0.96728814,0.010286981,0.013262389,0.007214292,0.000061398074],"about_ca_topic_score_codex":0.0018628822,"about_ca_topic_score_gemma":0.00252622,"teacher_disagreement_score":0.0018628822,"about_ca_system_score_codex":0.0005852392,"about_ca_system_score_gemma":0.0005860971,"threshold_uncertainty_score":0.0051867366},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01753956,0.0006483919,0.9546469,0.0009433839,0.00018241318,0.000089692214,0.00021556341,0.0002635346,0.025470657],"genre_scores_gemma":[0.8707845,0.0008049258,0.113424696,0.00045122503,0.000121247685,0.0002651656,0.00025014635,0.00003573586,0.013862325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99961567,0.00010981497,0.000013497112,0.000055046872,0.00014440551,0.000061515486],"domain_scores_gemma":[0.9994043,0.0002132007,0.000067017005,0.0001187902,0.0001756096,0.000020997693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036955933,0.00034595185,0.00022457178,0.00041181763,0.00048985105,0.0005015547,0.0006342953,0.0004395221,0.0029732483],"category_scores_gemma":[0.0010979119,0.000096866424,0.00020050323,0.00085226935,0.00060096267,0.00044918398,0.000797724,0.0005768261,0.0004792239],"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.00016310587,0.00006757047,0.0006124245,0.0002217343,0.00003789225,0.00046080447,0.00017071389,0.34469876,0.027906721,0.35419312,0.028192056,0.24327506],"study_design_scores_gemma":[0.000012392593,0.00004036293,0.00019035603,0.000018848032,0.000009335402,0.00011127836,0.000024549016,0.9609763,0.004007031,0.023569364,0.011025918,0.000014287286],"about_ca_topic_score_codex":0.005940337,"about_ca_topic_score_gemma":0.007857094,"teacher_disagreement_score":0.005940337,"about_ca_system_score_codex":0.0008057987,"about_ca_system_score_gemma":0.0011900761,"threshold_uncertainty_score":0.011811554},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28886253,0.0007379911,0.689461,0.000650856,0.00011221781,0.00016225115,0.0006844919,0.0016081466,0.01772052],"genre_scores_gemma":[0.79265684,0.0005085784,0.1956811,0.00017828432,0.000097907476,0.00017048503,0.0007462817,0.00011204324,0.009848552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995741,0.00008929805,0.000028161761,0.00006766759,0.00015423419,0.00008659093],"domain_scores_gemma":[0.99795747,0.00091661676,0.0002270973,0.0004333354,0.0003204987,0.000144962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042028728,0.0004033802,0.00034276463,0.00045912905,0.0003103382,0.0005606143,0.00068145746,0.0004304301,0.002299224],"category_scores_gemma":[0.002656145,0.0001721226,0.00020592887,0.0006030765,0.0007273985,0.0012410525,0.0011075052,0.0008170245,0.00068932475],"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.001131382,0.00028427425,0.0012443,0.0003081523,0.000030255167,0.00034578826,0.00038893797,0.29252994,0.09278812,0.38740492,0.008689304,0.21485472],"study_design_scores_gemma":[0.00006874705,0.00029691603,0.0003089391,0.000039428858,0.000010674608,0.0002072555,0.00006134716,0.8605431,0.036556546,0.09635132,0.0055145565,0.000041295047],"about_ca_topic_score_codex":0.0012238217,"about_ca_topic_score_gemma":0.0014691526,"teacher_disagreement_score":0.002299224,"about_ca_system_score_codex":0.0007229311,"about_ca_system_score_gemma":0.0008982218,"threshold_uncertainty_score":0.0076916814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07507439,0.0027267276,0.8965824,0.0012320156,0.0001666518,0.00032890736,0.00051859353,0.00083746895,0.02253282],"genre_scores_gemma":[0.7076847,0.0011847531,0.2801938,0.00044558677,0.00012109058,0.00042684723,0.00034848938,0.00022617717,0.009368545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946314,0.0002752241,0.000015412159,0.000065461914,0.000073736126,0.00010701749],"domain_scores_gemma":[0.9984938,0.0012056939,0.0000794838,0.000051909665,0.00012536296,0.000043751235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012243441,0.001246543,0.0013295384,0.0018515668,0.000782057,0.001645832,0.001414544,0.001638335,0.010010678],"category_scores_gemma":[0.0037742604,0.0007712837,0.0007201706,0.0022785466,0.0010607949,0.0012669511,0.0009881172,0.001006704,0.000802105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008518297,0.00004961808,0.00025147654,0.000078783996,0.00003603542,0.00003637389,0.0000475673,0.9566983,0.0003905592,0.0075644865,0.0024680828,0.03229356],"study_design_scores_gemma":[0.000026874643,0.000024836878,0.00005211574,0.000011722638,0.0000106743355,0.000012218105,0.000031758125,0.9936279,0.00012866079,0.005722782,0.0003467278,0.0000037093143],"about_ca_topic_score_codex":0.008937494,"about_ca_topic_score_gemma":0.007774053,"teacher_disagreement_score":0.010010678,"about_ca_system_score_codex":0.0015449447,"about_ca_system_score_gemma":0.00182899,"threshold_uncertainty_score":0.033489108},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18155898,0.0020916534,0.8086882,0.00040764015,0.00008322717,0.00007176622,0.00018778566,0.0007248504,0.006185859],"genre_scores_gemma":[0.93956584,0.0010509728,0.057104494,0.000060866434,0.000048579466,0.000070025046,0.000086702494,0.00002904685,0.0019835017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948174,0.00015834928,0.000033977118,0.000086068714,0.00016219844,0.000077814984],"domain_scores_gemma":[0.9976534,0.0013463362,0.0002980585,0.0003432717,0.00027847465,0.000080434926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076454185,0.0005804202,0.00054820563,0.00066778174,0.00035908562,0.0005215143,0.0006338182,0.0005980264,0.000818633],"category_scores_gemma":[0.00291505,0.00017862812,0.00025877604,0.0007343664,0.000666899,0.00084915257,0.00080863974,0.0006229984,0.00020594437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006304972,0.000067136396,0.0009451164,0.00038106155,0.00007440625,0.0015489076,0.00061984145,0.6204959,0.09449778,0.2002648,0.0021513079,0.07832331],"study_design_scores_gemma":[0.000024283838,0.00012632151,0.0002648167,0.000028148263,0.00002239322,0.00040904718,0.00004539138,0.9492968,0.01657617,0.030611612,0.0025655108,0.000029597442],"about_ca_topic_score_codex":0.0012014661,"about_ca_topic_score_gemma":0.0010213202,"teacher_disagreement_score":0.0012014661,"about_ca_system_score_codex":0.0007799771,"about_ca_system_score_gemma":0.0005072506,"threshold_uncertainty_score":0.0056591034},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007509472,0.0001265328,0.9901035,0.00012632903,0.00005629013,0.00005436661,0.000054859367,0.00020421816,0.0017645241],"genre_scores_gemma":[0.6915548,0.00038781954,0.3015224,0.00021217487,0.00008779173,0.0003784273,0.0002119413,0.000044404595,0.005600225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863154,0.000377387,0.000059196405,0.00021289125,0.00052542257,0.00019353362],"domain_scores_gemma":[0.9981104,0.00063713046,0.00018560218,0.0005487429,0.0004352944,0.00008288334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011872408,0.0009902961,0.00088065956,0.0007474554,0.00063419103,0.0010664962,0.0018574188,0.0009769608,0.0018536663],"category_scores_gemma":[0.0027732197,0.00038108096,0.00054780865,0.001311235,0.0012954972,0.001470761,0.0024953934,0.0015117143,0.00049333996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036363036,0.00012980438,0.00069646887,0.00023904956,0.00008478433,0.0003543245,0.0002795963,0.49500614,0.03164502,0.34287938,0.00403788,0.12428384],"study_design_scores_gemma":[0.000036099576,0.000066545945,0.000077955374,0.00001331744,0.000017712096,0.00012336775,0.0000143922825,0.9644484,0.0078141615,0.024919009,0.002438613,0.000030430188],"about_ca_topic_score_codex":0.0011314932,"about_ca_topic_score_gemma":0.0014687876,"teacher_disagreement_score":0.0018574188,"about_ca_system_score_codex":0.0007176501,"about_ca_system_score_gemma":0.0012439608,"threshold_uncertainty_score":0.0062787533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031969555,0.000109311186,0.96384966,0.00013454947,0.000028563865,0.00004588559,0.000101988786,0.00021397133,0.0035465264],"genre_scores_gemma":[0.4943042,0.00023396239,0.50259453,0.00010356376,0.000039715975,0.00014474243,0.00024138064,0.00006098625,0.0022769659],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888426,0.00040041798,0.000069551104,0.00012476754,0.0004137374,0.0001072549],"domain_scores_gemma":[0.9977736,0.0010972505,0.00026905167,0.0003391286,0.00039877987,0.00012210153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084479415,0.0005186309,0.00045986447,0.00041900753,0.00041936839,0.00078567606,0.0006331025,0.0005527681,0.0010690825],"category_scores_gemma":[0.0038252887,0.00025443497,0.00041796174,0.0005026382,0.0009891099,0.00078491913,0.0013408612,0.0008839677,0.00047079095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003150484,0.000102240374,0.0014491217,0.00024623956,0.00004240711,0.00029435908,0.0003351163,0.40264714,0.052507892,0.39134577,0.0027742153,0.1479404],"study_design_scores_gemma":[0.000052830754,0.00016751481,0.0001896894,0.000026988377,0.000008762044,0.00025875348,0.000050109385,0.9073311,0.028927222,0.058189347,0.004760966,0.00003671455],"about_ca_topic_score_codex":0.0006127012,"about_ca_topic_score_gemma":0.0006293866,"teacher_disagreement_score":0.0010690825,"about_ca_system_score_codex":0.00062860665,"about_ca_system_score_gemma":0.0012515021,"threshold_uncertainty_score":0.004560888},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12560871,0.004195969,0.73125297,0.0015987917,0.00096168125,0.0005806205,0.0011107974,0.030132482,0.10455787],"genre_scores_gemma":[0.65781283,0.00080282026,0.29670691,0.0009523118,0.00025638618,0.0003990698,0.0020819306,0.00037115323,0.04061657],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996911,0.000043282595,0.000017293838,0.00008081264,0.00010214351,0.000065390734],"domain_scores_gemma":[0.99975616,0.000042343512,0.000024068993,0.000052254913,0.00010419399,0.000020962658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022464586,0.00075059576,0.00038919572,0.0008216642,0.00042033693,0.0009862173,0.0019478811,0.0005195705,0.01754055],"category_scores_gemma":[0.00054688624,0.00028814786,0.00032161127,0.00061002286,0.00018746377,0.0010524783,0.0006658064,0.0005006512,0.006120356],"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.0008739561,0.0004455979,0.004105902,0.0008538209,0.00021568709,0.00074605254,0.00036724214,0.030785708,0.2140381,0.06439519,0.0972603,0.58591247],"study_design_scores_gemma":[0.0003560938,0.0023140782,0.0034459776,0.0001890192,0.0003532108,0.0017042118,0.0001926756,0.4794114,0.20922579,0.018504329,0.28409994,0.00020329938],"about_ca_topic_score_codex":0.0022304908,"about_ca_topic_score_gemma":0.0037337097,"teacher_disagreement_score":0.01754055,"about_ca_system_score_codex":0.0010350627,"about_ca_system_score_gemma":0.0011215258,"threshold_uncertainty_score":0.058678985},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038043768,0.0077593187,0.75850785,0.00097399385,0.0009243512,0.00006317565,0.00014495291,0.00029075437,0.22753127],"genre_scores_gemma":[0.3349322,0.027653793,0.2310487,0.0008809441,0.0015537987,0.00043458724,0.00050388154,0.00036417664,0.40262794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996424,0.000089787834,0.000011619403,0.000046181634,0.00016914221,0.00004087792],"domain_scores_gemma":[0.99939704,0.00036190942,0.000024274252,0.000115918796,0.00008754433,0.000013268606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053712656,0.00074032956,0.00037340118,0.00074413815,0.00039328082,0.0012577394,0.0007381612,0.0009120244,0.006307077],"category_scores_gemma":[0.0017744665,0.0003222745,0.00027589317,0.0016746139,0.0010299771,0.0016475854,0.0009935346,0.0013830477,0.0017183643],"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.00002086041,0.0000236255,0.00006242884,0.000099595025,0.000010131495,0.00006110458,0.000108216234,0.030692903,0.0016261374,0.7800861,0.019264715,0.1679442],"study_design_scores_gemma":[0.000009464483,0.00003576798,0.00017063672,0.00013016092,0.000021964193,0.0003952848,0.000059497237,0.1454405,0.00313148,0.68920076,0.16136932,0.000035197165],"about_ca_topic_score_codex":0.0016091358,"about_ca_topic_score_gemma":0.0018139535,"teacher_disagreement_score":0.006307077,"about_ca_system_score_codex":0.0009281779,"about_ca_system_score_gemma":0.0008770332,"threshold_uncertainty_score":0.02109921},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14876395,0.0009046391,0.83929455,0.00020516125,0.00017446149,0.00007799142,0.00004918491,0.0005496592,0.009980303],"genre_scores_gemma":[0.95255405,0.00016499704,0.044886984,0.000090056375,0.000020844924,0.000027410955,0.00003979562,0.000023153063,0.0021927154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996345,0.000087560795,0.000009848147,0.000071980634,0.00007073167,0.0001252245],"domain_scores_gemma":[0.99958235,0.00018099093,0.00004855572,0.00006162218,0.000087248736,0.000039282302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060227746,0.0007889347,0.00073607767,0.00023850941,0.0005696532,0.0007886555,0.0008955239,0.0006393562,0.0008802178],"category_scores_gemma":[0.00093114737,0.00026212484,0.00045302222,0.00031940208,0.0007457127,0.0008561172,0.0010595128,0.0005582795,0.0002127441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029034537,0.000118365584,0.0013882244,0.00008533972,0.00006868628,0.00044873243,0.00017999795,0.9055202,0.01678808,0.008883301,0.0018537214,0.064375],"study_design_scores_gemma":[0.0000047888575,0.00004885608,0.00017329562,0.0000043309383,0.0000066972575,0.000047803045,0.00003270706,0.99691236,0.0012219899,0.0010806802,0.0004597389,0.000006762265],"about_ca_topic_score_codex":0.0062956,"about_ca_topic_score_gemma":0.008950906,"teacher_disagreement_score":0.0062956,"about_ca_system_score_codex":0.0005297422,"about_ca_system_score_gemma":0.00079643354,"threshold_uncertainty_score":0.0125178695},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08383956,0.0005427226,0.89933217,0.00044893156,0.000086730906,0.000099828954,0.00035309402,0.0002862553,0.015010697],"genre_scores_gemma":[0.91376895,0.0005924119,0.074554436,0.00012275786,0.000078066485,0.00010533173,0.0002255822,0.000047826605,0.010504694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993166,0.00021206512,0.000019798741,0.00009535462,0.00014879905,0.00020749765],"domain_scores_gemma":[0.9981172,0.0010273802,0.00019314527,0.00028636935,0.00022094916,0.0001549743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010037046,0.00052459707,0.00065205793,0.000814912,0.00095169153,0.0015460101,0.00083885825,0.0007367732,0.0029817345],"category_scores_gemma":[0.003163109,0.00033702847,0.00045206695,0.0012126438,0.0015710635,0.002244196,0.0011866682,0.0012587934,0.00041535162],"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.00028489635,0.00006654795,0.00040407034,0.00009897891,0.000015542097,0.00021445323,0.00012679001,0.3646597,0.0033139563,0.611232,0.002191628,0.017391399],"study_design_scores_gemma":[0.000024851372,0.00003750964,0.00012636103,0.000016754451,0.000009376318,0.0000720922,0.000040374394,0.84312963,0.0008405555,0.15374562,0.0019399691,0.00001695185],"about_ca_topic_score_codex":0.0039050425,"about_ca_topic_score_gemma":0.0045895944,"teacher_disagreement_score":0.0039050425,"about_ca_system_score_codex":0.001939209,"about_ca_system_score_gemma":0.0013902878,"threshold_uncertainty_score":0.014069974},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05557609,0.00091906305,0.9408883,0.00019963786,0.000027810955,0.00003222751,0.00002754331,0.0001230014,0.0022062762],"genre_scores_gemma":[0.9379513,0.00079992437,0.05945452,0.00006514978,0.000026493442,0.000089230605,0.000031485244,0.000012133435,0.0015697827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944776,0.0003015435,0.000018011626,0.0000687325,0.00013204376,0.000031974803],"domain_scores_gemma":[0.99938214,0.00036448028,0.0001027755,0.00003862725,0.00009135012,0.000020498917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007646533,0.00037195804,0.00042384173,0.00029240194,0.0002766135,0.00034364744,0.00046013258,0.00053567206,0.0003915741],"category_scores_gemma":[0.0015395874,0.00026552356,0.0001812459,0.00042251233,0.0005441326,0.0008254439,0.00046121946,0.0003399448,0.00013544946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019707657,0.000056795634,0.0010518908,0.00018554887,0.00004618443,0.00031612223,0.0002478104,0.84528226,0.038040977,0.04947649,0.0007128403,0.06438606],"study_design_scores_gemma":[0.000035398978,0.00013665528,0.00041655632,0.000007845076,0.000012847722,0.000096349555,0.000048256006,0.9831561,0.002817928,0.012605697,0.0006471223,0.000019283238],"about_ca_topic_score_codex":0.0010669963,"about_ca_topic_score_gemma":0.0011954728,"teacher_disagreement_score":0.0010669963,"about_ca_system_score_codex":0.00048662585,"about_ca_system_score_gemma":0.00036945575,"threshold_uncertainty_score":0.0040439367},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027752437,0.0010887508,0.96806103,0.00019741134,0.00003859253,0.000015019715,0.000009087176,0.00009162863,0.002746002],"genre_scores_gemma":[0.94789934,0.0006061685,0.050268043,0.000081856204,0.00008213466,0.000052727846,0.0000119090355,0.000015456006,0.0009822805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996911,0.00008995129,0.000010787079,0.000038473434,0.00012684391,0.000042845455],"domain_scores_gemma":[0.9994235,0.00035503122,0.000074126474,0.000059626975,0.00006584689,0.000021859732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005470766,0.00034407832,0.00028608498,0.0002713491,0.00044227263,0.0005472964,0.0005992482,0.0004135104,0.00056242675],"category_scores_gemma":[0.0013626621,0.0001715228,0.0001844341,0.0003380107,0.00069492875,0.00086818857,0.0007708274,0.000725239,0.00010244961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015024116,0.000067412475,0.00069580675,0.0002032462,0.00006018625,0.00023875013,0.00027166607,0.6066473,0.07263721,0.19442828,0.0012211032,0.1233787],"study_design_scores_gemma":[0.000019239362,0.000116078125,0.00015432946,0.000013894461,0.0000108521135,0.00008603108,0.00002441926,0.9514713,0.0044133817,0.041360687,0.0023135385,0.000016210037],"about_ca_topic_score_codex":0.00047522833,"about_ca_topic_score_gemma":0.000714888,"teacher_disagreement_score":0.0005992482,"about_ca_system_score_codex":0.0004731669,"about_ca_system_score_gemma":0.0004182485,"threshold_uncertainty_score":0.0034331083},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056856204,0.00043104868,0.93702507,0.0004415835,0.00004845216,0.00007867773,0.000078023775,0.0002603614,0.004780714],"genre_scores_gemma":[0.77068496,0.00033848517,0.22419323,0.00022402352,0.000047825717,0.00036150822,0.0001951048,0.00008853523,0.0038663999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996339,0.00014365966,0.000017025184,0.0000642294,0.00007716015,0.00006389412],"domain_scores_gemma":[0.99877053,0.0008559576,0.00011901459,0.000043290183,0.00014581082,0.00006523352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011520084,0.00083850574,0.0012414106,0.0008928457,0.0005247859,0.0009835177,0.0014925529,0.0015229558,0.002523968],"category_scores_gemma":[0.0021487877,0.00059798016,0.0010249048,0.0008620425,0.00075177726,0.0009814448,0.0008804116,0.00092190347,0.00025313874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018619588,0.000016561962,0.0002547853,0.000011433003,0.000015940626,0.000016513543,0.0000125895385,0.9909073,0.00014012784,0.0013798478,0.00022170779,0.0070046056],"study_design_scores_gemma":[0.000005223919,0.0000072957455,0.000019858502,0.0000020687744,0.0000023126372,0.0000021784033,0.000003794,0.9994111,0.000044970402,0.00043836512,0.00006163149,0.0000011340013],"about_ca_topic_score_codex":0.012219086,"about_ca_topic_score_gemma":0.008196058,"teacher_disagreement_score":0.012219086,"about_ca_system_score_codex":0.0010082672,"about_ca_system_score_gemma":0.0013538877,"threshold_uncertainty_score":0.024295926},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47071978,0.004013325,0.49547887,0.0010518049,0.00010736557,0.00008528217,0.00026458985,0.0006572459,0.027621709],"genre_scores_gemma":[0.9951106,0.0004314206,0.0034682485,0.00004363073,0.000024000943,0.000025192312,0.00004430793,0.0000145863105,0.0008381084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883705,0.0004104012,0.000048666145,0.00015124447,0.0003465608,0.00020602623],"domain_scores_gemma":[0.9972228,0.0015753785,0.00029149104,0.00014389204,0.0007204689,0.000045894707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012045095,0.0009677284,0.0007675085,0.0007812857,0.00076214026,0.0009065455,0.00063057936,0.0012122351,0.001361046],"category_scores_gemma":[0.0045129578,0.0002539459,0.0005335278,0.00083052454,0.00069456693,0.00086181704,0.000847575,0.0005130879,0.00025196682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017743773,0.000022061378,0.0025032407,0.00014235321,0.00006839822,0.00044549847,0.0002524249,0.9601928,0.008753916,0.012930105,0.0007435341,0.013768194],"study_design_scores_gemma":[0.000005538662,0.000078995785,0.000700393,0.000009172139,0.000019640647,0.0002041277,0.00004711276,0.9961056,0.0012372921,0.0013680831,0.00020932428,0.000014678913],"about_ca_topic_score_codex":0.005914093,"about_ca_topic_score_gemma":0.0024512107,"teacher_disagreement_score":0.005914093,"about_ca_system_score_codex":0.001317427,"about_ca_system_score_gemma":0.00079617207,"threshold_uncertainty_score":0.011759341},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051922746,0.00037989978,0.94520825,0.00013224957,0.000023448321,0.000037822476,0.000007615519,0.000057866146,0.0022300712],"genre_scores_gemma":[0.9007932,0.00021293311,0.09746432,0.000054827626,0.000020319312,0.000082081824,0.00001741218,0.0000121961175,0.0013427552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996877,0.00015149676,0.000010310683,0.000029795996,0.00008820335,0.000032510052],"domain_scores_gemma":[0.9996213,0.0002305288,0.000039293165,0.000039782586,0.0000493268,0.000019740874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010235645,0.000251993,0.0002449317,0.00026187178,0.00036230413,0.0002943944,0.0006978459,0.0003140961,0.0005248009],"category_scores_gemma":[0.0016051816,0.000121511875,0.00019027629,0.00037906246,0.0005754132,0.00046914147,0.00064358534,0.00031729002,0.00010834484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013737241,0.00007122302,0.00062816014,0.00007058342,0.000031375403,0.00013392119,0.00018856453,0.8011274,0.019278396,0.094887584,0.0008598706,0.08258556],"study_design_scores_gemma":[0.000009265619,0.000030628038,0.00007417286,0.0000027599326,0.0000046383598,0.000021201224,0.000011862349,0.9864223,0.001055495,0.011752366,0.00061113265,0.0000041899616],"about_ca_topic_score_codex":0.00090153614,"about_ca_topic_score_gemma":0.0014075267,"teacher_disagreement_score":0.0010235645,"about_ca_system_score_codex":0.0006642067,"about_ca_system_score_gemma":0.00059605547,"threshold_uncertainty_score":0.0054131746},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06291874,0.0017012568,0.9250126,0.00029630755,0.00009213675,0.00007727294,0.000096466625,0.00025767548,0.009547533],"genre_scores_gemma":[0.9446435,0.000979736,0.050720755,0.000065190485,0.000053171825,0.00011025057,0.000062148574,0.000030134937,0.0033351071],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960417,0.00022046779,0.000008809582,0.00004771598,0.00006965674,0.000049139555],"domain_scores_gemma":[0.9994431,0.0002729636,0.00009983341,0.00006626085,0.00009884059,0.00001889297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073731545,0.00062337227,0.0003716555,0.00033024087,0.00034744365,0.0005478739,0.0008266719,0.00045963484,0.0021997823],"category_scores_gemma":[0.0019601113,0.00014398995,0.00027692568,0.0004941864,0.00044006543,0.0006472597,0.00048380595,0.00042269198,0.0003876132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036078863,0.000112669484,0.0016284218,0.0004459904,0.000089811154,0.0006488073,0.00032208438,0.6759549,0.03270241,0.12993538,0.0050009354,0.1527978],"study_design_scores_gemma":[0.000022037426,0.00015472555,0.0003239417,0.00002285726,0.000026172911,0.00020560081,0.000051085004,0.9737169,0.0023655046,0.020396812,0.002691938,0.000022439332],"about_ca_topic_score_codex":0.0017579601,"about_ca_topic_score_gemma":0.0016025282,"teacher_disagreement_score":0.0021997823,"about_ca_system_score_codex":0.0005205026,"about_ca_system_score_gemma":0.00050158816,"threshold_uncertainty_score":0.0073589683},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017911125,0.0005313447,0.9774414,0.00033318155,0.00006805663,0.000029860774,0.00006365695,0.0000938407,0.0035275982],"genre_scores_gemma":[0.8223806,0.001081847,0.17006525,0.00025687274,0.00010741831,0.0001601371,0.00016612605,0.000053059815,0.005728726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956566,0.0001553006,0.000013804826,0.00004959508,0.00016852064,0.00004717049],"domain_scores_gemma":[0.99863094,0.0009406406,0.000113994574,0.00012202676,0.0001644085,0.000027894974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078346895,0.00043719332,0.0004219631,0.00046923384,0.00025689913,0.000675081,0.0006960446,0.0005626434,0.0017413086],"category_scores_gemma":[0.0038833548,0.0001723854,0.00018372816,0.00069608405,0.0009789369,0.0015833767,0.0007944044,0.0009150451,0.00021100877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012447251,0.00001944209,0.00016416886,0.00012790179,0.000012815667,0.000083632905,0.0001340099,0.626095,0.007058368,0.33000565,0.0017044175,0.034470182],"study_design_scores_gemma":[0.000007336161,0.000017798087,0.000030216637,0.000007709972,0.0000023783684,0.000016649537,0.000010526219,0.96364427,0.00087855046,0.03452389,0.0008554953,0.000005259073],"about_ca_topic_score_codex":0.0020585947,"about_ca_topic_score_gemma":0.0015531782,"teacher_disagreement_score":0.0020585947,"about_ca_system_score_codex":0.0010781612,"about_ca_system_score_gemma":0.0006513027,"threshold_uncertainty_score":0.007822633},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057988487,0.0031568238,0.9193079,0.0010792131,0.00013565824,0.00011192632,0.00013955198,0.0005067769,0.017573781],"genre_scores_gemma":[0.8703174,0.0023558422,0.1210621,0.00026874492,0.00019229554,0.00014168725,0.00015298247,0.00005367066,0.005455414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804294,0.00067977834,0.00008483957,0.00020164056,0.000731846,0.0002589988],"domain_scores_gemma":[0.9969357,0.0015743093,0.00042585738,0.00071929354,0.00028636557,0.00005843626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017999575,0.0006786456,0.0005172762,0.00070194993,0.00065358134,0.0012697278,0.0008019728,0.00096354046,0.0017309916],"category_scores_gemma":[0.0064520505,0.00023551477,0.00036354107,0.000995662,0.0017737512,0.0018572995,0.0019345457,0.001185058,0.00031528148],"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.00012364496,0.000031902935,0.00029957015,0.00021426227,0.00003120363,0.00009638456,0.00021536114,0.1399616,0.00528885,0.79493815,0.0019244988,0.05687457],"study_design_scores_gemma":[0.000039887447,0.00010437538,0.00021378147,0.00013064504,0.000020854759,0.00019387408,0.00005147259,0.556074,0.0069356784,0.42649156,0.009704939,0.00003893326],"about_ca_topic_score_codex":0.0014097508,"about_ca_topic_score_gemma":0.0010510138,"teacher_disagreement_score":0.001968731,"about_ca_system_score_codex":0.001968731,"about_ca_system_score_gemma":0.001389929,"threshold_uncertainty_score":0.0142841935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05808906,0.0005884709,0.9311657,0.00028646842,0.00004124778,0.000050905695,0.00006386789,0.00012116714,0.009593254],"genre_scores_gemma":[0.9828551,0.00025643862,0.0143842045,0.000042568598,0.000022172846,0.00003770297,0.000017851657,0.000015324447,0.002368652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996489,0.00010807532,0.00001662916,0.00008387388,0.00007873272,0.00006369266],"domain_scores_gemma":[0.99927837,0.0004406647,0.00012278656,0.00003708393,0.00009485965,0.00002626206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077599153,0.0007723954,0.0005152367,0.00028530596,0.00032092028,0.00089515967,0.0008194888,0.0005986069,0.001854306],"category_scores_gemma":[0.0018701828,0.00028868267,0.00023574237,0.00039575814,0.00078739354,0.0006695132,0.00074748066,0.0006390297,0.00022617263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001872777,0.00007324101,0.00038941784,0.00016067701,0.000036220743,0.00019494796,0.00018523341,0.8966338,0.0094174985,0.044224527,0.0010327805,0.0474644],"study_design_scores_gemma":[0.000018017083,0.000058557565,0.000090391775,0.000007665647,0.000010063597,0.000029143934,0.000017139371,0.9887101,0.00071644655,0.009974929,0.00036114908,0.0000064408005],"about_ca_topic_score_codex":0.0020238727,"about_ca_topic_score_gemma":0.0020841735,"teacher_disagreement_score":0.0020238727,"about_ca_system_score_codex":0.00081603514,"about_ca_system_score_gemma":0.0006009518,"threshold_uncertainty_score":0.006203234},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25726208,0.008682321,0.69210315,0.0011962956,0.00015159523,0.0000688701,0.00032834316,0.00045934707,0.039747946],"genre_scores_gemma":[0.98697066,0.0027349375,0.007949375,0.00007914331,0.00013461063,0.0000389814,0.00006243377,0.0000429671,0.0019869863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979842,0.0008165518,0.000052759504,0.0001672578,0.0006186635,0.0003606056],"domain_scores_gemma":[0.9834871,0.01405497,0.0009833007,0.00045623796,0.00085769396,0.00016066676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027704611,0.001406996,0.0012818628,0.0012196288,0.000716681,0.0017356673,0.00098095,0.0010650073,0.0021372084],"category_scores_gemma":[0.014909277,0.0006236159,0.0005863288,0.0017396392,0.002172915,0.0022678012,0.0014616784,0.0012855448,0.0003710236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013152741,0.000046671244,0.0014408126,0.00019730654,0.00003816381,0.0005983652,0.00020733509,0.86332935,0.0038236745,0.115876764,0.0010374493,0.013272604],"study_design_scores_gemma":[0.000007722944,0.000073325624,0.00060062413,0.00005075113,0.000018238705,0.00033667326,0.0000720415,0.9546435,0.0012595368,0.042476922,0.00043405045,0.000026675702],"about_ca_topic_score_codex":0.0016907444,"about_ca_topic_score_gemma":0.0012122663,"teacher_disagreement_score":0.0027704611,"about_ca_system_score_codex":0.0023489627,"about_ca_system_score_gemma":0.00076324213,"threshold_uncertainty_score":0.017042994},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13938802,0.0027022893,0.81914395,0.0014248344,0.000115843344,0.00007591377,0.0005091275,0.00041323167,0.036226813],"genre_scores_gemma":[0.9803976,0.0010079003,0.01554957,0.000080310354,0.00009843537,0.00011148478,0.00017961468,0.00005626036,0.0025189484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899155,0.0003938695,0.000031709133,0.00010257732,0.0003252175,0.00015514214],"domain_scores_gemma":[0.99389935,0.0041543576,0.00054508646,0.00028302212,0.0009796004,0.00013853273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015724435,0.0008613089,0.0007006377,0.0009260067,0.0005070642,0.001227228,0.0007759605,0.0007450837,0.0022384566],"category_scores_gemma":[0.011116126,0.00049025955,0.00032709216,0.0010156183,0.0021258146,0.0016282869,0.0010151569,0.0008293083,0.00048553172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062677114,0.000029937773,0.0005063388,0.00010530511,0.000022410704,0.00019003176,0.00010934044,0.72089285,0.0030647072,0.26587233,0.001509396,0.007634653],"study_design_scores_gemma":[0.000007208596,0.000022567707,0.00026389697,0.0000256667,0.0000049078626,0.00007537096,0.00003262665,0.889361,0.0007116895,0.10912194,0.0003549124,0.000018109276],"about_ca_topic_score_codex":0.002255787,"about_ca_topic_score_gemma":0.0015805275,"teacher_disagreement_score":0.002255787,"about_ca_system_score_codex":0.0020192687,"about_ca_system_score_gemma":0.0012477404,"threshold_uncertainty_score":0.014650881},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47349024,0.006072489,0.48855945,0.001103642,0.00024513758,0.00006107644,0.00014005587,0.0013475573,0.02898027],"genre_scores_gemma":[0.99209434,0.0008301119,0.006382033,0.000036853053,0.00006768566,0.000016908076,0.000018247707,0.000029144128,0.000524777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995566,0.00015082923,0.000012275931,0.00004516289,0.00012766087,0.00010746802],"domain_scores_gemma":[0.99755424,0.0016844807,0.00022721608,0.00025024728,0.00022402902,0.00005971991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087055325,0.0004755496,0.00034871843,0.00052273256,0.00032123405,0.00064357335,0.0004442493,0.00043301703,0.0012156444],"category_scores_gemma":[0.005467309,0.0002165556,0.00020044569,0.00067554665,0.00090098305,0.0019156947,0.0006028236,0.00048361134,0.00018877657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009809944,0.000059346337,0.0014621785,0.00012970903,0.00003465179,0.00032045084,0.0002615763,0.85775554,0.019907966,0.06473472,0.0019262878,0.053309426],"study_design_scores_gemma":[0.000007986656,0.00008952487,0.00065783877,0.0000188609,0.000018966779,0.0001339062,0.000091153386,0.9692095,0.0044019693,0.023505615,0.0018498134,0.00001490629],"about_ca_topic_score_codex":0.0010828432,"about_ca_topic_score_gemma":0.0006960867,"teacher_disagreement_score":0.0012156444,"about_ca_system_score_codex":0.0007499015,"about_ca_system_score_gemma":0.00036044177,"threshold_uncertainty_score":0.0054409504},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06619267,0.00032439487,0.9298442,0.00023427652,0.00004410077,0.00019173682,0.00006302376,0.000204116,0.0029014235],"genre_scores_gemma":[0.8600572,0.00039968968,0.13734514,0.00009600231,0.00003279292,0.00036927342,0.000059493443,0.000026438149,0.0016139271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992248,0.00032925344,0.000042669417,0.00010883689,0.00018686445,0.00010756275],"domain_scores_gemma":[0.99837863,0.0009172953,0.00021103426,0.00022130147,0.00017503048,0.000096650314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001304849,0.00057300983,0.00049900205,0.00042526692,0.0005782463,0.00076667115,0.0014100671,0.0007038789,0.0009509542],"category_scores_gemma":[0.0032285384,0.00024067522,0.00030128317,0.00058450754,0.0008922313,0.0010116777,0.0011738216,0.00064371753,0.00013308368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006616233,0.00032913094,0.0011278121,0.00034656617,0.00009646528,0.000773837,0.00069611095,0.5638729,0.05972951,0.30035904,0.0019896792,0.07001732],"study_design_scores_gemma":[0.000042010783,0.00014837747,0.00009934771,0.000012813592,0.000024980884,0.00013197733,0.000029056535,0.9717999,0.0038272366,0.022456964,0.0013991027,0.000028240718],"about_ca_topic_score_codex":0.0014021852,"about_ca_topic_score_gemma":0.0015297106,"teacher_disagreement_score":0.0014100671,"about_ca_system_score_codex":0.0008003524,"about_ca_system_score_gemma":0.0013427818,"threshold_uncertainty_score":0.0069007874},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029954398,0.03910908,0.89375573,0.0020626532,0.0011390803,0.00005587776,0.0001247104,0.00036157598,0.033436846],"genre_scores_gemma":[0.69670683,0.055766154,0.17878272,0.0005548899,0.0025943513,0.00016655351,0.00030166842,0.00011033665,0.0650165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994467,0.0002463075,0.000025374628,0.00006521384,0.00016940433,0.000046930483],"domain_scores_gemma":[0.9990601,0.0006023841,0.00005463298,0.00013694368,0.00013007228,0.000015903699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006287154,0.0004798691,0.00039628817,0.0006022746,0.00022941285,0.0008609769,0.0005446177,0.0007414769,0.002278151],"category_scores_gemma":[0.0018631304,0.00022853544,0.0002593728,0.0009559846,0.00042163138,0.0010529999,0.00041115689,0.0006849422,0.00097429584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020313456,0.000108905995,0.00080482836,0.00057006424,0.000110009045,0.00043407443,0.00032115323,0.17839888,0.028334089,0.24096163,0.015142168,0.53461117],"study_design_scores_gemma":[0.000041484902,0.00034096852,0.001329759,0.00021130775,0.00008711791,0.0013375173,0.00015709003,0.7179998,0.01641933,0.17841557,0.08359287,0.00006723776],"about_ca_topic_score_codex":0.00042008076,"about_ca_topic_score_gemma":0.0006668377,"teacher_disagreement_score":0.002278151,"about_ca_system_score_codex":0.00041968332,"about_ca_system_score_gemma":0.00025169045,"threshold_uncertainty_score":0.007621169},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10027368,0.0008032367,0.8930771,0.0004692354,0.0000910693,0.000091519774,0.000097211894,0.0019363895,0.0031606061],"genre_scores_gemma":[0.8420596,0.0007549227,0.15285285,0.0002764677,0.000066084984,0.0001166994,0.00024409524,0.00014165543,0.0034876976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940085,0.000106178966,0.00002201262,0.00007973101,0.00029666154,0.000094507355],"domain_scores_gemma":[0.99788755,0.0011338684,0.00019995782,0.0003073381,0.00038588984,0.00008535318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014041836,0.0005546797,0.00047421557,0.0005135026,0.00057932286,0.00062473427,0.0008573797,0.00066218385,0.000863519],"category_scores_gemma":[0.004932115,0.00024843015,0.0001959542,0.00042038123,0.0008431994,0.0014399765,0.0010797988,0.0011789595,0.00032138536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092773524,0.00023320247,0.002369447,0.00029206672,0.000061723564,0.00040632192,0.0004901372,0.61067164,0.0894307,0.02068693,0.0066472874,0.2677828],"study_design_scores_gemma":[0.000032709984,0.00015954967,0.0005597612,0.000030705487,0.000014630205,0.00015315044,0.00008567275,0.9644048,0.027222702,0.0052063675,0.0021093239,0.000020707788],"about_ca_topic_score_codex":0.0054623587,"about_ca_topic_score_gemma":0.0060480754,"teacher_disagreement_score":0.0054623587,"about_ca_system_score_codex":0.0008700992,"about_ca_system_score_gemma":0.0014496807,"threshold_uncertainty_score":0.010861099},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01954476,0.008595153,0.24762908,0.006430066,0.002173512,0.00005502156,0.0002790697,0.00037436254,0.7149191],"genre_scores_gemma":[0.445398,0.010120182,0.1467502,0.0038428158,0.0022352547,0.00024753687,0.0003780117,0.00048778686,0.39054015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957067,0.000112942034,0.000012490466,0.000047419973,0.00021069002,0.0000457917],"domain_scores_gemma":[0.9992686,0.00035782225,0.000045089506,0.00013822634,0.00014088584,0.000049258637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047375698,0.00042115012,0.00047575907,0.0006469304,0.00092023076,0.0017891668,0.0008051233,0.0010940623,0.009362216],"category_scores_gemma":[0.0023394222,0.000333961,0.00029513292,0.0011673243,0.0027541115,0.002479559,0.0011218068,0.0026365332,0.0025868644],"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.0000020984585,0.0000032524194,0.000007692683,0.00001195664,5.4344935e-7,0.0000098421215,0.000031251395,0.00077500724,0.00016153153,0.9913818,0.0025568863,0.0050580283],"study_design_scores_gemma":[0.0000033109516,0.0000054682364,0.000022360022,0.000020551473,0.0000013562808,0.000090100926,0.000032688517,0.005974407,0.00037332886,0.9650209,0.028448744,0.0000067896876],"about_ca_topic_score_codex":0.0019595965,"about_ca_topic_score_gemma":0.002148378,"teacher_disagreement_score":0.009362216,"about_ca_system_score_codex":0.0014002676,"about_ca_system_score_gemma":0.0009830812,"threshold_uncertainty_score":0.031319737},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024053974,0.0018649496,0.9547655,0.0022828907,0.0002185444,0.00023639954,0.0005511335,0.00011897689,0.01590771],"genre_scores_gemma":[0.63972926,0.0042723534,0.3313089,0.00080888625,0.00047591233,0.0007470462,0.00074710895,0.00015191761,0.021758612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971156,0.0015598224,0.00009242871,0.000759685,0.00029249498,0.00017989015],"domain_scores_gemma":[0.9968453,0.0023057081,0.00029731134,0.00018248717,0.00021598036,0.00015314629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022397714,0.0016414556,0.0018240554,0.0007008177,0.000628671,0.00227666,0.0018871884,0.002896361,0.004269161],"category_scores_gemma":[0.008314371,0.00071902847,0.00077214924,0.0014082904,0.0013601163,0.003691669,0.0018388752,0.0014101034,0.0006684771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000351985,0.00012274324,0.0006240006,0.0007905074,0.0001511028,0.00047449037,0.0003013231,0.56209576,0.0025086335,0.35173523,0.012648292,0.06819598],"study_design_scores_gemma":[0.0002054809,0.0002458534,0.00022851591,0.00010999869,0.00011822044,0.0005238554,0.0001691025,0.641023,0.0019206804,0.3351853,0.020221602,0.00004841011],"about_ca_topic_score_codex":0.0012697744,"about_ca_topic_score_gemma":0.0009783389,"teacher_disagreement_score":0.004269161,"about_ca_system_score_codex":0.0016274452,"about_ca_system_score_gemma":0.0013215943,"threshold_uncertainty_score":0.01428175},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015714474,0.002066217,0.974146,0.0004154257,0.00016857385,0.000066628105,0.00015926345,0.0002323122,0.0070312195],"genre_scores_gemma":[0.7793559,0.0032083055,0.20979482,0.0003963232,0.00013413023,0.00029899873,0.0003237921,0.00010952403,0.006378113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918526,0.0002506777,0.000035387362,0.00010537346,0.0002840204,0.00013927855],"domain_scores_gemma":[0.9980568,0.0010130132,0.00018359802,0.00019706925,0.00049211294,0.000057420144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011900353,0.00084166776,0.0006296166,0.00083213573,0.00055884285,0.0011825851,0.0012565497,0.00081071985,0.00224935],"category_scores_gemma":[0.0041584116,0.00029325928,0.0004575588,0.0015478338,0.0008486232,0.0012177943,0.0014066999,0.0011474437,0.0004355008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010315431,0.00004011135,0.00047364764,0.00021151785,0.000042091775,0.00017441298,0.00011719018,0.81094736,0.0039998395,0.12641342,0.004266373,0.05321086],"study_design_scores_gemma":[0.00000808255,0.000028636552,0.000071315364,0.000020099373,0.000010426632,0.000049805243,0.000019036619,0.980537,0.00072781957,0.016204538,0.0023132353,0.000009943565],"about_ca_topic_score_codex":0.008428816,"about_ca_topic_score_gemma":0.009917424,"teacher_disagreement_score":0.008428816,"about_ca_system_score_codex":0.0022363502,"about_ca_system_score_gemma":0.0021164224,"threshold_uncertainty_score":0.016759515},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052849627,0.0057526086,0.9725366,0.001183505,0.00021069044,0.000049615017,0.00004717937,0.00010064825,0.014834198],"genre_scores_gemma":[0.37923038,0.028704384,0.5782904,0.00081349304,0.0012404205,0.00051946455,0.00018011808,0.00014675314,0.010874602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892396,0.00038498154,0.000054340384,0.00014523836,0.0004108097,0.00008062152],"domain_scores_gemma":[0.99810743,0.0011801873,0.00014900586,0.00029522864,0.00023018781,0.000037907947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013276594,0.00087438565,0.0004617995,0.0011389642,0.00059707323,0.0017108391,0.0009819528,0.0012008551,0.002253736],"category_scores_gemma":[0.0039972565,0.000374451,0.0004268149,0.0015436353,0.0032152154,0.0038222754,0.0014748772,0.002523142,0.00058187946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023856646,0.000018718261,0.00013546397,0.00016769272,0.00000998212,0.000050992556,0.000115199786,0.05346358,0.0027106493,0.88437086,0.0014769244,0.057456028],"study_design_scores_gemma":[0.000015636826,0.000066784254,0.0001387457,0.0001350316,0.000010772082,0.00018031835,0.000071754825,0.28015018,0.0039474685,0.6959827,0.019263035,0.000037569873],"about_ca_topic_score_codex":0.00096946285,"about_ca_topic_score_gemma":0.00074446405,"teacher_disagreement_score":0.002253736,"about_ca_system_score_codex":0.0014255409,"about_ca_system_score_gemma":0.0010180614,"threshold_uncertainty_score":0.010343015},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6099131,0.004254005,0.36002803,0.0022783873,0.000287888,0.00014217029,0.00105418,0.0007346379,0.02130763],"genre_scores_gemma":[0.99399674,0.00051046105,0.0029549738,0.000079447476,0.00005502148,0.00003282376,0.00013905515,0.000034793808,0.0021967483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747795,0.00067023234,0.00014534325,0.00039114876,0.00072055426,0.0005947241],"domain_scores_gemma":[0.9718665,0.022408223,0.0017229831,0.0010696695,0.0025913334,0.00034125024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003625759,0.0014932476,0.0015148787,0.0011717583,0.00093580794,0.00198007,0.0015134239,0.002256563,0.002863257],"category_scores_gemma":[0.017279306,0.00065710983,0.0006135725,0.0012166406,0.0019266686,0.0020048488,0.0020032618,0.0012361988,0.0004885417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021882718,0.00016980799,0.0144872395,0.0007096809,0.00031670954,0.0014563208,0.0009813273,0.87172174,0.015520501,0.059370983,0.0025669073,0.030510468],"study_design_scores_gemma":[0.00006721715,0.0002144362,0.005001652,0.000076778306,0.00020445514,0.001001556,0.00021138969,0.9746037,0.0055624894,0.012451955,0.0005062478,0.000098087134],"about_ca_topic_score_codex":0.0044852495,"about_ca_topic_score_gemma":0.0031182335,"teacher_disagreement_score":0.0044852495,"about_ca_system_score_codex":0.0014906795,"about_ca_system_score_gemma":0.0016643258,"threshold_uncertainty_score":0.019175112},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004048093,0.00029500667,0.9947068,0.000107736974,0.00001499893,0.000023878967,0.000015609232,0.0001221691,0.00066575035],"genre_scores_gemma":[0.6811257,0.0008977984,0.31229836,0.00040597483,0.00007643056,0.00027983438,0.00011962564,0.000055924138,0.0047404524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882513,0.0005151741,0.00004016389,0.00017434025,0.00036785196,0.00007739984],"domain_scores_gemma":[0.99779874,0.00148453,0.00017129575,0.0001533584,0.00034064733,0.000051410832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013754148,0.00059392804,0.000989027,0.00051620905,0.00050414033,0.0008920642,0.0010336334,0.0010680412,0.0012420842],"category_scores_gemma":[0.0044417176,0.00026677302,0.0002975528,0.0006324403,0.0010126464,0.0013963047,0.0011433607,0.0012657039,0.0005182405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040631046,0.00014570636,0.0014208141,0.0004560514,0.00012859302,0.00041541382,0.00040461138,0.50485235,0.044488743,0.2081725,0.0051544383,0.23395443],"study_design_scores_gemma":[0.000022382985,0.00011741969,0.00009501168,0.000015715015,0.000014167712,0.0001520901,0.000023493436,0.97744465,0.006472021,0.013783349,0.0018363572,0.000023297494],"about_ca_topic_score_codex":0.0006303498,"about_ca_topic_score_gemma":0.00073529384,"teacher_disagreement_score":0.0013754148,"about_ca_system_score_codex":0.0008497775,"about_ca_system_score_gemma":0.001301038,"threshold_uncertainty_score":0.0072740316},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020168304,0.0016559227,0.968795,0.0005120852,0.00032965356,0.0003120843,0.00014765638,0.0009668994,0.007112346],"genre_scores_gemma":[0.81015396,0.0013616638,0.18028706,0.00048056638,0.00018161032,0.0008899463,0.00052565645,0.000071247996,0.006048302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947363,0.00013149262,0.000035767593,0.000059339854,0.00023735444,0.00006252207],"domain_scores_gemma":[0.99854916,0.0004370691,0.00017177872,0.00014717315,0.0006436252,0.000051223356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007962294,0.0004339443,0.0004487626,0.0007273753,0.0007221609,0.00056110293,0.001190415,0.0004342075,0.0008604205],"category_scores_gemma":[0.0025810588,0.00011880451,0.00019184955,0.0005650907,0.0006461063,0.00058180105,0.0009081556,0.00080427446,0.00023342767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007446074,0.000262633,0.0021673157,0.000961216,0.00013876184,0.000904218,0.00083953555,0.2613119,0.13350408,0.17356163,0.033692062,0.391912],"study_design_scores_gemma":[0.00006646682,0.00026089608,0.0005826519,0.0000617928,0.00005266997,0.0005539449,0.00007480931,0.9437522,0.02039234,0.010884001,0.023261033,0.000057178273],"about_ca_topic_score_codex":0.004130491,"about_ca_topic_score_gemma":0.004984764,"teacher_disagreement_score":0.004130491,"about_ca_system_score_codex":0.00072865287,"about_ca_system_score_gemma":0.0018479449,"threshold_uncertainty_score":0.008212864},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123645715,0.0012800028,0.87045926,0.0002928166,0.00008578772,0.00006050426,0.00004855658,0.00029012593,0.0038372718],"genre_scores_gemma":[0.92922693,0.0005356191,0.068949506,0.00007637832,0.000037128768,0.0000749597,0.00002636085,0.000016796534,0.0010564789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991685,0.00029788548,0.00003700775,0.00013813541,0.00022823429,0.00013025076],"domain_scores_gemma":[0.99795294,0.0011713434,0.0003461692,0.00017333691,0.00028376398,0.00007238986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008785387,0.0007504652,0.00054295966,0.0006441385,0.00068764435,0.00075635215,0.0009110963,0.0006564357,0.00045601738],"category_scores_gemma":[0.0031436414,0.00043573044,0.00036567976,0.00071830733,0.0010849109,0.001023334,0.0010510485,0.0007460916,0.0001493705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000434129,0.00010428908,0.0010348595,0.00019810097,0.00007312219,0.00070104137,0.0004888435,0.8138908,0.024043426,0.079204164,0.001339592,0.07848769],"study_design_scores_gemma":[0.000021040345,0.000106998734,0.000066811,0.000010369431,0.000017324754,0.0001803567,0.000025968426,0.9887466,0.0031800028,0.006999764,0.0006267258,0.000018061444],"about_ca_topic_score_codex":0.0023982862,"about_ca_topic_score_gemma":0.002208249,"teacher_disagreement_score":0.0023982862,"about_ca_system_score_codex":0.00078001025,"about_ca_system_score_gemma":0.00091785204,"threshold_uncertainty_score":0.005659461},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48299047,0.0010315354,0.5017628,0.00036657532,0.00010042909,0.00005237413,0.0001822675,0.00022579097,0.013287828],"genre_scores_gemma":[0.9935649,0.00018765945,0.00545801,0.000024275545,0.000013788341,0.000014163366,0.000022333163,0.000006071972,0.0007089032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991972,0.00026267878,0.000020385045,0.00008119014,0.00025363345,0.00018496167],"domain_scores_gemma":[0.9921341,0.005501562,0.00085840095,0.00035027912,0.0010331393,0.00012252048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014707351,0.0010374952,0.00073404313,0.0003804532,0.00043188318,0.0006825751,0.0007754837,0.00064890087,0.00065217254],"category_scores_gemma":[0.005907808,0.0002836277,0.00029670805,0.0010398474,0.0012260082,0.0008717506,0.0008462387,0.00059648626,0.00012174011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008567422,0.000017420802,0.00076002354,0.00006231607,0.000029962344,0.00028893052,0.000081525206,0.9857255,0.0029492003,0.0067908075,0.0001724214,0.0030362608],"study_design_scores_gemma":[0.0000046303317,0.000041484833,0.00020335229,0.000004088097,0.000012824211,0.000061142266,0.000022044114,0.9971209,0.001124297,0.001319445,0.00007784157,0.000007922239],"about_ca_topic_score_codex":0.0071658273,"about_ca_topic_score_gemma":0.006306067,"teacher_disagreement_score":0.0071658273,"about_ca_system_score_codex":0.0011096663,"about_ca_system_score_gemma":0.0008814482,"threshold_uncertainty_score":0.014248192},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8695728,0.0027382576,0.12003388,0.00028006829,0.00004694868,0.000026106814,0.00019227805,0.00029255316,0.0068171504],"genre_scores_gemma":[0.9980428,0.00032384385,0.0013370509,0.000013934388,0.000005891504,0.0000059750723,0.000027226484,0.0000043191553,0.00023881278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914193,0.0002729292,0.00003615457,0.00007099694,0.00023467554,0.00024332169],"domain_scores_gemma":[0.99521554,0.0028555468,0.00070721074,0.00039216917,0.0007418534,0.0000876422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013308655,0.00069622236,0.0006854139,0.0008765582,0.00064686633,0.000988038,0.0007102638,0.0006719387,0.0004218806],"category_scores_gemma":[0.004619542,0.00019443994,0.00036967,0.0014089154,0.0009457281,0.0010988818,0.0008937074,0.00038696302,0.00012062111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002489753,0.000020679188,0.0026276212,0.00005833776,0.000044305285,0.00019869587,0.0000602287,0.9728717,0.0076647056,0.007985916,0.000291088,0.007927763],"study_design_scores_gemma":[0.000005407696,0.00008954885,0.00065328134,0.0000099243025,0.000023692852,0.00009624135,0.000046917798,0.99279356,0.004919603,0.0012297113,0.00011731234,0.000014814057],"about_ca_topic_score_codex":0.0053653545,"about_ca_topic_score_gemma":0.0039040924,"teacher_disagreement_score":0.0053653545,"about_ca_system_score_codex":0.0015547273,"about_ca_system_score_gemma":0.000768651,"threshold_uncertainty_score":0.011280417},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31696835,0.0008680546,0.6647097,0.0002578908,0.00002459428,0.00004250982,0.00007588152,0.00015355836,0.016899375],"genre_scores_gemma":[0.99313354,0.00017287696,0.0058321585,0.00002445938,0.000008083835,0.000022759697,0.000013394021,0.000010806521,0.00078199466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992036,0.00026256003,0.000020309846,0.00008162068,0.0002587306,0.00017314267],"domain_scores_gemma":[0.99697757,0.00225372,0.00022334057,0.00011844165,0.00038200992,0.000045009856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015480482,0.00069274736,0.0005370565,0.00066976494,0.0004241388,0.0011145396,0.000670685,0.00064979296,0.0011164512],"category_scores_gemma":[0.00498515,0.00021845732,0.0003859177,0.0007401617,0.0011733924,0.0007966916,0.00067421654,0.0003595652,0.0001746444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000784712,0.00002879582,0.00063863694,0.00004800295,0.000033226956,0.00015895293,0.00005425727,0.971849,0.0048234113,0.016657853,0.00015455988,0.0054748855],"study_design_scores_gemma":[0.00000316928,0.000028241102,0.0002204437,0.000005236723,0.000009746795,0.000039328686,0.00002874101,0.99541986,0.0013346871,0.0028138058,0.0000916415,0.0000050883427],"about_ca_topic_score_codex":0.0028124712,"about_ca_topic_score_gemma":0.0016862722,"teacher_disagreement_score":0.0028124712,"about_ca_system_score_codex":0.0013778756,"about_ca_system_score_gemma":0.00066747825,"threshold_uncertainty_score":0.009997249},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007292984,0.64666516,0.27539864,0.003012242,0.0013738114,0.00009307918,0.00015855502,0.00018587038,0.06581971],"genre_scores_gemma":[0.13125771,0.79215527,0.059816774,0.0015470032,0.004119044,0.00022730941,0.00026366694,0.00007275299,0.010540455],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99942255,0.0001608495,0.000052886207,0.00010111955,0.00021429722,0.000048294398],"domain_scores_gemma":[0.999005,0.0007030496,0.00004687898,0.00006283818,0.00015558756,0.000026655107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069159985,0.00073971,0.0009609771,0.001617821,0.0006852419,0.0017394437,0.0009285918,0.0012860616,0.00291793],"category_scores_gemma":[0.001397118,0.00052233733,0.0005059844,0.0032939625,0.0011319078,0.0032429346,0.0011232932,0.0018096277,0.0010026414],"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.000086020416,0.000106919455,0.0010065979,0.0045031453,0.000077435834,0.00033360953,0.00061969116,0.012970029,0.0034481355,0.44153434,0.020528818,0.51478523],"study_design_scores_gemma":[0.000025511163,0.00040298371,0.0012143004,0.0022031968,0.0001359185,0.0020091985,0.0004965305,0.05525653,0.00364581,0.31579545,0.6186885,0.00012609104],"about_ca_topic_score_codex":0.0007025332,"about_ca_topic_score_gemma":0.00053985,"teacher_disagreement_score":0.00291793,"about_ca_system_score_codex":0.00063098036,"about_ca_system_score_gemma":0.0007866226,"threshold_uncertainty_score":0.009761393},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037666755,0.0006291371,0.9933722,0.000114432405,0.000058388974,0.00010462443,0.000010991794,0.000068219306,0.001875245],"genre_scores_gemma":[0.4852992,0.0026508472,0.501229,0.00024775695,0.0002417962,0.0013559192,0.00010349506,0.00013285823,0.008739087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977151,0.0009085757,0.00013362772,0.00021825811,0.00087136804,0.00015304299],"domain_scores_gemma":[0.9972656,0.0012622417,0.00022918527,0.00034238817,0.00082144846,0.0000791547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032821046,0.0009028973,0.00084336573,0.00092153944,0.00092612096,0.001842854,0.0025313306,0.0012301538,0.0016346734],"category_scores_gemma":[0.0059803696,0.00067267555,0.000610693,0.0009828475,0.001111161,0.0021707728,0.0017472242,0.0010705981,0.0005319169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013751237,0.00011617022,0.00047558616,0.0004145166,0.00012953868,0.0003018078,0.0006038713,0.5289974,0.015582278,0.3384995,0.0032470117,0.111494735],"study_design_scores_gemma":[0.000034726734,0.00014882883,0.0000695853,0.000038425096,0.00007503256,0.00014354789,0.00008966889,0.92840564,0.0033056566,0.060415577,0.007249939,0.000023339275],"about_ca_topic_score_codex":0.0010864898,"about_ca_topic_score_gemma":0.0016416595,"teacher_disagreement_score":0.0032821046,"about_ca_system_score_codex":0.0012101895,"about_ca_system_score_gemma":0.0015620005,"threshold_uncertainty_score":0.017357588},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14837126,0.00089488196,0.837343,0.000533564,0.000043698972,0.0000602066,0.000047603367,0.00016888806,0.012536987],"genre_scores_gemma":[0.95126146,0.00047967225,0.046352565,0.000058470407,0.00005299375,0.00004109186,0.000016080376,0.000013065437,0.0017247316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994448,0.00031061147,0.000014758379,0.000054041288,0.000112993956,0.00006279107],"domain_scores_gemma":[0.9991912,0.0005445625,0.00007928818,0.00007256366,0.00009262473,0.00001960614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007735061,0.0007074842,0.0004821017,0.00025149834,0.00030540046,0.0006234213,0.00050886784,0.00049528683,0.00087139924],"category_scores_gemma":[0.0023489918,0.00018456957,0.00018659316,0.00044986123,0.0007277164,0.0008511559,0.00059493113,0.00029800192,0.0002005344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024186632,0.00010117192,0.0009653989,0.00009305446,0.000034586476,0.00023496205,0.00014267242,0.8487936,0.02113215,0.06661305,0.0012648873,0.060382564],"study_design_scores_gemma":[0.000017949384,0.000118208634,0.00015239281,0.0000053804006,0.000015816577,0.00008243381,0.000023124172,0.97993004,0.0036660247,0.0153706735,0.0006102279,0.000007741506],"about_ca_topic_score_codex":0.0006889451,"about_ca_topic_score_gemma":0.0012515032,"teacher_disagreement_score":0.00087139924,"about_ca_system_score_codex":0.0005198598,"about_ca_system_score_gemma":0.00041562968,"threshold_uncertainty_score":0.0040907264},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106258355,0.0024290408,0.87825876,0.0004906378,0.00007302521,0.00014314683,0.00020352117,0.00044072696,0.011702786],"genre_scores_gemma":[0.9697178,0.0012776236,0.026825834,0.00007765157,0.000038106522,0.00011838735,0.000101043464,0.000028954077,0.001814511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821585,0.000708545,0.00009989394,0.00020321172,0.00057243544,0.00019998413],"domain_scores_gemma":[0.99552566,0.0025494955,0.0004855208,0.00039363245,0.0009771482,0.00006854941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002499853,0.0011698334,0.0009861478,0.00075921713,0.0006221763,0.0013189323,0.0008494455,0.0010341543,0.0021455572],"category_scores_gemma":[0.00786835,0.00043990667,0.0005696526,0.0010706384,0.000975305,0.001593784,0.0010752974,0.00075756793,0.0004928896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023642635,0.00006243542,0.0012840207,0.00031496526,0.00008757424,0.00036131218,0.0004489792,0.8828099,0.012853635,0.07145977,0.0011117705,0.028969152],"study_design_scores_gemma":[0.000017175902,0.00010668683,0.00029552085,0.000018500268,0.000029468007,0.00024239109,0.000048067162,0.9928871,0.001850206,0.0040834276,0.00039179286,0.000029650904],"about_ca_topic_score_codex":0.0037570912,"about_ca_topic_score_gemma":0.0020172957,"teacher_disagreement_score":0.0037570912,"about_ca_system_score_codex":0.0013518274,"about_ca_system_score_gemma":0.00091505994,"threshold_uncertainty_score":0.013220608},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062272507,0.0005709473,0.99054164,0.00006763001,0.00005094292,0.000055076227,0.000022858252,0.0002621883,0.0022013711],"genre_scores_gemma":[0.58430916,0.0012481789,0.40827712,0.00022532976,0.00010065499,0.0004217791,0.00016776734,0.00011411394,0.005135909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991418,0.00033485395,0.000049644597,0.00012225381,0.00027162852,0.000079668236],"domain_scores_gemma":[0.99917114,0.00029403644,0.00010635764,0.00014095138,0.00026100466,0.000026580688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018019712,0.00076591276,0.00041623213,0.0004528016,0.00038127846,0.0012653839,0.0010216292,0.0006486214,0.0027169797],"category_scores_gemma":[0.0022595592,0.00042771726,0.0003746554,0.00032834723,0.00032854543,0.0007647903,0.00086241757,0.00068796065,0.000786515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017054011,0.00011894654,0.00077493535,0.00038653117,0.0002175993,0.00030317326,0.00021379591,0.6675977,0.043986302,0.08475986,0.004455743,0.1970148],"study_design_scores_gemma":[0.000025375664,0.00016117045,0.00017126868,0.0000191016,0.00004834777,0.00012943482,0.000017741595,0.9799454,0.007021392,0.007195705,0.0052483645,0.00001664605],"about_ca_topic_score_codex":0.00057413295,"about_ca_topic_score_gemma":0.0011528839,"teacher_disagreement_score":0.0027169797,"about_ca_system_score_codex":0.00057652325,"about_ca_system_score_gemma":0.0005919735,"threshold_uncertainty_score":0.009529829},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3775279,0.0020135147,0.589527,0.001179714,0.00008514597,0.00010038696,0.0003436367,0.00047358908,0.028749138],"genre_scores_gemma":[0.9900949,0.0004995666,0.0070690354,0.00006585283,0.00004294719,0.000032217813,0.00005925006,0.000034571134,0.002101593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829084,0.00068349723,0.00004590777,0.00014856171,0.00047562056,0.0003554425],"domain_scores_gemma":[0.99257666,0.0052339565,0.0005751301,0.00047637193,0.0010131843,0.00012465286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026823415,0.0011796318,0.0009368311,0.0008564852,0.000639122,0.0018922024,0.0007596887,0.0009834156,0.002591556],"category_scores_gemma":[0.008411391,0.00051351136,0.0005559588,0.0010481193,0.0017615887,0.001541515,0.0016239021,0.00075440673,0.0005520544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044504172,0.000070256916,0.002162563,0.00016477211,0.00009773473,0.00036439687,0.000230236,0.9153904,0.020861266,0.05030673,0.00092378247,0.008982853],"study_design_scores_gemma":[0.0000099154095,0.00008822342,0.0005417749,0.00001430875,0.00003435884,0.00012009249,0.00005040313,0.99087805,0.0031617607,0.004903555,0.00017925189,0.000018340797],"about_ca_topic_score_codex":0.0026326077,"about_ca_topic_score_gemma":0.0018881416,"teacher_disagreement_score":0.0026823415,"about_ca_system_score_codex":0.0015659067,"about_ca_system_score_gemma":0.0011762073,"threshold_uncertainty_score":0.014185727},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013264169,0.0002251128,0.9846164,0.000089292895,0.000020678257,0.000026543026,0.00001877471,0.00009094425,0.0016479873],"genre_scores_gemma":[0.811075,0.00048247346,0.18378513,0.00009254156,0.00004512245,0.00018190106,0.00005085902,0.0000460175,0.0042410353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996051,0.0001390034,0.000014752794,0.00008389611,0.00009802241,0.000059196056],"domain_scores_gemma":[0.9995758,0.00021946133,0.000050250652,0.000028498962,0.00010936673,0.00001651627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007647977,0.0008548407,0.0009172051,0.00025823258,0.0002908067,0.00089566037,0.0009382483,0.0009858406,0.0018243375],"category_scores_gemma":[0.0014662043,0.00039961023,0.00042563924,0.0003505019,0.00066408614,0.00090636534,0.00065283646,0.0005734316,0.00038520887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005296634,0.000035877907,0.00017727252,0.000056152385,0.000027001706,0.00005431794,0.000043882046,0.9646529,0.0044884724,0.005547168,0.00045989,0.024404185],"study_design_scores_gemma":[0.000007889162,0.000027119551,0.00003181774,0.0000023167609,0.0000050868002,0.000012966802,0.0000056325835,0.99795306,0.00071480864,0.0010136877,0.00022229517,0.0000032455887],"about_ca_topic_score_codex":0.0019630706,"about_ca_topic_score_gemma":0.0025653143,"teacher_disagreement_score":0.0019630706,"about_ca_system_score_codex":0.00079263165,"about_ca_system_score_gemma":0.0009014266,"threshold_uncertainty_score":0.006103039},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02902314,0.0062501985,0.95226616,0.00045901013,0.000050613402,0.00011236862,0.00006187797,0.00017325745,0.011603431],"genre_scores_gemma":[0.8860404,0.010142104,0.09446951,0.00012200679,0.00018156297,0.00044522132,0.00010591253,0.00007550626,0.0084177675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908423,0.00036623338,0.000023887222,0.00011579325,0.00030372874,0.0001061339],"domain_scores_gemma":[0.9987326,0.0007401405,0.00015548938,0.000061693114,0.00028857694,0.000021506403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016560694,0.0010787176,0.00074927614,0.0005581822,0.0004066543,0.0013855149,0.00068184367,0.0010448423,0.0017735022],"category_scores_gemma":[0.0026290407,0.0006113225,0.00056101626,0.00085755007,0.0007721588,0.00090445584,0.0006735727,0.0007833668,0.0005716779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006525499,0.000061643645,0.0006004169,0.00017507297,0.00005254699,0.0000646376,0.000117109,0.9191012,0.0063236966,0.03467065,0.001514939,0.037252847],"study_design_scores_gemma":[0.000005734132,0.00006269623,0.00013789744,0.00001248232,0.000013646028,0.000033150758,0.000018646822,0.99400383,0.0010988178,0.0035945503,0.0010094548,0.000009040434],"about_ca_topic_score_codex":0.0033370433,"about_ca_topic_score_gemma":0.002897026,"teacher_disagreement_score":0.0033370433,"about_ca_system_score_codex":0.0016600372,"about_ca_system_score_gemma":0.0013019597,"threshold_uncertainty_score":0.01204443},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015363142,0.0011965947,0.97447795,0.00033879108,0.00035839478,0.00040507189,0.00012975298,0.001995073,0.005735331],"genre_scores_gemma":[0.6816038,0.0013954077,0.30403775,0.00051323435,0.00030793078,0.0014561561,0.0006258545,0.00017750832,0.009882371],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99935204,0.00013344841,0.000059249738,0.00009597373,0.0002944239,0.00006493944],"domain_scores_gemma":[0.99831486,0.00037396586,0.00022692788,0.00023683158,0.0007761462,0.00007118193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008946481,0.00052198494,0.0005261653,0.0009083028,0.00085443474,0.00066160725,0.0015144589,0.00049969245,0.0010895192],"category_scores_gemma":[0.002717189,0.0001746329,0.00026310183,0.000607878,0.00065684435,0.00074646424,0.00095384114,0.0009688995,0.00034191317],"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.000937041,0.00034042887,0.0021531335,0.000979043,0.00019613781,0.0008514379,0.00091602263,0.15281425,0.18666944,0.11402097,0.036653504,0.50346863],"study_design_scores_gemma":[0.00014312998,0.00048363756,0.00088803424,0.00007024431,0.000092836184,0.00077024073,0.0001108576,0.8927119,0.03895157,0.009506216,0.05617171,0.00009973137],"about_ca_topic_score_codex":0.0038662604,"about_ca_topic_score_gemma":0.0038397044,"teacher_disagreement_score":0.0038662604,"about_ca_system_score_codex":0.00077843457,"about_ca_system_score_gemma":0.0016615465,"threshold_uncertainty_score":0.007687509},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016054157,0.9282171,0.012356342,0.007712027,0.00855876,0.000045721103,0.00015861158,0.00024881534,0.04109722],"genre_scores_gemma":[0.014471108,0.92942923,0.013457404,0.0037919837,0.011042655,0.00005846427,0.00039724508,0.00006300778,0.0272889],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991493,0.00015292295,0.00006971282,0.00015207958,0.0004003272,0.0000757251],"domain_scores_gemma":[0.9969182,0.001272322,0.00021319791,0.00021023436,0.0011318532,0.00025418864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001251722,0.0007531084,0.0007812581,0.0016043587,0.000502084,0.001871139,0.0014544812,0.0014833976,0.016363751],"category_scores_gemma":[0.0038140719,0.0003017914,0.00036939062,0.0036892458,0.0007416504,0.0039090337,0.0012119937,0.0021121076,0.011718833],"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.00008211892,0.00007040044,0.0004571711,0.002551781,0.00003683325,0.00015495211,0.00012765647,0.00073431176,0.001440797,0.02721465,0.08668633,0.8804431],"study_design_scores_gemma":[0.0000065809327,0.00006475647,0.00037121653,0.00058079214,0.000026865584,0.00040633834,0.00008249495,0.0005607078,0.00036393377,0.008405746,0.989113,0.000017531405],"about_ca_topic_score_codex":0.0006322595,"about_ca_topic_score_gemma":0.00069080014,"teacher_disagreement_score":0.016363751,"about_ca_system_score_codex":0.00061947043,"about_ca_system_score_gemma":0.0011358416,"threshold_uncertainty_score":0.054742157},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5048335,0.005011489,0.44964388,0.0017236264,0.00018708226,0.0002237963,0.0006298072,0.000822317,0.036924493],"genre_scores_gemma":[0.9884461,0.0006156056,0.0084003685,0.00006514713,0.00008631481,0.00004151846,0.00011344028,0.000050658306,0.0021806762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778724,0.0008462232,0.000052097614,0.00018532298,0.0005670018,0.0005620758],"domain_scores_gemma":[0.9806997,0.015734768,0.00070023705,0.000602513,0.0020205828,0.00024218207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002970404,0.0014171622,0.0010267089,0.001350259,0.0008939318,0.0018731803,0.0013802798,0.0009857715,0.0041658445],"category_scores_gemma":[0.011797617,0.0003988371,0.0004630578,0.0016089313,0.0013875656,0.0014616109,0.0013484418,0.000839936,0.0004892486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086422986,0.00009054249,0.0012686726,0.00019152349,0.00007606488,0.00023154527,0.00020433332,0.9182689,0.0105151255,0.04541635,0.0015019046,0.021370735],"study_design_scores_gemma":[0.000013463923,0.0001602024,0.00037267766,0.000011468584,0.000035071615,0.00008976459,0.000044285276,0.99276817,0.0017313181,0.0045065978,0.0002513657,0.000015574382],"about_ca_topic_score_codex":0.006958657,"about_ca_topic_score_gemma":0.005557467,"teacher_disagreement_score":0.006958657,"about_ca_system_score_codex":0.0030476262,"about_ca_system_score_gemma":0.0022683297,"threshold_uncertainty_score":0.02211219},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024903024,0.00061924226,0.9675234,0.0002770157,0.00009287771,0.00006773197,0.00009146359,0.00026940566,0.0061557903],"genre_scores_gemma":[0.84432054,0.0011532828,0.14912152,0.00023459135,0.000082073966,0.00017614911,0.00014565387,0.000050023704,0.0047161826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936837,0.00019974454,0.00002864964,0.00011874731,0.00016094037,0.00012360445],"domain_scores_gemma":[0.9988726,0.0005068853,0.00014889799,0.00022207749,0.00019464458,0.000054868946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010757903,0.00088795595,0.0007712491,0.00053688756,0.000606286,0.001049826,0.0012105815,0.0010748759,0.0020097652],"category_scores_gemma":[0.0028533633,0.00031164364,0.0003962787,0.00095764466,0.0017457171,0.0015612526,0.0013170801,0.0012842445,0.0005458026],"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.0004865437,0.000055839326,0.00043902523,0.00023946853,0.000042641987,0.00050684414,0.00039801953,0.3641552,0.02553403,0.50737673,0.0032644277,0.09750116],"study_design_scores_gemma":[0.000031539013,0.00007597427,0.000092066795,0.000029113044,0.0000144377655,0.00017633727,0.000031049007,0.9380427,0.00755535,0.05112942,0.0027752705,0.00004681639],"about_ca_topic_score_codex":0.0022411495,"about_ca_topic_score_gemma":0.001470901,"teacher_disagreement_score":0.0022411495,"about_ca_system_score_codex":0.0009636612,"about_ca_system_score_gemma":0.0012966224,"threshold_uncertainty_score":0.0069918633},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031699056,0.8502904,0.10518802,0.0030136597,0.002158713,0.00012629961,0.0002545669,0.000386322,0.03541215],"genre_scores_gemma":[0.021568544,0.92876166,0.036207862,0.0011371966,0.0026441785,0.0001511404,0.00050705415,0.000107431435,0.008914868],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933285,0.00012348965,0.000066255445,0.000099327255,0.00031193503,0.00006621015],"domain_scores_gemma":[0.9986041,0.00079972774,0.00007842961,0.000099478,0.00035128574,0.00006693819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000839856,0.0009952617,0.0009407856,0.0023451885,0.00063463906,0.0018265723,0.0011839658,0.0012069029,0.005800915],"category_scores_gemma":[0.0021096556,0.000548033,0.0004806313,0.005634196,0.0007416836,0.0032711301,0.0010161041,0.001830237,0.0022981009],"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.000060442955,0.000091113776,0.00072195014,0.0058638467,0.00004112083,0.00016828632,0.00019683635,0.009356832,0.0035488915,0.10900536,0.06379344,0.8071519],"study_design_scores_gemma":[0.000011048629,0.00015929087,0.00085779873,0.001959985,0.000051055515,0.0009370253,0.00018821984,0.0208035,0.0017514203,0.051885385,0.9213258,0.000069457084],"about_ca_topic_score_codex":0.0015930654,"about_ca_topic_score_gemma":0.0013544178,"teacher_disagreement_score":0.005800915,"about_ca_system_score_codex":0.0010536269,"about_ca_system_score_gemma":0.0016375233,"threshold_uncertainty_score":0.019405961},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060295086,0.0019894608,0.9253173,0.0005561078,0.0003236178,0.00024087897,0.00016677102,0.0015998029,0.009511058],"genre_scores_gemma":[0.87525386,0.00055837265,0.1171257,0.00035763564,0.000065679,0.0002107997,0.00021659471,0.000028298688,0.006183072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995833,0.00009012817,0.0000231367,0.00008735397,0.000119275464,0.00009686702],"domain_scores_gemma":[0.99967635,0.00009946617,0.00004362337,0.000034226177,0.00010405977,0.0000422736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047793583,0.0007540826,0.0006431754,0.0006237719,0.00080736505,0.0007180178,0.0013698211,0.00074154127,0.0016346897],"category_scores_gemma":[0.001093782,0.00015864559,0.0004615513,0.0005214151,0.0006107291,0.000530636,0.0010380638,0.0007282721,0.00042011382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007377958,0.00033178765,0.0040925005,0.00023878564,0.00022485369,0.0007831361,0.0003608545,0.5143732,0.034402438,0.017815812,0.016937187,0.40970165],"study_design_scores_gemma":[0.00008965798,0.00033051264,0.0006050783,0.00001703958,0.000047024463,0.00036900773,0.00006492354,0.983306,0.0060132877,0.003300918,0.005826605,0.000029999086],"about_ca_topic_score_codex":0.005895186,"about_ca_topic_score_gemma":0.007636842,"teacher_disagreement_score":0.005895186,"about_ca_system_score_codex":0.00060202694,"about_ca_system_score_gemma":0.0014930853,"threshold_uncertainty_score":0.01172179},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0425938,0.00135281,0.9485704,0.00019136716,0.000057100173,0.000077082914,0.000030349396,0.00021326228,0.0069139465],"genre_scores_gemma":[0.93365884,0.0006859051,0.06395833,0.00006750632,0.00006130433,0.000077621975,0.000022938711,0.000027208665,0.0014403244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988586,0.00053596,0.000050346076,0.00010836013,0.00033685326,0.00010992515],"domain_scores_gemma":[0.9972703,0.0017672593,0.0003411218,0.00036131733,0.00022347603,0.000036493842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018613365,0.0007835787,0.0006259239,0.000515317,0.00042396496,0.0009720372,0.0008880689,0.00074163236,0.00096766703],"category_scores_gemma":[0.005226062,0.0002834193,0.0004771797,0.0006590996,0.0009412554,0.0012999696,0.0005330993,0.0004826988,0.00024713224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012555587,0.000071368806,0.00062279,0.00015307621,0.000058652386,0.0001901802,0.00012498864,0.8465322,0.014487424,0.08955259,0.00055454305,0.047526564],"study_design_scores_gemma":[0.000013731987,0.00009897021,0.00028617095,0.000010761228,0.000018261388,0.00013117038,0.000016126041,0.9817523,0.002830597,0.014044414,0.0007826192,0.000014812489],"about_ca_topic_score_codex":0.0005792417,"about_ca_topic_score_gemma":0.00063126965,"teacher_disagreement_score":0.0018613365,"about_ca_system_score_codex":0.0010380148,"about_ca_system_score_gemma":0.00044263853,"threshold_uncertainty_score":0.009843767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064431643,0.00013757148,0.9912334,0.00011517581,0.00006157055,0.00005777766,0.000053639626,0.00023156844,0.0016661221],"genre_scores_gemma":[0.67345303,0.00043630446,0.31954816,0.0002280986,0.00009707826,0.0003958114,0.0002292107,0.00004798075,0.0055642826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986004,0.00036299368,0.000061928025,0.0002102929,0.00055992336,0.00020442791],"domain_scores_gemma":[0.99819934,0.0005767555,0.00017794094,0.0005127004,0.0004512116,0.00008198865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011602709,0.0010735451,0.00095289055,0.0007786534,0.000664364,0.0011041878,0.0019547988,0.000977851,0.0019518881],"category_scores_gemma":[0.0026263564,0.000404797,0.00057593203,0.0012990104,0.0012442583,0.001559383,0.0025993488,0.0015331636,0.00052735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039605564,0.0001410745,0.00070190255,0.00026900915,0.000093592724,0.0003942293,0.00026939283,0.5055213,0.03478409,0.30816242,0.004680018,0.14458703],"study_design_scores_gemma":[0.000037686237,0.00007297722,0.00007734897,0.000013874865,0.00001867423,0.00013605857,0.00001326737,0.9685392,0.008421203,0.020099763,0.0025365744,0.00003351941],"about_ca_topic_score_codex":0.0011380895,"about_ca_topic_score_gemma":0.0014820639,"teacher_disagreement_score":0.0019547988,"about_ca_system_score_codex":0.00069930585,"about_ca_system_score_gemma":0.0013103274,"threshold_uncertainty_score":0.006529689},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55558366,0.0013447617,0.43031064,0.00018023633,0.000058786452,0.000062851424,0.00010093955,0.00020290544,0.012155118],"genre_scores_gemma":[0.99531305,0.00016201979,0.004075029,0.000015532696,0.000007914379,0.000011967772,0.000010237543,0.0000036665392,0.0004005209],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998885,0.00033626886,0.000035929646,0.00019455068,0.00026986867,0.0002784002],"domain_scores_gemma":[0.99559575,0.002653966,0.0005402034,0.0002802819,0.0008135604,0.00011621578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011966354,0.0010809257,0.0007178276,0.0004179874,0.0005676724,0.0010526201,0.00079335144,0.00061055884,0.000453539],"category_scores_gemma":[0.0047696396,0.00017559198,0.00029330264,0.00086488505,0.0013452491,0.00091089314,0.0012533339,0.0004467263,0.00008763477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030232893,0.00005083079,0.0015706713,0.00016819822,0.00007322217,0.00043519345,0.00027087596,0.95565516,0.00910479,0.015603734,0.0003700462,0.016394962],"study_design_scores_gemma":[0.000008760077,0.00009638029,0.00032069368,0.0000075144308,0.000026422911,0.000120371435,0.00005804097,0.99432737,0.002131912,0.002728487,0.00016022356,0.000013860739],"about_ca_topic_score_codex":0.00944701,"about_ca_topic_score_gemma":0.00858989,"teacher_disagreement_score":0.00944701,"about_ca_system_score_codex":0.0011885846,"about_ca_system_score_gemma":0.001452979,"threshold_uncertainty_score":0.018784046},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02900887,0.00049629057,0.96139896,0.0009812553,0.00014623415,0.00010925455,0.00022907977,0.0010051605,0.0066248416],"genre_scores_gemma":[0.82442415,0.00065261824,0.15882534,0.00036367765,0.00013816357,0.0003163823,0.00042004898,0.00028508264,0.014574483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992661,0.00024426036,0.00002448358,0.00010954607,0.00019927489,0.00015623093],"domain_scores_gemma":[0.9983803,0.0009789455,0.000094006995,0.00019299121,0.0002587073,0.00009496077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013706047,0.0008388534,0.0008453175,0.000548788,0.0005996139,0.0012080842,0.0019228167,0.000922635,0.0040710694],"category_scores_gemma":[0.005189398,0.00037539226,0.00043134237,0.0007697531,0.0011603737,0.0023209644,0.0015658089,0.0017524209,0.0007396216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034068458,0.00006936678,0.0005205546,0.000094458104,0.000022599226,0.00010303616,0.0001085154,0.83035755,0.0017484436,0.12969717,0.0058368114,0.031100847],"study_design_scores_gemma":[0.000009671738,0.000010816679,0.000027860198,0.0000032738776,0.000002395451,0.00000716006,0.0000059730933,0.9784297,0.00029300488,0.02076969,0.00043676168,0.0000037382724],"about_ca_topic_score_codex":0.0089922,"about_ca_topic_score_gemma":0.009579574,"teacher_disagreement_score":0.0089922,"about_ca_system_score_codex":0.002533478,"about_ca_system_score_gemma":0.0018054552,"threshold_uncertainty_score":0.018381774},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013750476,0.00045002543,0.9632367,0.0003696317,0.00026706807,0.0001423794,0.00020679245,0.005644465,0.015932351],"genre_scores_gemma":[0.34528193,0.00033671426,0.61993855,0.00049327174,0.00011831083,0.00032299946,0.00060599326,0.0010232956,0.03187899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994197,0.00010956751,0.000025752835,0.00010941317,0.00024105048,0.00009462142],"domain_scores_gemma":[0.99932003,0.00024382131,0.00004763182,0.00015735427,0.00018362154,0.000047597176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045808643,0.0011152086,0.0006479754,0.00051876216,0.00085790595,0.0010504063,0.0016435721,0.0009166027,0.02333341],"category_scores_gemma":[0.0019988024,0.00031091212,0.0004726217,0.00052405434,0.0006701324,0.0015446924,0.0017229837,0.0011762242,0.005626932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009868032,0.0002686495,0.0012559036,0.0007073495,0.00012903253,0.0007587439,0.00037979023,0.40108055,0.04440544,0.12987676,0.035386816,0.3847641],"study_design_scores_gemma":[0.000071241426,0.00017722919,0.0001800617,0.00004605205,0.000023465007,0.00024149344,0.00007664527,0.9049437,0.02158895,0.048481524,0.024131162,0.000038484202],"about_ca_topic_score_codex":0.004342019,"about_ca_topic_score_gemma":0.008512643,"teacher_disagreement_score":0.02333341,"about_ca_system_score_codex":0.0009696863,"about_ca_system_score_gemma":0.0017674429,"threshold_uncertainty_score":0.078058004},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12803164,0.0006679923,0.86598235,0.00019726878,0.00008175515,0.000080431324,0.000044272707,0.00021590659,0.0046983687],"genre_scores_gemma":[0.9340806,0.00034357866,0.06447909,0.000056203335,0.000020837897,0.000034556262,0.00003574137,0.000016822276,0.0009325752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996594,0.00007766044,0.000012061797,0.00005233508,0.00012462643,0.00007391058],"domain_scores_gemma":[0.9996301,0.00011859051,0.00006266696,0.00003367298,0.000121537996,0.00003334886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049166963,0.00039980988,0.00039844718,0.0003212215,0.00045857247,0.00056064187,0.00060297624,0.00030854275,0.00068725355],"category_scores_gemma":[0.0010803858,0.00013230085,0.00020752028,0.00044299054,0.00047808758,0.00065122696,0.000449538,0.0004102198,0.00012476514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022054996,0.0000907945,0.0017415527,0.000095059935,0.000042006155,0.00029190938,0.00012322911,0.827498,0.0532739,0.045755826,0.0015099152,0.069357276],"study_design_scores_gemma":[0.000006755061,0.000032424014,0.00011335596,0.0000030097744,0.000005421698,0.000032301145,0.00001567074,0.9955065,0.0022942505,0.0015942676,0.00038998423,0.0000061849987],"about_ca_topic_score_codex":0.009056522,"about_ca_topic_score_gemma":0.011723081,"teacher_disagreement_score":0.009056522,"about_ca_system_score_codex":0.00083938433,"about_ca_system_score_gemma":0.0017219589,"threshold_uncertainty_score":0.018007576},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03153399,0.0005422777,0.9438791,0.0003363024,0.00005207909,0.00004500893,0.00017948027,0.000083723266,0.023348082],"genre_scores_gemma":[0.90880686,0.0008934921,0.082381226,0.0002743184,0.000119946926,0.00020144517,0.00023598291,0.00007130286,0.007015434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865,0.0005294685,0.000037296537,0.00018548925,0.00040731524,0.00019055104],"domain_scores_gemma":[0.99747556,0.0016483958,0.00027771248,0.00014672583,0.00033618163,0.00011542459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013507201,0.00071449426,0.00077737786,0.00045729347,0.00048499976,0.001940227,0.0005708389,0.0006182536,0.0021722494],"category_scores_gemma":[0.0036348398,0.00034845556,0.0005674001,0.00069551246,0.0015094739,0.0017146344,0.0017218131,0.0015308005,0.00038831495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016141962,0.000105490406,0.00065614673,0.00014280707,0.000033322674,0.00032484686,0.0002889719,0.21032245,0.0046323687,0.7546333,0.0025030638,0.026195802],"study_design_scores_gemma":[0.00003883668,0.00012629142,0.00048150224,0.00003364363,0.000024540373,0.00055786665,0.00016725279,0.7421905,0.005334875,0.245105,0.0059103514,0.000029347406],"about_ca_topic_score_codex":0.0010329256,"about_ca_topic_score_gemma":0.0007299195,"teacher_disagreement_score":0.0021722494,"about_ca_system_score_codex":0.0011052997,"about_ca_system_score_gemma":0.0012440776,"threshold_uncertainty_score":0.008019507},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16433151,0.0037329572,0.8242201,0.00040884988,0.000080861806,0.0000602052,0.0001596776,0.0002985484,0.006707312],"genre_scores_gemma":[0.9544517,0.0022550838,0.040613294,0.00006258908,0.0001058336,0.000076052405,0.00006213992,0.00002584983,0.0023474423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993592,0.00026086837,0.000029912311,0.00008099897,0.0001746935,0.00009440938],"domain_scores_gemma":[0.9981609,0.001256991,0.00021001039,0.00016337822,0.00015395887,0.000054700533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009071926,0.00083189,0.00067012315,0.0006620608,0.00043026332,0.0006754366,0.0007610545,0.0007295864,0.00070470275],"category_scores_gemma":[0.003081456,0.0002882616,0.0002909925,0.0010340766,0.00093386305,0.0013931831,0.0009286543,0.0006585186,0.0002045543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034604353,0.000041686577,0.0005170969,0.00024795585,0.00004893009,0.00061490166,0.00037580318,0.7522264,0.024664316,0.17889477,0.0010804707,0.040941603],"study_design_scores_gemma":[0.000025038431,0.00011020883,0.00017248844,0.000019149758,0.000026033862,0.00021791503,0.00004097975,0.94807655,0.006140931,0.0435179,0.0016298118,0.000023049615],"about_ca_topic_score_codex":0.0013358442,"about_ca_topic_score_gemma":0.0012478615,"teacher_disagreement_score":0.0013358442,"about_ca_system_score_codex":0.00086062343,"about_ca_system_score_gemma":0.00047149629,"threshold_uncertainty_score":0.006244242},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016424246,0.00034698925,0.9890997,0.00031810533,0.000067161236,0.000035024488,0.00006837714,0.00008456877,0.008337656],"genre_scores_gemma":[0.43135825,0.0020769783,0.55394787,0.0008237276,0.00042180624,0.0005979847,0.0002896821,0.00023991475,0.010243785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810565,0.0007978781,0.000084699226,0.0002442365,0.0006061378,0.00016145864],"domain_scores_gemma":[0.9971095,0.0018365787,0.00015539203,0.0005714769,0.00024421435,0.00008283134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002248292,0.0011402821,0.0010854691,0.0007830995,0.0006805579,0.0022437025,0.00189924,0.0011361814,0.005482149],"category_scores_gemma":[0.0069573387,0.0004491977,0.0010597722,0.0011701059,0.00300574,0.003478978,0.002147082,0.003890999,0.001228298],"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.00003083665,0.000021031537,0.00006222341,0.000055372057,0.0000118437865,0.000052850744,0.00006814907,0.072958544,0.0012085226,0.9156061,0.001233268,0.008691233],"study_design_scores_gemma":[0.000020182933,0.00004222155,0.000028897872,0.00003383314,0.000009477755,0.00009287674,0.00002370432,0.47400674,0.0017946623,0.5174253,0.006498851,0.00002319046],"about_ca_topic_score_codex":0.0013785639,"about_ca_topic_score_gemma":0.0011386095,"teacher_disagreement_score":0.005482149,"about_ca_system_score_codex":0.0023156407,"about_ca_system_score_gemma":0.0018466065,"threshold_uncertainty_score":0.018339574},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15220015,0.0011126149,0.826931,0.0013559181,0.00024619128,0.00026825845,0.00066282693,0.0018994883,0.015323576],"genre_scores_gemma":[0.6845952,0.0009555753,0.3012688,0.00055613706,0.0002770485,0.0004551373,0.001190557,0.00041552796,0.010286041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982973,0.0004614745,0.0001344245,0.00023264333,0.0005785577,0.00029556878],"domain_scores_gemma":[0.9846768,0.010281062,0.0008948912,0.0025493198,0.0012179338,0.00037994082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020453492,0.00085467775,0.000956626,0.0008390049,0.00047326842,0.0011613015,0.0010789838,0.0012300425,0.0037020752],"category_scores_gemma":[0.01593502,0.00048288243,0.00047322802,0.0010224846,0.0012443376,0.0034139373,0.0020576818,0.0021711271,0.001030732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095099944,0.00020440604,0.00078987674,0.000385626,0.000036891273,0.00031134541,0.00029032765,0.57583237,0.023916066,0.2821064,0.006071384,0.10910426],"study_design_scores_gemma":[0.00011133723,0.0001593078,0.000201363,0.00007644036,0.000012287581,0.00015562354,0.000040976065,0.87720025,0.008520679,0.110758044,0.002724869,0.000038794657],"about_ca_topic_score_codex":0.001871268,"about_ca_topic_score_gemma":0.0022054203,"teacher_disagreement_score":0.0037020752,"about_ca_system_score_codex":0.0013328615,"about_ca_system_score_gemma":0.0028473171,"threshold_uncertainty_score":0.012384653},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058753774,0.0010738167,0.9348155,0.00026628023,0.000032860546,0.000037598667,0.00002400557,0.00010523219,0.0048909476],"genre_scores_gemma":[0.9137693,0.001452571,0.08240935,0.000072042974,0.000055214565,0.00008109431,0.00003417157,0.000040905587,0.0020853556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943537,0.00027730202,0.000015349977,0.00005399627,0.00015920987,0.000058788177],"domain_scores_gemma":[0.99871767,0.00097265776,0.000099484474,0.000081814804,0.000104092614,0.000024325185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009851017,0.00045669015,0.00041449053,0.0005196076,0.00030893568,0.0005892526,0.00060353044,0.00048874546,0.00042434022],"category_scores_gemma":[0.0029358265,0.00025379608,0.00027633648,0.0008909374,0.00087914494,0.0012392015,0.00066720095,0.0005233617,0.00011868256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034757366,0.000050669278,0.00047032651,0.00012022545,0.000037676877,0.00008763044,0.00014307453,0.87197465,0.010156365,0.079419896,0.00071679923,0.036787935],"study_design_scores_gemma":[0.000006515389,0.000046490863,0.00016249313,0.000009202298,0.000008158968,0.000031443164,0.000024472085,0.9697841,0.0023223863,0.026450714,0.0011469087,0.0000072426883],"about_ca_topic_score_codex":0.00093637296,"about_ca_topic_score_gemma":0.0011867457,"teacher_disagreement_score":0.0009851017,"about_ca_system_score_codex":0.0005451784,"about_ca_system_score_gemma":0.0005049699,"threshold_uncertainty_score":0.005209744},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027756577,0.00031339593,0.9894404,0.00023578727,0.00005762202,0.000020379928,0.00006373859,0.00007289074,0.007020241],"genre_scores_gemma":[0.41300392,0.001966872,0.5769861,0.0005457214,0.00029457858,0.0002586053,0.00021534119,0.00016033166,0.0065686028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992225,0.00026118665,0.000044189263,0.00012186906,0.0002842445,0.00006597921],"domain_scores_gemma":[0.9986627,0.00085968093,0.00008111004,0.00022464959,0.00012578658,0.000046038578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009137919,0.00079718634,0.00069054804,0.00060776854,0.00050133216,0.0016333325,0.0013492847,0.0008486288,0.0029096513],"category_scores_gemma":[0.0039592586,0.00035559246,0.000703506,0.00080309,0.00228732,0.0026133398,0.001528577,0.002988437,0.0005959146],"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.0000377712,0.00002861285,0.00013291315,0.00006924188,0.000011009429,0.00008306823,0.000103753926,0.093794,0.001992139,0.8867219,0.00093550206,0.016089987],"study_design_scores_gemma":[0.00001669616,0.000034797853,0.000051659117,0.00003896643,0.000008330611,0.00008763836,0.000030857427,0.5698764,0.002184028,0.42229813,0.0053502205,0.000022298378],"about_ca_topic_score_codex":0.0017784492,"about_ca_topic_score_gemma":0.0015732568,"teacher_disagreement_score":0.0029096513,"about_ca_system_score_codex":0.0015285915,"about_ca_system_score_gemma":0.0012220639,"threshold_uncertainty_score":0.011090755},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009459363,0.9451303,0.016208733,0.002729651,0.0007363542,0.000043738542,0.0002160002,0.0000690633,0.025406843],"genre_scores_gemma":[0.029848365,0.95820874,0.0064855088,0.0007223449,0.001275841,0.00003338172,0.0003624735,0.00003196626,0.0030313623],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909747,0.00015926294,0.00009647596,0.00020815054,0.00033981825,0.00009881875],"domain_scores_gemma":[0.99693334,0.0019786225,0.0002357272,0.00012893525,0.00058696145,0.00013627356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014039322,0.000804974,0.0009716816,0.0041130395,0.0006764196,0.0022935355,0.0010476974,0.0013932461,0.0033491373],"category_scores_gemma":[0.0030522442,0.0005892947,0.00048360837,0.01015511,0.00092706113,0.0067121997,0.0014376685,0.0016111158,0.0012502457],"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.000077563745,0.00011908923,0.004442797,0.0057927202,0.000059027763,0.0002484678,0.0006418142,0.005311329,0.0012384178,0.07319683,0.019137584,0.8897344],"study_design_scores_gemma":[0.000010686358,0.00028949263,0.0064772354,0.0044474974,0.000103660175,0.0022754266,0.0014948825,0.0069121486,0.0010196577,0.045938037,0.9309372,0.00009417579],"about_ca_topic_score_codex":0.0019819199,"about_ca_topic_score_gemma":0.001618891,"teacher_disagreement_score":0.0041130395,"about_ca_system_score_codex":0.0012091531,"about_ca_system_score_gemma":0.0012118978,"threshold_uncertainty_score":0.011203945},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009258744,0.0005018555,0.117950134,0.0029857948,0.0031888627,0.0008839833,0.028693272,0.052317854,0.7842194],"genre_scores_gemma":[0.03535849,0.00041418942,0.035223365,0.00057045545,0.0002877528,0.0003376195,0.020556586,0.022641888,0.88460964],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999387,0.00006751904,0.000033397173,0.00009863335,0.00026823345,0.00014525012],"domain_scores_gemma":[0.998703,0.0001591876,0.000050305793,0.0004997802,0.0004011682,0.00018648671],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00047375518,0.0009635221,0.000594022,0.00080682326,0.0016315022,0.0043304143,0.0020111096,0.0012578861,0.52172905],"category_scores_gemma":[0.0028551435,0.00058836146,0.00088296545,0.00086562784,0.0005168619,0.0033599173,0.0031455634,0.0019392236,0.5107755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029354045,0.00009130904,0.00053014955,0.00023106467,0.000013294315,0.00017651632,0.00029056694,0.0011690255,0.0043171896,0.023464557,0.854074,0.115348786],"study_design_scores_gemma":[0.000035625682,0.000030552343,0.00048213822,0.00006992234,0.000007370899,0.000111827474,0.000097890086,0.0027780738,0.0072412635,0.0060297986,0.9830867,0.000028871973],"about_ca_topic_score_codex":0.006426711,"about_ca_topic_score_gemma":0.009494969,"teacher_disagreement_score":0.52172905,"about_ca_system_score_codex":0.0010134049,"about_ca_system_score_gemma":0.0010703166,"threshold_uncertainty_score":0.6821954},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05058554,0.0016180826,0.9286788,0.00078737916,0.0001226333,0.00010628635,0.0002631659,0.00023246778,0.017605644],"genre_scores_gemma":[0.8344903,0.0028474857,0.155925,0.0004896215,0.00032143787,0.0003181613,0.00036658646,0.00010537763,0.005136117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785906,0.0008074217,0.00009573079,0.00022176438,0.00070865726,0.0003073337],"domain_scores_gemma":[0.9920099,0.005265952,0.0006536502,0.0009552231,0.000953132,0.00016226446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021864916,0.0012420707,0.0006577577,0.0012424091,0.0006942863,0.00096477877,0.0011010629,0.0010358248,0.0019673044],"category_scores_gemma":[0.012340574,0.00035352688,0.00037914052,0.0017052923,0.0026621227,0.002619346,0.002597527,0.0020480938,0.00044420036],"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.00020045282,0.000037356254,0.000466209,0.00013419215,0.000016220774,0.00017459743,0.00023266298,0.2920069,0.0068213027,0.65786505,0.001768709,0.040276375],"study_design_scores_gemma":[0.00003956308,0.00015471636,0.00019465722,0.00009339283,0.000012088264,0.00024500248,0.00005155611,0.69698775,0.005007669,0.293024,0.0041507315,0.000038862076],"about_ca_topic_score_codex":0.0025272365,"about_ca_topic_score_gemma":0.0015306963,"teacher_disagreement_score":0.0025272365,"about_ca_system_score_codex":0.0016789088,"about_ca_system_score_gemma":0.0016195787,"threshold_uncertainty_score":0.012181401},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058452837,0.001312244,0.9293237,0.0001874732,0.00002489807,0.00004257545,0.00011551551,0.00022166534,0.0103191035],"genre_scores_gemma":[0.95393527,0.0016045696,0.0415049,0.00005866787,0.000043823275,0.00008087916,0.00009790131,0.000032251777,0.0026417708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935323,0.0002038678,0.000025769448,0.00006035828,0.00027102584,0.0000857766],"domain_scores_gemma":[0.99799573,0.0012756105,0.00017456102,0.0001055995,0.0004085377,0.000039964558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011953082,0.0011128776,0.00065225153,0.0006900007,0.0003983363,0.00097527093,0.0005709167,0.0007895225,0.0018494151],"category_scores_gemma":[0.0037328675,0.00031041275,0.00042919684,0.00068692485,0.000520007,0.00087130093,0.00073410926,0.0005734857,0.0005826631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000599356,0.000017651997,0.0005185631,0.000063286556,0.00002373814,0.000109553745,0.00005015721,0.9593461,0.008028603,0.017749282,0.0003404522,0.013692653],"study_design_scores_gemma":[0.0000024156482,0.00004789472,0.00020853702,0.0000068647087,0.0000090501535,0.00007965894,0.000016442644,0.99489504,0.0012434857,0.003250928,0.00023015638,0.0000094637435],"about_ca_topic_score_codex":0.0019330824,"about_ca_topic_score_gemma":0.0016052336,"teacher_disagreement_score":0.0019330824,"about_ca_system_score_codex":0.0009824033,"about_ca_system_score_gemma":0.0006408738,"threshold_uncertainty_score":0.007127881},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08578924,0.0036479675,0.88581485,0.0011969955,0.00035850803,0.00013131391,0.0009506264,0.00046720015,0.021643402],"genre_scores_gemma":[0.9624549,0.0035814599,0.01554139,0.00015018707,0.00025701217,0.00018069035,0.00045366428,0.00012000147,0.017260801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951327,0.0001653671,0.000016055015,0.000078982004,0.000096260104,0.00013003724],"domain_scores_gemma":[0.99863523,0.00078721094,0.00014465016,0.00008695691,0.0002692327,0.00007666664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009216079,0.00124951,0.0011711306,0.0009929589,0.0005592641,0.0014256903,0.0016528269,0.0011084323,0.00310147],"category_scores_gemma":[0.0032504748,0.00057636556,0.00058024237,0.0013596436,0.0012212052,0.001688797,0.00096342753,0.001320855,0.0006576988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049247174,0.00002318007,0.0003725689,0.0000672887,0.000021377586,0.0001593981,0.00009221903,0.94227237,0.00086351525,0.04887183,0.0019649337,0.005242155],"study_design_scores_gemma":[0.000008903843,0.000015175586,0.000107865366,0.0000066909656,0.0000130870885,0.000033400476,0.000017993376,0.9909279,0.00007273473,0.008235766,0.00055170903,0.0000087911085],"about_ca_topic_score_codex":0.009255858,"about_ca_topic_score_gemma":0.0061853817,"teacher_disagreement_score":0.009255858,"about_ca_system_score_codex":0.0013931912,"about_ca_system_score_gemma":0.0007786256,"threshold_uncertainty_score":0.018403947},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04490399,0.00033134542,0.9494565,0.00020986969,0.00004596392,0.000031862666,0.00010029883,0.00013341095,0.0047867605],"genre_scores_gemma":[0.9298574,0.000287015,0.06632687,0.00007753319,0.000042729214,0.000043824093,0.00006471582,0.000016884112,0.0032830732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951184,0.00015023892,0.000023989698,0.000082919025,0.00013774476,0.00009329383],"domain_scores_gemma":[0.99924207,0.0004683987,0.00008248727,0.00007819047,0.00010806957,0.000020851057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052563567,0.0005735158,0.00051583006,0.00033635952,0.0003742326,0.00065607205,0.00072223804,0.00059432274,0.0015119432],"category_scores_gemma":[0.0018503598,0.0002741819,0.00026910304,0.0008638099,0.00058057986,0.0007890035,0.0008608511,0.00039769715,0.00024485114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037439796,0.000060732636,0.00085573056,0.00015098983,0.00005637248,0.00029459703,0.00014648092,0.83451664,0.025513737,0.045728214,0.0015687287,0.09073342],"study_design_scores_gemma":[0.00001773202,0.00004070727,0.00019033543,0.0000077298455,0.000014100009,0.00008829019,0.000017172242,0.9890977,0.0038444875,0.0062874947,0.00038233228,0.000011861729],"about_ca_topic_score_codex":0.00272388,"about_ca_topic_score_gemma":0.0050262623,"teacher_disagreement_score":0.00272388,"about_ca_system_score_codex":0.00064519374,"about_ca_system_score_gemma":0.0008730245,"threshold_uncertainty_score":0.0054160357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049103763,0.0012797775,0.94532746,0.00024036311,0.00003396353,0.000024116845,0.000025328021,0.00014023385,0.0038249209],"genre_scores_gemma":[0.9656225,0.00048508184,0.032355066,0.00006431904,0.00002130549,0.00003369612,0.000018185912,0.000023255345,0.001376519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960977,0.00016729074,0.000011367571,0.000052227333,0.00010665628,0.00005281838],"domain_scores_gemma":[0.9997248,0.00016465594,0.00003301395,0.000020298921,0.000046841404,0.000010385497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055179506,0.00047243657,0.00046774404,0.00029465975,0.00029442023,0.00053369056,0.0004613197,0.000461658,0.0007807416],"category_scores_gemma":[0.0012197776,0.00019590823,0.00024551107,0.0005228621,0.00044213672,0.0007233505,0.0005567542,0.00034199303,0.0001520526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000654661,0.000020213969,0.00036337724,0.000043904813,0.000023064062,0.00008465829,0.00007704513,0.9296956,0.004225826,0.017539589,0.0007891878,0.047072098],"study_design_scores_gemma":[0.0000034482769,0.000020535057,0.00007003489,0.0000029404016,0.000004036661,0.000018339326,0.0000127717185,0.9926523,0.0005923986,0.0062556844,0.00036427422,0.0000031963114],"about_ca_topic_score_codex":0.001465002,"about_ca_topic_score_gemma":0.0013422646,"teacher_disagreement_score":0.001465002,"about_ca_system_score_codex":0.0006726105,"about_ca_system_score_gemma":0.00043211054,"threshold_uncertainty_score":0.0048801303},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022797883,0.00054893375,0.96935654,0.0003933846,0.000080462,0.00011333615,0.0000882332,0.00027457226,0.006346545],"genre_scores_gemma":[0.5910114,0.00078101706,0.40447262,0.00015627008,0.0001329783,0.00026255084,0.00015242286,0.00014429909,0.0028864003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980552,0.00083629624,0.00012845699,0.00039687695,0.00043165617,0.00015147339],"domain_scores_gemma":[0.99455404,0.0029464834,0.00068869157,0.000334323,0.0012794625,0.00019696336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026115794,0.0015293821,0.0012876139,0.00218671,0.0012417407,0.0018696222,0.0013204191,0.0023497539,0.0029996536],"category_scores_gemma":[0.016838763,0.00045779982,0.0004796999,0.0008115821,0.002023755,0.0020115029,0.0016189767,0.0009407466,0.0015964274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006488703,0.0002135904,0.0031929805,0.0007037586,0.000107991276,0.0006737423,0.00043462813,0.6480606,0.05961065,0.14136283,0.0060471646,0.13894321],"study_design_scores_gemma":[0.000110199544,0.0009528313,0.0012301677,0.00016148417,0.0000917002,0.00093349424,0.00036732815,0.918738,0.04224707,0.027759673,0.0072496394,0.00015842138],"about_ca_topic_score_codex":0.0008984267,"about_ca_topic_score_gemma":0.00071588333,"teacher_disagreement_score":0.0029996536,"about_ca_system_score_codex":0.0014045701,"about_ca_system_score_gemma":0.0021277608,"threshold_uncertainty_score":0.013811529},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049373668,0.0023710714,0.78362876,0.00071561756,0.00028498602,0.000086462525,0.0001769677,0.00017857591,0.16318393],"genre_scores_gemma":[0.948919,0.0013653274,0.02357667,0.00012203231,0.00007331921,0.000048385948,0.000059113656,0.000037359536,0.02579876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997727,0.000054072425,0.000008258545,0.000060311566,0.000052210245,0.000052446292],"domain_scores_gemma":[0.99984515,0.000049243456,0.000021571957,0.000025200845,0.000043844673,0.000014983971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020743917,0.00073847745,0.00056181947,0.00022934834,0.00038046928,0.0010593968,0.0005874982,0.00064468116,0.0066456003],"category_scores_gemma":[0.0005317197,0.00016639665,0.00039337098,0.0003034371,0.00042130955,0.0010620594,0.0006073687,0.0005287812,0.0010188378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012486347,0.00005032696,0.00079339184,0.0002800061,0.000046755616,0.001141197,0.00023290286,0.4708146,0.010218022,0.45842117,0.009471127,0.048405603],"study_design_scores_gemma":[0.000024270132,0.00010345686,0.00037129832,0.000042544376,0.000031953095,0.00075626693,0.00016043973,0.87706393,0.0020908741,0.10325429,0.01607842,0.00002232831],"about_ca_topic_score_codex":0.0020973703,"about_ca_topic_score_gemma":0.0019202873,"teacher_disagreement_score":0.0066456003,"about_ca_system_score_codex":0.00092038687,"about_ca_system_score_gemma":0.0005978348,"threshold_uncertainty_score":0.022231698},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002217551,0.029713273,0.6263477,0.0017095081,0.002279954,0.000081054015,0.0004019801,0.0032966437,0.3339523],"genre_scores_gemma":[0.029452402,0.01713358,0.16284545,0.00060160115,0.0011094175,0.00017138699,0.000610381,0.00065315736,0.78742266],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980694,0.000028655817,0.0000064602596,0.00003300215,0.000109877685,0.000015142316],"domain_scores_gemma":[0.99971443,0.00014011255,0.000010616657,0.000060746283,0.000058324713,0.00001577018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027369714,0.00079405395,0.00055983313,0.00063695293,0.00043113416,0.001317882,0.0009189011,0.0009879534,0.028053029],"category_scores_gemma":[0.0009816482,0.00030636953,0.00028512813,0.0015457356,0.0005236878,0.0022731663,0.0008612674,0.001427419,0.012425143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028848917,0.000050302602,0.00006594256,0.00021377373,0.000011646926,0.000043474116,0.000057041212,0.014643166,0.0016460173,0.15209657,0.15112631,0.68001693],"study_design_scores_gemma":[0.000009661027,0.00004835796,0.00025012123,0.00019443333,0.000011403432,0.0002811691,0.00003941054,0.068852074,0.00186888,0.27661407,0.6518096,0.000020873988],"about_ca_topic_score_codex":0.0011400904,"about_ca_topic_score_gemma":0.0016979866,"teacher_disagreement_score":0.028053029,"about_ca_system_score_codex":0.00079780386,"about_ca_system_score_gemma":0.0005359736,"threshold_uncertainty_score":0.09384668},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002645701,0.076823436,0.18479086,0.0027873588,0.004747735,0.00014212268,0.00048193973,0.0011550465,0.7264257],"genre_scores_gemma":[0.04061914,0.0675636,0.050044093,0.0016310678,0.0014188826,0.0002784593,0.00075081835,0.00022764581,0.83746636],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998344,0.000020545407,0.0000054755706,0.00003203486,0.00009166424,0.000015847427],"domain_scores_gemma":[0.9998765,0.00004286501,0.00000726948,0.000017317445,0.000044708664,0.000011364013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014918475,0.00070187,0.00050030276,0.0006718958,0.0005759202,0.0013805954,0.00073196605,0.00082871574,0.017517352],"category_scores_gemma":[0.0005150673,0.00024467122,0.00023101187,0.0012628506,0.0004996846,0.0013176842,0.0008497973,0.0009962944,0.011376024],"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.000017712571,0.00003090477,0.00010248,0.00034862245,0.000020558644,0.00025474548,0.00025373153,0.0079543395,0.0035641345,0.2749868,0.37542215,0.33704382],"study_design_scores_gemma":[0.0000031980812,0.000016268883,0.000083291634,0.000090567635,0.0000044517005,0.00023390836,0.00003660649,0.0051815542,0.00041347469,0.031857967,0.9620698,0.000008913941],"about_ca_topic_score_codex":0.00083845103,"about_ca_topic_score_gemma":0.0017663277,"teacher_disagreement_score":0.017517352,"about_ca_system_score_codex":0.00065181934,"about_ca_system_score_gemma":0.0005491954,"threshold_uncertainty_score":0.05860138},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048156668,0.0009589314,0.9468576,0.000156605,0.00003817322,0.000023620763,0.000011748366,0.00009077755,0.003705891],"genre_scores_gemma":[0.92218786,0.0017976165,0.07417149,0.000085554646,0.0000433957,0.00005976004,0.000013941314,0.000020920728,0.0016194077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961144,0.00014208425,0.00001922406,0.00004575803,0.00013660981,0.000045035387],"domain_scores_gemma":[0.9990188,0.00058579503,0.0001379478,0.00013213369,0.00009948191,0.00002595381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006235256,0.00047603308,0.00033979156,0.0003452162,0.00030985422,0.0007489327,0.00061978254,0.0006164514,0.0004889381],"category_scores_gemma":[0.0016531943,0.00033913733,0.00032918158,0.00038059466,0.0007612573,0.0012013591,0.00057941757,0.0005272995,0.00017900458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083979525,0.000070765345,0.0013968346,0.00020508996,0.000047292393,0.00029287537,0.0002436083,0.7003844,0.09972129,0.13614467,0.0004718907,0.060937375],"study_design_scores_gemma":[0.000008779143,0.00010800164,0.00032660982,0.000020789876,0.000018939782,0.00016277602,0.000051667666,0.9714149,0.0073645874,0.018438648,0.0020614087,0.00002289719],"about_ca_topic_score_codex":0.00045735756,"about_ca_topic_score_gemma":0.00043050395,"teacher_disagreement_score":0.0007489327,"about_ca_system_score_codex":0.00044713783,"about_ca_system_score_gemma":0.00032799182,"threshold_uncertainty_score":0.0032975674},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008807482,0.00010948264,0.987688,0.00016584284,0.000030132947,0.00005977971,0.000026650956,0.000043103395,0.0030696236],"genre_scores_gemma":[0.8108807,0.00036516134,0.18283083,0.0001838861,0.000060738632,0.0004033123,0.00007323006,0.000050284845,0.0051519414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863535,0.00059030816,0.000060942613,0.0002435402,0.00028857443,0.00018129568],"domain_scores_gemma":[0.99824464,0.0011183684,0.00019461612,0.00008396326,0.00020206904,0.00015640409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019726465,0.00091041776,0.0009764257,0.0006606867,0.00087221834,0.0012224044,0.002024098,0.0011308872,0.0022101388],"category_scores_gemma":[0.004213961,0.00051459006,0.0007685664,0.0006575189,0.0016790488,0.002183935,0.0017138558,0.0015385543,0.00022089746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058613037,0.0000311426,0.00024400633,0.0000699538,0.000029124481,0.00022070072,0.00014660814,0.85153806,0.0020117639,0.13692386,0.0006318727,0.008094256],"study_design_scores_gemma":[0.00001394416,0.000020666053,0.000031143416,0.0000046378273,0.0000054299053,0.00002684779,0.000019433319,0.9790125,0.00017308773,0.020182895,0.00050228095,0.000007161756],"about_ca_topic_score_codex":0.0048982,"about_ca_topic_score_gemma":0.0037164898,"teacher_disagreement_score":0.0048982,"about_ca_system_score_codex":0.0017361308,"about_ca_system_score_gemma":0.0023539527,"threshold_uncertainty_score":0.012596607},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38207603,0.0011684558,0.59379,0.001136763,0.00007247102,0.00010725017,0.00046464487,0.0003802465,0.020804225],"genre_scores_gemma":[0.88790166,0.0007423829,0.10365747,0.0002238001,0.000093021015,0.00011499945,0.00037001597,0.00009075386,0.006805901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992466,0.00019019324,0.00003378375,0.00019717964,0.00018371716,0.00014853018],"domain_scores_gemma":[0.99691474,0.0015238682,0.00046660833,0.000549102,0.00025953978,0.00028616787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068996486,0.0005048888,0.00049700047,0.0008652634,0.0009478773,0.0015375928,0.00046731377,0.00069313723,0.002344004],"category_scores_gemma":[0.004324696,0.0004300954,0.00051962945,0.000621945,0.0025374407,0.002664205,0.0012963266,0.0012332962,0.0003810225],"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.000132957,0.00002307709,0.00079532753,0.00007060074,0.000009022625,0.000079042235,0.0002970481,0.028363984,0.0038353584,0.9477692,0.0015107302,0.017113544],"study_design_scores_gemma":[0.000030371335,0.000061235936,0.00032503135,0.00003303046,0.0000074590885,0.00021665037,0.00013055866,0.05400523,0.0041634673,0.93346775,0.0075300015,0.000029190287],"about_ca_topic_score_codex":0.0013778993,"about_ca_topic_score_gemma":0.0011533963,"teacher_disagreement_score":0.002344004,"about_ca_system_score_codex":0.0011455696,"about_ca_system_score_gemma":0.00061773293,"threshold_uncertainty_score":0.0083117485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048377895,0.9928773,0.0017690945,0.00021068778,0.00036960377,0.000023975392,0.00004679574,0.000030596606,0.004187986],"genre_scores_gemma":[0.0031929954,0.9927503,0.0015761623,0.00021289883,0.00025679107,0.000025455018,0.000092975,0.0000063404254,0.0018859823],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997229,0.000037484097,0.000034587007,0.00005154378,0.00012674539,0.00002667304],"domain_scores_gemma":[0.99946827,0.0002532413,0.00006710238,0.000020909429,0.00016658254,0.000023945999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000435626,0.00083453825,0.0008567007,0.0025957737,0.00032329466,0.0007841476,0.0009043075,0.00087756105,0.0042813644],"category_scores_gemma":[0.000953697,0.0003610978,0.00057511416,0.0024347883,0.00026751266,0.0014735276,0.00044074972,0.00079578755,0.0019386995],"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.00004716919,0.00008099887,0.00024306672,0.017707486,0.000061957806,0.00017877959,0.000066142704,0.0011656659,0.003348649,0.005739672,0.023141349,0.9482191],"study_design_scores_gemma":[0.0000074079007,0.00022269998,0.00075257925,0.003818197,0.00014464537,0.0010517841,0.00006925654,0.00074128836,0.0022860796,0.0016315522,0.989238,0.00003649344],"about_ca_topic_score_codex":0.0010518372,"about_ca_topic_score_gemma":0.0011111414,"teacher_disagreement_score":0.0042813644,"about_ca_system_score_codex":0.0004647727,"about_ca_system_score_gemma":0.0009832156,"threshold_uncertainty_score":0.0143226385},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10073405,0.00033308906,0.8941483,0.000239496,0.00004897841,0.00006926727,0.00004924242,0.00017995079,0.0041975956],"genre_scores_gemma":[0.9060879,0.00022957112,0.09219581,0.00008192294,0.000015487458,0.0000544576,0.00005647324,0.000011944655,0.0012664471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999754,0.00007129032,0.000011642998,0.000033397173,0.00009036908,0.000039334904],"domain_scores_gemma":[0.99958557,0.00019413482,0.000054712513,0.000057059475,0.000087566856,0.00002096316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040060212,0.00031533468,0.00020110674,0.00044938165,0.00041889015,0.00033022606,0.0003992782,0.00030877962,0.00058868085],"category_scores_gemma":[0.0009707614,0.000088974644,0.00022760517,0.0004516724,0.00053435407,0.0005836277,0.00066722924,0.00034247298,0.00009804881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004363382,0.00010939078,0.0025108752,0.00017904048,0.00007083901,0.00032126822,0.0003883992,0.5281441,0.09023665,0.09795659,0.0026672236,0.2769793],"study_design_scores_gemma":[0.000020386427,0.000097482734,0.00032668668,0.000010114772,0.00001660094,0.00011033955,0.000054275373,0.9731055,0.016076878,0.008211242,0.0019565392,0.000013963937],"about_ca_topic_score_codex":0.0035964104,"about_ca_topic_score_gemma":0.0050159786,"teacher_disagreement_score":0.0035964104,"about_ca_system_score_codex":0.00066706457,"about_ca_system_score_gemma":0.0010310487,"threshold_uncertainty_score":0.0071510077},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2674264,0.0022890694,0.7141755,0.0005017154,0.000102394406,0.00010270786,0.000413829,0.00089445687,0.014093853],"genre_scores_gemma":[0.9576103,0.0010846535,0.03818051,0.000081773316,0.000071516915,0.000071760674,0.00032000255,0.000047921094,0.0025316775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983473,0.00045253005,0.00007132273,0.00016542515,0.0006504406,0.00031309956],"domain_scores_gemma":[0.99344796,0.0027277095,0.0009057413,0.0006965586,0.0020384234,0.00018359217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011604821,0.0011508267,0.0006984946,0.0010623129,0.0007951993,0.00078069285,0.0006780034,0.00065454346,0.0015002663],"category_scores_gemma":[0.0061540445,0.00027675807,0.00045452797,0.0012120664,0.0012717079,0.0011109096,0.0011553961,0.0006971516,0.0005241118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005903062,0.00004817895,0.0036224632,0.00019115098,0.00008591505,0.00035837325,0.00040210993,0.82830024,0.020428766,0.07012201,0.001764902,0.074085556],"study_design_scores_gemma":[0.00001042497,0.0001846181,0.0006228024,0.000021433409,0.00002358885,0.00021546817,0.00004425323,0.98177296,0.008058901,0.00813299,0.000872649,0.00003986281],"about_ca_topic_score_codex":0.0069409455,"about_ca_topic_score_gemma":0.003800172,"teacher_disagreement_score":0.0069409455,"about_ca_system_score_codex":0.0013753388,"about_ca_system_score_gemma":0.0019431517,"threshold_uncertainty_score":0.013801038},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0091213435,0.023950357,0.821414,0.010154461,0.0015901572,0.00008505732,0.00019397831,0.00048174773,0.13300899],"genre_scores_gemma":[0.5335673,0.044803474,0.35182014,0.0066469912,0.0027274254,0.00033482144,0.0005016283,0.0008078926,0.058790293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747306,0.0008485476,0.00010288672,0.00034999638,0.000991592,0.00023396895],"domain_scores_gemma":[0.9961138,0.002036326,0.00015439473,0.0011883104,0.000355975,0.00015121364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002896537,0.0010297504,0.0011615715,0.0011255655,0.0023046932,0.004470139,0.002317158,0.0025016835,0.0087795155],"category_scores_gemma":[0.00704294,0.00069735956,0.0009735164,0.0021423632,0.0056023328,0.011074531,0.0057045817,0.0051740254,0.00267111],"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.00006202487,0.00002796349,0.00022876232,0.00023611968,0.000023022902,0.0001232885,0.00032777002,0.011069546,0.0018758624,0.87529767,0.008706221,0.10202171],"study_design_scores_gemma":[0.000020558562,0.000060794326,0.00010198373,0.00027520972,0.000021779872,0.0003953411,0.0003028481,0.053387582,0.0034687833,0.7770792,0.16483572,0.000050216368],"about_ca_topic_score_codex":0.0017879469,"about_ca_topic_score_gemma":0.0016261557,"teacher_disagreement_score":0.0087795155,"about_ca_system_score_codex":0.002286986,"about_ca_system_score_gemma":0.0012677967,"threshold_uncertainty_score":0.029370427},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004620871,0.0001219672,0.9935336,0.00014612146,0.000015719786,0.000028761826,0.00003223077,0.00007293204,0.0014277897],"genre_scores_gemma":[0.42576078,0.00093819026,0.565305,0.00033700105,0.00013555515,0.00045706998,0.0003456165,0.00013929933,0.0065814597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868816,0.00057111884,0.000047869522,0.00019215475,0.00034681728,0.0001539073],"domain_scores_gemma":[0.9968491,0.0022025744,0.0002651893,0.0002620635,0.00029983072,0.00012115874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016260411,0.0014850426,0.0011323198,0.00057416473,0.00050583755,0.0011880724,0.0012917436,0.0011293982,0.002640402],"category_scores_gemma":[0.0062367567,0.0005519839,0.0006684972,0.0013602535,0.0017082414,0.002004844,0.002167761,0.0026486157,0.0007232819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023471963,0.00012424111,0.000572541,0.00022305828,0.000062758576,0.00022870538,0.00019667785,0.7111025,0.007875398,0.17364742,0.004405081,0.101326846],"study_design_scores_gemma":[0.000012316742,0.000038566854,0.000029381501,0.000007162606,0.000004105575,0.000034280387,0.000012286627,0.97947043,0.0008087199,0.01909182,0.00048323162,0.000007797502],"about_ca_topic_score_codex":0.0021999592,"about_ca_topic_score_gemma":0.002289733,"teacher_disagreement_score":0.002640402,"about_ca_system_score_codex":0.0009236011,"about_ca_system_score_gemma":0.0017559371,"threshold_uncertainty_score":0.008832991},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004213038,0.00033272675,0.99251634,0.00027801128,0.00003627398,0.00001732527,0.0000238513,0.00008809514,0.0024943454],"genre_scores_gemma":[0.5731774,0.0018206931,0.41501886,0.0007162431,0.00033429914,0.00031120284,0.00019743995,0.0003888609,0.008035029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988726,0.0004361491,0.000028206778,0.00014903935,0.0003561265,0.00015788586],"domain_scores_gemma":[0.9964982,0.002788723,0.00019509926,0.00011969523,0.00029940065,0.000098860175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002531994,0.0013440165,0.0011950949,0.0007377642,0.00044049855,0.0015527672,0.0015402781,0.0011064537,0.002950449],"category_scores_gemma":[0.00587334,0.00063528144,0.0007829746,0.0010994656,0.0016648726,0.0022469265,0.0019777976,0.0029376796,0.00039216457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004853568,0.00005228735,0.00030712786,0.00008761086,0.000028179807,0.000089606496,0.00009780196,0.8243375,0.0011242888,0.14880334,0.0030260806,0.02199771],"study_design_scores_gemma":[0.000004837064,0.000017107894,0.000027331977,0.0000063220846,0.0000038164717,0.000017719754,0.00000914388,0.9755771,0.00016595976,0.023708798,0.00045731262,0.0000046270393],"about_ca_topic_score_codex":0.0016536957,"about_ca_topic_score_gemma":0.0015410205,"teacher_disagreement_score":0.002950449,"about_ca_system_score_codex":0.0015163609,"about_ca_system_score_gemma":0.0015778706,"threshold_uncertainty_score":0.013390601},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015275365,0.071322985,0.9068556,0.01075301,0.00068305625,0.00007195098,0.000042711585,0.000120996345,0.008622236],"genre_scores_gemma":[0.22453506,0.25008935,0.49588084,0.0028785584,0.011026842,0.0009488025,0.00021279993,0.00022354668,0.01420415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99687684,0.0016138771,0.00014937557,0.0003428308,0.0008960013,0.00012108471],"domain_scores_gemma":[0.9931618,0.005417689,0.0002083163,0.00052645407,0.00054239033,0.00014327205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053829206,0.0008870959,0.0013681217,0.0010634545,0.0006895294,0.0033112657,0.0021470657,0.0029404142,0.0016364073],"category_scores_gemma":[0.00892827,0.0005360094,0.0008055112,0.002308906,0.003485464,0.0046126996,0.0023534354,0.0056617013,0.0008215197],"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.00002259379,0.000066110355,0.00059412344,0.0006285541,0.00004941295,0.000096969205,0.00022175928,0.0419427,0.0005439109,0.7713754,0.010057815,0.17440064],"study_design_scores_gemma":[0.000020022055,0.0000421756,0.00016277202,0.00022212174,0.000012050209,0.00015522174,0.00008824108,0.22553016,0.00028626507,0.72683096,0.046620864,0.000029212264],"about_ca_topic_score_codex":0.0012481058,"about_ca_topic_score_gemma":0.00076214137,"teacher_disagreement_score":0.0053829206,"about_ca_system_score_codex":0.0016131473,"about_ca_system_score_gemma":0.0015781327,"threshold_uncertainty_score":0.028467953},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10565513,0.0009184534,0.8879776,0.00023959072,0.00002898474,0.000034040808,0.000092185815,0.00016917674,0.004884761],"genre_scores_gemma":[0.9666732,0.0005926638,0.030796146,0.00003681713,0.000025169984,0.000032775388,0.0000760798,0.000016546075,0.0017507025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995409,0.0001758748,0.000016504922,0.00005754662,0.00013635585,0.00007284918],"domain_scores_gemma":[0.99885726,0.0006095898,0.0001663631,0.00010131374,0.00024442622,0.000020979835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060107064,0.00031251807,0.00046469292,0.0005094876,0.00050236064,0.0005791583,0.000574185,0.00038680114,0.000731112],"category_scores_gemma":[0.0022142006,0.00017855335,0.00032532663,0.0005285305,0.0005467461,0.00062106334,0.0005355061,0.0002711019,0.00018356006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075834134,0.000035083325,0.002286594,0.00011292423,0.00003973832,0.0004658109,0.00023542366,0.87119746,0.009251004,0.07275696,0.0013301084,0.04221305],"study_design_scores_gemma":[0.000003933185,0.00005877446,0.00047678285,0.000008769165,0.000016427295,0.00019421458,0.00006661455,0.9839287,0.0019131283,0.011867465,0.00144924,0.000015933789],"about_ca_topic_score_codex":0.0036346344,"about_ca_topic_score_gemma":0.0042628897,"teacher_disagreement_score":0.0036346344,"about_ca_system_score_codex":0.0009371334,"about_ca_system_score_gemma":0.00069262885,"threshold_uncertainty_score":0.007226944},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010764608,0.0015032919,0.98407346,0.00027207617,0.00026198218,0.00023082944,0.00003952975,0.00039190927,0.0024623391],"genre_scores_gemma":[0.6144938,0.001838742,0.37580487,0.00046916705,0.00039574422,0.0012459117,0.0001840657,0.00005184039,0.005515819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839836,0.0005992323,0.00010206933,0.00012555532,0.00066762517,0.00010714109],"domain_scores_gemma":[0.9978066,0.0007695237,0.00035957072,0.00043622687,0.00056668295,0.00006141307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021509123,0.00073197234,0.0007455418,0.0006922332,0.0006168587,0.0012397493,0.0016074054,0.0008146348,0.0008246868],"category_scores_gemma":[0.004068097,0.00030824664,0.0003402559,0.0006571299,0.0008154662,0.0011374371,0.0011468868,0.001128733,0.0002975094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033771814,0.00039448414,0.0012160543,0.00082246104,0.00050609384,0.0009301369,0.00057898497,0.23969127,0.11708784,0.33753145,0.014167592,0.28673595],"study_design_scores_gemma":[0.00009886764,0.00032582792,0.00036159833,0.000057761346,0.00012626313,0.00047986433,0.000040371782,0.9161186,0.0194438,0.03340719,0.02948553,0.000054173655],"about_ca_topic_score_codex":0.0002979238,"about_ca_topic_score_gemma":0.00038763887,"teacher_disagreement_score":0.0021509123,"about_ca_system_score_codex":0.0005140682,"about_ca_system_score_gemma":0.00072118745,"threshold_uncertainty_score":0.011375248},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066221096,0.005740782,0.80568904,0.0017530987,0.0015401542,0.00006529784,0.00029464957,0.0007270568,0.1775678],"genre_scores_gemma":[0.46828362,0.014233642,0.23162048,0.0012116698,0.0022781948,0.0004647592,0.0012199379,0.0005961233,0.2800916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996031,0.000078517514,0.000015395435,0.000054734137,0.00020953544,0.000038833718],"domain_scores_gemma":[0.99945086,0.00020357763,0.000026957992,0.00018670593,0.000104669234,0.000027159891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035759702,0.00063982105,0.0004515447,0.000717552,0.0004107957,0.0011160196,0.0007031608,0.00072540966,0.009166694],"category_scores_gemma":[0.0013789403,0.00024568738,0.00028012175,0.0012565646,0.0011201532,0.0012159616,0.0010763971,0.0017178825,0.0029278258],"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.000029776738,0.000016153046,0.000052409636,0.00007477381,0.00000965633,0.000034170993,0.000066544155,0.0134939505,0.003937298,0.85473746,0.014605438,0.11294228],"study_design_scores_gemma":[0.000027325008,0.000032193966,0.0001320868,0.00006199315,0.000012203345,0.0002038872,0.000023822753,0.07424017,0.005007152,0.81874067,0.10149502,0.000023483697],"about_ca_topic_score_codex":0.0005076269,"about_ca_topic_score_gemma":0.0005657454,"teacher_disagreement_score":0.009166694,"about_ca_system_score_codex":0.00089143077,"about_ca_system_score_gemma":0.0007268722,"threshold_uncertainty_score":0.030665636},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5978061,0.00085111137,0.3936107,0.00031287325,0.00005335435,0.000076459015,0.000049059414,0.00021893751,0.007021328],"genre_scores_gemma":[0.98886603,0.00008442713,0.010644823,0.000015014311,0.0000083642335,0.000012514719,0.0000072109633,0.0000027578108,0.00035884828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995314,0.00017597748,0.000024962223,0.00007482902,0.000106991334,0.00008596635],"domain_scores_gemma":[0.9983127,0.0010933824,0.00022911478,0.000119414464,0.0001946214,0.000050817158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000868462,0.0008789113,0.0007702928,0.00041937595,0.000374221,0.0005149095,0.00078509154,0.0007546548,0.0005321986],"category_scores_gemma":[0.0023288103,0.00018392043,0.00044198942,0.00055015314,0.0007198691,0.00074863835,0.0005897695,0.00037467666,0.00008145763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011395296,0.000052308173,0.00079770753,0.00004077259,0.00003138151,0.00014187777,0.000060998525,0.96928835,0.0071114562,0.004816161,0.00018720295,0.017357817],"study_design_scores_gemma":[0.000005914693,0.00007041212,0.000114105766,0.0000014675284,0.0000057786046,0.000026964824,0.0000046179616,0.9981742,0.00090304576,0.00064871233,0.000041126877,0.0000035909065],"about_ca_topic_score_codex":0.0029417998,"about_ca_topic_score_gemma":0.0025298113,"teacher_disagreement_score":0.0029417998,"about_ca_system_score_codex":0.00057484314,"about_ca_system_score_gemma":0.0005769303,"threshold_uncertainty_score":0.005849302},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020247743,0.0019159144,0.97195506,0.00038977558,0.00012220087,0.00008100775,0.0000842169,0.00042950147,0.0047745057],"genre_scores_gemma":[0.75723815,0.0035461837,0.2293196,0.00023371866,0.00015886012,0.0003353761,0.00025062112,0.00012232552,0.00879507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995067,0.00016852838,0.000023607292,0.00004770587,0.00021644673,0.000036908878],"domain_scores_gemma":[0.99886644,0.00060713687,0.00010791774,0.00015325745,0.00023405325,0.00003118791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005203898,0.0004145905,0.00039484448,0.00048675973,0.00036856098,0.00049597,0.0005752153,0.000884445,0.0012732907],"category_scores_gemma":[0.0029689712,0.00019132273,0.00035810366,0.00073638005,0.00075446535,0.0006709612,0.00055278704,0.0008060168,0.00044092286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001374256,0.000036732457,0.00061501306,0.00028589816,0.00004479325,0.00031821674,0.00018822333,0.7276158,0.014728725,0.16523369,0.0032079883,0.087587535],"study_design_scores_gemma":[0.000011848827,0.000043378794,0.00012777295,0.000019175037,0.00000874191,0.00009543476,0.000011330916,0.9625413,0.0032008605,0.03163797,0.002289574,0.000012619747],"about_ca_topic_score_codex":0.002688672,"about_ca_topic_score_gemma":0.002073874,"teacher_disagreement_score":0.002688672,"about_ca_system_score_codex":0.00072572223,"about_ca_system_score_gemma":0.00115668,"threshold_uncertainty_score":0.005346},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019966157,0.015833134,0.9086883,0.0035924355,0.0005904671,0.00007787252,0.00045070564,0.0005060581,0.05029483],"genre_scores_gemma":[0.7446743,0.030229656,0.15087298,0.00083578937,0.0012576401,0.0004460586,0.0010038884,0.00020427699,0.070475355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963534,0.00014942637,0.000014853872,0.000035190358,0.00012675159,0.000038375903],"domain_scores_gemma":[0.99923635,0.00048112683,0.00004295293,0.000109200584,0.00011539227,0.000014939714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050150376,0.00035988603,0.00028900514,0.0003458221,0.00014385917,0.00071027695,0.00049353956,0.00046404006,0.0024621517],"category_scores_gemma":[0.0022295944,0.00018165074,0.0001758465,0.0005839101,0.0003917595,0.00090494496,0.00042024156,0.0011236431,0.0008856129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011671492,0.0000437077,0.00024700913,0.00030111292,0.000032891014,0.00017317221,0.00018556445,0.12946856,0.010768609,0.6405144,0.025480175,0.19266814],"study_design_scores_gemma":[0.000039058355,0.00008197447,0.00038464493,0.0001225682,0.000019325353,0.00017024767,0.000039784783,0.5093418,0.0032592565,0.44673184,0.039780658,0.00002888231],"about_ca_topic_score_codex":0.0013145868,"about_ca_topic_score_gemma":0.001196881,"teacher_disagreement_score":0.0024621517,"about_ca_system_score_codex":0.000696935,"about_ca_system_score_gemma":0.0005639911,"threshold_uncertainty_score":0.008236706},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01762027,0.0012907219,0.9759616,0.00017353884,0.00005367509,0.000024993726,0.00003128211,0.00007412046,0.004769727],"genre_scores_gemma":[0.7472463,0.002544257,0.24596477,0.00024334849,0.00014098687,0.00010122617,0.00009014343,0.00003848497,0.003630524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996474,0.000094105126,0.000013812909,0.00004529242,0.00015589694,0.000043560955],"domain_scores_gemma":[0.99929833,0.00038528786,0.00009751017,0.00007554227,0.00012850284,0.000014767591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036157577,0.00060804177,0.00032575184,0.0003155025,0.00045702024,0.0007098885,0.00036186093,0.0007100418,0.001376052],"category_scores_gemma":[0.0016867323,0.00017182251,0.00031257112,0.0006581672,0.00044942315,0.0005670813,0.00043536216,0.000634001,0.00041338487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017985364,0.00008056834,0.0018638939,0.00043651537,0.000074514806,0.00039447838,0.0002590574,0.48709726,0.049792476,0.12541373,0.003108775,0.33129877],"study_design_scores_gemma":[0.0000070783417,0.000102914404,0.00038740478,0.000048340145,0.000030521493,0.00032318218,0.000033995457,0.9704709,0.009062988,0.014652833,0.004851493,0.000028382712],"about_ca_topic_score_codex":0.0018103333,"about_ca_topic_score_gemma":0.003473839,"teacher_disagreement_score":0.0018103333,"about_ca_system_score_codex":0.0008392588,"about_ca_system_score_gemma":0.0007841132,"threshold_uncertainty_score":0.0060893297},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08511206,0.003645306,0.89730954,0.0003583187,0.00020125408,0.000048600992,0.000081844046,0.0005361593,0.012706889],"genre_scores_gemma":[0.9416866,0.0018708607,0.046446487,0.000096347554,0.00018291733,0.000096346084,0.000095376214,0.00007353309,0.009451707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995278,0.00016714021,0.000014838287,0.00007012336,0.00013270868,0.000087274675],"domain_scores_gemma":[0.99808645,0.0013028585,0.00013868848,0.00010444424,0.00031014023,0.00005733714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060183654,0.0005597653,0.00066863955,0.0005449415,0.00038996284,0.0007058094,0.00071653246,0.00049439113,0.0011547508],"category_scores_gemma":[0.0022250938,0.00027574878,0.00025988495,0.00068756245,0.00051144045,0.0006741436,0.00070462585,0.00057179946,0.00049036427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047450824,0.00012777807,0.001349157,0.0002781136,0.00013274948,0.00055519457,0.00036707846,0.77570176,0.029307332,0.03036201,0.0057435273,0.15560082],"study_design_scores_gemma":[0.0000123356895,0.000109408335,0.00026576556,0.000014948635,0.000026531467,0.00017770636,0.000067698544,0.986981,0.005188188,0.0054189838,0.0017256907,0.000011752368],"about_ca_topic_score_codex":0.0017590683,"about_ca_topic_score_gemma":0.002490962,"teacher_disagreement_score":0.0017590683,"about_ca_system_score_codex":0.0004993675,"about_ca_system_score_gemma":0.0005246736,"threshold_uncertainty_score":0.0038630366},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044106017,0.06370733,0.30751094,0.0024048144,0.003959212,0.00016629108,0.00030142453,0.001119265,0.6164201],"genre_scores_gemma":[0.14293927,0.0932332,0.13816378,0.0034429496,0.0044712992,0.00053530524,0.0009773781,0.00037249955,0.6158642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996712,0.000048604612,0.000009833248,0.000071297334,0.00016469597,0.00003431444],"domain_scores_gemma":[0.999765,0.00009130749,0.000015748372,0.000041118165,0.00006438281,0.000022476233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025376413,0.0007603423,0.00038047764,0.00067771587,0.0005240613,0.0020951629,0.0010612797,0.00114613,0.010426803],"category_scores_gemma":[0.0009218573,0.0002499388,0.0002864466,0.0010805468,0.0007870597,0.0017826188,0.001249666,0.0010603247,0.0056522572],"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.000030117617,0.000046332734,0.00009439834,0.00052778487,0.00004367748,0.00019262513,0.00027461097,0.01132256,0.0037969663,0.42629337,0.13361067,0.42376676],"study_design_scores_gemma":[0.000009477076,0.000048598227,0.00014026603,0.00019609644,0.000013370059,0.0004520762,0.00006330599,0.011256706,0.0013221201,0.16367267,0.82280314,0.000022256003],"about_ca_topic_score_codex":0.0005934451,"about_ca_topic_score_gemma":0.00082910364,"teacher_disagreement_score":0.010426803,"about_ca_system_score_codex":0.000718333,"about_ca_system_score_gemma":0.00067938527,"threshold_uncertainty_score":0.034881115},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041549234,0.0035222685,0.006874512,0.0038916373,0.0073610838,0.00014855091,0.0022951278,0.0010808562,0.9744105],"genre_scores_gemma":[0.0016222937,0.002220098,0.0018739777,0.0015040942,0.001282785,0.000103678074,0.00188348,0.0003307349,0.9891788],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924016,0.00008242523,0.000026068994,0.00015782726,0.00040555763,0.000087908214],"domain_scores_gemma":[0.99901104,0.00014045087,0.00003766549,0.0001511621,0.00044240858,0.00021727603],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00075561943,0.0009966072,0.0005720205,0.0017545694,0.0013609735,0.004254141,0.0017427515,0.001821888,0.59605104],"category_scores_gemma":[0.00276909,0.00031619414,0.0005503532,0.0015234584,0.00068050245,0.0032218117,0.0029084687,0.0018805024,0.5074954],"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.000026386993,0.000032483804,0.00009558317,0.0001865494,0.0000025393106,0.000045786273,0.000121019315,0.00012244946,0.00044411703,0.04444664,0.7731466,0.18132983],"study_design_scores_gemma":[0.0000014926028,0.0000053884078,0.000044211814,0.00005172652,7.8063607e-7,0.00002529038,0.000025055117,0.000017548684,0.00006939401,0.0036912835,0.9960657,0.0000022000831],"about_ca_topic_score_codex":0.0016508971,"about_ca_topic_score_gemma":0.0023299549,"teacher_disagreement_score":0.59605104,"about_ca_system_score_codex":0.0012041981,"about_ca_system_score_gemma":0.002027447,"threshold_uncertainty_score":0.57618415},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09700334,0.0011599071,0.89170045,0.00036147147,0.0002537583,0.00008799066,0.00009960061,0.0005843567,0.008749125],"genre_scores_gemma":[0.863506,0.00033002492,0.13225412,0.00012564872,0.00012048226,0.000061444836,0.00006341375,0.000021269243,0.0035175611],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936837,0.00019553304,0.00005298885,0.000119547585,0.0001541595,0.000109378765],"domain_scores_gemma":[0.9987569,0.0005859459,0.0000901652,0.00020434997,0.00031705236,0.000045673765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007937699,0.00087362574,0.0009213906,0.00049628684,0.00080308126,0.00083435455,0.0010459243,0.0009858856,0.0018094452],"category_scores_gemma":[0.0018532781,0.00023723456,0.0006519548,0.0006492841,0.0005427165,0.0008997439,0.00082366937,0.0006585258,0.00045552844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011316532,0.00025795982,0.0022125961,0.00023211281,0.00021963322,0.0005696486,0.0004509982,0.40693885,0.06761049,0.036416512,0.0035489714,0.4804106],"study_design_scores_gemma":[0.000051706844,0.00026383757,0.00041638178,0.000011987369,0.00004969437,0.00028953195,0.000022998336,0.9862683,0.006341031,0.0051702755,0.0010881004,0.000026243044],"about_ca_topic_score_codex":0.0021966414,"about_ca_topic_score_gemma":0.0056023225,"teacher_disagreement_score":0.0021966414,"about_ca_system_score_codex":0.00048607695,"about_ca_system_score_gemma":0.0010459935,"threshold_uncertainty_score":0.0060532093},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38697386,0.00095451815,0.6036842,0.00035801477,0.000075503485,0.00007337266,0.00004897284,0.0002648966,0.007566578],"genre_scores_gemma":[0.9781954,0.000130328,0.020886935,0.00002594086,0.000016317888,0.000015600737,0.000010562281,0.000004131577,0.000714781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962044,0.00014022848,0.000021920117,0.00006609897,0.0000834643,0.00006781388],"domain_scores_gemma":[0.9988005,0.000751959,0.00016254005,0.00009679689,0.00015004711,0.000038202124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007520574,0.0007215968,0.0007109515,0.00036497257,0.0003408689,0.00051965966,0.0008291123,0.000655916,0.0006772788],"category_scores_gemma":[0.0018252617,0.00016724209,0.00044266297,0.0005264412,0.00061031536,0.0006977618,0.00053614506,0.00036958873,0.000105496656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001299928,0.0000653413,0.00072959176,0.000045882414,0.000034434845,0.0001545488,0.00007523005,0.94477594,0.009076385,0.006989711,0.00034349287,0.037579466],"study_design_scores_gemma":[0.000004895919,0.000046898043,0.00008202411,0.0000014033546,0.000005024586,0.000023702692,0.0000040261825,0.99814546,0.00093598216,0.00068640494,0.000060919283,0.0000031922284],"about_ca_topic_score_codex":0.0026531264,"about_ca_topic_score_gemma":0.0027754584,"teacher_disagreement_score":0.0026531264,"about_ca_system_score_codex":0.0005501222,"about_ca_system_score_gemma":0.0005537539,"threshold_uncertainty_score":0.0052753687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03668798,0.00054221606,0.94323504,0.0015982374,0.00010356583,0.000119614066,0.00004343999,0.0004223026,0.017247587],"genre_scores_gemma":[0.9321152,0.00037560618,0.06073441,0.00023928504,0.00007147203,0.00020564666,0.000040121053,0.00006447195,0.0061537726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625945,0.0017014527,0.0001541639,0.00035357816,0.0010259728,0.00050543144],"domain_scores_gemma":[0.9938751,0.003565454,0.00055724167,0.0011089182,0.00056178274,0.00033147776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043209484,0.0005448935,0.00061480765,0.00067213917,0.0015204484,0.00216172,0.0014626043,0.0018483073,0.0022404748],"category_scores_gemma":[0.011516891,0.00050386484,0.00047820748,0.00085323106,0.0035857724,0.004990524,0.0039823246,0.0022455128,0.0005115889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000331204,0.00009235939,0.0010158207,0.00014689662,0.000048624093,0.0005363722,0.0014293619,0.15023695,0.0071413005,0.7517329,0.0048919823,0.08239632],"study_design_scores_gemma":[0.00007637877,0.00016656936,0.00025233434,0.00005391412,0.000029902083,0.0003745181,0.0002496456,0.53108346,0.0033809457,0.45423526,0.010050712,0.000046421683],"about_ca_topic_score_codex":0.0017452079,"about_ca_topic_score_gemma":0.0011441638,"teacher_disagreement_score":0.0043209484,"about_ca_system_score_codex":0.0011026401,"about_ca_system_score_gemma":0.0014987692,"threshold_uncertainty_score":0.022851646},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006238994,0.0054813656,0.0006683684,0.023037655,0.9674634,0.000013657561,0.000030130353,0.000043594675,0.0031994868],"genre_scores_gemma":[0.001032408,0.0053467206,0.00029459916,0.007507129,0.96890277,0.000018889017,0.000025222744,0.000052547963,0.016819678],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99772507,0.0003064061,0.00019965795,0.00027648263,0.0013329285,0.00015939797],"domain_scores_gemma":[0.98939145,0.0036581862,0.000504184,0.00028012827,0.005133729,0.0010322356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034952578,0.0018928554,0.0013863794,0.0026005718,0.0013962155,0.0046275826,0.0014051206,0.0044210535,0.011322291],"category_scores_gemma":[0.012836794,0.00050317775,0.0012353814,0.00084865274,0.0015412604,0.0027994623,0.0009281368,0.010401588,0.007797566],"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.00003881902,0.000011086466,0.000019180612,0.00017315807,0.000010064285,0.00007649537,0.000013781522,0.000056790617,0.00013765189,0.0023045696,0.9876872,0.009471303],"study_design_scores_gemma":[0.000029122899,0.000029686027,0.00012316667,0.00023455075,0.000021451382,0.00018850638,0.00002174421,0.00029760422,0.00023580047,0.002667563,0.99613863,0.00001210176],"about_ca_topic_score_codex":0.00035843748,"about_ca_topic_score_gemma":0.00067821017,"teacher_disagreement_score":0.011322291,"about_ca_system_score_codex":0.0014459478,"about_ca_system_score_gemma":0.0012901238,"threshold_uncertainty_score":0.037876844},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59944737,0.000849889,0.3919928,0.00031269633,0.00005324105,0.0000764515,0.000048735925,0.00021922584,0.0069996556],"genre_scores_gemma":[0.98896885,0.00008362523,0.01054666,0.000014954536,0.0000083220875,0.0000124510525,0.000007135182,0.0000027256942,0.0003551751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995326,0.0001751399,0.000024957944,0.000074669144,0.00010682201,0.00008589155],"domain_scores_gemma":[0.99832636,0.0010820325,0.00022861484,0.000118831944,0.0001934134,0.000050736402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086513767,0.0008807015,0.0007680931,0.00041763356,0.00037434482,0.0005134607,0.00078685576,0.0007545602,0.0005323881],"category_scores_gemma":[0.0023074073,0.0001835436,0.00044200817,0.00054645096,0.0007157326,0.0007469267,0.00058647216,0.0003749389,0.0000817164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115057126,0.000052800715,0.00080410804,0.00004099645,0.000031619413,0.0001429062,0.000061334664,0.96907884,0.0072012413,0.0047901995,0.00018665662,0.017494312],"study_design_scores_gemma":[0.000005954701,0.00007144098,0.000115203555,0.0000014757386,0.000005843616,0.00002723152,0.00000465987,0.9981627,0.00091443583,0.00064593245,0.000041421696,0.000003627017],"about_ca_topic_score_codex":0.0029241478,"about_ca_topic_score_gemma":0.0025151658,"teacher_disagreement_score":0.0029241478,"about_ca_system_score_codex":0.00057368824,"about_ca_system_score_gemma":0.00057651557,"threshold_uncertainty_score":0.0058142543},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038271762,0.00053945766,0.94188184,0.0016833376,0.00010845851,0.00013084167,0.000046220408,0.00046031937,0.016877633],"genre_scores_gemma":[0.933476,0.0003464455,0.059530366,0.00024332842,0.00007367786,0.00020938087,0.00004222595,0.00006760725,0.0060110837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595684,0.0018631539,0.00017388801,0.0003887413,0.0010787135,0.00053850946],"domain_scores_gemma":[0.9937093,0.0036034186,0.00057200977,0.0011908025,0.0005635584,0.00036084908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00457793,0.00056240265,0.00066225295,0.00065447105,0.0016132555,0.0022815296,0.0015641282,0.0019387078,0.002417803],"category_scores_gemma":[0.011785576,0.0005325751,0.00051178713,0.000821182,0.0034857807,0.005300914,0.004380583,0.0023511169,0.0005519539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041384387,0.00011017858,0.0012195024,0.00016858279,0.000057323334,0.00064143713,0.001663386,0.15922803,0.007629515,0.73335445,0.0056328727,0.08988104],"study_design_scores_gemma":[0.00008547599,0.00018380104,0.00028141838,0.000053753785,0.00003342879,0.00039094797,0.0002767408,0.5501489,0.003324887,0.43494838,0.010224122,0.000048034875],"about_ca_topic_score_codex":0.0016827992,"about_ca_topic_score_gemma":0.0011441044,"teacher_disagreement_score":0.00457793,"about_ca_system_score_codex":0.0010899418,"about_ca_system_score_gemma":0.0014739507,"threshold_uncertainty_score":0.024210751},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023372355,0.0006579131,0.99440235,0.000106379804,0.000111474335,0.00006258758,0.000010847666,0.00022457335,0.0020866445],"genre_scores_gemma":[0.33242932,0.002536842,0.64683735,0.00047015143,0.0005365275,0.00081895554,0.00014386668,0.00019304511,0.016033934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862695,0.00049743365,0.000058626396,0.00015659805,0.000569549,0.000090903195],"domain_scores_gemma":[0.9982015,0.00063722685,0.0001231068,0.00016634587,0.0008253079,0.00004643351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022215734,0.00085185166,0.00058503647,0.0006413397,0.00052281725,0.0014476776,0.0017746321,0.0009683984,0.0024866892],"category_scores_gemma":[0.0034769087,0.00055782613,0.0004222528,0.0003870859,0.00056181895,0.0011685275,0.00065130455,0.0016658874,0.0013961723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003306302,0.00025657436,0.0009861536,0.000792281,0.00024661506,0.00044841945,0.00077341177,0.29467058,0.07350809,0.3393156,0.0079659745,0.28070575],"study_design_scores_gemma":[0.00006217562,0.00054128515,0.00034246326,0.00009621695,0.00012466202,0.00035798503,0.0000434141,0.93133056,0.01660481,0.02695845,0.023469182,0.00006876925],"about_ca_topic_score_codex":0.00039509052,"about_ca_topic_score_gemma":0.0008091049,"teacher_disagreement_score":0.0024866892,"about_ca_system_score_codex":0.00073583046,"about_ca_system_score_gemma":0.0010888054,"threshold_uncertainty_score":0.01174891},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025947355,0.0017151654,0.9632289,0.00044086517,0.00007154326,0.000158805,0.00014411783,0.00025038084,0.00804291],"genre_scores_gemma":[0.72386044,0.0028597333,0.26254684,0.000326764,0.00020075234,0.00059106835,0.00039426266,0.00015545504,0.009064695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760914,0.0009488575,0.000079450656,0.00024233448,0.00089498766,0.00022516909],"domain_scores_gemma":[0.9917956,0.0050076325,0.0006788371,0.0006071614,0.0017807487,0.00012998989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002829735,0.0011671704,0.00068499765,0.0011856491,0.0004449295,0.0014268782,0.0011173008,0.00083509786,0.0025416417],"category_scores_gemma":[0.010786221,0.0005395959,0.0005056869,0.0012553313,0.0011970036,0.0017644757,0.00095061853,0.0009574627,0.0005842836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030813826,0.00008076049,0.0008377377,0.00032493722,0.000093385504,0.000082315964,0.00021191609,0.74947983,0.009628986,0.14763403,0.0030715687,0.0882464],"study_design_scores_gemma":[0.000029628984,0.00014294196,0.00019211863,0.00005056246,0.00002730107,0.00009117322,0.000028915867,0.9718401,0.0030764176,0.022591619,0.0019057811,0.000023428936],"about_ca_topic_score_codex":0.0027576592,"about_ca_topic_score_gemma":0.0039390707,"teacher_disagreement_score":0.002829735,"about_ca_system_score_codex":0.0027171709,"about_ca_system_score_gemma":0.0023046855,"threshold_uncertainty_score":0.019714534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019716287,0.00081199966,0.96987975,0.0008324516,0.00017486008,0.00007156929,0.000118164695,0.00037273645,0.008022255],"genre_scores_gemma":[0.84891164,0.0016648284,0.13005814,0.00035815386,0.0003249859,0.00041684904,0.00034691734,0.0001083419,0.017810205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993123,0.00027710557,0.000022220565,0.00007289512,0.00020794525,0.00010742116],"domain_scores_gemma":[0.99795985,0.0014733339,0.00013481715,0.00017754622,0.00022240866,0.00003196303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011536325,0.00045032782,0.0004042203,0.0006394641,0.00033878948,0.0005362242,0.0011075902,0.00068449025,0.0017864173],"category_scores_gemma":[0.0051552635,0.0002610442,0.00031235008,0.0007320888,0.0008352359,0.0010056548,0.0008858167,0.0010275343,0.00046104036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030005848,0.00009001249,0.00033558457,0.0001561706,0.000039928746,0.00016718873,0.00022348975,0.5943265,0.01075716,0.29707637,0.008518526,0.08800905],"study_design_scores_gemma":[0.00002802441,0.000042359487,0.00005692633,0.000011779182,0.0000090154235,0.000027721939,0.000011270334,0.95763963,0.0007309284,0.039722923,0.0017082616,0.000011201935],"about_ca_topic_score_codex":0.0039013324,"about_ca_topic_score_gemma":0.005828129,"teacher_disagreement_score":0.0039013324,"about_ca_system_score_codex":0.0010862325,"about_ca_system_score_gemma":0.0010535101,"threshold_uncertainty_score":0.007881224},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00836703,0.00017976806,0.98914284,0.000065926804,0.00004223003,0.000074632655,0.00003511659,0.00019378259,0.0018986288],"genre_scores_gemma":[0.7296912,0.00038536763,0.26736486,0.00020646019,0.00006851623,0.00027219838,0.00010788331,0.000047185553,0.0018563945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990482,0.00033416064,0.000046703306,0.00015670265,0.00029660802,0.00011772874],"domain_scores_gemma":[0.99890125,0.00026758097,0.00014839334,0.00017097456,0.0004693649,0.00004241626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012161834,0.0006562793,0.0003373885,0.0003300256,0.00041360344,0.0006419026,0.0010035421,0.0004967402,0.0010900674],"category_scores_gemma":[0.0016735834,0.00021428375,0.00027986654,0.00031501675,0.0005017663,0.0007458449,0.0007430968,0.00067694386,0.00028132857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002684878,0.0001217771,0.0015113988,0.00031090528,0.00015190119,0.00038884662,0.00021001762,0.6631056,0.10533808,0.06744044,0.003658011,0.1574946],"study_design_scores_gemma":[0.000014959839,0.00018768576,0.00023070448,0.000013259827,0.000027709139,0.00016779947,0.000018028531,0.97838223,0.014344891,0.003307631,0.0032834823,0.000021729249],"about_ca_topic_score_codex":0.0014552126,"about_ca_topic_score_gemma":0.002018404,"teacher_disagreement_score":0.0014552126,"about_ca_system_score_codex":0.0007495679,"about_ca_system_score_gemma":0.000896994,"threshold_uncertainty_score":0.0064318776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1138705,0.0007899133,0.87763894,0.00013897398,0.000043556705,0.00007691622,0.000033145992,0.00016274967,0.007245283],"genre_scores_gemma":[0.9503095,0.00031773915,0.04766946,0.000027328428,0.00001866771,0.00004806151,0.000012490383,0.000008684803,0.0015880127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994111,0.00020952377,0.000029365538,0.000108663844,0.00016178981,0.00007966919],"domain_scores_gemma":[0.9991374,0.00050569174,0.000110327885,0.00008883934,0.00013612883,0.000021626309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007230169,0.00054643035,0.0007059883,0.00030646095,0.00062181964,0.0008254192,0.00076400983,0.0007344588,0.00064310245],"category_scores_gemma":[0.0026406317,0.00021659237,0.00025364826,0.00055936,0.00066799944,0.0006724688,0.00048318747,0.00036806313,0.00021339745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086854205,0.000049244918,0.00066360424,0.000050391867,0.000023782013,0.00024794217,0.00017343405,0.92186606,0.007580983,0.025218852,0.0004137111,0.043625046],"study_design_scores_gemma":[0.000010685978,0.000046412817,0.00011697817,0.000003522632,0.0000071966065,0.00007464467,0.000025970752,0.99148107,0.0014827533,0.006141403,0.0006019416,0.0000073886035],"about_ca_topic_score_codex":0.003992796,"about_ca_topic_score_gemma":0.0029530032,"teacher_disagreement_score":0.003992796,"about_ca_system_score_codex":0.0007762819,"about_ca_system_score_gemma":0.00070959533,"threshold_uncertainty_score":0.0079391},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3021671,0.002867382,0.6891918,0.00018009984,0.00008112341,0.000045602425,0.00003802345,0.0004467683,0.0049820887],"genre_scores_gemma":[0.9787699,0.00044443877,0.020195492,0.000021559974,0.00003657601,0.000014901025,0.000020549769,0.0000122030715,0.00048446722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99957544,0.00010384198,0.000021779273,0.000045283723,0.00016156059,0.000092109956],"domain_scores_gemma":[0.9988908,0.00043653866,0.00021788271,0.00018271658,0.00024139462,0.00003068406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075524114,0.0004567154,0.00041156608,0.000476761,0.00042909596,0.00056222605,0.00052951684,0.000300842,0.00064349547],"category_scores_gemma":[0.0015231974,0.00014471839,0.0003074416,0.00037100096,0.0005602644,0.0008857914,0.00027274218,0.000396152,0.00014028855],"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.0013306441,0.0002678139,0.007713978,0.0006093324,0.00028695448,0.00077938515,0.00068993546,0.34324756,0.3142772,0.07258346,0.0020467413,0.25616702],"study_design_scores_gemma":[0.00003428406,0.0006597075,0.0029800145,0.000024797719,0.00013689908,0.001215963,0.00008262541,0.9153602,0.06827291,0.007890792,0.0032808562,0.000060909628],"about_ca_topic_score_codex":0.00083899207,"about_ca_topic_score_gemma":0.0009704355,"teacher_disagreement_score":0.00083899207,"about_ca_system_score_codex":0.0005509479,"about_ca_system_score_gemma":0.0004289786,"threshold_uncertainty_score":0.0039973855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007254579,0.00016673353,0.9913339,0.00010093581,0.000012698319,0.000032467822,0.0000127450285,0.00012518195,0.0009607612],"genre_scores_gemma":[0.6825302,0.00043146033,0.31396282,0.00020491678,0.00004120517,0.00038637847,0.00011789621,0.000086125256,0.0022389942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920243,0.00034389546,0.000029244946,0.00012399463,0.00019059138,0.0001098674],"domain_scores_gemma":[0.9980854,0.0013776077,0.00016397852,0.00006950993,0.0002499387,0.000053544944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019398107,0.00095660234,0.0010054345,0.0007905561,0.00061600795,0.00089326047,0.001287885,0.0008136549,0.0011548542],"category_scores_gemma":[0.0050548567,0.0004379072,0.00045226692,0.0010272454,0.00087840814,0.0012130522,0.0012110544,0.0009532864,0.00022590024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000492936,0.000027612992,0.0002614818,0.000026439042,0.000015573454,0.000020117253,0.000045665056,0.9634915,0.0005629162,0.0068173143,0.0005042699,0.028177887],"study_design_scores_gemma":[0.000005554487,0.0000069819325,0.000020648742,0.0000018696963,0.0000016106742,0.000003900429,0.000004929857,0.99803454,0.00012681281,0.0016927609,0.00009866345,0.0000018072359],"about_ca_topic_score_codex":0.0066001024,"about_ca_topic_score_gemma":0.006084546,"teacher_disagreement_score":0.0066001024,"about_ca_system_score_codex":0.0016443213,"about_ca_system_score_gemma":0.0018926068,"threshold_uncertainty_score":0.013123393},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01759896,0.020341165,0.03371513,0.10604897,0.577584,0.0052479766,0.00323483,0.0057336055,0.23049529],"genre_scores_gemma":[0.049808186,0.022682765,0.014246978,0.011684689,0.084572785,0.0011981934,0.0071630864,0.0033624908,0.8052808],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9902422,0.0012092718,0.0005210811,0.0005403239,0.006843753,0.0006433898],"domain_scores_gemma":[0.89063084,0.005669881,0.0021068766,0.0058586197,0.08827391,0.0074598663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008001684,0.0010273076,0.001387129,0.0045906072,0.0037319667,0.0048656412,0.0029873888,0.0026398746,0.10377399],"category_scores_gemma":[0.055126905,0.0005844468,0.0009927483,0.002215272,0.0012666187,0.0028617405,0.003621887,0.0020515304,0.071179114],"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.0000749679,0.00005570802,0.00093712524,0.0007989251,0.000030457488,0.0003552709,0.00011458276,0.00018538587,0.0012544601,0.0017103475,0.86971444,0.124768354],"study_design_scores_gemma":[0.000019633075,0.00004874098,0.0013102342,0.00020503213,0.000022650282,0.0002707723,0.000080413505,0.0009191466,0.0013348676,0.0009551047,0.99480754,0.000025947189],"about_ca_topic_score_codex":0.0030122432,"about_ca_topic_score_gemma":0.007909683,"teacher_disagreement_score":0.10377399,"about_ca_system_score_codex":0.0018005935,"about_ca_system_score_gemma":0.007615045,"threshold_uncertainty_score":0.34715855},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045238115,0.0014061371,0.94701576,0.0002694122,0.00006255136,0.00007684761,0.000040692932,0.00008811008,0.0058024544],"genre_scores_gemma":[0.92596143,0.0012393113,0.07010732,0.00007716888,0.000059417256,0.00014452093,0.000050063747,0.000012854478,0.0023479103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903846,0.0004180028,0.000037551643,0.000119883676,0.00031540982,0.00007086026],"domain_scores_gemma":[0.9993224,0.00032136796,0.00011410942,0.00007416353,0.00014089812,0.00002704604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000988,0.0005537521,0.0005936923,0.00040914363,0.00045926563,0.0010151481,0.00071049295,0.00088389864,0.0006861067],"category_scores_gemma":[0.0017776298,0.00020563533,0.00039342235,0.00085247855,0.00087194284,0.0010981754,0.0008972808,0.0005509151,0.0001884683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000257733,0.00007840954,0.00090202276,0.0004728971,0.00011918073,0.0010721168,0.00047016257,0.6452169,0.046880886,0.24154957,0.0013830052,0.061597075],"study_design_scores_gemma":[0.000046543402,0.0002780168,0.00023970613,0.000019361732,0.00003915167,0.00042359243,0.000049506514,0.9734779,0.0049150144,0.017316192,0.003156001,0.000039035353],"about_ca_topic_score_codex":0.0008823537,"about_ca_topic_score_gemma":0.0006234335,"teacher_disagreement_score":0.0010151481,"about_ca_system_score_codex":0.00064563355,"about_ca_system_score_gemma":0.000614955,"threshold_uncertainty_score":0.005225122},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16355927,0.0014930202,0.81969464,0.00060507003,0.00010632367,0.00007270399,0.00009337764,0.0003446157,0.014031006],"genre_scores_gemma":[0.97314817,0.0007503138,0.020911932,0.00004776652,0.000052901567,0.00006150787,0.000041575382,0.000017966164,0.004967776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942064,0.00024071027,0.000017658123,0.000087142405,0.00013228405,0.00010162013],"domain_scores_gemma":[0.99849427,0.0009952821,0.000109079425,0.00014686181,0.00019995809,0.000054593496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070192886,0.00044827437,0.0004595943,0.00043994948,0.00036214857,0.0007148236,0.00055193994,0.00045184785,0.0011422831],"category_scores_gemma":[0.002168642,0.00026674452,0.00022172736,0.0005835626,0.0006709127,0.00080688286,0.0008555643,0.0005145381,0.0003437059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005382344,0.00008275042,0.0012791025,0.00018241111,0.000058629274,0.0005639777,0.0005815937,0.7455936,0.045687098,0.10042745,0.0041663926,0.100838736],"study_design_scores_gemma":[0.000028016386,0.00018379613,0.00037470352,0.000020303722,0.000022549786,0.00020401384,0.00007029428,0.9619771,0.0071802493,0.026713716,0.0032069876,0.000018196111],"about_ca_topic_score_codex":0.0010903998,"about_ca_topic_score_gemma":0.0012382482,"teacher_disagreement_score":0.0011422831,"about_ca_system_score_codex":0.0006782302,"about_ca_system_score_gemma":0.00066555676,"threshold_uncertainty_score":0.0049209},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059495702,0.0013715844,0.92623514,0.000493475,0.00021564668,0.00015464133,0.00024277136,0.0003592374,0.011431744],"genre_scores_gemma":[0.7731431,0.0012920084,0.21322264,0.00016513799,0.0002362334,0.0002284111,0.00031553966,0.00011419307,0.011282884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995931,0.00017242171,0.000020271911,0.000050069306,0.00009980449,0.00006431541],"domain_scores_gemma":[0.99884087,0.00078270026,0.000095158735,0.000065840395,0.00017038312,0.00004503403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009242147,0.0004981314,0.00050933345,0.0004330567,0.00038879912,0.00100024,0.0007385806,0.0004610258,0.0024865167],"category_scores_gemma":[0.0033261485,0.00028053817,0.00020762597,0.00078560674,0.00032910155,0.0006311487,0.0005350166,0.0005657263,0.00058061304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001562859,0.00006135684,0.00032696725,0.00005686585,0.00002451021,0.000036453366,0.00007298225,0.8889292,0.00277035,0.022068944,0.0031296,0.08236649],"study_design_scores_gemma":[0.00001697604,0.000026751337,0.00006680079,0.0000044691137,0.000003996974,0.000009948664,0.000011633817,0.9929571,0.00033916952,0.0058152233,0.00074504944,0.0000028117106],"about_ca_topic_score_codex":0.0039916523,"about_ca_topic_score_gemma":0.0049268426,"teacher_disagreement_score":0.0039916523,"about_ca_system_score_codex":0.0010411891,"about_ca_system_score_gemma":0.0012990556,"threshold_uncertainty_score":0.008318245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048156668,0.0009589314,0.9468576,0.000156605,0.00003817322,0.000023620763,0.000011748366,0.00009077755,0.003705891],"genre_scores_gemma":[0.92218786,0.0017976165,0.07417149,0.000085554646,0.0000433957,0.00005976004,0.000013941314,0.000020920728,0.0016194077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961144,0.00014208425,0.00001922406,0.00004575803,0.00013660981,0.000045035387],"domain_scores_gemma":[0.9990188,0.00058579503,0.0001379478,0.00013213369,0.00009948191,0.00002595381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006235256,0.00047603308,0.00033979156,0.0003452162,0.00030985422,0.0007489327,0.00061978254,0.0006164514,0.0004889381],"category_scores_gemma":[0.0016531943,0.00033913733,0.00032918158,0.00038059466,0.0007612573,0.0012013591,0.00057941757,0.0005272995,0.00017900458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083979525,0.000070765345,0.0013968346,0.00020508996,0.000047292393,0.00029287537,0.0002436083,0.7003844,0.09972129,0.13614467,0.0004718907,0.060937375],"study_design_scores_gemma":[0.000008779143,0.00010800164,0.00032660982,0.000020789876,0.000018939782,0.00016277602,0.000051667666,0.9714149,0.0073645874,0.018438648,0.0020614087,0.00002289719],"about_ca_topic_score_codex":0.00045735756,"about_ca_topic_score_gemma":0.00043050395,"teacher_disagreement_score":0.0007489327,"about_ca_system_score_codex":0.00044713783,"about_ca_system_score_gemma":0.00032799182,"threshold_uncertainty_score":0.0032975674},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08340348,0.0018423407,0.8889795,0.0030883166,0.0004300248,0.00008409714,0.00008399183,0.00017897796,0.021909188],"genre_scores_gemma":[0.88624907,0.0018618795,0.10672741,0.00035031905,0.00047838158,0.000102781865,0.00006152875,0.00005114815,0.0041174176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988092,0.00052623276,0.000046037563,0.00010378307,0.00033158014,0.00018311682],"domain_scores_gemma":[0.9916721,0.006448863,0.00035061088,0.0006999066,0.0007126724,0.00011579675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030875206,0.00044998256,0.00080179283,0.000953143,0.0009211184,0.002052915,0.0012335483,0.002064618,0.0019352667],"category_scores_gemma":[0.010776899,0.0002971494,0.0003402058,0.0012481759,0.0013962121,0.0039816783,0.0013749335,0.0013400153,0.0002087708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031618914,0.0000921572,0.0007440415,0.00014053567,0.000039149254,0.00010228127,0.00029607164,0.14053987,0.008476902,0.7086582,0.002567072,0.13802744],"study_design_scores_gemma":[0.000039367525,0.00010333694,0.00018918682,0.000054817283,0.00004872166,0.00014198317,0.00010672319,0.6649728,0.003617177,0.32703722,0.00366291,0.000025760597],"about_ca_topic_score_codex":0.0013965593,"about_ca_topic_score_gemma":0.0015712619,"teacher_disagreement_score":0.0030875206,"about_ca_system_score_codex":0.0011211396,"about_ca_system_score_gemma":0.0012298697,"threshold_uncertainty_score":0.016328573},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058753774,0.0010738167,0.9348155,0.00026628023,0.000032860546,0.000037598667,0.00002400557,0.00010523219,0.0048909476],"genre_scores_gemma":[0.9137693,0.001452571,0.08240935,0.000072042974,0.000055214565,0.00008109431,0.00003417157,0.000040905587,0.0020853556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943537,0.00027730202,0.000015349977,0.00005399627,0.00015920987,0.000058788177],"domain_scores_gemma":[0.99871767,0.00097265776,0.000099484474,0.000081814804,0.000104092614,0.000024325185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009851017,0.00045669015,0.00041449053,0.0005196076,0.00030893568,0.0005892526,0.00060353044,0.00048874546,0.00042434022],"category_scores_gemma":[0.0029358265,0.00025379608,0.00027633648,0.0008909374,0.00087914494,0.0012392015,0.00066720095,0.0005233617,0.00011868256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034757366,0.000050669278,0.00047032651,0.00012022545,0.000037676877,0.00008763044,0.00014307453,0.87197465,0.010156365,0.079419896,0.00071679923,0.036787935],"study_design_scores_gemma":[0.000006515389,0.000046490863,0.00016249313,0.000009202298,0.000008158968,0.000031443164,0.000024472085,0.9697841,0.0023223863,0.026450714,0.0011469087,0.0000072426883],"about_ca_topic_score_codex":0.00093637296,"about_ca_topic_score_gemma":0.0011867457,"teacher_disagreement_score":0.0009851017,"about_ca_system_score_codex":0.0005451784,"about_ca_system_score_gemma":0.0005049699,"threshold_uncertainty_score":0.005209744},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08206822,0.0003875118,0.9146759,0.0001964318,0.000033388133,0.000058307127,0.000029799285,0.00014224894,0.0024081646],"genre_scores_gemma":[0.9508293,0.00021666367,0.04734452,0.000067841385,0.0000158159,0.000072110175,0.000024642963,0.000007880497,0.0014211136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990464,0.00023704988,0.00005693067,0.00024930545,0.0002730942,0.00013728334],"domain_scores_gemma":[0.9991586,0.0002949306,0.00017167535,0.00013491063,0.00018127187,0.000058620757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010309897,0.00086261844,0.0011406699,0.00050874945,0.0006738739,0.0008748152,0.0024101667,0.00079282955,0.00046209412],"category_scores_gemma":[0.0020669694,0.00037069566,0.0005952938,0.0010811419,0.0009672324,0.0011301435,0.0017271438,0.00055381784,0.0001648781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050506025,0.00015469862,0.0011334742,0.00019276787,0.00017975396,0.0008009514,0.00095120544,0.7856002,0.06403304,0.051395588,0.0016221454,0.09343117],"study_design_scores_gemma":[0.000032556138,0.0001479785,0.00013369293,0.0000072895314,0.000037605027,0.00018129425,0.000047852234,0.99041396,0.0035732593,0.004771899,0.0006278225,0.00002482411],"about_ca_topic_score_codex":0.0018436015,"about_ca_topic_score_gemma":0.0015749802,"teacher_disagreement_score":0.0024101667,"about_ca_system_score_codex":0.00073117507,"about_ca_system_score_gemma":0.00094428705,"threshold_uncertainty_score":0.0054525137},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1138705,0.0007899133,0.87763894,0.00013897398,0.000043556705,0.00007691622,0.000033145992,0.00016274967,0.007245283],"genre_scores_gemma":[0.9503095,0.00031773915,0.04766946,0.000027328428,0.00001866771,0.00004806151,0.000012490383,0.000008684803,0.0015880127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994111,0.00020952377,0.000029365538,0.000108663844,0.00016178981,0.00007966919],"domain_scores_gemma":[0.9991374,0.00050569174,0.000110327885,0.00008883934,0.00013612883,0.000021626309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007230169,0.00054643035,0.0007059883,0.00030646095,0.00062181964,0.0008254192,0.00076400983,0.0007344588,0.00064310245],"category_scores_gemma":[0.0026406317,0.00021659237,0.00025364826,0.00055936,0.00066799944,0.0006724688,0.00048318747,0.00036806313,0.00021339745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086854205,0.000049244918,0.00066360424,0.000050391867,0.000023782013,0.00024794217,0.00017343405,0.92186606,0.007580983,0.025218852,0.0004137111,0.043625046],"study_design_scores_gemma":[0.000010685978,0.000046412817,0.00011697817,0.000003522632,0.0000071966065,0.00007464467,0.000025970752,0.99148107,0.0014827533,0.006141403,0.0006019416,0.0000073886035],"about_ca_topic_score_codex":0.003992796,"about_ca_topic_score_gemma":0.0029530032,"teacher_disagreement_score":0.003992796,"about_ca_system_score_codex":0.0007762819,"about_ca_system_score_gemma":0.00070959533,"threshold_uncertainty_score":0.0079391},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070155796,0.06594818,0.04053547,0.0018199683,0.01169812,0.00031222872,0.004207176,0.0033665323,0.87141067],"genre_scores_gemma":[0.0019672248,0.04342681,0.011193723,0.0007789616,0.0021108382,0.00021871437,0.002983544,0.00093201397,0.93638813],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994981,0.000057567315,0.00003297887,0.00008255619,0.0002853704,0.0000433552],"domain_scores_gemma":[0.9991671,0.00023143977,0.00005963647,0.000107870976,0.00032270362,0.00011133848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003604665,0.0018980986,0.0016006306,0.0037136904,0.0005151694,0.0034381694,0.0014744498,0.0010200391,0.22514647],"category_scores_gemma":[0.0013260084,0.00047957047,0.00035254797,0.006046599,0.00044540814,0.0023504894,0.0014544824,0.0014598867,0.20941718],"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.000019374544,0.000035572626,0.000060248272,0.0005962043,0.000008849561,0.00004878458,0.000024976584,0.0007413807,0.0007767653,0.012040241,0.7148236,0.27082396],"study_design_scores_gemma":[0.0000033876318,0.000012280188,0.000097986944,0.00018982064,0.0000045261286,0.00012405045,0.00001448332,0.0005015948,0.00010870968,0.0036447647,0.9952918,0.0000065701715],"about_ca_topic_score_codex":0.0017242532,"about_ca_topic_score_gemma":0.0032482834,"teacher_disagreement_score":0.22514647,"about_ca_system_score_codex":0.00088701944,"about_ca_system_score_gemma":0.0015057771,"threshold_uncertainty_score":0.75319},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06071889,0.0023123522,0.92881,0.00045770538,0.00008046554,0.000054422242,0.000055587898,0.0001230012,0.007387572],"genre_scores_gemma":[0.93501,0.0019829764,0.058915216,0.00008795046,0.00007744986,0.00013402315,0.000063239386,0.000036643385,0.00369238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995608,0.00018875518,0.000016010135,0.00006782588,0.000085406,0.00008126339],"domain_scores_gemma":[0.99952435,0.00027154287,0.00006626314,0.000047456953,0.000063743486,0.000026653886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001113288,0.00046535544,0.00043745138,0.00023856832,0.00038412304,0.00088002457,0.0006461371,0.00055263506,0.0007539813],"category_scores_gemma":[0.0019591472,0.00031149868,0.00029471115,0.00050280907,0.00047188185,0.0007652237,0.00070996565,0.00052701856,0.0001895395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006476879,0.000035644196,0.00040125963,0.00007226894,0.000029096216,0.00014501248,0.00012922953,0.8990226,0.0057160743,0.05711581,0.0014743024,0.035793964],"study_design_scores_gemma":[0.0000051310885,0.000025968979,0.00009285969,0.000004390535,0.0000053513663,0.000020867912,0.000021571026,0.98971564,0.0007155506,0.00840112,0.0009854471,0.0000060826346],"about_ca_topic_score_codex":0.0026878563,"about_ca_topic_score_gemma":0.0023915248,"teacher_disagreement_score":0.0026878563,"about_ca_system_score_codex":0.0009388555,"about_ca_system_score_gemma":0.0008869151,"threshold_uncertainty_score":0.0068119764},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079450674,0.0009384456,0.91668177,0.00023485316,0.000057131125,0.00004661626,0.000067322115,0.00014549415,0.0023777299],"genre_scores_gemma":[0.93593305,0.0007085942,0.06104676,0.00006537928,0.000039366627,0.00010125098,0.000049964427,0.000034819772,0.002020818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912816,0.00040049438,0.000028608492,0.00013444595,0.00015247935,0.00015586278],"domain_scores_gemma":[0.9978436,0.0016462447,0.0002088499,0.00006921476,0.00016147937,0.000070507114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016927836,0.0009593689,0.0009980506,0.0007238025,0.00050322094,0.0014946259,0.0012043312,0.0008887656,0.0008758094],"category_scores_gemma":[0.0050061117,0.00072416815,0.00029710462,0.00102151,0.000846398,0.0017523668,0.0009103097,0.00062450033,0.0001907615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091877824,0.000036787227,0.0002753417,0.000044735163,0.000014705666,0.00008054518,0.000050072395,0.9733272,0.0019206696,0.014490164,0.00028740297,0.00938043],"study_design_scores_gemma":[0.0000065360628,0.000018685025,0.00003364344,0.0000021581805,0.0000044012986,0.000013969248,0.000007561573,0.99621886,0.00038696243,0.0031785634,0.00012464414,0.000004009626],"about_ca_topic_score_codex":0.0024428244,"about_ca_topic_score_gemma":0.0024664034,"teacher_disagreement_score":0.0024428244,"about_ca_system_score_codex":0.0013248293,"about_ca_system_score_gemma":0.0012979637,"threshold_uncertainty_score":0.009612381},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051261944,0.025513707,0.0085817315,0.0029573126,0.008055423,0.00013435177,0.007081226,0.0011799538,0.9459837],"genre_scores_gemma":[0.0035021468,0.025325317,0.005855522,0.0012714516,0.0018297111,0.00014631693,0.009497841,0.000741424,0.9518303],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994438,0.00006915052,0.000033133343,0.00007517687,0.000336787,0.000041934352],"domain_scores_gemma":[0.9983419,0.0003588393,0.000054278895,0.00019053768,0.00094139256,0.00011300595],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005402461,0.001009962,0.0009089369,0.008431184,0.001562173,0.0023861988,0.001492745,0.00095448934,0.33966723],"category_scores_gemma":[0.004169292,0.00029845344,0.00041492956,0.012162044,0.00048454158,0.0025023215,0.0012093323,0.0012701071,0.25795174],"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.0000061533106,0.0000150840915,0.000046244026,0.00019994698,0.0000023908,0.000018192266,0.00002521503,0.00016502541,0.00006022696,0.006138471,0.9024875,0.09083556],"study_design_scores_gemma":[0.0000017610108,0.0000033408553,0.00008155838,0.00018689527,0.0000053923172,0.00003453271,0.00002105393,0.00007655332,0.00007988492,0.0027220384,0.9967835,0.0000035779476],"about_ca_topic_score_codex":0.009083368,"about_ca_topic_score_gemma":0.020145878,"teacher_disagreement_score":0.6603328,"about_ca_system_score_codex":0.0015334053,"about_ca_system_score_gemma":0.0025016717,"threshold_uncertainty_score":0.9418846},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002813088,0.0017680593,0.99171257,0.00023089425,0.00013212513,0.0001593808,0.000018038012,0.00013007858,0.0030357614],"genre_scores_gemma":[0.39393628,0.005712252,0.5857416,0.00037535388,0.00040639364,0.002056147,0.00013700158,0.00015117979,0.011483843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835855,0.00072356994,0.00009572282,0.00014404273,0.0005896421,0.00008848686],"domain_scores_gemma":[0.9983851,0.00077684066,0.00014461558,0.00017917859,0.0004593996,0.00005493492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024445131,0.0008080266,0.00073094346,0.0005654697,0.0006583137,0.0015063917,0.002001156,0.0009910937,0.002092263],"category_scores_gemma":[0.004722357,0.0004906284,0.0004350048,0.0006656887,0.0009262092,0.0016211986,0.0012126421,0.0010102417,0.00073039235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011444227,0.000094351555,0.00039458962,0.00049389625,0.00013236322,0.0003210288,0.0005065457,0.5118088,0.01048202,0.301495,0.0057564536,0.1684006],"study_design_scores_gemma":[0.000048335125,0.00019265838,0.00008718388,0.00006854388,0.00006294405,0.0001347887,0.00009755866,0.8917007,0.002176779,0.08555206,0.019852879,0.000025632184],"about_ca_topic_score_codex":0.000893035,"about_ca_topic_score_gemma":0.0013938559,"teacher_disagreement_score":0.0024445131,"about_ca_system_score_codex":0.0009255899,"about_ca_system_score_gemma":0.0013235462,"threshold_uncertainty_score":0.012928009},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00989866,0.06852686,0.8908026,0.0012758325,0.00020837307,0.00012436141,0.00017853509,0.00029049002,0.028694306],"genre_scores_gemma":[0.3256786,0.18584426,0.4779199,0.00038203422,0.00067649706,0.00039182563,0.00073655316,0.00017868364,0.008191663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990626,0.0003783822,0.000058643527,0.00013974863,0.0002898303,0.00007085913],"domain_scores_gemma":[0.9989838,0.0006397365,0.00009775616,0.00008262939,0.00015414665,0.000041939158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010459865,0.001092409,0.0009231889,0.0012726658,0.0005257407,0.0016186159,0.0015715611,0.000960696,0.0031190536],"category_scores_gemma":[0.0025133993,0.00063918077,0.0006787983,0.0029752941,0.00077938096,0.00193389,0.000999205,0.0006792957,0.00082913996],"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.000048308302,0.000060463983,0.0009950751,0.0016471678,0.000059683636,0.00014764167,0.00016403651,0.46584228,0.0015312891,0.117721006,0.0054317336,0.40635127],"study_design_scores_gemma":[0.0000323514,0.00019373685,0.00071608956,0.0006919558,0.000065774046,0.0003609168,0.00035899392,0.74013287,0.003375977,0.13517064,0.11885574,0.000044975393],"about_ca_topic_score_codex":0.002194005,"about_ca_topic_score_gemma":0.002309426,"teacher_disagreement_score":0.0031190536,"about_ca_system_score_codex":0.0012174057,"about_ca_system_score_gemma":0.0011328032,"threshold_uncertainty_score":0.01043427},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2789916,0.0016037145,0.68141466,0.0004897242,0.00040338203,0.00034164664,0.0002637119,0.003248944,0.03324255],"genre_scores_gemma":[0.8456956,0.0009020201,0.11976025,0.00009549503,0.00011554867,0.00017758356,0.00015661924,0.00015717496,0.03293971],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999143,0.00012496195,0.000062212486,0.0001856594,0.000350998,0.00013312105],"domain_scores_gemma":[0.9987979,0.00026767273,0.0001549459,0.00038759332,0.00032671329,0.00006519364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070704875,0.0009861009,0.0004627279,0.00088905107,0.0009863883,0.0018893812,0.0010062879,0.00066935434,0.008786852],"category_scores_gemma":[0.0020203441,0.0003471351,0.0004957776,0.0007215875,0.0005566258,0.0020488366,0.0012219162,0.0007918212,0.0014948195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00187023,0.00039193663,0.012309753,0.0008846663,0.00030751125,0.002116149,0.0029300426,0.10459338,0.3382872,0.085913256,0.0077887434,0.44260707],"study_design_scores_gemma":[0.00010922679,0.0017479622,0.00901087,0.00015752812,0.00037906825,0.003090045,0.0020719669,0.43975085,0.41454569,0.018966228,0.11003189,0.00013866334],"about_ca_topic_score_codex":0.002353533,"about_ca_topic_score_gemma":0.003821772,"teacher_disagreement_score":0.008786852,"about_ca_system_score_codex":0.001221674,"about_ca_system_score_gemma":0.0007848682,"threshold_uncertainty_score":0.029394984},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17734051,0.0022013574,0.80455226,0.0003795739,0.000069407535,0.000054311568,0.00011675169,0.00045861784,0.014827235],"genre_scores_gemma":[0.9719045,0.00071751606,0.026142055,0.000044929577,0.000050735936,0.000027450811,0.000049416503,0.000031049178,0.0010322742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908984,0.00030607093,0.00004055718,0.00007733129,0.00036450368,0.00012175088],"domain_scores_gemma":[0.99777395,0.0012121823,0.0003480076,0.00025980012,0.00036804492,0.00003796629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017186366,0.0006942939,0.0009541038,0.00048542503,0.00042281047,0.00095059955,0.000590983,0.0005706109,0.0010418101],"category_scores_gemma":[0.004326849,0.0002370867,0.0003985623,0.000660829,0.00086207205,0.0008251553,0.00070429756,0.00047845682,0.00030996324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002610085,0.0000710836,0.0020092104,0.0003360428,0.000106158775,0.0013045294,0.0005611634,0.8406987,0.039362732,0.058218107,0.0023219516,0.05474928],"study_design_scores_gemma":[0.000009814022,0.00008540653,0.000578429,0.000024421053,0.00005112152,0.0005193573,0.000054646884,0.98631847,0.0070605516,0.004389025,0.0008860634,0.00002275752],"about_ca_topic_score_codex":0.0017324061,"about_ca_topic_score_gemma":0.0011020977,"teacher_disagreement_score":0.0017324061,"about_ca_system_score_codex":0.00084568816,"about_ca_system_score_gemma":0.0005704214,"threshold_uncertainty_score":0.009089172},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02754453,0.007943193,0.9071643,0.0035747846,0.00029203267,0.00008696525,0.00050294603,0.00041027463,0.05248087],"genre_scores_gemma":[0.88609636,0.011177584,0.066650026,0.0012452739,0.0013916048,0.0007925183,0.0008760565,0.00037425454,0.031396322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973707,0.0012226247,0.0000626558,0.0003513556,0.0006733442,0.00031937112],"domain_scores_gemma":[0.9783966,0.017302407,0.0012789064,0.0010610354,0.001417171,0.0005438108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003863874,0.0020193195,0.0012948668,0.0023755662,0.0009316111,0.0037193068,0.0035715948,0.002296903,0.0064165764],"category_scores_gemma":[0.023705237,0.00089662184,0.0009678823,0.0030303318,0.0024614576,0.0073627234,0.0030472032,0.004458392,0.0011296382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070477116,0.000066854045,0.00039719237,0.00015522032,0.000048818674,0.00009848589,0.00033490008,0.26911354,0.00077197445,0.70557564,0.009121148,0.014245699],"study_design_scores_gemma":[0.000012140329,0.000031608764,0.00016489046,0.000058768444,0.000022867209,0.0000493396,0.000068462716,0.5694508,0.00018496183,0.4265294,0.0034105238,0.000016116195],"about_ca_topic_score_codex":0.0049181306,"about_ca_topic_score_gemma":0.003970629,"teacher_disagreement_score":0.0064165764,"about_ca_system_score_codex":0.0040494353,"about_ca_system_score_gemma":0.0011582987,"threshold_uncertainty_score":0.029380858},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3904581,0.011333076,0.55809623,0.0016384721,0.00041423252,0.00014592106,0.00028401008,0.0008312765,0.03679871],"genre_scores_gemma":[0.9820301,0.000719452,0.011606639,0.000048659273,0.00007452928,0.000034213324,0.00003690012,0.00002001707,0.005429404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997423,0.00011002566,0.000011612523,0.00004536564,0.000043639026,0.000047087313],"domain_scores_gemma":[0.99962354,0.00021553207,0.000040485767,0.000028368695,0.00006338511,0.000028589477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048791082,0.00021418837,0.0003080654,0.00020127228,0.000366524,0.0010956347,0.0005509201,0.00032109075,0.0014776123],"category_scores_gemma":[0.0013369839,0.00012290842,0.00008639545,0.00024787252,0.00029458335,0.0006885057,0.0003749777,0.0003075108,0.00042646716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004831294,0.00026897612,0.0018657607,0.00018219407,0.00008945514,0.00061975495,0.00034883365,0.5840743,0.062179863,0.048261497,0.009530336,0.29209593],"study_design_scores_gemma":[0.000016874754,0.00012431401,0.00058044266,0.000010147525,0.000021289943,0.00012688586,0.000105245264,0.98368454,0.0038094472,0.0075669033,0.003940703,0.000013177588],"about_ca_topic_score_codex":0.0026280282,"about_ca_topic_score_gemma":0.0032467255,"teacher_disagreement_score":0.0026280282,"about_ca_system_score_codex":0.0006743476,"about_ca_system_score_gemma":0.0003701432,"threshold_uncertainty_score":0.0052254796},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041673025,0.010667201,0.9131358,0.00038381436,0.00051089545,0.000072766816,0.0002066558,0.0004512977,0.0704042],"genre_scores_gemma":[0.39695787,0.028125772,0.38428172,0.0011602333,0.0027422132,0.0006913108,0.0017904256,0.0013971555,0.18285334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999474,0.00011285026,0.000023394392,0.000083763916,0.00025818628,0.000047832775],"domain_scores_gemma":[0.9992993,0.00038485945,0.00004138799,0.00009567788,0.00015747816,0.000021342556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047446607,0.0011688893,0.0007857157,0.0013510815,0.0005395215,0.0015223251,0.0013773167,0.0007189887,0.0049616285],"category_scores_gemma":[0.0014334469,0.00034388405,0.00043480602,0.0018923043,0.0010846065,0.0022489352,0.000753806,0.0018055007,0.0029811705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007824054,0.00011792389,0.00036201507,0.00054608483,0.000035408524,0.00027184412,0.00035923946,0.060502835,0.034512285,0.5887776,0.037360672,0.27707592],"study_design_scores_gemma":[0.00000785577,0.00013149373,0.00071054127,0.0001868637,0.00003475714,0.00090814027,0.00020164168,0.4408292,0.016473394,0.39062342,0.14982584,0.00006684821],"about_ca_topic_score_codex":0.00094298564,"about_ca_topic_score_gemma":0.0007391284,"teacher_disagreement_score":0.0049616285,"about_ca_system_score_codex":0.00085331034,"about_ca_system_score_gemma":0.00037969355,"threshold_uncertainty_score":0.016598344},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45883057,0.0067262794,0.49188137,0.0016826413,0.00046152412,0.000085477746,0.00031939053,0.00034553377,0.039667152],"genre_scores_gemma":[0.98737645,0.0015540848,0.0042784144,0.000042624113,0.00008838165,0.000030822157,0.000049473892,0.00001371246,0.0065660067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998252,0.00006177969,0.0000044775593,0.000030087029,0.000036749563,0.000041729814],"domain_scores_gemma":[0.9992441,0.00053327956,0.000068044974,0.000036913472,0.0000768641,0.00004093445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027333206,0.0002467059,0.00029719557,0.00048234075,0.00030297603,0.00061211194,0.00043260676,0.0004014992,0.0018078956],"category_scores_gemma":[0.0020669636,0.00018518372,0.0001495455,0.00058167015,0.00054101006,0.00051630696,0.00036643495,0.00036233038,0.00018884066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013772694,0.000028242235,0.0013068216,0.00008167767,0.000033897533,0.000273567,0.00013918559,0.864459,0.0037157955,0.094418935,0.003277313,0.0321278],"study_design_scores_gemma":[0.000017031089,0.000056560293,0.00062926876,0.000018885778,0.000017586735,0.00012950496,0.00009205287,0.95547116,0.00043998676,0.04124578,0.0018669332,0.000015141928],"about_ca_topic_score_codex":0.0048205126,"about_ca_topic_score_gemma":0.003391746,"teacher_disagreement_score":0.0048205126,"about_ca_system_score_codex":0.00071659184,"about_ca_system_score_gemma":0.00039759802,"threshold_uncertainty_score":0.009584963},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23956677,0.002499818,0.73776025,0.00066517433,0.00010361695,0.00014444075,0.0004920737,0.0005932647,0.018174635],"genre_scores_gemma":[0.9545918,0.0012450346,0.042331018,0.00006965078,0.000041608037,0.00020907442,0.00019782258,0.000040277577,0.0012737595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980233,0.00066729164,0.00015154513,0.00022714239,0.0005285461,0.00040219413],"domain_scores_gemma":[0.9859536,0.010873897,0.0010902487,0.0006291573,0.001237894,0.00021518081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035632118,0.0014605625,0.0012189158,0.001269263,0.00093043,0.0022401155,0.0014874934,0.0010607217,0.0014068265],"category_scores_gemma":[0.011193205,0.0004148667,0.00059626484,0.0013333972,0.0015033674,0.002419507,0.0017325472,0.0010830604,0.00035338383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061446044,0.00010236276,0.0011957216,0.00058955443,0.000119362114,0.00054086465,0.0006798685,0.7149585,0.029327484,0.20095922,0.002088996,0.04882366],"study_design_scores_gemma":[0.000043235006,0.00023998646,0.00050495705,0.00008709274,0.00008695233,0.00057716755,0.00019175075,0.9157061,0.020720841,0.060209133,0.0015586051,0.00007409087],"about_ca_topic_score_codex":0.0009666369,"about_ca_topic_score_gemma":0.0009190894,"teacher_disagreement_score":0.0035632118,"about_ca_system_score_codex":0.0016701181,"about_ca_system_score_gemma":0.0011217854,"threshold_uncertainty_score":0.018844306},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010567398,0.0004900455,0.98712456,0.00010997999,0.000033623768,0.000029376297,0.000013044072,0.000045039036,0.001586983],"genre_scores_gemma":[0.76034343,0.0010169187,0.2365856,0.00011016741,0.00007771942,0.00013849395,0.000059557104,0.000022029428,0.0016461315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915576,0.0003234089,0.000035225647,0.000086467895,0.0003366652,0.0000624013],"domain_scores_gemma":[0.9988493,0.0005046961,0.00015184583,0.00014165645,0.0003208839,0.000031600895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007140144,0.00078143756,0.0004909664,0.00044765408,0.00038209333,0.00061427435,0.0009176802,0.0007324989,0.0005864291],"category_scores_gemma":[0.0020821106,0.00020344328,0.000313363,0.00073864183,0.0008034158,0.00077520113,0.00069758354,0.00074545335,0.00024391215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014719764,0.00007437166,0.0007782694,0.00021373098,0.00005905059,0.0002709059,0.00024006199,0.70314646,0.040959675,0.14536458,0.001008449,0.107737325],"study_design_scores_gemma":[0.000012844021,0.000085078784,0.000067210945,0.000014481604,0.000013418455,0.00009900307,0.000015215489,0.9841456,0.0041528065,0.010101025,0.001280544,0.000012789543],"about_ca_topic_score_codex":0.001086763,"about_ca_topic_score_gemma":0.0020995622,"teacher_disagreement_score":0.001086763,"about_ca_system_score_codex":0.00087216566,"about_ca_system_score_gemma":0.00089025946,"threshold_uncertainty_score":0.0063280463},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073541314,0.0053248545,0.49971223,0.000984459,0.0013156455,0.00018057472,0.00066293246,0.0060157487,0.47844952],"genre_scores_gemma":[0.12766358,0.0053589605,0.11702929,0.00097246445,0.00082865125,0.0002740367,0.0011249935,0.0009386666,0.7458094],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994221,0.00005717558,0.00001274473,0.00008439203,0.0003329815,0.000090612],"domain_scores_gemma":[0.9992229,0.00020193592,0.000032022406,0.0002094082,0.00026992912,0.000063846404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005172781,0.00080937595,0.00057128223,0.0011885229,0.0007135471,0.0019578433,0.001684091,0.0016268457,0.10155533],"category_scores_gemma":[0.0008593541,0.00044508625,0.00041838427,0.0018249196,0.00058228977,0.0031625016,0.0022099623,0.0018066182,0.040760707],"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.00021686757,0.0001040289,0.0002868511,0.00049996364,0.000028129982,0.00029434447,0.00028456186,0.0064560836,0.036876053,0.10162293,0.097832024,0.7554982],"study_design_scores_gemma":[0.00003334787,0.00026937525,0.0006075466,0.00028861378,0.000055761393,0.001672876,0.0001652176,0.060253244,0.05023455,0.049441934,0.836891,0.00008654302],"about_ca_topic_score_codex":0.0009739269,"about_ca_topic_score_gemma":0.0018430189,"teacher_disagreement_score":0.10155533,"about_ca_system_score_codex":0.0007622873,"about_ca_system_score_gemma":0.0007967307,"threshold_uncertainty_score":0.33973646},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035122235,0.0073623853,0.7196818,0.00092136074,0.0009271262,0.0000622766,0.00014395479,0.00032510769,0.26706377],"genre_scores_gemma":[0.2806947,0.025534807,0.2144112,0.00089464453,0.0013870772,0.00039861034,0.0004878895,0.00041458546,0.47577658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968433,0.00007822701,0.000009195774,0.00004001363,0.00015139183,0.00003696747],"domain_scores_gemma":[0.9994518,0.00032870602,0.00002106488,0.00010855164,0.00007716434,0.000012683102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004684839,0.0007407537,0.00035926007,0.00067914027,0.0004003692,0.0012316897,0.0007301373,0.00090848975,0.007485245],"category_scores_gemma":[0.001617439,0.00033067816,0.00027510832,0.0016429527,0.0009708876,0.0017205168,0.0009531261,0.0013751226,0.0020489614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002039031,0.000024542547,0.000059058963,0.00009596652,0.000009111034,0.00006352692,0.00010493775,0.029963128,0.0017063473,0.77781105,0.023032045,0.16710988],"study_design_scores_gemma":[0.000008385071,0.000033429442,0.0001646775,0.00011882855,0.000019562027,0.00039275648,0.000059271577,0.13335791,0.0030821017,0.6816746,0.18105619,0.00003235584],"about_ca_topic_score_codex":0.0016096537,"about_ca_topic_score_gemma":0.0019123945,"teacher_disagreement_score":0.007485245,"about_ca_system_score_codex":0.0009147919,"about_ca_system_score_gemma":0.0008205758,"threshold_uncertainty_score":0.025040627},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00567684,0.00037575778,0.980396,0.0008798899,0.00007714804,0.00007522664,0.00002572623,0.00003743466,0.012455951],"genre_scores_gemma":[0.7296889,0.001570427,0.2500836,0.00047179192,0.00035141862,0.0005221402,0.00005465851,0.0000761617,0.017180901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969771,0.0019415085,0.00008693465,0.0002203321,0.00051745836,0.0002566941],"domain_scores_gemma":[0.9967572,0.0025620037,0.00013616467,0.00013472636,0.00023394401,0.00017594032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031775138,0.0011743646,0.0007729111,0.00091941917,0.0009842166,0.002770387,0.0021239766,0.0018631173,0.003698329],"category_scores_gemma":[0.005809556,0.0006132132,0.001009647,0.0009235,0.0033016582,0.0031465176,0.0021975813,0.0024030325,0.00042852186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004455454,0.000068914494,0.00016792881,0.00008070101,0.000050004997,0.00010810075,0.0002805362,0.22898546,0.0012027186,0.7525693,0.0020595856,0.014382142],"study_design_scores_gemma":[0.00002142932,0.000050641294,0.000061776474,0.000022496535,0.000019482944,0.000051150408,0.00007774361,0.7163704,0.00026085987,0.27986288,0.0031808373,0.000020303176],"about_ca_topic_score_codex":0.004052213,"about_ca_topic_score_gemma":0.004073914,"teacher_disagreement_score":0.004052213,"about_ca_system_score_codex":0.003472642,"about_ca_system_score_gemma":0.0026402574,"threshold_uncertainty_score":0.025195897},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015001443,0.023587327,0.029123345,0.114488356,0.5905196,0.004761676,0.0030500193,0.004580032,0.21488816],"genre_scores_gemma":[0.05038321,0.031663425,0.01457683,0.01355913,0.09790755,0.0012980251,0.007870556,0.0032205095,0.77952075],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9896694,0.0013721203,0.0005812998,0.0006006596,0.007087229,0.0006893127],"domain_scores_gemma":[0.8698443,0.006747508,0.0025675618,0.0065712593,0.10647136,0.007797969],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00846787,0.0010029963,0.0014196342,0.004647547,0.0038918604,0.0050014183,0.0031349894,0.0027997803,0.09824436],"category_scores_gemma":[0.06271119,0.0005728749,0.0009786185,0.0024169509,0.0013328753,0.0030083216,0.0036242416,0.0021406852,0.07196374],"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.00006449001,0.000052810643,0.000887729,0.0008729452,0.000029515233,0.00029669126,0.000108748114,0.00017031672,0.0010444558,0.0017121626,0.86430866,0.1304516],"study_design_scores_gemma":[0.00001737889,0.00004528372,0.0012517326,0.00023774446,0.000022174565,0.00024212441,0.00008076115,0.000760861,0.0012113197,0.0009230785,0.9951828,0.0000246465],"about_ca_topic_score_codex":0.0028555808,"about_ca_topic_score_gemma":0.007177198,"teacher_disagreement_score":0.99153215,"about_ca_system_score_codex":0.0018379733,"about_ca_system_score_gemma":0.0081889285,"threshold_uncertainty_score":0.32866013},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020946477,0.0020050858,0.96479034,0.0015572995,0.00020165872,0.000031953936,0.00006245774,0.0001728132,0.010231996],"genre_scores_gemma":[0.8450133,0.0049913726,0.14111303,0.00023317948,0.00062940933,0.000103890234,0.00013631287,0.00014063038,0.007638791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990088,0.0005566997,0.000025223506,0.000085659914,0.00025233574,0.000071213],"domain_scores_gemma":[0.99561775,0.0032782657,0.00020041835,0.00048048893,0.00030623344,0.00011684859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018167918,0.00041578084,0.00038381136,0.00034760783,0.00026429427,0.0014140981,0.0008238201,0.0006139565,0.001374237],"category_scores_gemma":[0.011150364,0.00052511215,0.0002908838,0.0006045829,0.0012123337,0.0024500801,0.0010032185,0.001797617,0.0001991537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069445465,0.00005175219,0.0003837362,0.00007907826,0.000021247726,0.000058381433,0.00008575452,0.7481784,0.001178011,0.20415418,0.0022731703,0.043466736],"study_design_scores_gemma":[0.0000056305853,0.000017212116,0.000093069924,0.0000127259,0.000004478451,0.000016545708,0.000011440729,0.9183427,0.00026002922,0.07969756,0.0015336517,0.0000050499443],"about_ca_topic_score_codex":0.0032205242,"about_ca_topic_score_gemma":0.002552768,"teacher_disagreement_score":0.0032205242,"about_ca_system_score_codex":0.0012125433,"about_ca_system_score_gemma":0.0014090636,"threshold_uncertainty_score":0.009608269},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07318314,0.023289893,0.8535879,0.0025576185,0.0005362118,0.000083186846,0.000096823096,0.00030895328,0.046356227],"genre_scores_gemma":[0.83918464,0.026428655,0.094694264,0.00033055065,0.0008640092,0.00017671297,0.00013171187,0.000048455106,0.038140886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996202,0.00012068153,0.000013789448,0.000047614558,0.00016578636,0.000031859927],"domain_scores_gemma":[0.99927396,0.0004566234,0.000038907212,0.00008640227,0.00012992306,0.000014161069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005619692,0.00032603645,0.00026925752,0.00051331753,0.00027507343,0.00073439756,0.00040452118,0.00047992286,0.0009659275],"category_scores_gemma":[0.0016410383,0.00020041072,0.00017961975,0.00087617576,0.0005280222,0.0006968085,0.0003879209,0.000540935,0.00047696507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014573918,0.00010572006,0.0006685645,0.0004266442,0.000083171,0.00036265637,0.00081650313,0.1450698,0.049933393,0.29035568,0.011665823,0.5003664],"study_design_scores_gemma":[0.00009982331,0.00046320327,0.0014770963,0.00020055543,0.000098199336,0.0009817219,0.0002978125,0.53391236,0.028754065,0.3554631,0.07817868,0.000073405376],"about_ca_topic_score_codex":0.00044673996,"about_ca_topic_score_gemma":0.0005845376,"teacher_disagreement_score":0.0009659275,"about_ca_system_score_codex":0.00041454585,"about_ca_system_score_gemma":0.00034852469,"threshold_uncertainty_score":0.0032313466},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6669496,0.0028052335,0.28169093,0.0016595243,0.00012377316,0.00006936904,0.00019869873,0.0004630505,0.046039887],"genre_scores_gemma":[0.9902474,0.00041638,0.008104256,0.000047841815,0.000023884857,0.000019203428,0.000045145516,0.000011407805,0.0010844771],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926645,0.00035684343,0.0000161366,0.00006034286,0.00015129102,0.00014898553],"domain_scores_gemma":[0.9965585,0.0022641988,0.00018858834,0.0003329552,0.0004676685,0.00018812598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007741289,0.00020943211,0.00021740467,0.00035393107,0.00036913416,0.0007559785,0.00045336396,0.0005942352,0.0031804026],"category_scores_gemma":[0.007110443,0.00016655271,0.0001535255,0.00041596952,0.0004809384,0.0012772487,0.0010233358,0.00033948864,0.0004628704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035272972,0.00035644046,0.028205039,0.000692684,0.000115581075,0.0022683966,0.0009945185,0.26409432,0.11485118,0.09745735,0.0076987436,0.47973853],"study_design_scores_gemma":[0.00018258623,0.0019850996,0.0169595,0.00011716909,0.00017514626,0.0031536503,0.0019046745,0.8715178,0.05089616,0.03257907,0.020463847,0.00006529351],"about_ca_topic_score_codex":0.0014349575,"about_ca_topic_score_gemma":0.0016639829,"teacher_disagreement_score":0.0031804026,"about_ca_system_score_codex":0.0003127792,"about_ca_system_score_gemma":0.00031407364,"threshold_uncertainty_score":0.010639548},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5586874,0.001514081,0.41502008,0.00052085635,0.000038307342,0.000043741056,0.00025258338,0.0003119619,0.02361104],"genre_scores_gemma":[0.99295104,0.000260255,0.0058772913,0.00002092162,0.000010610219,0.000010623158,0.000041391242,0.000016795786,0.0008110522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932003,0.00021814686,0.00002214363,0.00005027719,0.00027673878,0.00011270974],"domain_scores_gemma":[0.9971539,0.0021912146,0.00018391888,0.00015328152,0.00027423806,0.00004343523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010668214,0.0006498533,0.00062427955,0.00054951926,0.00029958264,0.00070317485,0.00053625164,0.0004945304,0.0014426523],"category_scores_gemma":[0.004478148,0.00020145965,0.00035631974,0.0004975053,0.0007916277,0.001050629,0.00051375665,0.00048610847,0.00017989158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015659473,0.000045188397,0.00097157585,0.000070445385,0.00002728409,0.00033086294,0.00009392069,0.9433741,0.0068954043,0.036642432,0.00054665917,0.010845634],"study_design_scores_gemma":[0.000008743241,0.00006019377,0.0004319398,0.0000068991994,0.000015593025,0.00012493678,0.000037576876,0.9892216,0.0018972874,0.007996274,0.00019088118,0.000008127663],"about_ca_topic_score_codex":0.001577061,"about_ca_topic_score_gemma":0.0015790173,"teacher_disagreement_score":0.001577061,"about_ca_system_score_codex":0.0011522878,"about_ca_system_score_gemma":0.0006300266,"threshold_uncertainty_score":0.008360505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20887636,0.004858915,0.7703411,0.0011436433,0.00011663381,0.000041601783,0.00010568557,0.00048073978,0.014035247],"genre_scores_gemma":[0.97439045,0.0019122597,0.022373127,0.000087969995,0.00010361673,0.000045168515,0.000043059797,0.00004905358,0.0009953739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986871,0.00043606857,0.000034728768,0.00011578144,0.0005561507,0.00017016385],"domain_scores_gemma":[0.9844781,0.012044851,0.0010830528,0.0010437936,0.0011809696,0.00016917424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002127286,0.0005786794,0.0005280016,0.0008243973,0.00036013898,0.001060458,0.0007800886,0.00067308435,0.00086121325],"category_scores_gemma":[0.017850326,0.00028204403,0.00022137185,0.0007627059,0.0016227963,0.0022785326,0.0010468658,0.0011617944,0.00018622169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019003975,0.000055037697,0.0015412625,0.00018812367,0.000047467773,0.00017887997,0.00026898584,0.68862253,0.015925545,0.2424514,0.0010736247,0.04945713],"study_design_scores_gemma":[0.000013146236,0.00012031672,0.0007028075,0.000037297094,0.000026108832,0.00019776504,0.00006151696,0.87958896,0.004919631,0.112936296,0.001372895,0.000023276285],"about_ca_topic_score_codex":0.00089966325,"about_ca_topic_score_gemma":0.0005855751,"teacher_disagreement_score":0.002127286,"about_ca_system_score_codex":0.0012717376,"about_ca_system_score_gemma":0.0006324219,"threshold_uncertainty_score":0.011250317},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010110305,0.0000878814,0.9983754,0.000022458977,0.000011001577,0.000008101788,0.000008714592,0.00016497105,0.00031052306],"genre_scores_gemma":[0.25053898,0.0006888693,0.7451328,0.00012412916,0.000072663854,0.00023504905,0.00018743693,0.00010096182,0.0029192315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927515,0.00022509947,0.000042699896,0.00020730234,0.00019465563,0.000055202152],"domain_scores_gemma":[0.9992563,0.00037741935,0.00009907643,0.00008252339,0.000165485,0.000019146692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009293446,0.0009841111,0.0014136012,0.0005097402,0.00036257296,0.00081627944,0.0012226473,0.0011032184,0.0016373799],"category_scores_gemma":[0.0023060092,0.00052382686,0.00070238457,0.00076141616,0.0006016688,0.001456174,0.0008800225,0.0009860026,0.00083574944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017916936,0.00005024855,0.00048314754,0.00017565818,0.00011088283,0.00010804043,0.00015006782,0.74946,0.021644717,0.029951418,0.0016805148,0.1960062],"study_design_scores_gemma":[0.00000837532,0.000035905756,0.00006121146,0.0000049931873,0.000008007769,0.000042954343,0.0000063183284,0.99443996,0.0021390007,0.0022458925,0.000994473,0.000013033145],"about_ca_topic_score_codex":0.0033962491,"about_ca_topic_score_gemma":0.0024207963,"teacher_disagreement_score":0.0033962491,"about_ca_system_score_codex":0.00051900744,"about_ca_system_score_gemma":0.000981157,"threshold_uncertainty_score":0.006752968},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13442749,0.0033599685,0.8560333,0.00040266535,0.00008896057,0.00007381396,0.0001229336,0.00040484953,0.005085938],"genre_scores_gemma":[0.9493424,0.002216971,0.045548744,0.00007464289,0.000073551004,0.00010144145,0.000096188945,0.00003415615,0.0025119216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991279,0.00029551022,0.00004574327,0.00008445736,0.00031805338,0.00012832333],"domain_scores_gemma":[0.99448663,0.0039511262,0.0005792085,0.00033616612,0.00054384256,0.00010306819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012441244,0.0009118471,0.0007471905,0.0008655034,0.0003730557,0.0007539597,0.0008874015,0.0007213576,0.00076995115],"category_scores_gemma":[0.0061986567,0.00037290403,0.00037812695,0.0008595961,0.0009771116,0.0015261765,0.0011167293,0.00097357674,0.00022837229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029733888,0.00007081402,0.00074366597,0.00038780412,0.000073791285,0.00041660736,0.00041480132,0.77963823,0.020208051,0.13565184,0.0013094308,0.06078764],"study_design_scores_gemma":[0.000017759365,0.00010159095,0.00012216541,0.000021380165,0.000016786735,0.00010899928,0.000030896415,0.97614515,0.004664169,0.017925076,0.00082576985,0.000020141584],"about_ca_topic_score_codex":0.0015638086,"about_ca_topic_score_gemma":0.0011626052,"teacher_disagreement_score":0.0015638086,"about_ca_system_score_codex":0.0010090999,"about_ca_system_score_gemma":0.000684733,"threshold_uncertainty_score":0.007321596},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060953878,0.0009919478,0.9304002,0.00023077264,0.00015094712,0.000063742955,0.00008598518,0.00029096153,0.0068316585],"genre_scores_gemma":[0.68497753,0.00061294675,0.30919126,0.00028902778,0.000112943584,0.00006948624,0.00014923746,0.000026326306,0.004571353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965084,0.000071700495,0.000013499982,0.000048158374,0.00015824035,0.000057547622],"domain_scores_gemma":[0.9995105,0.00018966178,0.000055498647,0.00008608531,0.00013721552,0.000020991394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040741908,0.00037813018,0.00043883215,0.00031991466,0.0002470373,0.0004034079,0.00079379417,0.00044806098,0.0008469441],"category_scores_gemma":[0.0013327948,0.0001140171,0.00017622414,0.00059557875,0.0003854932,0.000783016,0.0004491977,0.000534338,0.00023321879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064015493,0.00021614235,0.0017430763,0.0003420826,0.0000826672,0.00072039175,0.00026654408,0.28757554,0.12965599,0.11786521,0.0040835785,0.4568087],"study_design_scores_gemma":[0.000023760187,0.00013557858,0.00035802554,0.000015046422,0.000018670013,0.00027665938,0.000013969438,0.97355574,0.01604206,0.005822704,0.003717784,0.000019971367],"about_ca_topic_score_codex":0.0015340217,"about_ca_topic_score_gemma":0.0021271291,"teacher_disagreement_score":0.0015340217,"about_ca_system_score_codex":0.0005285051,"about_ca_system_score_gemma":0.0006202237,"threshold_uncertainty_score":0.0038345456},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73451674,0.0022216013,0.2281065,0.0010776158,0.00014165403,0.00020307516,0.00014301264,0.0005224686,0.0330673],"genre_scores_gemma":[0.9968442,0.000097934644,0.0027354998,0.00003352995,0.0000051950947,0.000012897924,0.000011687426,0.000011604175,0.00024755253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968886,0.0015145941,0.00011407896,0.0002567232,0.00059433584,0.0006317617],"domain_scores_gemma":[0.9918691,0.00607408,0.0005627018,0.00032825064,0.00089734886,0.00026856398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026627558,0.0009650532,0.0007845586,0.000737261,0.00045083827,0.0017584505,0.0007108116,0.0008339436,0.0009725731],"category_scores_gemma":[0.013688385,0.00022014347,0.00029129535,0.0004836033,0.0008714599,0.0015009814,0.0006850169,0.0005634221,0.00015863575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007677861,0.00026255802,0.0032486168,0.00015559015,0.0001474754,0.00028669037,0.0001076897,0.9294898,0.014999435,0.030927472,0.00083603105,0.018770926],"study_design_scores_gemma":[0.000030887124,0.00036589405,0.0009464484,0.000012718772,0.00004381856,0.00013920678,0.00006941125,0.9883146,0.0041044117,0.005698275,0.0002499204,0.000024432562],"about_ca_topic_score_codex":0.0025667055,"about_ca_topic_score_gemma":0.0015769686,"teacher_disagreement_score":0.0026627558,"about_ca_system_score_codex":0.001224073,"about_ca_system_score_gemma":0.0016372263,"threshold_uncertainty_score":0.014082193},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04721617,0.00055346277,0.9368005,0.0008146816,0.00018915026,0.00023609692,0.0003142741,0.0013017483,0.012573915],"genre_scores_gemma":[0.78957593,0.00060126476,0.20201309,0.00019166859,0.00010199294,0.00026428478,0.00022814385,0.00007888081,0.0069447267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991008,0.00022318358,0.000053204218,0.000106635234,0.00037486592,0.00014133933],"domain_scores_gemma":[0.9993394,0.00016182558,0.00013161884,0.00020865016,0.00009769727,0.00006075593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073879736,0.00046116294,0.00050096435,0.00068397616,0.00094847573,0.001189911,0.0008902047,0.00069232035,0.00161148],"category_scores_gemma":[0.0011124621,0.00023434575,0.0004784135,0.00087777345,0.0017482443,0.0031728668,0.0016731921,0.0018073502,0.00069577235],"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.0006826134,0.00019967968,0.00045840844,0.00050396036,0.000056274028,0.00047662732,0.00033639485,0.052846853,0.0496947,0.7917504,0.0060745617,0.096919514],"study_design_scores_gemma":[0.00034031973,0.00047944396,0.00056837726,0.00009045222,0.00006373347,0.0020077985,0.00016618491,0.5709073,0.092501216,0.26405162,0.06865259,0.00017104519],"about_ca_topic_score_codex":0.0005454604,"about_ca_topic_score_gemma":0.00052701234,"teacher_disagreement_score":0.00161148,"about_ca_system_score_codex":0.0010563129,"about_ca_system_score_gemma":0.0018148082,"threshold_uncertainty_score":0.007664144},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21825647,0.0006939212,0.7593177,0.0005169922,0.00006177307,0.0000862035,0.000312725,0.00038649963,0.020367678],"genre_scores_gemma":[0.9713488,0.00022679607,0.02536409,0.00005141858,0.000016576725,0.00005296838,0.000084653235,0.000034697976,0.0028200368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954057,0.00016332936,0.000009697948,0.000075538825,0.000071063616,0.0001399593],"domain_scores_gemma":[0.99932766,0.0004012396,0.00007079078,0.000041698586,0.00010289318,0.00005571837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008297627,0.0009227682,0.0006804246,0.00036437585,0.0003928682,0.001112485,0.00092300033,0.00065379025,0.001544152],"category_scores_gemma":[0.0017454437,0.00027508262,0.000363885,0.0008015075,0.00078966503,0.0008058351,0.0007732571,0.00047544058,0.00015375037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043738954,0.000017059041,0.00016782884,0.000029270914,0.000009541925,0.000066125154,0.000017494536,0.98701596,0.0019295209,0.00725134,0.00041243114,0.003039637],"study_design_scores_gemma":[0.0000020509253,0.0000067359188,0.000032092365,0.0000013823995,0.000001996256,0.0000047408207,0.00000514675,0.99876106,0.00031403752,0.00080311956,0.00006612786,0.0000014839812],"about_ca_topic_score_codex":0.009642901,"about_ca_topic_score_gemma":0.008505555,"teacher_disagreement_score":0.009642901,"about_ca_system_score_codex":0.0025929664,"about_ca_system_score_gemma":0.0013278932,"threshold_uncertainty_score":0.019173563},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.581772,0.0035638735,0.38084197,0.001455753,0.00010901547,0.000047845668,0.00033222086,0.00043049012,0.031446874],"genre_scores_gemma":[0.99231875,0.0012007188,0.005106021,0.000049278733,0.000035569297,0.000018946228,0.000064030595,0.000035299498,0.0011714151],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947125,0.00020090185,0.000014463595,0.00006630893,0.00017359864,0.000073495496],"domain_scores_gemma":[0.9946567,0.0043991585,0.00029483347,0.00028450097,0.0002960351,0.00006876531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001163484,0.0005768786,0.0003776363,0.00048842246,0.00041431122,0.0007507921,0.00053240586,0.00061692565,0.0012688483],"category_scores_gemma":[0.008812704,0.00019309972,0.00016864504,0.00060374016,0.0013052045,0.0017060644,0.00080957497,0.0006494555,0.00021698944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004587092,0.00002148328,0.00090556697,0.000072530696,0.000021721225,0.00006963013,0.000083475075,0.9357062,0.0048177578,0.04934703,0.0005910734,0.008317641],"study_design_scores_gemma":[0.0000027661622,0.00002677856,0.00045296605,0.00001462241,0.0000057416005,0.000030859024,0.000035829333,0.9819726,0.0019512351,0.015223816,0.00027397223,0.000008854894],"about_ca_topic_score_codex":0.0026458774,"about_ca_topic_score_gemma":0.0023833662,"teacher_disagreement_score":0.0026458774,"about_ca_system_score_codex":0.0011505772,"about_ca_system_score_gemma":0.00056472287,"threshold_uncertainty_score":0.008348048},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04737517,0.000126315,0.9466461,0.00012453493,0.000033300188,0.000052480864,0.00009252479,0.00027369807,0.0052758628],"genre_scores_gemma":[0.56482977,0.00023589948,0.43157998,0.00007998464,0.000029427008,0.00014707193,0.00019543657,0.000055955294,0.0028465278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993524,0.00021775172,0.000042446754,0.00009342085,0.00022283076,0.00007127344],"domain_scores_gemma":[0.99910235,0.0003581114,0.00013777475,0.00019771322,0.0001426863,0.000061403975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045180993,0.00042394857,0.0003321787,0.00032129133,0.00039653305,0.000712089,0.00050963624,0.0004819533,0.0010181308],"category_scores_gemma":[0.0018737682,0.00024632394,0.00039122804,0.00035741655,0.0009261863,0.00060258986,0.001098516,0.0007330714,0.00034799794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023900614,0.00010366173,0.0013370678,0.0002712901,0.000037093443,0.00026773012,0.00034350992,0.30723688,0.08367256,0.44801486,0.0024447786,0.15603147],"study_design_scores_gemma":[0.00005486042,0.00017382592,0.00022790249,0.00002910316,0.000009672863,0.00023827779,0.000050751143,0.89122033,0.046178445,0.056306027,0.005469579,0.000041198266],"about_ca_topic_score_codex":0.00058307836,"about_ca_topic_score_gemma":0.0007366191,"teacher_disagreement_score":0.0010181308,"about_ca_system_score_codex":0.0006204829,"about_ca_system_score_gemma":0.0010431485,"threshold_uncertainty_score":0.004501939},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07895993,0.00047039872,0.91214716,0.00042944239,0.000084690466,0.00013435018,0.00027144377,0.00033548352,0.007167202],"genre_scores_gemma":[0.8563554,0.00037162384,0.13923708,0.00012908044,0.00003692662,0.00014226527,0.00029875032,0.000112018744,0.0033167882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993981,0.0001401262,0.00001821546,0.00015581779,0.000116375384,0.00017127214],"domain_scores_gemma":[0.99843377,0.0009852775,0.00016297682,0.00010513827,0.00015411187,0.00015870848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094750803,0.0011916789,0.00096872274,0.0004924827,0.0006972785,0.0011296683,0.0015692882,0.0008941448,0.002168604],"category_scores_gemma":[0.002594774,0.0004963914,0.000648916,0.0010227794,0.0008892679,0.0012105331,0.0012069719,0.0010754577,0.00020111018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004976676,0.00003227954,0.00023496577,0.000035609835,0.000008973969,0.000049454356,0.000027668933,0.98492926,0.0007002073,0.0064008525,0.0007533453,0.006777577],"study_design_scores_gemma":[0.0000056074855,0.000014032191,0.000056486664,0.000002717407,0.0000024831838,0.000008568541,0.000012767612,0.99701726,0.00025658327,0.0024165027,0.00020367661,0.0000033076185],"about_ca_topic_score_codex":0.016959134,"about_ca_topic_score_gemma":0.020111311,"teacher_disagreement_score":0.016959134,"about_ca_system_score_codex":0.0024177674,"about_ca_system_score_gemma":0.002426718,"threshold_uncertainty_score":0.03372085},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101672955,0.00020618687,0.8916326,0.000369342,0.00004227709,0.00009057289,0.00008639888,0.00042379365,0.005475826],"genre_scores_gemma":[0.8930935,0.00019806434,0.10364692,0.000092650815,0.000047276615,0.00015813534,0.0001124939,0.000047509333,0.0026034259],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788135,0.0009106618,0.00008596647,0.00042213398,0.00035316168,0.0003465969],"domain_scores_gemma":[0.99539644,0.0030100835,0.00058916496,0.00050513574,0.00031461415,0.00018467293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014221728,0.0004115049,0.0006028848,0.00047005198,0.00096128066,0.0014097805,0.0014321615,0.00069314026,0.0012214093],"category_scores_gemma":[0.007445609,0.00037121304,0.0005218635,0.000929241,0.0015109724,0.0019103487,0.0014279725,0.0006896931,0.0002872627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022995962,0.00005591462,0.0010930564,0.000116736526,0.00004141336,0.0003513751,0.00025192517,0.75773656,0.002818474,0.21981135,0.0011959132,0.016297305],"study_design_scores_gemma":[0.000040915675,0.0000622525,0.00014902782,0.000008519864,0.000014859192,0.000082378865,0.00007801089,0.8681326,0.0016493689,0.12749073,0.0022753184,0.000016149756],"about_ca_topic_score_codex":0.0011237373,"about_ca_topic_score_gemma":0.0011552827,"teacher_disagreement_score":0.0014321615,"about_ca_system_score_codex":0.0008946826,"about_ca_system_score_gemma":0.0007652456,"threshold_uncertainty_score":0.007521212},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00815476,0.0007362801,0.97742563,0.0009885058,0.0000717193,0.000036790032,0.00011911812,0.000068851514,0.012398404],"genre_scores_gemma":[0.61662006,0.005460859,0.36254838,0.0011589825,0.00081335363,0.0005238926,0.0004121919,0.00017742478,0.0122848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977558,0.0009583027,0.00007032162,0.00028406343,0.0007103519,0.00022118639],"domain_scores_gemma":[0.9923959,0.0052780607,0.0006056878,0.0006332755,0.00084953144,0.00023754673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033700478,0.0012118274,0.0010117206,0.0016436778,0.0009857048,0.0028330698,0.0021946735,0.0016018661,0.0022818942],"category_scores_gemma":[0.0140345,0.0007118884,0.00084636407,0.001779434,0.0044886405,0.006428666,0.004406878,0.0052162716,0.00086848607],"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.000040166226,0.000015942593,0.00017151838,0.00006300506,0.000010581154,0.00007207299,0.00011631863,0.078521095,0.00079171686,0.9121706,0.0011872967,0.006839631],"study_design_scores_gemma":[0.0000084969115,0.000030960186,0.000059885184,0.000031788313,0.000007701015,0.000055871427,0.00003588332,0.42278653,0.00058349903,0.57385653,0.0025220634,0.000020670654],"about_ca_topic_score_codex":0.0020134682,"about_ca_topic_score_gemma":0.0016370424,"teacher_disagreement_score":0.0033700478,"about_ca_system_score_codex":0.0031010085,"about_ca_system_score_gemma":0.0021327538,"threshold_uncertainty_score":0.022499502},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103398964,0.0025976007,0.8721598,0.003746407,0.0004925689,0.00033221458,0.0007267155,0.0017103462,0.014835342],"genre_scores_gemma":[0.9213676,0.0008222559,0.061051458,0.0008309881,0.000507223,0.0003646175,0.00057423743,0.00014712656,0.014334505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99333364,0.0029880996,0.00020860725,0.00095857435,0.0014427282,0.0010682544],"domain_scores_gemma":[0.9721664,0.018518183,0.0020641722,0.0036715036,0.0026200183,0.00095969776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005780773,0.0011812431,0.003049303,0.0021665792,0.0018446144,0.0030809608,0.0041522942,0.0031350325,0.0050624018],"category_scores_gemma":[0.03363754,0.00080710585,0.0008366972,0.0033037537,0.0030955945,0.007104365,0.003873394,0.0026492542,0.0017536902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091004913,0.00029091633,0.0019504535,0.00040324262,0.00012206434,0.0010315974,0.0005298445,0.45432433,0.002768312,0.44009328,0.016201401,0.08137449],"study_design_scores_gemma":[0.000068495465,0.00007257857,0.00026675517,0.000023721544,0.000016355547,0.00023247018,0.00007492076,0.8008895,0.0005146261,0.1958598,0.0019450218,0.00003577214],"about_ca_topic_score_codex":0.0038084253,"about_ca_topic_score_gemma":0.0031991787,"teacher_disagreement_score":0.005780773,"about_ca_system_score_codex":0.0033125896,"about_ca_system_score_gemma":0.0020396477,"threshold_uncertainty_score":0.030571997},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5005502,0.0018188313,0.4871475,0.00019103735,0.00020911195,0.00011620239,0.00007427242,0.00034871305,0.009544134],"genre_scores_gemma":[0.99475855,0.00012853146,0.0046051717,0.000013091442,0.0000043017817,0.000013863893,0.000017086513,0.0000032928945,0.0004560379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998192,0.000029863473,0.000011785506,0.000040453164,0.000063732325,0.000034952118],"domain_scores_gemma":[0.9994987,0.00021458679,0.000056431665,0.000042619165,0.0001602447,0.00002734745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044399843,0.00032001227,0.00030424757,0.00028865846,0.00020107451,0.0005005615,0.00034550822,0.00035315566,0.0007058581],"category_scores_gemma":[0.00110201,0.000071809365,0.000164577,0.0002022212,0.00021255066,0.00025341284,0.0003055114,0.0002144211,0.00007485622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000890815,0.00013624894,0.0022699616,0.00027497252,0.000087142704,0.00018089911,0.00012479926,0.8646408,0.025289947,0.004722901,0.00046427088,0.10091726],"study_design_scores_gemma":[0.000026285205,0.0004916027,0.0011473316,0.000008178374,0.000026821892,0.000044698656,0.000055457072,0.98935753,0.0073628114,0.00040400034,0.0010652897,0.000009964985],"about_ca_topic_score_codex":0.0052136867,"about_ca_topic_score_gemma":0.003498011,"teacher_disagreement_score":0.0052136867,"about_ca_system_score_codex":0.0004898786,"about_ca_system_score_gemma":0.00037072646,"threshold_uncertainty_score":0.010366678},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042479437,0.00044824576,0.9545757,0.00008897724,0.000034934423,0.00003801652,0.000035404046,0.00011349927,0.0021858935],"genre_scores_gemma":[0.8768525,0.00053438527,0.120569915,0.00007346736,0.000023702132,0.00006869535,0.00004398448,0.0000198573,0.0018135062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999241,0.0003074868,0.000035561337,0.000099467325,0.00024268877,0.0000738421],"domain_scores_gemma":[0.9985807,0.00087979104,0.0001707219,0.00018723402,0.00014372045,0.000037949005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013592462,0.00089139305,0.0006719797,0.00043308781,0.0004706824,0.00082638557,0.0009986878,0.00077706756,0.00078925426],"category_scores_gemma":[0.0034515387,0.00030760287,0.00039575528,0.00048792103,0.0010047044,0.0014828828,0.0011773569,0.00068402593,0.00017469768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021467525,0.000051455725,0.00045821376,0.00021289519,0.000056826513,0.00026981498,0.00020365171,0.82870305,0.023796009,0.10044063,0.0006924613,0.04490036],"study_design_scores_gemma":[0.000020046951,0.00012504864,0.00007723775,0.000010497328,0.000020226043,0.00013744479,0.000019428282,0.9855364,0.004581627,0.008713233,0.0007343361,0.000024407716],"about_ca_topic_score_codex":0.00092804345,"about_ca_topic_score_gemma":0.0012830531,"teacher_disagreement_score":0.0013592462,"about_ca_system_score_codex":0.00073393196,"about_ca_system_score_gemma":0.0006789154,"threshold_uncertainty_score":0.0071884394},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012691355,0.000082714585,0.99813783,0.000022387432,0.000009756589,0.000008329272,0.000012620355,0.00007249296,0.0003846877],"genre_scores_gemma":[0.54333764,0.00095215125,0.45203957,0.00009847931,0.00011876459,0.00031587607,0.00022098608,0.0000870624,0.0028294232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992873,0.00017547069,0.000044959987,0.00022389556,0.00020254726,0.000065987646],"domain_scores_gemma":[0.9989371,0.0005537752,0.00016646892,0.000077938224,0.00023896588,0.000025703628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010075364,0.0011227727,0.0010514876,0.00043758168,0.00035325586,0.00095124554,0.0010541716,0.0010724192,0.0017115183],"category_scores_gemma":[0.0037340152,0.0005161188,0.00088529737,0.0005186912,0.0006423799,0.0012740241,0.0007829022,0.0010996368,0.0007148709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006780303,0.000024269933,0.00031917702,0.000117904085,0.00004992259,0.00006518564,0.00010899479,0.906888,0.0051583475,0.014358097,0.00059491466,0.07224742],"study_design_scores_gemma":[0.000006309688,0.000044482204,0.000064277425,0.000006647088,0.000010298197,0.000024474162,0.000009690576,0.99598527,0.0008654948,0.0023667326,0.0006070139,0.000009420732],"about_ca_topic_score_codex":0.0034345062,"about_ca_topic_score_gemma":0.0026282507,"teacher_disagreement_score":0.0034345062,"about_ca_system_score_codex":0.00053593377,"about_ca_system_score_gemma":0.0011662724,"threshold_uncertainty_score":0.0068290234},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9289999,0.0016431861,0.050018113,0.00019532624,0.00015107713,0.00012283772,0.00025010642,0.0016623841,0.016957168],"genre_scores_gemma":[0.9956392,0.00016026977,0.0035779278,0.000023249424,0.000008481579,0.000018749975,0.00010561069,0.000017567538,0.0004489865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916315,0.00013572424,0.000047883976,0.00013266431,0.00028333775,0.0002372823],"domain_scores_gemma":[0.9988257,0.00047203276,0.00012217261,0.000093577,0.00036681487,0.000119613556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069808203,0.00084267004,0.0007494011,0.00065236405,0.0005330431,0.00091850414,0.00084036664,0.00063137914,0.001601921],"category_scores_gemma":[0.0019238822,0.00012839779,0.00045859392,0.0005509353,0.00036267182,0.0006115168,0.0005259018,0.0005345955,0.0002944688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004965551,0.00097496476,0.013306662,0.00096290285,0.0002686618,0.00094989064,0.0002960282,0.63295597,0.1830189,0.0030247406,0.0032445746,0.15603119],"study_design_scores_gemma":[0.00008777022,0.0034446686,0.0077907927,0.000025569327,0.0001488495,0.00033918186,0.00017388334,0.92764866,0.058548663,0.0004173803,0.0013170016,0.000057571655],"about_ca_topic_score_codex":0.0048635225,"about_ca_topic_score_gemma":0.0027657659,"teacher_disagreement_score":0.0048635225,"about_ca_system_score_codex":0.00063925143,"about_ca_system_score_gemma":0.00053507293,"threshold_uncertainty_score":0.009670436},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03167071,0.00017603824,0.9647169,0.00024099744,0.000027258095,0.000030335612,0.00006118688,0.00007155799,0.0030050448],"genre_scores_gemma":[0.85954577,0.00064159924,0.13482748,0.0002185748,0.00012081996,0.00018706948,0.00018397947,0.00007696471,0.0041977153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984332,0.0005471418,0.00005824119,0.00022680614,0.00058734266,0.0001472761],"domain_scores_gemma":[0.9953117,0.0030735007,0.0005591597,0.0005271065,0.00043527636,0.000093235954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017697429,0.000605901,0.0005188734,0.0005722591,0.00029371594,0.0008444304,0.0008392872,0.00071671105,0.0013231264],"category_scores_gemma":[0.010954978,0.0002885649,0.00032914078,0.0006342252,0.0020808338,0.00214139,0.0012387047,0.0013201797,0.0002267113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021792427,0.000055081284,0.0005547431,0.00018988813,0.000030979354,0.00018065161,0.00033159473,0.40074337,0.016919998,0.54656297,0.000989672,0.033223066],"study_design_scores_gemma":[0.000014700853,0.000076234486,0.0001784452,0.000013281659,0.0000054099214,0.000075800235,0.000037982707,0.90849423,0.0042837756,0.08609523,0.00070888636,0.000015934009],"about_ca_topic_score_codex":0.0009802814,"about_ca_topic_score_gemma":0.0006683806,"teacher_disagreement_score":0.0017697429,"about_ca_system_score_codex":0.0008436027,"about_ca_system_score_gemma":0.00075397984,"threshold_uncertainty_score":0.00935936},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19808789,0.0073370943,0.7356945,0.00276337,0.00011633289,0.00014288259,0.0010558672,0.00063856243,0.05416353],"genre_scores_gemma":[0.9763922,0.0026221906,0.016177056,0.00017987892,0.00014775284,0.00015564832,0.00021091072,0.00007198214,0.0040425216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985421,0.00048129028,0.00003885181,0.00021353623,0.0003027879,0.00042149177],"domain_scores_gemma":[0.9893847,0.008337827,0.0007382937,0.0004050438,0.0008675494,0.00026654676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019500314,0.0009980083,0.0009482992,0.0013058803,0.0011651347,0.0026718713,0.0016010344,0.00125026,0.0032090093],"category_scores_gemma":[0.0108542275,0.0005462119,0.0005988169,0.0014775279,0.0033445929,0.0026053975,0.0017662428,0.0013689616,0.00048732985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026359028,0.000065734625,0.00088978774,0.00037803428,0.00009535224,0.0006932397,0.00055445894,0.54426694,0.0047307066,0.42955384,0.0038944362,0.01461384],"study_design_scores_gemma":[0.000023742059,0.000043244534,0.00035808148,0.000070775866,0.000034493074,0.00024148935,0.00017115261,0.86853147,0.001992595,0.12584558,0.0026483545,0.000038971502],"about_ca_topic_score_codex":0.0070209713,"about_ca_topic_score_gemma":0.0024377701,"teacher_disagreement_score":0.0070209713,"about_ca_system_score_codex":0.0028910816,"about_ca_system_score_gemma":0.001642044,"threshold_uncertainty_score":0.020976365},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026018525,0.00022098678,0.97274965,0.00013201009,0.000013018211,0.000013560363,0.000032548054,0.000060603175,0.0007589632],"genre_scores_gemma":[0.8437627,0.00081139634,0.1532151,0.00006579368,0.00007903596,0.00007911794,0.00009612198,0.000029388664,0.0018612732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991779,0.0004294462,0.00003207555,0.00011552734,0.00018757125,0.00005743565],"domain_scores_gemma":[0.99704176,0.0022337646,0.00028972,0.00019656376,0.00019390095,0.00004427342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001688314,0.0006805933,0.000691004,0.00048817976,0.00036514626,0.0008649037,0.0006696513,0.0010060382,0.00058516394],"category_scores_gemma":[0.010826605,0.00047389747,0.00045506746,0.00050888915,0.0014108979,0.0013228763,0.0011221403,0.0006452433,0.00018061207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016491965,0.000026779866,0.0007295991,0.00010949795,0.00004959111,0.00010797928,0.00017615127,0.9100177,0.00498229,0.05476619,0.0005409462,0.02832839],"study_design_scores_gemma":[0.00000625284,0.000015487252,0.00009469061,0.000005195666,0.0000059413196,0.000030589785,0.000010615372,0.98798466,0.0012189507,0.01045447,0.00016408977,0.000009005807],"about_ca_topic_score_codex":0.0015618303,"about_ca_topic_score_gemma":0.0013369572,"teacher_disagreement_score":0.001688314,"about_ca_system_score_codex":0.0005718185,"about_ca_system_score_gemma":0.0007415712,"threshold_uncertainty_score":0.008928776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1198194,0.0010275149,0.8701587,0.00029436717,0.000048951504,0.00004720262,0.000042876694,0.00020117045,0.008359825],"genre_scores_gemma":[0.9671031,0.00031583745,0.030800467,0.000032972337,0.00001177521,0.000036483798,0.000015879328,0.000013237393,0.0016702241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979275,0.0000831392,0.0000067016936,0.00004481958,0.00003862919,0.000034030083],"domain_scores_gemma":[0.9996878,0.00020531045,0.000036411482,0.000025852773,0.000028183018,0.0000164966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040501106,0.00037746428,0.00039984897,0.00022672581,0.00034333646,0.0006097002,0.00069959246,0.00044006854,0.0010091566],"category_scores_gemma":[0.0011212742,0.00019189384,0.00019507634,0.00034805632,0.0006447598,0.00072420435,0.00070092216,0.00031887542,0.00015939435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013981652,0.000042058193,0.00035814094,0.000107283886,0.00002929903,0.00025163565,0.00012635044,0.904792,0.015768822,0.04834676,0.0015262715,0.028511535],"study_design_scores_gemma":[0.0000058980013,0.000024562212,0.000050605246,0.0000027720146,0.0000051048787,0.000027291437,0.000021690243,0.99426055,0.0012356495,0.0038721932,0.0004892152,0.0000044190842],"about_ca_topic_score_codex":0.001980139,"about_ca_topic_score_gemma":0.0025256348,"teacher_disagreement_score":0.001980139,"about_ca_system_score_codex":0.00083377276,"about_ca_system_score_gemma":0.0004961187,"threshold_uncertainty_score":0.006049514},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0087708095,0.00060016336,0.9854401,0.000090543734,0.000033646418,0.00004932886,0.000022613904,0.00010344709,0.004889273],"genre_scores_gemma":[0.6536012,0.0022849794,0.33837003,0.00016669482,0.00017246259,0.00020484914,0.00008312724,0.00005425762,0.0050624525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937505,0.00027145311,0.00003085205,0.000059776616,0.00021046246,0.000052344996],"domain_scores_gemma":[0.99900347,0.00048067857,0.00011374297,0.000092004404,0.0002803388,0.000029840816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073829346,0.0006783637,0.000401553,0.00044354156,0.00031663972,0.0007541551,0.0006437034,0.00074680004,0.0021665308],"category_scores_gemma":[0.0020854422,0.00029812014,0.0003211734,0.00070473325,0.0005962174,0.0008027167,0.0005867852,0.0005612452,0.0008400517],"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.00024584928,0.0000751511,0.0012045167,0.00036193,0.00014557644,0.00037584154,0.0002493049,0.61579615,0.055591043,0.101520434,0.0031847,0.2212495],"study_design_scores_gemma":[0.0000109990815,0.000248251,0.00022552481,0.000029611521,0.00003096863,0.00026748248,0.000020182828,0.97564906,0.010373286,0.009017884,0.0041026967,0.000023967474],"about_ca_topic_score_codex":0.00046386936,"about_ca_topic_score_gemma":0.0007265897,"teacher_disagreement_score":0.0021665308,"about_ca_system_score_codex":0.0004296713,"about_ca_system_score_gemma":0.00047564437,"threshold_uncertainty_score":0.0072478056},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037945755,0.003025077,0.9340916,0.00075587735,0.0000834368,0.000051886593,0.00018825775,0.00014265487,0.023715356],"genre_scores_gemma":[0.9381174,0.0044446713,0.047666565,0.0002552237,0.00028249205,0.0002069405,0.00017385832,0.000100661215,0.008752219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906355,0.00032784746,0.00003381398,0.00010574214,0.00034998337,0.00011901693],"domain_scores_gemma":[0.9957176,0.003238311,0.00029728445,0.00016925223,0.0004985239,0.00007897924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001802057,0.0010015711,0.0009139329,0.0015126488,0.00071493466,0.0017303927,0.0011253721,0.0010273311,0.0042166486],"category_scores_gemma":[0.008824833,0.00055248867,0.00053095346,0.0013935334,0.0015272036,0.0020593235,0.0010599954,0.0009330724,0.0007063628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007441546,0.000032007858,0.00063116354,0.00022768068,0.000046421723,0.0002315686,0.00030082295,0.6057735,0.0034427235,0.36600536,0.002761306,0.020473031],"study_design_scores_gemma":[0.000006906726,0.00003694037,0.00025701584,0.000039720533,0.000016443108,0.00012861723,0.00006411739,0.88503885,0.000597708,0.11281543,0.0009810762,0.000017176282],"about_ca_topic_score_codex":0.0018431856,"about_ca_topic_score_gemma":0.0015444373,"teacher_disagreement_score":0.0042166486,"about_ca_system_score_codex":0.0020861567,"about_ca_system_score_gemma":0.00094337383,"threshold_uncertainty_score":0.015136242},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10951702,0.002803857,0.8089805,0.0010605737,0.00010661273,0.00011820822,0.00029866848,0.00042765014,0.076686904],"genre_scores_gemma":[0.97971594,0.0011653507,0.012553685,0.00013285497,0.000095116186,0.00007906802,0.000084408064,0.000076183496,0.0060974704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990783,0.00029266856,0.0000171109,0.00006938505,0.0003893424,0.00015311537],"domain_scores_gemma":[0.9972409,0.0018016035,0.00031048688,0.0001095381,0.00047379412,0.0000636951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014977119,0.0008488929,0.0006579013,0.00081659097,0.0005762055,0.0012194559,0.0007979962,0.0009656105,0.005218972],"category_scores_gemma":[0.0041381083,0.00041181842,0.0006877774,0.0011704174,0.0011178843,0.0012874152,0.00079933414,0.0008135697,0.00059759273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006982272,0.000025139849,0.0014811556,0.00013975742,0.000067717374,0.00043444042,0.00018023798,0.89248115,0.0037494255,0.090863146,0.0018185301,0.008689488],"study_design_scores_gemma":[0.0000022294055,0.00002228824,0.00034671518,0.0000139841595,0.000014139706,0.0001457479,0.000026687492,0.99008864,0.00033194103,0.008556187,0.000442864,0.000008565164],"about_ca_topic_score_codex":0.0032231612,"about_ca_topic_score_gemma":0.002097059,"teacher_disagreement_score":0.005218972,"about_ca_system_score_codex":0.0020225141,"about_ca_system_score_gemma":0.0007932244,"threshold_uncertainty_score":0.017459214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16446108,0.000782559,0.8208462,0.0005760431,0.000052425487,0.000109716435,0.00026460038,0.00033123378,0.012576251],"genre_scores_gemma":[0.97091144,0.0004865671,0.026383422,0.00007830748,0.000024967187,0.00008847028,0.00006913597,0.00005119105,0.0019065464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815875,0.0009451372,0.00005492216,0.00024188553,0.0002857222,0.00031355198],"domain_scores_gemma":[0.99646324,0.0024286024,0.0004934071,0.00022624964,0.00024303015,0.00014548923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00219808,0.0015684068,0.0012598573,0.0008842617,0.00052727887,0.0014098207,0.0013983806,0.0010903951,0.0018519475],"category_scores_gemma":[0.005562669,0.0005993516,0.0007276714,0.0012006675,0.0017492964,0.0015825296,0.0017975867,0.0010756484,0.00043952838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025575087,0.000097497745,0.00053834455,0.0002035841,0.000058468773,0.00037056013,0.00018778689,0.8664513,0.008060447,0.110303216,0.0015521396,0.011920899],"study_design_scores_gemma":[0.00002240305,0.00007702485,0.00013802179,0.000014442511,0.000015737522,0.00011450716,0.000038333117,0.974426,0.0016583249,0.023144517,0.0003291166,0.000021600454],"about_ca_topic_score_codex":0.002074622,"about_ca_topic_score_gemma":0.0018576398,"teacher_disagreement_score":0.00219808,"about_ca_system_score_codex":0.0018900486,"about_ca_system_score_gemma":0.0011657748,"threshold_uncertainty_score":0.0137133},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0951611,0.00055799645,0.897114,0.00028185293,0.000044524768,0.00008247419,0.00004706315,0.00019912186,0.006511951],"genre_scores_gemma":[0.9349207,0.00027751838,0.062163975,0.00006622609,0.00002290099,0.00006734558,0.00002427071,0.000030341602,0.0024267496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993581,0.000203724,0.00001978088,0.000095900665,0.00018659019,0.00013591812],"domain_scores_gemma":[0.9965635,0.0024544299,0.0003256726,0.00024628744,0.00027382514,0.000136392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011536517,0.00075334345,0.00043459632,0.00065817503,0.00046773223,0.0008049706,0.0011232595,0.00054609607,0.0013154949],"category_scores_gemma":[0.005815026,0.0003181703,0.00020785457,0.0005412311,0.0015626767,0.0016602103,0.0016268061,0.00093600445,0.000150996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022062517,0.00009718378,0.0007809118,0.00013252547,0.00003543791,0.00025606318,0.00034550455,0.7370881,0.020481557,0.18533818,0.0010405054,0.054183386],"study_design_scores_gemma":[0.000019220637,0.00008829805,0.00024342051,0.000023399669,0.0000150008445,0.00012537136,0.00007497533,0.9566438,0.0068253516,0.03463917,0.0012785916,0.0000233781],"about_ca_topic_score_codex":0.0017336073,"about_ca_topic_score_gemma":0.0027465483,"teacher_disagreement_score":0.0017336073,"about_ca_system_score_codex":0.0013333135,"about_ca_system_score_gemma":0.0010508867,"threshold_uncertainty_score":0.009673893},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10870463,0.0012948449,0.87112457,0.0005760126,0.00011253551,0.00012808497,0.00015502112,0.00047147856,0.017432828],"genre_scores_gemma":[0.9296449,0.0006936945,0.06187174,0.00013864749,0.000086581866,0.000115632494,0.00006281862,0.000042575874,0.007343373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994642,0.00016968444,0.000027691136,0.000072229515,0.00014257623,0.00012356455],"domain_scores_gemma":[0.998154,0.0012930818,0.00012605902,0.00011996914,0.00026479343,0.000042194337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011479952,0.0009883515,0.0008716547,0.00064039085,0.00072000455,0.0011390027,0.0009862549,0.00089773966,0.0038212007],"category_scores_gemma":[0.0026368683,0.00038921484,0.00042377182,0.0007378472,0.0007868775,0.0007671239,0.0011825119,0.0005569933,0.00073606014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010308819,0.00027023198,0.0011910954,0.000478097,0.00024980365,0.0008025531,0.0010658267,0.57106,0.121910796,0.095967256,0.0047246143,0.20124888],"study_design_scores_gemma":[0.00006506417,0.0003183939,0.00039212598,0.00003253622,0.00011770794,0.00039198538,0.0001661652,0.96581197,0.012004337,0.018883241,0.0017711996,0.00004530201],"about_ca_topic_score_codex":0.0014532531,"about_ca_topic_score_gemma":0.0035538343,"teacher_disagreement_score":0.0038212007,"about_ca_system_score_codex":0.00061330415,"about_ca_system_score_gemma":0.00073900685,"threshold_uncertainty_score":0.01278317},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36410633,0.0028423774,0.610024,0.00076049595,0.00009061883,0.00007410518,0.00032118926,0.0005021318,0.021278737],"genre_scores_gemma":[0.99211407,0.00055388524,0.005914307,0.000032095213,0.000022607555,0.000019660958,0.00004606011,0.000010776439,0.0012865027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992368,0.0002632969,0.00002797108,0.00010825973,0.00022259259,0.00014105208],"domain_scores_gemma":[0.99766624,0.0013798497,0.00028636583,0.00018575577,0.00041611423,0.00006566144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012176406,0.0009647962,0.00054975104,0.0005249943,0.00037397793,0.0009709631,0.0007216154,0.000606551,0.0012796499],"category_scores_gemma":[0.0040814066,0.00027946846,0.00032547646,0.00052373676,0.00081471517,0.0009680405,0.00078879937,0.0005615427,0.00032426888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014519703,0.000027236998,0.0010750489,0.00009678639,0.000039213275,0.00019672453,0.000092868504,0.95253253,0.009206574,0.025454177,0.00048368762,0.010649971],"study_design_scores_gemma":[0.0000041532,0.00005904714,0.00032004894,0.0000075851544,0.000010512041,0.000067163106,0.000028772065,0.9952683,0.0016552302,0.0024044684,0.00016537453,0.00000931086],"about_ca_topic_score_codex":0.0029543417,"about_ca_topic_score_gemma":0.0023474935,"teacher_disagreement_score":0.0029543417,"about_ca_system_score_codex":0.001092776,"about_ca_system_score_gemma":0.000515192,"threshold_uncertainty_score":0.007928669},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058327722,0.00014665902,0.992729,0.00008650563,0.000020600335,0.00002641558,0.000007547915,0.00009259968,0.0010578186],"genre_scores_gemma":[0.7073612,0.00058923464,0.28406462,0.00012252774,0.00008491248,0.00024280373,0.00004884612,0.000053719665,0.0074321474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995747,0.00017246508,0.000014085422,0.00008694614,0.00009379938,0.00005805399],"domain_scores_gemma":[0.99957484,0.00024314011,0.000049665305,0.00004896919,0.00006299514,0.000020295354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009015494,0.0007841132,0.0008139621,0.0003695056,0.00049210683,0.00085391506,0.0012301966,0.00085267145,0.0016149307],"category_scores_gemma":[0.0012244176,0.000249874,0.0005242037,0.00051729835,0.00084816484,0.00093659776,0.0008485064,0.0007143336,0.0003117842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008522449,0.00006165137,0.00016903023,0.000083309365,0.00004617087,0.000092854854,0.00008235119,0.91165775,0.0058195572,0.03820979,0.0009087462,0.04278347],"study_design_scores_gemma":[0.000008894874,0.000027100514,0.000026935068,0.0000020905127,0.0000070852366,0.000017025883,0.00000663324,0.99522877,0.00090262544,0.0030706008,0.00069910643,0.0000032793262],"about_ca_topic_score_codex":0.0018043597,"about_ca_topic_score_gemma":0.0018730779,"teacher_disagreement_score":0.0018043597,"about_ca_system_score_codex":0.0008803496,"about_ca_system_score_gemma":0.0009894232,"threshold_uncertainty_score":0.0063874125},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014166034,0.0038648658,0.9399681,0.0006919589,0.00026523345,0.00007279146,0.000315726,0.0003718074,0.040283445],"genre_scores_gemma":[0.75942373,0.012690916,0.20152469,0.0015479709,0.0017284269,0.0009865887,0.0012580439,0.00088461867,0.01995502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99638474,0.000861719,0.00012650035,0.00042206497,0.0014122981,0.00079275726],"domain_scores_gemma":[0.9768593,0.017526783,0.0012573077,0.0015084118,0.0022637756,0.00058442005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003913816,0.0029282894,0.0012838128,0.0025896316,0.0011089399,0.0035568601,0.0026626305,0.0015180028,0.007264841],"category_scores_gemma":[0.024423668,0.00071863184,0.0012273086,0.0024281784,0.0035445592,0.0064420355,0.0044049514,0.006267695,0.0014120021],"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.00015664585,0.00010992126,0.00040602798,0.0006190904,0.000072804236,0.00019130373,0.0005592338,0.21187466,0.006261148,0.730345,0.007899841,0.04150421],"study_design_scores_gemma":[0.000016679629,0.00011381522,0.0003996003,0.00022267837,0.000077553006,0.0002473192,0.00016182917,0.5742809,0.0069015836,0.40385035,0.013629667,0.00009804274],"about_ca_topic_score_codex":0.001897376,"about_ca_topic_score_gemma":0.0013242724,"teacher_disagreement_score":0.007264841,"about_ca_system_score_codex":0.002577933,"about_ca_system_score_gemma":0.0014261202,"threshold_uncertainty_score":0.024303377},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08284379,0.0005829488,0.9061665,0.00054041436,0.000086664964,0.000056124896,0.00009465474,0.0004596309,0.009169284],"genre_scores_gemma":[0.9076315,0.0006631921,0.085511655,0.0001716683,0.00012391247,0.00009292669,0.00009168303,0.000052441424,0.005661069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993882,0.00027745348,0.000030227942,0.000049824717,0.00016653663,0.00008763411],"domain_scores_gemma":[0.99824023,0.0011516577,0.00011868681,0.00011711325,0.00032949698,0.00004288466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001032625,0.00070586323,0.00074180414,0.0004023107,0.00048629806,0.00089315884,0.00058200426,0.0010033112,0.002267226],"category_scores_gemma":[0.002923561,0.00036706636,0.00043893405,0.00074245763,0.00071401783,0.0008247115,0.0009896683,0.0006781834,0.0006916038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010471679,0.0001478469,0.0022352946,0.0004611731,0.00028737876,0.0008859291,0.0005429386,0.61430264,0.12162025,0.05303032,0.0033387775,0.20210037],"study_design_scores_gemma":[0.000023156732,0.0002357344,0.00043078582,0.000022656599,0.000059902675,0.00028170613,0.00003062238,0.970386,0.019741448,0.007419283,0.0013374566,0.000031134707],"about_ca_topic_score_codex":0.0006827941,"about_ca_topic_score_gemma":0.001667468,"teacher_disagreement_score":0.002267226,"about_ca_system_score_codex":0.00042333716,"about_ca_system_score_gemma":0.0005922548,"threshold_uncertainty_score":0.007584572},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024561163,0.026252301,0.7725201,0.0009035073,0.00052986806,0.000034334644,0.00013311235,0.00045039962,0.17461523],"genre_scores_gemma":[0.7186024,0.031532764,0.14513151,0.0004019077,0.0010990662,0.00020575493,0.00021204613,0.00018459713,0.10262996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997726,0.00005989177,0.0000048774227,0.000027253156,0.00011448376,0.000020889143],"domain_scores_gemma":[0.9995146,0.00036749555,0.000017721075,0.000040245774,0.0000498964,0.000009981916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028573498,0.0004835844,0.0004809283,0.0004725933,0.00023089803,0.000901579,0.0007076727,0.00063863426,0.002191447],"category_scores_gemma":[0.001295224,0.0003577496,0.00016882332,0.0014720864,0.00084768527,0.0009742002,0.0006660409,0.0010093182,0.0006201882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009019749,0.00002526405,0.00008570076,0.00037499514,0.000029285071,0.000109872926,0.0001737326,0.219441,0.011614385,0.5184747,0.012054655,0.23752621],"study_design_scores_gemma":[0.00003124136,0.000090674876,0.00029140527,0.00016217583,0.000028091616,0.00035177014,0.00005750749,0.28929237,0.0066571375,0.6535635,0.049430143,0.000044000946],"about_ca_topic_score_codex":0.0003813577,"about_ca_topic_score_gemma":0.00050576596,"teacher_disagreement_score":0.002191447,"about_ca_system_score_codex":0.00063472014,"about_ca_system_score_gemma":0.00038678027,"threshold_uncertainty_score":0.007331133},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07707026,0.0007137274,0.9172999,0.00073529157,0.00004973764,0.00004470425,0.000059400107,0.00016671918,0.0038601346],"genre_scores_gemma":[0.975229,0.00024009177,0.022367707,0.00012252916,0.000026754136,0.000041584015,0.0000389335,0.00002471139,0.001908649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965525,0.00013315551,0.000012364021,0.00006551648,0.000058752397,0.00007490606],"domain_scores_gemma":[0.998723,0.0008616186,0.0001355266,0.00003895064,0.00015807476,0.00008284829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013508062,0.0006982753,0.0009929867,0.00031713245,0.0002790808,0.0005967253,0.0009953779,0.0010330791,0.0011067985],"category_scores_gemma":[0.0026567916,0.00033735827,0.00031566672,0.00034749683,0.00088492286,0.0011702819,0.0009506493,0.0010142728,0.00009304882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034797686,0.00002322274,0.00030111716,0.000022423494,0.00001433473,0.00004260575,0.000018622093,0.98671955,0.0004393689,0.0049857227,0.000333725,0.007064501],"study_design_scores_gemma":[0.00000227823,0.000008824908,0.000023591761,0.0000013349489,0.0000018086729,0.0000036519618,0.0000029063626,0.99843484,0.00005459712,0.0014222577,0.00004278982,0.0000011558827],"about_ca_topic_score_codex":0.0050200396,"about_ca_topic_score_gemma":0.0038676346,"teacher_disagreement_score":0.0050200396,"about_ca_system_score_codex":0.0011519009,"about_ca_system_score_gemma":0.0010212823,"threshold_uncertainty_score":0.009981692},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009962247,0.030905375,0.86815244,0.004697914,0.0010361394,0.000027906617,0.0003692845,0.00067368185,0.08417511],"genre_scores_gemma":[0.68228835,0.057566427,0.11527673,0.0015798311,0.005491733,0.00024604704,0.0006519937,0.0006388067,0.13626006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994398,0.00013831479,0.000015889953,0.00009676586,0.0002488304,0.000060421684],"domain_scores_gemma":[0.99901927,0.00059035764,0.00010230027,0.00011144969,0.00014297587,0.000033540007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010044613,0.0016319925,0.0011354272,0.00081142044,0.00034735425,0.002036961,0.0012600728,0.0010706089,0.0042032455],"category_scores_gemma":[0.0028588576,0.00046987343,0.00036367797,0.0017279002,0.001650347,0.0026949777,0.0006791801,0.002781626,0.0014677445],"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.000030858107,0.000042910444,0.0002513039,0.000121814905,0.000034261207,0.000057736583,0.0000710267,0.169292,0.0014728538,0.74347526,0.028066268,0.05708377],"study_design_scores_gemma":[0.0000051949796,0.000024518773,0.0002658204,0.000032915614,0.000015218884,0.00007659286,0.000020712077,0.26212302,0.00037708652,0.7215272,0.015514357,0.000017432936],"about_ca_topic_score_codex":0.0016775765,"about_ca_topic_score_gemma":0.0011516195,"teacher_disagreement_score":0.0042032455,"about_ca_system_score_codex":0.0016291218,"about_ca_system_score_gemma":0.000649784,"threshold_uncertainty_score":0.014061332},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42580605,0.0019828666,0.56470704,0.0008822549,0.00012491932,0.00007011603,0.00019944638,0.00048131554,0.0057459134],"genre_scores_gemma":[0.9720214,0.0006961495,0.02528607,0.00007414979,0.00003374132,0.000065510394,0.000104550316,0.00007052968,0.0016478605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917585,0.00020984816,0.000030038484,0.00013960303,0.00024580787,0.00019885124],"domain_scores_gemma":[0.98336065,0.014030851,0.0010737829,0.0003538393,0.0009300654,0.0002507899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001812382,0.00081404933,0.0005834216,0.00086273026,0.0005969398,0.0008553993,0.000896577,0.0007100381,0.0014910344],"category_scores_gemma":[0.014997987,0.00035068358,0.0003073877,0.00070288475,0.001615272,0.0014159272,0.000836337,0.0010888376,0.0001428268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035650606,0.00003435763,0.0013162094,0.000094491916,0.00003040511,0.00010720783,0.00013700745,0.95605594,0.009272829,0.018941987,0.00048987643,0.013163206],"study_design_scores_gemma":[0.000008385433,0.00006270773,0.0002224321,0.000009811516,0.0000095479045,0.000033158518,0.000025669144,0.99386966,0.0027467026,0.0028062132,0.00019539763,0.000010190188],"about_ca_topic_score_codex":0.0070478837,"about_ca_topic_score_gemma":0.0061563025,"teacher_disagreement_score":0.0070478837,"about_ca_system_score_codex":0.0039417655,"about_ca_system_score_gemma":0.0016192016,"threshold_uncertainty_score":0.02859962},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18358223,0.00032770864,0.8055815,0.00017844178,0.00008185921,0.0002496835,0.00005560168,0.00009797377,0.009844948],"genre_scores_gemma":[0.9607513,0.000116012554,0.037490036,0.000042042375,0.000016106387,0.00007116706,0.00001689112,0.000010050563,0.0014863795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973098,0.0015743654,0.000062161445,0.00023341455,0.00038263574,0.00043763666],"domain_scores_gemma":[0.9972813,0.0017047962,0.00028082874,0.0001532235,0.00030695344,0.00027288587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032393145,0.0011785682,0.000943898,0.00068746944,0.00080656,0.0012861682,0.0010833638,0.00069431536,0.0011235323],"category_scores_gemma":[0.004413433,0.0002870735,0.0005227056,0.0006453447,0.0014696956,0.0015227376,0.0015732141,0.0007520696,0.00009142484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002979551,0.00015011885,0.0019727896,0.00006430789,0.00006974348,0.00015665263,0.0001230714,0.90280175,0.0032145365,0.07117995,0.00052979286,0.019439353],"study_design_scores_gemma":[0.000013608698,0.00010586005,0.0001802209,0.000004187429,0.00001676856,0.000029083043,0.000037360503,0.99264693,0.0007371812,0.005971077,0.00024895635,0.000008883728],"about_ca_topic_score_codex":0.004686665,"about_ca_topic_score_gemma":0.004496042,"teacher_disagreement_score":0.004686665,"about_ca_system_score_codex":0.0021790452,"about_ca_system_score_gemma":0.002575765,"threshold_uncertainty_score":0.017131388},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033302113,0.0003013268,0.96057606,0.00017054833,0.00006443505,0.00004958064,0.00003984437,0.0013014656,0.004194691],"genre_scores_gemma":[0.8474295,0.00021263816,0.14913607,0.00013906888,0.000033327455,0.00008602656,0.00012152162,0.000058394522,0.0027834845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995247,0.00010947791,0.000022368353,0.00011267693,0.00011299405,0.00011775076],"domain_scores_gemma":[0.99959666,0.000109927416,0.000034335288,0.00009121571,0.00012074408,0.000047220743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006009953,0.00073539064,0.00061700563,0.00024125373,0.0004488563,0.0009164857,0.0012402702,0.000493386,0.0026760434],"category_scores_gemma":[0.001075028,0.00022535812,0.00047196503,0.0003641217,0.00040614753,0.0010009158,0.0010813031,0.00093937264,0.0005596021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028943917,0.000201234,0.0010697016,0.00010156812,0.000060032442,0.00023795383,0.00008991539,0.85103416,0.015404041,0.01394281,0.0025815002,0.11498762],"study_design_scores_gemma":[0.0000053794197,0.000027968721,0.000057769503,0.0000021533601,0.000003925816,0.000017293618,0.0000073359083,0.99694425,0.0010251321,0.0015389452,0.00036621036,0.0000036885751],"about_ca_topic_score_codex":0.0032862332,"about_ca_topic_score_gemma":0.005188332,"teacher_disagreement_score":0.0032862332,"about_ca_system_score_codex":0.0005108731,"about_ca_system_score_gemma":0.0011735864,"threshold_uncertainty_score":0.00895226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07620053,0.00070604874,0.91648996,0.00058671256,0.00005624091,0.000039409802,0.00014583876,0.00021225786,0.005563021],"genre_scores_gemma":[0.8947079,0.00047591105,0.10075057,0.00010823538,0.000035044643,0.000079660174,0.00011035119,0.000052281786,0.003679936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993698,0.0003400513,0.000016642822,0.00008860605,0.00009331491,0.00009156032],"domain_scores_gemma":[0.9991992,0.0004849746,0.000102809725,0.000061200975,0.00010128166,0.000050538718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015643142,0.00065369625,0.0007572352,0.000524963,0.00042428094,0.00093147706,0.0006997792,0.0009829318,0.0010830129],"category_scores_gemma":[0.0025087283,0.00047490135,0.00046254712,0.00093257916,0.0006226657,0.0012551873,0.000870316,0.0007719429,0.00020607696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033098957,0.000017114162,0.00018889735,0.000019518833,0.000014043329,0.00005079451,0.00001999261,0.9827824,0.0005898094,0.007841602,0.00045026236,0.007992528],"study_design_scores_gemma":[0.000011457447,0.000028385432,0.0001312041,0.000005155699,0.000005280203,0.000017018618,0.000019962696,0.99173415,0.00035426492,0.0071873213,0.0005018076,0.0000041081576],"about_ca_topic_score_codex":0.0043203193,"about_ca_topic_score_gemma":0.0035218468,"teacher_disagreement_score":0.0043203193,"about_ca_system_score_codex":0.0013695576,"about_ca_system_score_gemma":0.0008146298,"threshold_uncertainty_score":0.00993681},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016391879,0.00038428305,0.98153484,0.00006062997,0.000026272026,0.000033361484,0.000009075923,0.00010549921,0.0014541739],"genre_scores_gemma":[0.81976014,0.0006480832,0.17764375,0.00006797941,0.000047363777,0.00007584564,0.000031091025,0.000025596155,0.0017000576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990608,0.0003963612,0.00004457223,0.00016917363,0.00025308423,0.000076037],"domain_scores_gemma":[0.99851996,0.00080672145,0.0002302085,0.00016422117,0.00023466772,0.000044233726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012707962,0.0006688107,0.0004892577,0.00046464955,0.0003649331,0.0005448839,0.0008398411,0.0004713181,0.00076572446],"category_scores_gemma":[0.0045353654,0.0002742556,0.0003054092,0.0007062185,0.000886349,0.001145306,0.0007331343,0.0005012237,0.00035342464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004374739,0.00011951126,0.0015443504,0.00026169687,0.00007370758,0.00031381997,0.00044517455,0.6661543,0.051921252,0.10154421,0.0012186161,0.17596593],"study_design_scores_gemma":[0.000022898137,0.00025911885,0.00026955406,0.000014664733,0.00003028908,0.00026213125,0.000043889744,0.9776635,0.011333584,0.008039355,0.0020345768,0.000026471314],"about_ca_topic_score_codex":0.0006941765,"about_ca_topic_score_gemma":0.00089932047,"teacher_disagreement_score":0.0012707962,"about_ca_system_score_codex":0.00053472345,"about_ca_system_score_gemma":0.0007385144,"threshold_uncertainty_score":0.0067207217},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11096083,0.0021973592,0.88064873,0.00038151725,0.00008761133,0.000083442246,0.00010974701,0.0001673174,0.0053634453],"genre_scores_gemma":[0.9457612,0.0022943364,0.0487015,0.000082029466,0.00011113392,0.000088606896,0.00008476865,0.000035789602,0.0028405618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999175,0.00031552065,0.00003805708,0.0001475595,0.00019527086,0.00012848663],"domain_scores_gemma":[0.9964604,0.0023277523,0.0004262734,0.00022187189,0.00047120353,0.00009239457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011507581,0.00095251075,0.00079242775,0.0006312227,0.00057172397,0.0009424813,0.0010819162,0.0009204907,0.0012189175],"category_scores_gemma":[0.0046542836,0.0002852426,0.0005849696,0.0008155824,0.0012585309,0.0016472593,0.0008285594,0.00089132757,0.0002930019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030025566,0.00006152373,0.0008889551,0.00026747357,0.00007237544,0.0006316905,0.00034972635,0.80486035,0.015695708,0.14161293,0.0011949018,0.034064136],"study_design_scores_gemma":[0.000011938419,0.00009784869,0.00013436218,0.0000136015315,0.000023169952,0.00013849529,0.000041550014,0.9825417,0.0017134096,0.014421546,0.0008443463,0.000017990906],"about_ca_topic_score_codex":0.0038819364,"about_ca_topic_score_gemma":0.0022739538,"teacher_disagreement_score":0.0038819364,"about_ca_system_score_codex":0.0014469974,"about_ca_system_score_gemma":0.00071460864,"threshold_uncertainty_score":0.0104987025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09647721,0.0009962091,0.8981066,0.00056038186,0.00009615942,0.000053854863,0.00006481168,0.00075364625,0.0028912732],"genre_scores_gemma":[0.96791226,0.00018256465,0.029056374,0.00011341233,0.00003789408,0.00006534946,0.000049346098,0.000041501815,0.0025413856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999419,0.00019829089,0.000029298102,0.00010564365,0.000107621316,0.00014024302],"domain_scores_gemma":[0.9970372,0.0021811782,0.00027683878,0.00014465839,0.00024357934,0.0001166762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018127329,0.00090126775,0.0010869255,0.0003633806,0.0003351619,0.00064565113,0.0016064462,0.0010012477,0.0016229484],"category_scores_gemma":[0.005384897,0.0004470667,0.00032398396,0.000393057,0.0009399595,0.0013225223,0.000996913,0.0017551007,0.00020565571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008991707,0.0000657182,0.00037187047,0.000036917976,0.00002578003,0.000038343693,0.000041115363,0.9698158,0.0007243015,0.0057933456,0.00047577606,0.02252107],"study_design_scores_gemma":[0.000005260135,0.000016590286,0.000025120778,0.0000016824897,0.0000023212647,0.0000028715692,0.000002239725,0.9975243,0.00014814753,0.002218532,0.000051416304,0.0000015595845],"about_ca_topic_score_codex":0.0052185436,"about_ca_topic_score_gemma":0.00438626,"teacher_disagreement_score":0.0052185436,"about_ca_system_score_codex":0.0013195756,"about_ca_system_score_gemma":0.0013906348,"threshold_uncertainty_score":0.010376334},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0679557,0.0015475854,0.911293,0.0005156825,0.00011975487,0.00009431319,0.00029298128,0.00022811771,0.017952865],"genre_scores_gemma":[0.7459738,0.0028978423,0.24374224,0.00025844693,0.00016775062,0.00022600433,0.00039033665,0.00013502633,0.0062085595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922526,0.00021401946,0.00004280695,0.000110255336,0.00026337276,0.000144284],"domain_scores_gemma":[0.99581665,0.0028011198,0.00034346315,0.00048472342,0.00043629,0.00011782071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013494883,0.00083781296,0.00051095366,0.0008400609,0.0005318748,0.0011025743,0.0006609493,0.00075462245,0.0012286707],"category_scores_gemma":[0.006360553,0.00034432247,0.00032487043,0.0009802921,0.0015217193,0.0013003263,0.0018477549,0.0018244566,0.0003064829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019953823,0.00006583009,0.00082229613,0.00021211422,0.000041669493,0.00011101781,0.00026653666,0.19085288,0.02012644,0.69997907,0.0030138309,0.084308825],"study_design_scores_gemma":[0.00004714584,0.00021861453,0.00041751834,0.000105336985,0.000024842784,0.00044799419,0.000098074255,0.6739794,0.02349861,0.29081047,0.010297226,0.00005477474],"about_ca_topic_score_codex":0.0006481187,"about_ca_topic_score_gemma":0.0008953532,"teacher_disagreement_score":0.0013494883,"about_ca_system_score_codex":0.0010280395,"about_ca_system_score_gemma":0.0011864478,"threshold_uncertainty_score":0.0074590445},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8663377,0.00028168556,0.12239304,0.001714745,0.00007077939,0.00007987395,0.00070702744,0.00035384225,0.008061304],"genre_scores_gemma":[0.9809039,0.00018881069,0.0157442,0.00015123075,0.00006455577,0.00011413416,0.0005170274,0.00009591721,0.0022201578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984113,0.00049227476,0.000074057905,0.0003645619,0.00033684343,0.00032104005],"domain_scores_gemma":[0.9853284,0.010018084,0.0010908217,0.002063782,0.00067724776,0.00082162657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013432052,0.00067016017,0.00093921076,0.0007150488,0.0011443567,0.0016492546,0.0015669275,0.0013059368,0.004164035],"category_scores_gemma":[0.011542842,0.0006352191,0.00074829004,0.00059230305,0.0014412655,0.0038585623,0.0011608276,0.0014545226,0.00055064284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035234003,0.00057965284,0.063576095,0.00057646283,0.00039727546,0.0016377583,0.0005025039,0.53490835,0.09174483,0.21416715,0.012748115,0.0756384],"study_design_scores_gemma":[0.00008328198,0.00037137346,0.010093929,0.00002878464,0.00008743715,0.0012543881,0.00023591665,0.84993863,0.03228432,0.10305766,0.0024812196,0.000083101484],"about_ca_topic_score_codex":0.0007762094,"about_ca_topic_score_gemma":0.0011867185,"teacher_disagreement_score":0.004164035,"about_ca_system_score_codex":0.0015985135,"about_ca_system_score_gemma":0.00055923103,"threshold_uncertainty_score":0.013930082},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06919383,0.0025739195,0.87706983,0.00072948163,0.00010743562,0.000076773016,0.0006892873,0.00049563864,0.049063694],"genre_scores_gemma":[0.9476779,0.0020227826,0.04245055,0.00018170224,0.00021287151,0.00037933688,0.0005668105,0.00015043978,0.006357576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970067,0.00082188117,0.000098783355,0.0003167338,0.0010313183,0.0007246494],"domain_scores_gemma":[0.98306894,0.012149436,0.0009594877,0.0011295343,0.0022873725,0.00040534246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026337286,0.0013713347,0.0010692057,0.0012841993,0.0008278314,0.0025678715,0.0014679716,0.0009465944,0.0042925305],"category_scores_gemma":[0.013701355,0.00051227084,0.00071255025,0.0013693966,0.0020767457,0.0023757967,0.0026897576,0.0023923158,0.0008281948],"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.00029897818,0.000055757675,0.00035402417,0.000322333,0.00005090364,0.00022736182,0.0005092471,0.4347266,0.00845925,0.5310941,0.0037568586,0.02014462],"study_design_scores_gemma":[0.000022384911,0.00006857783,0.00028435158,0.0000907396,0.000031816526,0.0001418297,0.000099205914,0.7918693,0.0048280223,0.19872895,0.0037807915,0.000054040655],"about_ca_topic_score_codex":0.0031706293,"about_ca_topic_score_gemma":0.0016700077,"teacher_disagreement_score":0.0042925305,"about_ca_system_score_codex":0.0026870817,"about_ca_system_score_gemma":0.0015223323,"threshold_uncertainty_score":0.019496262},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10517007,0.0032810979,0.67119837,0.0043036607,0.00096161355,0.00038518943,0.003618342,0.0016690533,0.20941262],"genre_scores_gemma":[0.71548754,0.0035941834,0.21719857,0.0016109163,0.00051470456,0.00054735906,0.0047539943,0.00062505895,0.05566762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945647,0.00010882009,0.000022828775,0.00016391635,0.00017551563,0.00007240662],"domain_scores_gemma":[0.99861693,0.00051911786,0.00018025571,0.00030072674,0.00026352232,0.00011944972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021786138,0.0005400865,0.00032816353,0.0011206879,0.0010250839,0.001262304,0.0009040027,0.0009036762,0.012857493],"category_scores_gemma":[0.0025003238,0.0002535506,0.00041612977,0.001439655,0.001305432,0.0020655016,0.0014544734,0.001326489,0.001955506],"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.00003194552,0.000018991715,0.00057081186,0.00014055026,0.0000116356505,0.00014014443,0.0001763455,0.007254076,0.0020279877,0.94436616,0.009936363,0.03532494],"study_design_scores_gemma":[0.000028104925,0.000041609695,0.0006646957,0.00008131546,0.000022041282,0.0008579574,0.00014768318,0.028577482,0.0033330943,0.83644974,0.12976857,0.000027836817],"about_ca_topic_score_codex":0.0015868216,"about_ca_topic_score_gemma":0.0018531723,"teacher_disagreement_score":0.012857493,"about_ca_system_score_codex":0.0009025967,"about_ca_system_score_gemma":0.0006369781,"threshold_uncertainty_score":0.04301262},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047917184,0.59022397,0.14416112,0.0043200976,0.0059329164,0.000111501344,0.00060377416,0.00082060014,0.24903421],"genre_scores_gemma":[0.042975094,0.6065283,0.12523954,0.0030194225,0.0064402176,0.00024890524,0.0018910357,0.0010802721,0.21257727],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994741,0.000103716564,0.000038117076,0.00011714647,0.00021613666,0.000050761075],"domain_scores_gemma":[0.9990682,0.00043538315,0.00003619354,0.00014298738,0.00025681555,0.000060499067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008730112,0.00088588387,0.00075697043,0.0025253103,0.00076412334,0.002367073,0.0016439892,0.0009440482,0.023954865],"category_scores_gemma":[0.0025943296,0.00053356367,0.00048052552,0.006709508,0.00092882145,0.0042780256,0.0016924936,0.0018271497,0.011528253],"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.000056188,0.000057085625,0.00023125371,0.0010634689,0.000019073826,0.00006936863,0.000101800986,0.0020242948,0.0013509636,0.1562446,0.07404822,0.7647336],"study_design_scores_gemma":[0.000007683958,0.00007144565,0.00026788865,0.00038413127,0.000020980777,0.0006740059,0.00006503327,0.0035209535,0.00094822905,0.05959137,0.9344221,0.000026138905],"about_ca_topic_score_codex":0.0014259096,"about_ca_topic_score_gemma":0.002286738,"teacher_disagreement_score":0.023954865,"about_ca_system_score_codex":0.0009984913,"about_ca_system_score_gemma":0.0011225187,"threshold_uncertainty_score":0.080137014},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16191992,0.0027006555,0.82669705,0.00060004747,0.00010186977,0.00006592064,0.00012013407,0.00023528155,0.0075591835],"genre_scores_gemma":[0.92964673,0.0015364351,0.06582287,0.00012832413,0.00010826048,0.00009231389,0.000061273495,0.000028547372,0.0025753055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992225,0.0003460395,0.000036072382,0.00007227785,0.00021543266,0.000107611646],"domain_scores_gemma":[0.9969303,0.0021525146,0.00029624472,0.0003050987,0.00022744738,0.00008832868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011264092,0.00066753296,0.000582161,0.00077317376,0.0004883624,0.0006432959,0.00076814427,0.0009183734,0.0008945173],"category_scores_gemma":[0.00493135,0.00025924697,0.0004071221,0.0008897697,0.0009776922,0.0015218722,0.0015341779,0.0008904533,0.00016289586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037631067,0.000045901266,0.00068234344,0.00025950337,0.00006054543,0.00073554314,0.0005171581,0.5135985,0.019661494,0.40833926,0.0015364101,0.05418709],"study_design_scores_gemma":[0.00002961295,0.00011057782,0.00016141123,0.000044435485,0.000023760433,0.00029415765,0.00006105586,0.8915643,0.0075262403,0.09718443,0.0029735602,0.00002642329],"about_ca_topic_score_codex":0.00070469937,"about_ca_topic_score_gemma":0.00041084405,"teacher_disagreement_score":0.0011264092,"about_ca_system_score_codex":0.0010111834,"about_ca_system_score_gemma":0.0003615082,"threshold_uncertainty_score":0.0073366165},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013220497,0.0019412562,0.8771313,0.0072701056,0.0008324191,0.00009110827,0.0003926162,0.00024610566,0.09887452],"genre_scores_gemma":[0.6897944,0.0031957878,0.26656646,0.0041476227,0.0025556553,0.00095840223,0.00062498683,0.0003691578,0.031787515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99147016,0.0037077297,0.00050051656,0.0013936625,0.0021590048,0.0007688726],"domain_scores_gemma":[0.98675436,0.008350326,0.0007484651,0.0021541482,0.0015838406,0.00040873638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007885752,0.0016666751,0.0012124169,0.002290612,0.0028267282,0.005849281,0.002621588,0.0027896478,0.008650903],"category_scores_gemma":[0.019209879,0.0008885975,0.0025840853,0.0014883725,0.008566491,0.011013847,0.006078605,0.0066609853,0.0023737487],"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.00000889549,0.000007498065,0.000030159106,0.000020618902,0.000004079221,0.000047193316,0.00006706774,0.0013719102,0.00021965911,0.99520564,0.000736803,0.0022804704],"study_design_scores_gemma":[0.000009598232,0.000026122692,0.000030945856,0.000016894299,0.0000061984915,0.00010508969,0.000031615422,0.012061549,0.0005162522,0.97976524,0.007415423,0.000015004535],"about_ca_topic_score_codex":0.00083882903,"about_ca_topic_score_gemma":0.0004672343,"teacher_disagreement_score":0.008650903,"about_ca_system_score_codex":0.0029865992,"about_ca_system_score_gemma":0.0014435092,"threshold_uncertainty_score":0.041704357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05191749,0.0018523451,0.90346086,0.0016077376,0.0006092921,0.00030008875,0.0016041698,0.0018114144,0.036836527],"genre_scores_gemma":[0.9359268,0.0008257535,0.047193933,0.0006487554,0.00024463827,0.00024436734,0.0007368172,0.00007038168,0.014108539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847275,0.00051263743,0.000036699224,0.0002460231,0.0003665143,0.0003653874],"domain_scores_gemma":[0.9977562,0.0010714593,0.0002099815,0.00039867326,0.00043796012,0.00012584221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000963238,0.0010654472,0.0010249609,0.00059214217,0.00072860706,0.0014666714,0.0015426398,0.0012853465,0.004758631],"category_scores_gemma":[0.0040986035,0.0003463109,0.00041987217,0.0013198566,0.0009859214,0.0013005058,0.0020419036,0.0012085877,0.0013788228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054666534,0.00014692546,0.0015322196,0.0003288273,0.00009883196,0.0015410298,0.00013164688,0.75008786,0.0060264408,0.15915434,0.01500349,0.06540172],"study_design_scores_gemma":[0.000065149754,0.000073497125,0.00023751493,0.00002002539,0.000021381193,0.00035832607,0.000027145847,0.96148944,0.0009292321,0.032386757,0.00436291,0.000028530194],"about_ca_topic_score_codex":0.005621092,"about_ca_topic_score_gemma":0.007250034,"teacher_disagreement_score":0.005621092,"about_ca_system_score_codex":0.0014287939,"about_ca_system_score_gemma":0.0013718995,"threshold_uncertainty_score":0.015919209},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04660097,0.00097255356,0.9363887,0.0007455476,0.00014079933,0.000038519935,0.00024023285,0.00037954815,0.0144931],"genre_scores_gemma":[0.8951814,0.00053466944,0.098271444,0.0001369257,0.0001355454,0.000057356374,0.00011238919,0.000029588997,0.0055406485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994081,0.00015209083,0.000031612184,0.000083201274,0.0002236006,0.00010140219],"domain_scores_gemma":[0.99896824,0.00060630013,0.0001000297,0.00014246973,0.00014506151,0.000037931597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064989453,0.00080931577,0.0010208985,0.00035271945,0.0004571649,0.0012726191,0.000749774,0.0009277893,0.0016764634],"category_scores_gemma":[0.002183298,0.0003614129,0.0004542492,0.0009309567,0.0005318984,0.0010984464,0.0010091051,0.0006454013,0.0006338222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006760304,0.0001300661,0.0010847698,0.00025768933,0.00016844297,0.00063850114,0.00021233284,0.76894397,0.03821716,0.04616681,0.0037873655,0.13971694],"study_design_scores_gemma":[0.000034840232,0.000089320885,0.00029481275,0.000014651236,0.000031495074,0.0002685417,0.000027694292,0.9784064,0.0034709568,0.0165556,0.00078713667,0.000018470415],"about_ca_topic_score_codex":0.001153969,"about_ca_topic_score_gemma":0.0031875852,"teacher_disagreement_score":0.0016764634,"about_ca_system_score_codex":0.00044146727,"about_ca_system_score_gemma":0.000887939,"threshold_uncertainty_score":0.00560838},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04031263,0.00045008582,0.95101666,0.0003430279,0.00022934988,0.00013760106,0.00010693605,0.0004743992,0.0069292984],"genre_scores_gemma":[0.8432088,0.00035683395,0.1516078,0.00049959193,0.0000799216,0.00017624817,0.00015625074,0.000018660172,0.0038959114],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868757,0.00031592872,0.00006269157,0.00022980644,0.00054040604,0.00016363709],"domain_scores_gemma":[0.99831796,0.00046507292,0.00017477448,0.00033077388,0.00062679464,0.00008453919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077315944,0.0008654832,0.000594767,0.00061315973,0.00084074156,0.0007418056,0.0011245421,0.0009344483,0.0013686867],"category_scores_gemma":[0.0024639259,0.00029741722,0.000311616,0.0006063975,0.00078769366,0.0009413743,0.0018056149,0.0008790436,0.0005275438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094393664,0.00031122874,0.00237889,0.0004326273,0.00014718309,0.0011025164,0.00056628935,0.18057777,0.36328375,0.11978763,0.006873372,0.32359478],"study_design_scores_gemma":[0.00006201516,0.00032036565,0.00050677056,0.000038111415,0.000047231228,0.0008115527,0.000039031165,0.92598885,0.05603941,0.010982429,0.0050769956,0.000087192406],"about_ca_topic_score_codex":0.0010314446,"about_ca_topic_score_gemma":0.0015507215,"teacher_disagreement_score":0.0013686867,"about_ca_system_score_codex":0.000677091,"about_ca_system_score_gemma":0.0012025331,"threshold_uncertainty_score":0.0049126744},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015282528,0.00094251795,0.98772883,0.00056692987,0.00013440079,0.00004734327,0.00004856865,0.000057536065,0.008945704],"genre_scores_gemma":[0.26938725,0.0065248827,0.7061998,0.0014808906,0.0006193473,0.0008390557,0.00022254908,0.0001364935,0.014589657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987739,0.00057226,0.000043814995,0.0001689993,0.0003455566,0.00009550217],"domain_scores_gemma":[0.99858296,0.0007564801,0.00011061423,0.00032936627,0.0001806378,0.0000400622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013667822,0.0010724063,0.0007465677,0.00193312,0.001000166,0.001758074,0.002070612,0.0020910713,0.0029963353],"category_scores_gemma":[0.004448181,0.00037321044,0.0006774989,0.0022870959,0.0032888409,0.002677273,0.002253445,0.0044330624,0.0012501744],"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.000010584286,0.000008461495,0.000037367885,0.00004586905,0.000006196126,0.000034633948,0.000057019282,0.018250803,0.0009097767,0.96620387,0.0014713596,0.012964151],"study_design_scores_gemma":[0.0000125230745,0.000052891362,0.000058718517,0.000090245456,0.000010048495,0.00016256502,0.000031047537,0.23506801,0.00160279,0.7423489,0.020531261,0.000030945997],"about_ca_topic_score_codex":0.0013835812,"about_ca_topic_score_gemma":0.0010976342,"teacher_disagreement_score":0.0029963353,"about_ca_system_score_codex":0.0016570654,"about_ca_system_score_gemma":0.0010930576,"threshold_uncertainty_score":0.0120229125},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038598083,0.00065994845,0.9574977,0.000120871075,0.00006074209,0.000046881756,0.00003005954,0.0002622609,0.002723503],"genre_scores_gemma":[0.88929015,0.0005192684,0.10736025,0.00011172336,0.00007978632,0.000096611635,0.000039700186,0.000025370613,0.0024770547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939203,0.00022319541,0.000019728179,0.00006861576,0.00022308476,0.00007319444],"domain_scores_gemma":[0.998558,0.0008038323,0.00015487765,0.00015446846,0.00028310405,0.000045772493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010324587,0.0005923316,0.0006585518,0.00041425292,0.00055839104,0.0005395573,0.0013081061,0.0005395663,0.0010725096],"category_scores_gemma":[0.0016450306,0.00020231318,0.0002977591,0.0005242524,0.00071676663,0.00085025124,0.00081656413,0.00072267384,0.0002602378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048545894,0.00018334984,0.0009865927,0.00025064943,0.000103482664,0.0007449622,0.0005828044,0.60938156,0.08498313,0.17395282,0.002278329,0.1260669],"study_design_scores_gemma":[0.000012086576,0.00011756127,0.00009086207,0.000005857531,0.000010707449,0.00013184355,0.000022197779,0.9900012,0.0027441646,0.005794385,0.0010537496,0.000015424477],"about_ca_topic_score_codex":0.0013838131,"about_ca_topic_score_gemma":0.001819349,"teacher_disagreement_score":0.0013838131,"about_ca_system_score_codex":0.00057931984,"about_ca_system_score_gemma":0.00064266403,"threshold_uncertainty_score":0.0054602027},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04084288,0.0003738148,0.9543103,0.00022140477,0.00006435042,0.000038081336,0.000040391697,0.00015899535,0.003949795],"genre_scores_gemma":[0.75175774,0.000456398,0.24286824,0.00022174396,0.00006905578,0.00008615779,0.00008556618,0.0000231639,0.004432011],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957544,0.00013037887,0.000020866091,0.00007676664,0.00014268635,0.00005390129],"domain_scores_gemma":[0.999627,0.00009703251,0.00008869997,0.00009257388,0.00006790882,0.000026803202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036012675,0.00050449726,0.00040391064,0.0003528449,0.00039519827,0.00044588884,0.0006281039,0.00055651594,0.001258441],"category_scores_gemma":[0.00077549857,0.00020159264,0.00034155138,0.0007754915,0.0005380205,0.0012725403,0.0009672104,0.000646243,0.00037629963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007569073,0.00016631797,0.0011610899,0.00032906313,0.000113439884,0.00066820125,0.00047908185,0.094877444,0.41984177,0.15602748,0.002986385,0.32259282],"study_design_scores_gemma":[0.00011373581,0.00071051944,0.0005176697,0.000029954523,0.000074956435,0.0010508435,0.00009908215,0.7836737,0.17656472,0.02255134,0.014510239,0.000103295264],"about_ca_topic_score_codex":0.00019122516,"about_ca_topic_score_gemma":0.00023701528,"teacher_disagreement_score":0.001258441,"about_ca_system_score_codex":0.0003290344,"about_ca_system_score_gemma":0.0002573701,"threshold_uncertainty_score":0.004209876},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18974036,0.0017421955,0.7900764,0.0010475873,0.00013274752,0.00005896925,0.00006568647,0.0002779244,0.016858269],"genre_scores_gemma":[0.9852492,0.00025932517,0.013052765,0.00013443788,0.000039647282,0.000022199085,0.000015410918,0.000005206144,0.0012217623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996402,0.00010582486,0.000010491408,0.00009457526,0.00007950058,0.000069437454],"domain_scores_gemma":[0.9994779,0.0002320976,0.00008214034,0.00007881511,0.00009245439,0.000036650086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037379275,0.00034971922,0.00045044202,0.00015659186,0.00034608334,0.00047158997,0.0006063406,0.000769473,0.00090880226],"category_scores_gemma":[0.0010270439,0.00009917977,0.00019420055,0.00039549885,0.00073871046,0.0010913378,0.00068630226,0.0003944658,0.00020029132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061211817,0.00016155881,0.008080505,0.00042649984,0.00015550345,0.0020413047,0.0009404304,0.39483577,0.12657604,0.22804542,0.007258658,0.23086624],"study_design_scores_gemma":[0.00002827557,0.00023002119,0.00087190676,0.000018393985,0.000042820062,0.0010805349,0.000284306,0.96240294,0.0076762266,0.022560436,0.0047578528,0.00004627922],"about_ca_topic_score_codex":0.0009773313,"about_ca_topic_score_gemma":0.0012321726,"teacher_disagreement_score":0.0009773313,"about_ca_system_score_codex":0.0004029457,"about_ca_system_score_gemma":0.00027500186,"threshold_uncertainty_score":0.0030401945},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17140703,0.00573599,0.7717957,0.0042060358,0.0012093333,0.00008182895,0.0002086258,0.0010284426,0.044327013],"genre_scores_gemma":[0.9679088,0.0021397362,0.022521619,0.00021206654,0.00028126125,0.00003360113,0.00006903122,0.00003668001,0.0067971437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964714,0.00011535354,0.000008498692,0.00004499299,0.000090392,0.000093546754],"domain_scores_gemma":[0.9992674,0.00041004035,0.00003828353,0.00007518532,0.00016541395,0.00004362329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047454928,0.0005378197,0.0005639989,0.00038745248,0.0006747407,0.0015031999,0.00052572414,0.0006471854,0.003006679],"category_scores_gemma":[0.0024292783,0.00018287454,0.00020181689,0.0007196489,0.0003390974,0.00081106636,0.0010918754,0.00080840016,0.0006609704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096521055,0.00017009965,0.0021925592,0.00050900294,0.00013468506,0.0010192654,0.00034233805,0.22695516,0.039837986,0.22275689,0.031521633,0.47359514],"study_design_scores_gemma":[0.000054917808,0.00013823477,0.0005506027,0.00007072856,0.0001060728,0.00046221423,0.00019412485,0.8815199,0.010086122,0.07313553,0.033646025,0.00003555668],"about_ca_topic_score_codex":0.0019790262,"about_ca_topic_score_gemma":0.0023358793,"teacher_disagreement_score":0.003006679,"about_ca_system_score_codex":0.0004807193,"about_ca_system_score_gemma":0.00050769805,"threshold_uncertainty_score":0.010058284},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005811983,0.00053070806,0.9860519,0.00025552584,0.00012346011,0.00007417769,0.00009381491,0.00032431475,0.006734117],"genre_scores_gemma":[0.58765036,0.002153065,0.40325525,0.0007888394,0.00022065558,0.00048556848,0.00046551754,0.000114671835,0.0048659598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911636,0.00023021622,0.000047038357,0.00012469683,0.00034714735,0.00013450567],"domain_scores_gemma":[0.99873775,0.0004046095,0.00014493332,0.00027421146,0.0003897754,0.000048733382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010545468,0.0008013777,0.0005294454,0.00069181505,0.0005739338,0.001187458,0.0012083702,0.0008253783,0.0017440193],"category_scores_gemma":[0.003040424,0.0002536057,0.0003781201,0.00097619917,0.0014530615,0.0015797542,0.0017360573,0.0016663658,0.0005581601],"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.00028329765,0.00007751866,0.00067184865,0.00042940045,0.000061400606,0.00043250647,0.00041128625,0.19466533,0.053895373,0.5371867,0.009536777,0.20234863],"study_design_scores_gemma":[0.000041151026,0.00024787962,0.00018321579,0.00008926441,0.00003561297,0.00040261776,0.000074204916,0.86936474,0.02074958,0.08167394,0.027062083,0.00007568789],"about_ca_topic_score_codex":0.0024199097,"about_ca_topic_score_gemma":0.0035481923,"teacher_disagreement_score":0.0024199097,"about_ca_system_score_codex":0.0009823509,"about_ca_system_score_gemma":0.0019462919,"threshold_uncertainty_score":0.007127464},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000529053,0.020067744,0.0004149991,0.8819224,0.096032836,0.000009541279,0.000082019076,0.00006914937,0.00087212474],"genre_scores_gemma":[0.01093035,0.035020415,0.0010864792,0.74441016,0.20148563,0.000048877733,0.000113211674,0.0002543085,0.0066505293],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9910533,0.004255943,0.00075123645,0.0010774931,0.0020687336,0.00079335563],"domain_scores_gemma":[0.9445045,0.028571608,0.0035648278,0.0014376345,0.014754968,0.007166522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00813656,0.0012564181,0.0017055927,0.0016199257,0.0045405994,0.010210519,0.0031480673,0.014098878,0.012617473],"category_scores_gemma":[0.06663129,0.0007235325,0.0012425694,0.0012175222,0.005837304,0.02670787,0.0037446874,0.033642538,0.0065274145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050121598,0.00002938418,0.0006656484,0.00056635175,0.000027303631,0.00061187864,0.0017029054,0.00001934962,0.000115331095,0.00201209,0.9687867,0.025412934],"study_design_scores_gemma":[0.000021682148,0.00008335114,0.0008934084,0.0016805499,0.000042189808,0.002523804,0.007509776,0.0000764302,0.0001891588,0.0041528726,0.98272175,0.00010508452],"about_ca_topic_score_codex":0.004850945,"about_ca_topic_score_gemma":0.008551681,"teacher_disagreement_score":0.014098878,"about_ca_system_score_codex":0.0028735842,"about_ca_system_score_gemma":0.0047600726,"threshold_uncertainty_score":0.04303074},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13528447,0.00039346772,0.8599115,0.00022675729,0.000053983964,0.00008024754,0.000065476524,0.000412985,0.00357104],"genre_scores_gemma":[0.92934465,0.00017518953,0.069182135,0.00004185418,0.000011756772,0.000058517846,0.000061237755,0.000017642578,0.0011069933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996567,0.000094357354,0.000011822311,0.00004477704,0.00013250156,0.000059824826],"domain_scores_gemma":[0.9991341,0.00037965365,0.00010879537,0.000104858336,0.00023606741,0.00003654075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005464395,0.000345581,0.0002829471,0.00044889227,0.00046077895,0.0003294164,0.0005959527,0.00029021758,0.0006909252],"category_scores_gemma":[0.0016842338,0.00012121862,0.00019455048,0.0006852725,0.00047230147,0.0006850985,0.0007156129,0.00040068652,0.000100370766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022870004,0.00006665123,0.0009475982,0.00008807684,0.000030837196,0.00020948004,0.0001627069,0.8371986,0.025189836,0.026487015,0.0017622467,0.107628204],"study_design_scores_gemma":[0.000006149412,0.0000478444,0.00009665296,0.0000039990873,0.000006126098,0.00004164273,0.000021178144,0.99414366,0.002940394,0.0021961806,0.0004890096,0.000007196999],"about_ca_topic_score_codex":0.0058768326,"about_ca_topic_score_gemma":0.009038545,"teacher_disagreement_score":0.0058768326,"about_ca_system_score_codex":0.0009670979,"about_ca_system_score_gemma":0.00132177,"threshold_uncertainty_score":0.011685252},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017920263,0.010405817,0.083639584,0.004150898,0.004710205,0.0005497765,0.028690645,0.0033419027,0.8627191],"genre_scores_gemma":[0.022144338,0.01713783,0.031001495,0.0016028318,0.0014177231,0.00077997416,0.03210728,0.0011011827,0.8927074],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943644,0.000060951963,0.000028784036,0.00007792961,0.0003426569,0.000053174706],"domain_scores_gemma":[0.99864584,0.00022095931,0.00006002108,0.00016444043,0.00084105745,0.00006764382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044885566,0.00082845124,0.0004960253,0.0026962121,0.0006661904,0.0015705416,0.0010466658,0.00089454785,0.21063164],"category_scores_gemma":[0.002256023,0.00027068658,0.00030978303,0.0024014371,0.00036664042,0.0016815492,0.00082731614,0.0010992168,0.11861352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004731329,0.000016826143,0.00010216425,0.00048714798,0.0000058515648,0.000079295256,0.000055320535,0.00314861,0.0008596557,0.14063686,0.67428136,0.1802797],"study_design_scores_gemma":[0.000004417902,0.0000142584295,0.00012595055,0.000121314246,0.0000028785091,0.000108989785,0.000016928443,0.0011599663,0.00042510583,0.018776497,0.97923386,0.000009789922],"about_ca_topic_score_codex":0.0040579746,"about_ca_topic_score_gemma":0.0045486693,"teacher_disagreement_score":0.21063164,"about_ca_system_score_codex":0.0015801559,"about_ca_system_score_gemma":0.0013034436,"threshold_uncertainty_score":0.704633},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035004165,0.00023850027,0.96169126,0.000059029917,0.000011623014,0.000021187774,0.000045952733,0.00015348007,0.0027747145],"genre_scores_gemma":[0.9160573,0.0003996785,0.08125778,0.000034994886,0.00001351259,0.00005768966,0.000063401036,0.000034023822,0.002081673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996081,0.00015804113,0.000013272599,0.00005684128,0.00009470797,0.00006911072],"domain_scores_gemma":[0.9993305,0.00036161224,0.00010810769,0.00008924632,0.000085280364,0.000025290916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057678076,0.0004707414,0.000574483,0.00030363936,0.00022417365,0.00083297153,0.0006901178,0.0005532781,0.00087605894],"category_scores_gemma":[0.0013767869,0.000328161,0.00063423486,0.00058965036,0.0006465486,0.00069411227,0.00053850195,0.00045432392,0.0003609842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002402276,0.000014245942,0.00027113844,0.000019857933,0.000007491743,0.00007165978,0.00003518934,0.9806575,0.0033857534,0.010195522,0.00015610659,0.0051615443],"study_design_scores_gemma":[0.0000013013297,0.0000067183023,0.000030377429,0.000001154155,0.0000012381827,0.000016062497,0.0000036671838,0.9989268,0.00025189144,0.0006703218,0.0000879535,0.00000259473],"about_ca_topic_score_codex":0.003990299,"about_ca_topic_score_gemma":0.0029463896,"teacher_disagreement_score":0.003990299,"about_ca_system_score_codex":0.0009228017,"about_ca_system_score_gemma":0.0005570562,"threshold_uncertainty_score":0.007934153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019667834,0.0018885711,0.9750158,0.00027775136,0.00006807544,0.000059273367,0.00006305329,0.00014280365,0.0028167996],"genre_scores_gemma":[0.7308689,0.0030023195,0.2597219,0.00018729162,0.00017785255,0.00020862371,0.00012946813,0.000072943425,0.005630743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952626,0.00017842047,0.000016662643,0.000048430076,0.00018317421,0.00004704527],"domain_scores_gemma":[0.9986627,0.0008697246,0.00014069691,0.000112089845,0.00016832794,0.00004643503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007975845,0.00064113707,0.0003777852,0.0006134713,0.00039287048,0.0005805278,0.0007280698,0.00066832296,0.0015354626],"category_scores_gemma":[0.002803836,0.00023252117,0.00024442057,0.00088868476,0.0006192535,0.0011556305,0.0006318029,0.0009878295,0.00029096616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007713277,0.000043812754,0.00033260667,0.00018835985,0.000028115028,0.00009561777,0.00008001004,0.77639055,0.007069341,0.1355955,0.0016477862,0.07845114],"study_design_scores_gemma":[0.000005451904,0.000038025977,0.000053758813,0.000011620949,0.000005165571,0.000039150375,0.000009154564,0.97614163,0.0013812906,0.021023275,0.0012831928,0.000008171518],"about_ca_topic_score_codex":0.0019356388,"about_ca_topic_score_gemma":0.0021986344,"teacher_disagreement_score":0.0019356388,"about_ca_system_score_codex":0.0011799234,"about_ca_system_score_gemma":0.0008325244,"threshold_uncertainty_score":0.0085609555},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067346264,0.62303483,0.20823541,0.013114524,0.004042659,0.00062185846,0.00050569995,0.001381102,0.1423293],"genre_scores_gemma":[0.15197383,0.6498999,0.14178261,0.0048801815,0.0062286844,0.0010887879,0.0010518782,0.0005132437,0.042580813],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99562293,0.0007194962,0.0003812785,0.00054414186,0.0023204389,0.00041177467],"domain_scores_gemma":[0.9947187,0.0019593595,0.0007173826,0.0003582464,0.0019485835,0.00029761592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004085407,0.002238412,0.0011650687,0.006638924,0.0016346882,0.0060342774,0.0033418522,0.0032461933,0.00763764],"category_scores_gemma":[0.0069205645,0.0008316586,0.0008986694,0.00525305,0.002591465,0.009100702,0.003275474,0.003952669,0.0029955192],"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.00013788717,0.0003132662,0.0023440805,0.0037646836,0.00007408112,0.00024845076,0.00034436586,0.018168725,0.0028603612,0.2603912,0.04032939,0.67102355],"study_design_scores_gemma":[0.000019435362,0.0003447197,0.0030197424,0.0048353146,0.00010337416,0.0010182513,0.0007808864,0.02392616,0.004617063,0.10363291,0.85753673,0.00016541718],"about_ca_topic_score_codex":0.0044352384,"about_ca_topic_score_gemma":0.0022809033,"teacher_disagreement_score":0.00763764,"about_ca_system_score_codex":0.0052510696,"about_ca_system_score_gemma":0.003324265,"threshold_uncertainty_score":0.03809935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037716462,0.000976787,0.9855833,0.0003033292,0.00019486409,0.00023687504,0.000116426476,0.00033154042,0.00848527],"genre_scores_gemma":[0.2916796,0.0029586924,0.66384643,0.00044972074,0.00066894793,0.0017316004,0.00037170935,0.00030091408,0.037992373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961026,0.0019804554,0.00019002726,0.0003954166,0.00089463586,0.00043701124],"domain_scores_gemma":[0.9939407,0.00394836,0.00034404203,0.0010385999,0.00054082426,0.00018749802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053448705,0.002153199,0.0025751535,0.0011578712,0.0009397872,0.003007388,0.0043379725,0.0026516833,0.014792398],"category_scores_gemma":[0.012047875,0.0015322361,0.0010453808,0.0023458193,0.0013436812,0.0048076827,0.0028169213,0.0037608945,0.00251418],"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.00053403224,0.000514359,0.00020714499,0.00071029004,0.000103944745,0.00009643472,0.00013114308,0.17823145,0.0072206925,0.46972552,0.023061804,0.3194632],"study_design_scores_gemma":[0.00029066435,0.00033551082,0.00016676985,0.00011516303,0.00006594174,0.00020166754,0.000038727794,0.5626061,0.0024308509,0.4199287,0.0137762,0.00004374298],"about_ca_topic_score_codex":0.00031701726,"about_ca_topic_score_gemma":0.00048275263,"teacher_disagreement_score":0.014792398,"about_ca_system_score_codex":0.0018806634,"about_ca_system_score_gemma":0.0021716994,"threshold_uncertainty_score":0.049485564},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031828843,0.0003508347,0.9480361,0.0008155988,0.000050065388,0.000055547018,0.00007014553,0.000118426084,0.018674474],"genre_scores_gemma":[0.8773677,0.00086592,0.11076076,0.0003021229,0.00013827816,0.00028626228,0.00012587885,0.00012066346,0.0100325635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829024,0.000781421,0.000053149088,0.00016681486,0.0004837123,0.000224545],"domain_scores_gemma":[0.9947556,0.003557157,0.00059652666,0.00044425065,0.00045684056,0.00018965885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022242588,0.00071683293,0.0005816993,0.0008757042,0.0009797539,0.0023411447,0.0010815669,0.0011805064,0.0031848003],"category_scores_gemma":[0.008715421,0.00038160937,0.00046148707,0.0010192435,0.003040797,0.003346994,0.0032854602,0.0024798021,0.00052938564],"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.000038648872,0.000017496817,0.00010831532,0.000046090678,0.000006889502,0.00005932944,0.00014686976,0.074959695,0.0016690248,0.91629064,0.0006981192,0.005958931],"study_design_scores_gemma":[0.000023884559,0.00004437457,0.00007128933,0.000040652023,0.000009058668,0.00010618493,0.000105404426,0.45365304,0.002398296,0.54013824,0.0033890908,0.000020435999],"about_ca_topic_score_codex":0.0008835867,"about_ca_topic_score_gemma":0.0007506487,"teacher_disagreement_score":0.0031848003,"about_ca_system_score_codex":0.0019912717,"about_ca_system_score_gemma":0.0013100448,"threshold_uncertainty_score":0.014447749},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14674357,0.003571275,0.8118792,0.00295846,0.00027116915,0.00014730477,0.0010303915,0.0007469344,0.03265172],"genre_scores_gemma":[0.85163337,0.0041925116,0.13622814,0.00036131174,0.00034654222,0.0005621942,0.0008658901,0.00034032142,0.005469883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980635,0.00047701198,0.00008785386,0.00028725274,0.00076160324,0.00032283633],"domain_scores_gemma":[0.97253346,0.021076638,0.0013225122,0.0024779267,0.002016621,0.00057292444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027022657,0.0012743464,0.0011728873,0.0017650619,0.0009064578,0.0016981346,0.0015912578,0.0011821829,0.003225471],"category_scores_gemma":[0.024894271,0.0005387725,0.00052937,0.001289068,0.0022093272,0.005248801,0.0026876274,0.0024698302,0.0007252981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073788804,0.00014829643,0.002071496,0.00063746993,0.000060575607,0.00032256928,0.0004297992,0.46667022,0.037982102,0.41997263,0.0070978478,0.06386906],"study_design_scores_gemma":[0.00005449875,0.00019028773,0.00078239484,0.00016873374,0.000028955721,0.0004858246,0.00017246617,0.6756876,0.023303663,0.29281723,0.00623341,0.00007492908],"about_ca_topic_score_codex":0.0006230376,"about_ca_topic_score_gemma":0.0006374117,"teacher_disagreement_score":0.003225471,"about_ca_system_score_codex":0.0019520331,"about_ca_system_score_gemma":0.0013065167,"threshold_uncertainty_score":0.014291108},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06811844,0.0001559648,0.9232172,0.00044909999,0.00006395315,0.0001724678,0.0000889802,0.00009517439,0.007638717],"genre_scores_gemma":[0.9406255,0.00013930844,0.053266745,0.00014165709,0.000029263441,0.00023655573,0.00006412232,0.000018787548,0.0054780287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983646,0.0007533697,0.000056037465,0.0003508493,0.00022214797,0.00025288013],"domain_scores_gemma":[0.99832565,0.00091979484,0.00026328675,0.00009890149,0.00016933038,0.00022304936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016512382,0.0010647202,0.001037648,0.0004070728,0.0008953784,0.0010508838,0.0020566657,0.0017457654,0.0028508706],"category_scores_gemma":[0.0033398755,0.000331272,0.00090819807,0.00046361142,0.0014923235,0.0017212073,0.001644451,0.0017369633,0.00028016875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002782376,0.00012828679,0.0015736076,0.000118273754,0.00012420294,0.0007826418,0.00031389197,0.86716074,0.004207417,0.10618604,0.0012899872,0.01783668],"study_design_scores_gemma":[0.000023398652,0.000063477055,0.00011127044,0.0000056711588,0.0000151473105,0.000063107116,0.00004483876,0.98377305,0.00029875335,0.0150086945,0.0005806724,0.000011877701],"about_ca_topic_score_codex":0.004082,"about_ca_topic_score_gemma":0.0039719376,"teacher_disagreement_score":0.004082,"about_ca_system_score_codex":0.0013020836,"about_ca_system_score_gemma":0.001415649,"threshold_uncertainty_score":0.009537101},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03201602,0.000100910096,0.96487194,0.0002695338,0.000035917346,0.00010103932,0.00007258106,0.00030927203,0.0022228123],"genre_scores_gemma":[0.9153707,0.000121572346,0.080950916,0.0002070719,0.000024271843,0.00020517205,0.000113462476,0.000033025764,0.002973864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813974,0.00063144974,0.000074120704,0.0004514567,0.00034778775,0.00035536365],"domain_scores_gemma":[0.99841964,0.00077049714,0.0001755924,0.00017726046,0.0002911351,0.00016591368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027225476,0.001153621,0.0014316712,0.0005948064,0.00090625655,0.001425216,0.0026050801,0.0015752848,0.0021196513],"category_scores_gemma":[0.0041315267,0.00044675297,0.0010263333,0.00065233017,0.0010806343,0.0023492968,0.0020277635,0.0014669487,0.0002589315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001720202,0.00016738568,0.0011233933,0.000061350314,0.000068773275,0.0001820121,0.00009830247,0.9402767,0.001390078,0.018997006,0.0012908314,0.036172193],"study_design_scores_gemma":[0.000010496403,0.00003073251,0.00006415671,0.000002963768,0.00000732774,0.000021854923,0.000010673834,0.9942551,0.00026953424,0.005148274,0.00017352373,0.0000053055887],"about_ca_topic_score_codex":0.0056397608,"about_ca_topic_score_gemma":0.004296933,"teacher_disagreement_score":0.0056397608,"about_ca_system_score_codex":0.0014657667,"about_ca_system_score_gemma":0.002344824,"threshold_uncertainty_score":0.014398396},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1387595,0.0012251016,0.8543096,0.0002319058,0.0000346076,0.000027539325,0.00010227953,0.00020817561,0.0051012957],"genre_scores_gemma":[0.9831108,0.00077333796,0.01473365,0.00005166252,0.000025364403,0.000040296058,0.000048536607,0.000025959069,0.0011905195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990984,0.00033759142,0.000036018373,0.00008649559,0.00029721254,0.00014443336],"domain_scores_gemma":[0.9938465,0.0048376764,0.0005224354,0.00026977283,0.00046491632,0.00005864202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013674079,0.0006057789,0.0007495804,0.0005493519,0.00039481494,0.0008487712,0.0007355795,0.0007134261,0.0007696878],"category_scores_gemma":[0.009002565,0.00027626244,0.0002647096,0.00094767235,0.0017142319,0.0014668027,0.00093814236,0.0006276512,0.00015434204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027913258,0.000008802617,0.00059651845,0.00007901899,0.000011731423,0.00021443282,0.00014682046,0.9568051,0.0017281785,0.03549385,0.00022601838,0.0046615545],"study_design_scores_gemma":[0.0000034964594,0.000017883878,0.0003009363,0.000014354772,0.000007704631,0.00009247572,0.000029328929,0.98185915,0.0006039146,0.016830523,0.00023153228,0.000008701305],"about_ca_topic_score_codex":0.0033325076,"about_ca_topic_score_gemma":0.0023314264,"teacher_disagreement_score":0.0033325076,"about_ca_system_score_codex":0.0013510346,"about_ca_system_score_gemma":0.0007490234,"threshold_uncertainty_score":0.009802461},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008925632,0.00038408636,0.9841309,0.00067310716,0.00016785196,0.00020960878,0.000090213536,0.002145882,0.0032727004],"genre_scores_gemma":[0.7114638,0.00069425063,0.2798194,0.001191786,0.00016384643,0.00074327353,0.00047954623,0.0002489208,0.0051952065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989503,0.0003978469,0.00007921451,0.00014375734,0.00033652844,0.00009244277],"domain_scores_gemma":[0.9978682,0.0008821692,0.00027277137,0.000353756,0.0005349744,0.00008817078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002450931,0.00045735275,0.00057507906,0.0007559259,0.0007719086,0.0011535464,0.0017127506,0.0011120178,0.0020862462],"category_scores_gemma":[0.005545177,0.00020180573,0.00036654394,0.00070084305,0.0012554963,0.0016760245,0.0015258155,0.001551042,0.0006864802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005472798,0.00033975203,0.0017915613,0.00045051528,0.00010859888,0.00035601054,0.00042547612,0.3506055,0.02551697,0.118840165,0.023688765,0.4773294],"study_design_scores_gemma":[0.000055553042,0.0002430946,0.00023949929,0.00003234243,0.000022677184,0.0001617382,0.000032484433,0.95006406,0.008996465,0.026662799,0.013450301,0.000038970804],"about_ca_topic_score_codex":0.0017697731,"about_ca_topic_score_gemma":0.0021018072,"teacher_disagreement_score":0.002450931,"about_ca_system_score_codex":0.0009952873,"about_ca_system_score_gemma":0.001452454,"threshold_uncertainty_score":0.012961924},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022367219,0.0014992532,0.96740896,0.00032664,0.00008650089,0.00008543347,0.00009529538,0.00013763162,0.0079931235],"genre_scores_gemma":[0.67016137,0.0033350126,0.32201168,0.00029609352,0.000120043616,0.00026663745,0.00018644745,0.000053540596,0.003569198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995017,0.00018241678,0.000018185201,0.000051466122,0.00021424818,0.000031933745],"domain_scores_gemma":[0.9991504,0.0004846141,0.00012698659,0.00010494717,0.0001132233,0.000019816756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005256748,0.0005111709,0.00039286766,0.00037804962,0.00030964898,0.00075238035,0.00042824153,0.00072439865,0.0014830579],"category_scores_gemma":[0.0025375688,0.0002443961,0.00032248968,0.0006129187,0.00068736984,0.00077102246,0.00069636933,0.00094296585,0.0004866695],"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.00015406196,0.00004505146,0.0007344293,0.0002871607,0.000030749303,0.00040979765,0.00020294939,0.5492762,0.024338394,0.37509477,0.0014801326,0.04794628],"study_design_scores_gemma":[0.000024683863,0.00011817063,0.00023212295,0.000051408708,0.000017604192,0.00028472213,0.00002414773,0.916068,0.0076409425,0.06804914,0.0074544325,0.000034655637],"about_ca_topic_score_codex":0.0007993626,"about_ca_topic_score_gemma":0.000900977,"teacher_disagreement_score":0.0014830579,"about_ca_system_score_codex":0.0006502626,"about_ca_system_score_gemma":0.00075174065,"threshold_uncertainty_score":0.004961312},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064858474,0.00010411058,0.93184245,0.0002561551,0.00003722067,0.00005642839,0.00004829836,0.00037788157,0.002418916],"genre_scores_gemma":[0.9625463,0.00006411792,0.0360362,0.000074749994,0.0000147186975,0.000058827085,0.000033807497,0.00001796556,0.0011534289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952686,0.00015255793,0.000016669488,0.0001054137,0.00010369888,0.000094855735],"domain_scores_gemma":[0.9991617,0.0002932434,0.00014162742,0.000125327,0.00019459476,0.000083459345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008599271,0.00042490487,0.00044105423,0.00040593563,0.00037569675,0.0006270814,0.00089656556,0.0006647757,0.001250724],"category_scores_gemma":[0.002617259,0.00022474313,0.00028209,0.0003277005,0.00063872495,0.0009777588,0.0009281372,0.00066605455,0.00032342013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014399641,0.000073057105,0.0012592949,0.000060816277,0.000031376316,0.00017440954,0.000081952916,0.9235391,0.013716575,0.022954315,0.0012698909,0.036695357],"study_design_scores_gemma":[0.000012264,0.00006781294,0.00017797304,0.0000058347655,0.000007303083,0.000058368558,0.000025773008,0.9880927,0.0018848359,0.008929448,0.00073100306,0.000006499419],"about_ca_topic_score_codex":0.00091067835,"about_ca_topic_score_gemma":0.0014289742,"teacher_disagreement_score":0.001250724,"about_ca_system_score_codex":0.00078032207,"about_ca_system_score_gemma":0.0005890791,"threshold_uncertainty_score":0.005661726},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071221985,0.00052513287,0.9244994,0.00035976493,0.000056755518,0.000053152493,0.000056392637,0.000467319,0.0027600003],"genre_scores_gemma":[0.9773168,0.00011244747,0.021217251,0.00011942332,0.000021589502,0.00006713508,0.000047772905,0.000023850112,0.0010737814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962246,0.00012397306,0.00001881842,0.00008110256,0.0000649367,0.00008865931],"domain_scores_gemma":[0.99838316,0.0010118076,0.00018992364,0.00010365019,0.00022413928,0.00008738032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010016288,0.0010017554,0.0013355337,0.00043956083,0.00035931708,0.00074535783,0.0014485264,0.001164179,0.0009832765],"category_scores_gemma":[0.0030375838,0.00042755157,0.000547353,0.00038333584,0.0008530201,0.0009551889,0.00081472757,0.0012579724,0.00015645724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035751556,0.00003225021,0.0004202071,0.00002125472,0.000024401146,0.000029812121,0.000020858792,0.9880931,0.00037833967,0.0018866853,0.00025850596,0.008798805],"study_design_scores_gemma":[0.0000034611337,0.000009889951,0.000025070027,0.0000015204805,0.000003286011,0.000002997079,0.0000021377894,0.99923384,0.00006603738,0.0006152992,0.00003509256,0.0000013967518],"about_ca_topic_score_codex":0.008645367,"about_ca_topic_score_gemma":0.0077821603,"teacher_disagreement_score":0.008645367,"about_ca_system_score_codex":0.00093971734,"about_ca_system_score_gemma":0.001285879,"threshold_uncertainty_score":0.01719004},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011121387,0.0014763367,0.97983325,0.0005615035,0.00006196064,0.00004296565,0.00008004336,0.00011427693,0.0067082765],"genre_scores_gemma":[0.59107643,0.0040870295,0.3933217,0.00042115973,0.00036629417,0.00034698294,0.00034869165,0.00014195527,0.009889726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990815,0.00024601188,0.000030258665,0.0001049992,0.0004119083,0.00012528167],"domain_scores_gemma":[0.99737036,0.0019343711,0.00020283772,0.00018830366,0.00025212573,0.000051884206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011608071,0.00091568835,0.0006624256,0.00077111245,0.00059863395,0.0015228905,0.0010287846,0.00093138026,0.0024177479],"category_scores_gemma":[0.0058827163,0.00032564532,0.00049049605,0.0011527631,0.0013214994,0.0017985153,0.0015033873,0.0026148316,0.0006239438],"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.0001345163,0.00004446945,0.00030428445,0.00020828295,0.000032031916,0.00013704937,0.00023693606,0.41186604,0.00735623,0.4877456,0.004104829,0.087829724],"study_design_scores_gemma":[0.000018864177,0.000042782187,0.00008658227,0.000037742517,0.00001055884,0.00006700552,0.000042490203,0.81449866,0.002749891,0.17961735,0.0028128405,0.000015202205],"about_ca_topic_score_codex":0.0026101288,"about_ca_topic_score_gemma":0.002244546,"teacher_disagreement_score":0.0026101288,"about_ca_system_score_codex":0.0016967277,"about_ca_system_score_gemma":0.0013596282,"threshold_uncertainty_score":0.012310624},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039917994,0.0003422923,0.95512503,0.0005219621,0.00005425844,0.000052090832,0.000031526848,0.00020552089,0.003749346],"genre_scores_gemma":[0.96577203,0.000115248076,0.032327287,0.00013582729,0.00001865837,0.0000614854,0.000020856065,0.00001814713,0.0015304903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995976,0.00012582666,0.000017048726,0.000081137834,0.0000933498,0.00008510936],"domain_scores_gemma":[0.99904925,0.00047431953,0.00013386972,0.000043301938,0.0002312274,0.000067996996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011987779,0.0005887336,0.0006712058,0.000223096,0.00031381234,0.00060163235,0.00097550475,0.00083245814,0.0018326839],"category_scores_gemma":[0.002997304,0.00030470596,0.0002676481,0.00021382004,0.0008099986,0.0007862258,0.000865578,0.001229242,0.00021833822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095040814,0.000053960954,0.0005454545,0.000048138947,0.000022925706,0.000069471775,0.00005421448,0.9661147,0.002750357,0.008884596,0.00067401654,0.02068717],"study_design_scores_gemma":[0.000006150958,0.000020624315,0.000028318003,0.0000028666386,0.0000030787467,0.0000050073368,0.0000023730956,0.9986798,0.00017198332,0.0009924935,0.00008523435,0.0000020035698],"about_ca_topic_score_codex":0.0043318127,"about_ca_topic_score_gemma":0.0041513345,"teacher_disagreement_score":0.0043318127,"about_ca_system_score_codex":0.00089648785,"about_ca_system_score_gemma":0.0014142294,"threshold_uncertainty_score":0.008613229},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43626657,0.0016040683,0.4694795,0.0014708764,0.00026972548,0.00024816068,0.0005765586,0.0005898694,0.08949476],"genre_scores_gemma":[0.93175834,0.0011460816,0.056818448,0.0003395156,0.00010527617,0.00018937443,0.00026675072,0.00012698222,0.009249278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998998,0.00038461483,0.00003719262,0.00011759189,0.00025707047,0.00020558343],"domain_scores_gemma":[0.99660575,0.0019154372,0.00031456738,0.0007350068,0.00028131428,0.00014785027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012248992,0.00032501353,0.00034121776,0.0008407664,0.0011657781,0.0010105425,0.00064250454,0.0006757002,0.0045836135],"category_scores_gemma":[0.0061830725,0.0002514379,0.0003355449,0.0009238696,0.0018360225,0.0024800722,0.0016365749,0.0012801546,0.00054910354],"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.00007365487,0.000012017177,0.0001405904,0.00004913111,0.0000032407736,0.000028675968,0.00021724415,0.008258101,0.0027948304,0.97780776,0.0012245865,0.009390135],"study_design_scores_gemma":[0.000058044847,0.00010443501,0.00027223412,0.00006902653,0.00001607457,0.00014671343,0.00026939064,0.069573484,0.005586662,0.9105945,0.013269447,0.000039961837],"about_ca_topic_score_codex":0.0013926731,"about_ca_topic_score_gemma":0.0013633929,"teacher_disagreement_score":0.0045836135,"about_ca_system_score_codex":0.0015041321,"about_ca_system_score_gemma":0.0007851637,"threshold_uncertainty_score":0.015333772},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020794706,0.0002897027,0.975486,0.00026497035,0.000035364337,0.0000391017,0.0000409209,0.00015153452,0.0028976696],"genre_scores_gemma":[0.93768346,0.0002642282,0.057933487,0.00012908009,0.000030648065,0.00017792913,0.00008599054,0.00004150042,0.0036536555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993649,0.00024057933,0.00002447344,0.00013713681,0.00011900639,0.00011400615],"domain_scores_gemma":[0.99817514,0.001331859,0.00017387375,0.00005912282,0.00017779312,0.00008223286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013779826,0.0009585306,0.0012287239,0.0005413518,0.00047916017,0.0009459377,0.0012543615,0.0013021263,0.002013081],"category_scores_gemma":[0.0031117955,0.0005781196,0.0006520778,0.0005489332,0.0011954911,0.00089050847,0.0013950957,0.0012775997,0.0002456335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022392593,0.000012819607,0.00015676316,0.000021508187,0.000011763483,0.000042646934,0.000027725255,0.9899356,0.00022575937,0.005279731,0.00021934397,0.004043943],"study_design_scores_gemma":[0.0000041874346,0.000008979008,0.000015206689,0.0000016210909,0.0000026319906,0.0000034136874,0.0000032955056,0.9981998,0.00004497192,0.0016305227,0.000084061314,0.000001279591],"about_ca_topic_score_codex":0.009282872,"about_ca_topic_score_gemma":0.00617531,"teacher_disagreement_score":0.009282872,"about_ca_system_score_codex":0.001348402,"about_ca_system_score_gemma":0.0015647947,"threshold_uncertainty_score":0.01845771},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07707316,0.0002543785,0.90842056,0.00088534097,0.000118448275,0.00023753372,0.00004667958,0.0019436522,0.01102026],"genre_scores_gemma":[0.9103115,0.00015958157,0.08421654,0.00016364694,0.000035463298,0.00011627857,0.00007347837,0.000056215133,0.004867244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883455,0.00025880677,0.00009044463,0.00021133086,0.00039555522,0.00020933262],"domain_scores_gemma":[0.9987557,0.00018250816,0.00020911756,0.0002872259,0.00039688422,0.0001686335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014951762,0.0004360853,0.00036011921,0.00042328532,0.0009999103,0.0016477854,0.0013641384,0.0008256284,0.0018070362],"category_scores_gemma":[0.0021153179,0.00021506463,0.00047630354,0.00019051957,0.0014639663,0.0023173818,0.0030373456,0.0012860701,0.0005247396],"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.0006439044,0.0003294975,0.006162759,0.00035711675,0.00017203,0.0009288672,0.0015142942,0.29761904,0.057475325,0.47550705,0.007025306,0.15226473],"study_design_scores_gemma":[0.000036999827,0.00018620917,0.0004997355,0.00003212744,0.000054790104,0.00021143693,0.00010417026,0.919538,0.010642328,0.055498123,0.013155239,0.000040781095],"about_ca_topic_score_codex":0.0023518407,"about_ca_topic_score_gemma":0.0025980116,"teacher_disagreement_score":0.0023518407,"about_ca_system_score_codex":0.0013044942,"about_ca_system_score_gemma":0.0019966718,"threshold_uncertainty_score":0.0094648},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008904948,0.000059222908,0.9901057,0.00011641497,0.000017186527,0.000029879768,0.0000117755735,0.0001353195,0.00061947963],"genre_scores_gemma":[0.7569054,0.00017563347,0.24094528,0.00011079146,0.000055801218,0.00037830017,0.0000784619,0.00008083243,0.0012694994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990709,0.00041142848,0.00004341129,0.00018767838,0.00021599754,0.00007052936],"domain_scores_gemma":[0.9974994,0.0011847229,0.0003330262,0.00029878737,0.00054478104,0.00013929997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017528129,0.0006377453,0.0008170206,0.00057632,0.0005415946,0.0007158479,0.0016662974,0.0009892441,0.0008801789],"category_scores_gemma":[0.007629332,0.00041502487,0.00031558127,0.0006808709,0.0010797319,0.001662758,0.0014970561,0.0009052499,0.00027743148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005487668,0.00004216539,0.0005098717,0.00006926518,0.000019255445,0.000047397156,0.00008523233,0.92217404,0.0042285253,0.021915486,0.0009738016,0.049880035],"study_design_scores_gemma":[0.000008341757,0.0000238402,0.000034783123,0.000002626105,0.0000020422265,0.000015543696,0.000007964566,0.9941665,0.0005275485,0.0049358024,0.0002707191,0.000004222179],"about_ca_topic_score_codex":0.0013340166,"about_ca_topic_score_gemma":0.0016551118,"teacher_disagreement_score":0.0017528129,"about_ca_system_score_codex":0.0006397951,"about_ca_system_score_gemma":0.0012872571,"threshold_uncertainty_score":0.009269834},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038779206,0.0032521603,0.9843545,0.0010536186,0.00027193336,0.00003980004,0.00006770073,0.0005418376,0.0065405597],"genre_scores_gemma":[0.6219788,0.01259577,0.3405392,0.0013107328,0.0010182634,0.0004543449,0.0005493292,0.00014607352,0.02140748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990392,0.00036663355,0.000045884648,0.00017763827,0.00028380367,0.00008687843],"domain_scores_gemma":[0.99877185,0.00069178507,0.00008418284,0.00023033356,0.00019073064,0.00003109616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013427263,0.0008027595,0.0009388371,0.00055886334,0.0004369544,0.0015227267,0.00096002774,0.0012661705,0.0032201754],"category_scores_gemma":[0.0035428621,0.00025729206,0.00050992606,0.0013703501,0.000825885,0.0014515476,0.0014644433,0.0020776314,0.0010404399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012222695,0.00011826245,0.0005822453,0.00029369153,0.00009027393,0.00012309669,0.00006530674,0.4735936,0.0017557621,0.14632642,0.013871444,0.36305764],"study_design_scores_gemma":[0.000008931689,0.000039493305,0.00009268611,0.000028585251,0.000008162521,0.000042147793,0.000016200818,0.9287114,0.00062745274,0.06339909,0.007018261,0.000007666559],"about_ca_topic_score_codex":0.001716836,"about_ca_topic_score_gemma":0.0014190692,"teacher_disagreement_score":0.0032201754,"about_ca_system_score_codex":0.0009663633,"about_ca_system_score_gemma":0.0010431166,"threshold_uncertainty_score":0.010772526},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08083023,0.002103305,0.9030968,0.0009914268,0.00019452363,0.00012723649,0.00013154722,0.00052937196,0.011995551],"genre_scores_gemma":[0.96984756,0.0007097487,0.026787465,0.00014191035,0.00006551273,0.00005638154,0.0000326528,0.000040525756,0.0023182342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833256,0.0005198552,0.000044085573,0.00017852087,0.00059347425,0.00033159388],"domain_scores_gemma":[0.9980501,0.0009602405,0.00034476013,0.00016525814,0.00037375544,0.0001058953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021329345,0.00079003687,0.0006963932,0.0006505964,0.0009190619,0.0016244163,0.0014008511,0.0011558832,0.0029582714],"category_scores_gemma":[0.0058119036,0.00029558575,0.0005729912,0.0007227237,0.0012311584,0.001990831,0.0014435202,0.001329213,0.00044429905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015938966,0.0000784662,0.0009991482,0.00013451492,0.00003152872,0.00035510384,0.00017481072,0.8038331,0.0067374147,0.15801775,0.002676455,0.026802408],"study_design_scores_gemma":[0.000007845867,0.00004542366,0.00009814403,0.000015310683,0.000009178952,0.000079448684,0.000033903503,0.9840816,0.000543585,0.014088481,0.0009822994,0.000014774749],"about_ca_topic_score_codex":0.007733499,"about_ca_topic_score_gemma":0.006213832,"teacher_disagreement_score":0.007733499,"about_ca_system_score_codex":0.002015398,"about_ca_system_score_gemma":0.002180602,"threshold_uncertainty_score":0.015376985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024076696,0.00024410372,0.9732472,0.00026913706,0.000032769007,0.000039476185,0.000064644664,0.001349949,0.00067615445],"genre_scores_gemma":[0.84657514,0.00014160451,0.15081589,0.00022141471,0.000031970296,0.000103612016,0.00020621909,0.00008723543,0.0018169094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989654,0.00039723833,0.00005686344,0.00024307902,0.00019443632,0.00014302693],"domain_scores_gemma":[0.99723107,0.0012098729,0.00025858628,0.0007460368,0.00041889082,0.00013556867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028615517,0.0008955615,0.0011374993,0.00071198994,0.00081021595,0.0011629487,0.0023220421,0.001405741,0.0011653845],"category_scores_gemma":[0.006817039,0.00045491676,0.00069448777,0.0007232601,0.0010508497,0.0023820342,0.0019466367,0.0016983357,0.0002936328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012668136,0.00007917355,0.00084053486,0.000030248679,0.000045709352,0.000056750578,0.00004819263,0.9299284,0.0008854903,0.004360319,0.0009013101,0.06269725],"study_design_scores_gemma":[0.0000034745578,0.0000112793405,0.00004148292,0.0000021952458,0.000003297328,0.000007548479,0.00000556322,0.99466926,0.00043974124,0.004690873,0.00012302383,0.000002219454],"about_ca_topic_score_codex":0.006990222,"about_ca_topic_score_gemma":0.006910154,"teacher_disagreement_score":0.006990222,"about_ca_system_score_codex":0.0015091649,"about_ca_system_score_gemma":0.0015352936,"threshold_uncertainty_score":0.0151335},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39290732,0.00094121456,0.55696857,0.00077608746,0.00016614312,0.00019428841,0.00048637134,0.00061556115,0.046944544],"genre_scores_gemma":[0.92542475,0.0004811566,0.0685794,0.00019977031,0.00004340158,0.00015622804,0.00024331237,0.000080501566,0.0047915373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992938,0.00024089924,0.000031510208,0.00010266679,0.00019124245,0.00013987845],"domain_scores_gemma":[0.99828976,0.00073106494,0.00019939846,0.0004497106,0.00021147763,0.00011851342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073122245,0.00022475407,0.00035655044,0.0006061343,0.0009017427,0.0008315599,0.0007040744,0.0005723995,0.0031719091],"category_scores_gemma":[0.0033894402,0.00018881312,0.00033103648,0.00065288745,0.001187519,0.0016845209,0.0011803776,0.00085585465,0.00034670235],"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.00015834946,0.000024464101,0.0004538872,0.000103599436,0.000012526826,0.00006846407,0.0003805274,0.022428943,0.0123539055,0.937131,0.0025048146,0.024379443],"study_design_scores_gemma":[0.00009610441,0.00019166309,0.0008545858,0.00008766895,0.000030442396,0.00038567113,0.00064347795,0.17328633,0.01641458,0.7858386,0.022067275,0.00010364021],"about_ca_topic_score_codex":0.0011891996,"about_ca_topic_score_gemma":0.0016113321,"teacher_disagreement_score":0.0031719091,"about_ca_system_score_codex":0.0012988516,"about_ca_system_score_gemma":0.0006482339,"threshold_uncertainty_score":0.010611117},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00833311,0.0074339593,0.9517887,0.00039338748,0.00019607252,0.000043048585,0.00009501588,0.00023728784,0.031479456],"genre_scores_gemma":[0.6547654,0.03423157,0.28233403,0.000629025,0.00044145307,0.000241851,0.00028411765,0.000109426706,0.02696303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963486,0.00013265038,0.000017635854,0.00007922239,0.000101834594,0.000033765882],"domain_scores_gemma":[0.99975985,0.00010033635,0.00004075403,0.000039215425,0.00004545326,0.000014469068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043161013,0.00050493603,0.00036778848,0.0003824173,0.0003151354,0.0007762645,0.00054034137,0.0005643193,0.0014118328],"category_scores_gemma":[0.0009645536,0.00022847007,0.00023183867,0.0007212084,0.00070918334,0.0013035323,0.00069600047,0.000679394,0.0009394465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001227073,0.000025262529,0.0004124148,0.00047109174,0.000029072666,0.00037275278,0.00023561608,0.09157328,0.013569863,0.7507776,0.008289639,0.13412061],"study_design_scores_gemma":[0.000053672382,0.00030350717,0.00045779013,0.00015243104,0.00006634769,0.0021614062,0.00023378094,0.45007902,0.012517592,0.39821804,0.13567473,0.00008165654],"about_ca_topic_score_codex":0.0007807885,"about_ca_topic_score_gemma":0.000676721,"teacher_disagreement_score":0.0014118328,"about_ca_system_score_codex":0.000501651,"about_ca_system_score_gemma":0.00035465977,"threshold_uncertainty_score":0.0047230124},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049436152,0.00017988638,0.946652,0.0003004313,0.000050838433,0.000030824925,0.000041668587,0.000440196,0.002868077],"genre_scores_gemma":[0.9614078,0.000052652256,0.036820985,0.00011068245,0.000013392762,0.00003728217,0.00004129296,0.000033095508,0.0014828418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975115,0.00007029995,0.000009548532,0.00006218545,0.000054057236,0.000052747924],"domain_scores_gemma":[0.99946326,0.00023898597,0.00008790336,0.000047135847,0.0001116005,0.000051108902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007459821,0.00057014776,0.0005938066,0.00025396212,0.00034536907,0.00051368395,0.0009504325,0.00058734504,0.0010913663],"category_scores_gemma":[0.0015540703,0.00021333256,0.00030288793,0.00020563787,0.0005531476,0.00076368224,0.0008937739,0.000769642,0.00018680998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040656716,0.000024738005,0.00035304797,0.000018826397,0.000012935429,0.000038742775,0.000028188362,0.9810908,0.0016509762,0.0030423957,0.00048588216,0.013212724],"study_design_scores_gemma":[0.0000028461984,0.000009680955,0.000030722298,8.7238345e-7,0.0000014601916,0.0000034849577,0.0000039486354,0.99881834,0.00015779103,0.0008915963,0.00007800139,0.0000011128815],"about_ca_topic_score_codex":0.004843598,"about_ca_topic_score_gemma":0.0063494937,"teacher_disagreement_score":0.004843598,"about_ca_system_score_codex":0.0007706037,"about_ca_system_score_gemma":0.0007869232,"threshold_uncertainty_score":0.009630799},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23355842,0.0007632752,0.71602976,0.0033921257,0.00013772746,0.00027740418,0.001598552,0.0024590832,0.041783568],"genre_scores_gemma":[0.79392046,0.0014123389,0.1685396,0.0011444647,0.00014848901,0.00049552874,0.0024467707,0.00062299625,0.03126928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988594,0.0003878381,0.00007278424,0.00025250192,0.00026535816,0.00016212527],"domain_scores_gemma":[0.9936306,0.0040466744,0.000685122,0.0007086469,0.00060043024,0.00032852075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012148746,0.0006423505,0.00060793775,0.0017037094,0.001197526,0.0023626024,0.0010819667,0.0016637612,0.010018431],"category_scores_gemma":[0.011941942,0.00053729455,0.00073741,0.002020743,0.0013011446,0.0049426476,0.0020350388,0.0012176638,0.0022844416],"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.00022873735,0.00009760856,0.0018119168,0.00026690663,0.000041123058,0.00030829915,0.0004882176,0.09814147,0.0038369747,0.8221779,0.012547557,0.060053308],"study_design_scores_gemma":[0.0000654637,0.00004829651,0.0005805348,0.000060084665,0.000032617936,0.0002845124,0.00012922513,0.282874,0.002536765,0.7046699,0.008696014,0.000022628956],"about_ca_topic_score_codex":0.001703985,"about_ca_topic_score_gemma":0.0032472492,"teacher_disagreement_score":0.010018431,"about_ca_system_score_codex":0.0018171584,"about_ca_system_score_gemma":0.001207019,"threshold_uncertainty_score":0.033515036},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06293483,0.00039867274,0.9325565,0.00019442668,0.000021383295,0.000059609312,0.000057550464,0.00017201561,0.0036049245],"genre_scores_gemma":[0.8745502,0.00037236122,0.12227626,0.000069279726,0.000025165024,0.00012848791,0.0001199032,0.000066418776,0.0023918643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994419,0.00023060419,0.00001584988,0.00009374999,0.00011927531,0.00009855489],"domain_scores_gemma":[0.9984919,0.0010907402,0.00018665954,0.00007243684,0.0000995265,0.000058731443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007959529,0.0008697406,0.00060724886,0.0008041595,0.0005186351,0.0008397679,0.0007519926,0.0008234316,0.0017145592],"category_scores_gemma":[0.0033994105,0.00051355176,0.0003685719,0.0009479762,0.00087376515,0.0012936131,0.0008268294,0.0006177462,0.00028819923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049670358,0.000025778254,0.00038559467,0.000042579053,0.000017894074,0.000100275756,0.00005788012,0.96847725,0.0021197842,0.0081319865,0.00053613924,0.020055229],"study_design_scores_gemma":[0.000008194044,0.000027799888,0.0001267861,0.0000050127896,0.000005980376,0.00004051601,0.000025060413,0.9916523,0.00095209316,0.0068953093,0.00025522427,0.0000057768984],"about_ca_topic_score_codex":0.001545356,"about_ca_topic_score_gemma":0.002243202,"teacher_disagreement_score":0.0017145592,"about_ca_system_score_codex":0.0012492589,"about_ca_system_score_gemma":0.0006192308,"threshold_uncertainty_score":0.009064019},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004425503,0.008978847,0.9459094,0.0004921025,0.00053847657,0.000053696043,0.00008631266,0.00033355228,0.039182287],"genre_scores_gemma":[0.24649642,0.044219986,0.5630035,0.0006369563,0.0011102605,0.00041450563,0.000392731,0.00042371865,0.14330192],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998147,0.000029550034,0.0000062724716,0.000016122081,0.0001211883,0.000012090944],"domain_scores_gemma":[0.9996995,0.00017423363,0.000017156453,0.000042545118,0.00006167232,0.000004884979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023555115,0.00066339603,0.00029673183,0.0007632675,0.00023441705,0.00051522464,0.0006481005,0.0005309344,0.0046513095],"category_scores_gemma":[0.0010426263,0.00029190976,0.0002039782,0.0012552908,0.00061645964,0.0010042728,0.0005916517,0.0013224392,0.001190736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000520448,0.00004077259,0.00009447772,0.00035729486,0.000025861726,0.00011662681,0.00014067852,0.09005249,0.035816345,0.39109212,0.019127106,0.46308425],"study_design_scores_gemma":[0.00002111282,0.000082155646,0.0003592157,0.0002624409,0.000048000642,0.0006417113,0.000058680518,0.61761385,0.032991886,0.19668156,0.15118799,0.000051399435],"about_ca_topic_score_codex":0.0010889455,"about_ca_topic_score_gemma":0.001573402,"teacher_disagreement_score":0.0046513095,"about_ca_system_score_codex":0.0006474628,"about_ca_system_score_gemma":0.00042423807,"threshold_uncertainty_score":0.01556015},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06355303,0.00062080496,0.9258895,0.0005236703,0.00006653659,0.00010410371,0.00016679602,0.00028864082,0.008787006],"genre_scores_gemma":[0.915942,0.0004550601,0.07922365,0.000096897675,0.000034266875,0.00017010127,0.0001444545,0.0000496615,0.0038838997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996201,0.00011693206,0.0000125736,0.00009533638,0.000077405246,0.0000775534],"domain_scores_gemma":[0.9994863,0.00026809616,0.000096474774,0.000028007165,0.00008169199,0.000039290033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053709,0.0018423558,0.001268252,0.00051440863,0.00048690892,0.0011816527,0.00095410156,0.0015270726,0.0028396621],"category_scores_gemma":[0.0015930209,0.0006270655,0.0007275035,0.0008716509,0.0008003421,0.00090722897,0.0011569847,0.00078802963,0.00049044134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055074506,0.000018908982,0.00025493946,0.000041245046,0.000016855683,0.00012936321,0.000033249147,0.9878956,0.0012177544,0.0026926675,0.0005257201,0.0071185646],"study_design_scores_gemma":[0.000010321687,0.00004812936,0.00008421918,0.0000039630836,0.000009488791,0.00003323199,0.000016570364,0.9980792,0.0003150147,0.0011890993,0.00020552229,0.000005208441],"about_ca_topic_score_codex":0.005556192,"about_ca_topic_score_gemma":0.0036584784,"teacher_disagreement_score":0.005556192,"about_ca_system_score_codex":0.0014584472,"about_ca_system_score_gemma":0.0011242485,"threshold_uncertainty_score":0.011047721},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0412953,0.00025743092,0.95562,0.00020915577,0.00003389668,0.000029920962,0.000028091285,0.0006201331,0.0019060329],"genre_scores_gemma":[0.9435472,0.000087880675,0.054910973,0.00012490375,0.000018805742,0.000044728746,0.00007201756,0.000031131527,0.0011624991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951804,0.00013446673,0.000019730083,0.00010476955,0.00009696551,0.00012596902],"domain_scores_gemma":[0.999355,0.00031410446,0.00007286696,0.00008478956,0.000105670646,0.00006755797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011813045,0.00058063434,0.0008212094,0.000290087,0.00054411055,0.00079542934,0.0014054807,0.00079771376,0.0010351647],"category_scores_gemma":[0.0020331289,0.00025810828,0.00047314187,0.00029880533,0.0006229025,0.0010470997,0.001516135,0.0011401783,0.00017810395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058791018,0.00006163603,0.00052978843,0.000016145868,0.00001749773,0.000035618486,0.00003295689,0.96529114,0.00087948306,0.002953427,0.0004591461,0.029664438],"study_design_scores_gemma":[0.000002118549,0.000009224392,0.00002974344,8.629479e-7,0.0000014168448,0.0000034678042,0.0000031708034,0.9989784,0.00010534049,0.00080240035,0.00006275805,0.0000011767427],"about_ca_topic_score_codex":0.006152555,"about_ca_topic_score_gemma":0.006576852,"teacher_disagreement_score":0.006152555,"about_ca_system_score_codex":0.00093430985,"about_ca_system_score_gemma":0.0012357674,"threshold_uncertainty_score":0.012233436},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06069355,0.004933518,0.8779026,0.0008785063,0.00016602705,0.00008210442,0.0007374105,0.00069168146,0.053914618],"genre_scores_gemma":[0.94465995,0.0031577116,0.043200996,0.00028928317,0.0003026944,0.00041707561,0.00071330706,0.00020081525,0.007058155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99684,0.00084872503,0.00010328352,0.00034314196,0.001053295,0.0008115004],"domain_scores_gemma":[0.9816822,0.012700711,0.001147133,0.0012699977,0.0027408665,0.00045916857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027220738,0.0019686327,0.0013801135,0.0016222332,0.0009574243,0.0029475691,0.0019335487,0.0011337455,0.004473739],"category_scores_gemma":[0.01455289,0.0006446492,0.0008870098,0.00164443,0.002665098,0.0028112398,0.0030665712,0.0030930806,0.0010560488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029033833,0.000058514946,0.00040077235,0.00042641128,0.00007303424,0.00029572286,0.0004758234,0.5091087,0.00810111,0.45460814,0.004936107,0.021225216],"study_design_scores_gemma":[0.000020704147,0.00006659128,0.00027727534,0.00011976148,0.00004277294,0.00016270264,0.000095372234,0.8178786,0.004382232,0.17301811,0.0038743059,0.00006152288],"about_ca_topic_score_codex":0.0036437772,"about_ca_topic_score_gemma":0.001745413,"teacher_disagreement_score":0.004473739,"about_ca_system_score_codex":0.003199527,"about_ca_system_score_gemma":0.0016296105,"threshold_uncertainty_score":0.02321434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01487496,0.000116674855,0.98302025,0.000091519425,0.000023254684,0.000018843175,0.000015683265,0.00036503567,0.0014737843],"genre_scores_gemma":[0.8345162,0.00018222693,0.16188294,0.0002168994,0.000040932704,0.000097004064,0.0000824292,0.000057763024,0.0029235953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993388,0.00021151116,0.00003369432,0.00012834772,0.00018285362,0.00010468874],"domain_scores_gemma":[0.9989197,0.00054407725,0.00012120171,0.00014085828,0.00022913236,0.00004506564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012161325,0.00087894977,0.00071719,0.00032919223,0.00038602477,0.0006814623,0.00089826155,0.00080858276,0.0012668745],"category_scores_gemma":[0.0037653348,0.0003199366,0.000366502,0.0005161453,0.0007639457,0.0015058023,0.0012404196,0.0010239332,0.00037938473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116340554,0.000093698436,0.0006439394,0.000048454225,0.000028651177,0.000055024033,0.000057445082,0.8613552,0.004229781,0.006466512,0.00094175077,0.12596329],"study_design_scores_gemma":[0.000006790279,0.000032209802,0.00005185745,0.000003675401,0.0000035423468,0.000012190813,0.00000526721,0.99702626,0.0010408171,0.0016289569,0.0001846901,0.0000037000545],"about_ca_topic_score_codex":0.0026991975,"about_ca_topic_score_gemma":0.0035073012,"teacher_disagreement_score":0.0026991975,"about_ca_system_score_codex":0.00049486896,"about_ca_system_score_gemma":0.0008921164,"threshold_uncertainty_score":0.0064315796},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057532594,0.0015112892,0.9141506,0.002344607,0.00013579737,0.000091237365,0.000036644928,0.00038873297,0.02380845],"genre_scores_gemma":[0.87932867,0.00069324713,0.11773429,0.00026687593,0.00012652902,0.00005636726,0.000030286881,0.000031403455,0.001732323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998754,0.00045683634,0.000053608313,0.00013424752,0.00041107956,0.00019018418],"domain_scores_gemma":[0.9991054,0.00026968794,0.00010613129,0.00023525089,0.00017010853,0.00011347038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018717687,0.00048274983,0.00039176157,0.0005344926,0.0011066989,0.0025572036,0.0008812925,0.00092943845,0.0008732827],"category_scores_gemma":[0.0019614645,0.00026942315,0.00033078567,0.0006854185,0.0015305694,0.003823917,0.0030544228,0.0014341283,0.00025964002],"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.00016255253,0.00013993088,0.0028056898,0.00012861601,0.000058194124,0.0007240674,0.000995777,0.09452526,0.03378939,0.659409,0.0028766098,0.20438497],"study_design_scores_gemma":[0.000020794527,0.00018652639,0.0013328502,0.00011589057,0.000064150874,0.0009388332,0.0007234718,0.62827235,0.012570779,0.29915345,0.056539502,0.00008140215],"about_ca_topic_score_codex":0.0015067419,"about_ca_topic_score_gemma":0.0020859584,"teacher_disagreement_score":0.0025572036,"about_ca_system_score_codex":0.0010214515,"about_ca_system_score_gemma":0.0012645357,"threshold_uncertainty_score":0.009898961},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030002745,0.009655201,0.86417043,0.0044050915,0.0006192041,0.000090267895,0.00023712512,0.00035440273,0.09046554],"genre_scores_gemma":[0.859667,0.017733594,0.100921616,0.0022138667,0.0028337128,0.0005357688,0.00028124906,0.00038399574,0.015429267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884474,0.00038780356,0.00005333545,0.00014856279,0.00044542982,0.00012003614],"domain_scores_gemma":[0.9926603,0.0055774865,0.00036416948,0.00062001095,0.00063032535,0.00014765801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023930431,0.0009816736,0.00077643833,0.0014307554,0.00084194884,0.002186629,0.0009337416,0.0012775948,0.0036486972],"category_scores_gemma":[0.014045403,0.0003962179,0.0006028575,0.0012593049,0.0034059258,0.004889942,0.0013963226,0.003611393,0.00082919677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006437331,0.000013595456,0.00010382037,0.000055722707,0.0000059573636,0.000055064593,0.000100398785,0.011093554,0.0005573276,0.9807344,0.001635931,0.005637773],"study_design_scores_gemma":[0.000005588915,0.000016323165,0.00012383366,0.00004358909,0.000004430219,0.000059272003,0.000028900424,0.09127365,0.00025282186,0.903867,0.0043126214,0.000012028901],"about_ca_topic_score_codex":0.0009318587,"about_ca_topic_score_gemma":0.00042812582,"teacher_disagreement_score":0.0036486972,"about_ca_system_score_codex":0.0015416882,"about_ca_system_score_gemma":0.00062324986,"threshold_uncertainty_score":0.012655735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061538566,0.0003486298,0.9239429,0.000258851,0.00010626547,0.00013543376,0.0001197419,0.011704089,0.0018455643],"genre_scores_gemma":[0.8037361,0.000116523406,0.19217494,0.00034464872,0.00003508404,0.0001915022,0.00042663852,0.00022684221,0.0027477138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993462,0.00013895839,0.000038109796,0.00018685078,0.00015503391,0.000134876],"domain_scores_gemma":[0.9988167,0.00040826728,0.000088079534,0.00033208771,0.0002340838,0.00012077869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014730492,0.0010050065,0.0009765849,0.00038869848,0.0005333829,0.00086756545,0.0025258318,0.0011374485,0.0017234522],"category_scores_gemma":[0.0037919816,0.00037480117,0.00045059103,0.0004096155,0.00070810004,0.0017805751,0.0018593718,0.0014881528,0.0005845939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009932165,0.0006166263,0.0027778738,0.00011604287,0.00010620033,0.00017165112,0.00014291471,0.6233178,0.009038316,0.005396495,0.007210989,0.35011193],"study_design_scores_gemma":[0.000020185767,0.000047829835,0.00010232064,0.000002931003,0.0000047248645,0.0000148675945,0.000008494689,0.9960424,0.0018052151,0.0015926624,0.00035363683,0.000004829417],"about_ca_topic_score_codex":0.006486186,"about_ca_topic_score_gemma":0.006247026,"teacher_disagreement_score":0.006486186,"about_ca_system_score_codex":0.0006858805,"about_ca_system_score_gemma":0.0018360846,"threshold_uncertainty_score":0.012896836},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069342874,0.0006361539,0.92624366,0.0004144381,0.00006421545,0.000036816655,0.0001195682,0.0012824744,0.0018598526],"genre_scores_gemma":[0.937229,0.00016590317,0.06058522,0.00019391405,0.000025384687,0.000045345416,0.0001587056,0.000037547205,0.0015590476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995389,0.000111378,0.000023409815,0.00012246371,0.00009847314,0.00010548155],"domain_scores_gemma":[0.9989121,0.00055285526,0.00009243888,0.00015699286,0.00022316846,0.000062480634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008906463,0.0006282724,0.0010049902,0.00046935934,0.00060686155,0.00083612977,0.0019972383,0.001012602,0.00077829475],"category_scores_gemma":[0.0028151043,0.00029633037,0.00038077394,0.0008809171,0.00071949733,0.0016806282,0.0011447181,0.00090973097,0.00018634334],"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.00010121958,0.00009688283,0.0010620217,0.000033124572,0.000026984615,0.0000666699,0.00004529095,0.9337343,0.0011316872,0.0039831647,0.0016340266,0.05808464],"study_design_scores_gemma":[0.0000027800627,0.000009215189,0.000045104072,0.0000012321416,0.0000024308756,0.0000068571258,0.0000062380623,0.9981121,0.00023688262,0.0014892801,0.00008597962,0.0000018950789],"about_ca_topic_score_codex":0.015451108,"about_ca_topic_score_gemma":0.017859098,"teacher_disagreement_score":0.015451108,"about_ca_system_score_codex":0.001615019,"about_ca_system_score_gemma":0.0015556071,"threshold_uncertainty_score":0.03072232},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06963695,0.000671799,0.9177892,0.00022080158,0.00013978433,0.000031560645,0.00012735558,0.00058564235,0.0107968915],"genre_scores_gemma":[0.9167421,0.00032788768,0.07844777,0.00014298462,0.000034486082,0.00006897082,0.00014543976,0.000021518057,0.0040687434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998312,0.00004451158,0.000005361183,0.000035741712,0.000048094036,0.000034966837],"domain_scores_gemma":[0.9998043,0.00005545517,0.00003470044,0.000044827408,0.000036505717,0.000024309516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015109566,0.0005543306,0.00040622984,0.00023166169,0.00031887903,0.0005093055,0.0008852792,0.000424883,0.0014033942],"category_scores_gemma":[0.00040426195,0.00016159787,0.00029005823,0.00032174774,0.00040814737,0.00081169955,0.0010223741,0.00050542504,0.0005034073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016664904,0.000038067174,0.0009909102,0.000096626114,0.00006749618,0.00035835482,0.00013689403,0.83988595,0.029272057,0.028982416,0.0031617286,0.096842825],"study_design_scores_gemma":[0.0000109518805,0.00009619626,0.00017629213,0.000006593787,0.000014895026,0.00010174342,0.000029442188,0.98602027,0.003680307,0.005600803,0.0042515346,0.000010939063],"about_ca_topic_score_codex":0.0013009221,"about_ca_topic_score_gemma":0.0021499924,"teacher_disagreement_score":0.0014033942,"about_ca_system_score_codex":0.00038269008,"about_ca_system_score_gemma":0.00024843443,"threshold_uncertainty_score":0.0046948195},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13621092,0.0003648513,0.8589693,0.0002881287,0.000034450717,0.000050231924,0.000020366535,0.00019288599,0.0038689203],"genre_scores_gemma":[0.97740024,0.00007747807,0.021724477,0.000044767075,0.00001532249,0.000024718387,0.00001100027,0.000009794729,0.000692228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992046,0.0003201323,0.000023018394,0.0001389212,0.00018376988,0.00012964968],"domain_scores_gemma":[0.99930596,0.00027402933,0.00013566432,0.00012832026,0.00008361887,0.00007240082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001246581,0.00023904123,0.00045892844,0.00027902014,0.0006354889,0.00082593324,0.0010122687,0.00046130412,0.00053954544],"category_scores_gemma":[0.0015040626,0.00016222389,0.0002366109,0.0003419068,0.00086350826,0.0010938486,0.0011184616,0.00054104044,0.000090289686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013349904,0.00009813289,0.0015044532,0.000047154957,0.00003850959,0.0002776403,0.00034585234,0.8432377,0.01772009,0.06393137,0.0010444215,0.071621284],"study_design_scores_gemma":[0.000012541832,0.00003908541,0.00032549954,0.0000043802133,0.0000076605875,0.000040536335,0.000065873566,0.98196757,0.0016475077,0.01471056,0.0011693591,0.000009516406],"about_ca_topic_score_codex":0.0023685757,"about_ca_topic_score_gemma":0.0024647452,"teacher_disagreement_score":0.0023685757,"about_ca_system_score_codex":0.00089981366,"about_ca_system_score_gemma":0.0009667285,"threshold_uncertainty_score":0.0065926313},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072251715,0.0008019192,0.916229,0.0008923687,0.00013261069,0.00006749253,0.0004192536,0.00030703945,0.008898533],"genre_scores_gemma":[0.9031065,0.000879484,0.09094162,0.00028619455,0.00012430118,0.00011351304,0.00027820023,0.000050911476,0.004219104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993143,0.000247741,0.00003321747,0.000089097244,0.00020892885,0.00010671825],"domain_scores_gemma":[0.9986589,0.0007020952,0.00012799793,0.0002922629,0.00017787624,0.00004084857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001173128,0.000533034,0.00064511655,0.0004579552,0.00043475567,0.0009352994,0.00076626905,0.00063738466,0.001879309],"category_scores_gemma":[0.0033994692,0.00021066862,0.00026747133,0.00085474463,0.0010057468,0.0012180432,0.0011103336,0.00072021387,0.0002942252],"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.00031664807,0.000037592006,0.00043689518,0.00012734663,0.000022418159,0.00028391284,0.0002478263,0.19635457,0.012071176,0.7295461,0.0031419904,0.057413425],"study_design_scores_gemma":[0.000059721642,0.00007244819,0.00028643594,0.000042191037,0.00002276813,0.00015908267,0.000043730346,0.68839043,0.0041696164,0.3046052,0.0021090533,0.00003939507],"about_ca_topic_score_codex":0.0017795312,"about_ca_topic_score_gemma":0.0019512632,"teacher_disagreement_score":0.001879309,"about_ca_system_score_codex":0.0008296288,"about_ca_system_score_gemma":0.001350738,"threshold_uncertainty_score":0.006286919},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11768626,0.004272159,0.85728425,0.00033325737,0.00006525251,0.00008399622,0.00023420565,0.000511936,0.019528626],"genre_scores_gemma":[0.98150116,0.0014763972,0.014255222,0.000057288948,0.00005628025,0.00006647992,0.000095421456,0.00005906236,0.0024326462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832994,0.0006405295,0.00006496565,0.0001353608,0.00057880837,0.00025029213],"domain_scores_gemma":[0.9959,0.0023993908,0.00046489565,0.00030839315,0.0008341501,0.000093184986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032518327,0.0018370007,0.001768084,0.0020950644,0.00059223425,0.0019599483,0.00096380577,0.0011430711,0.0022438255],"category_scores_gemma":[0.007914814,0.0005439223,0.0008729134,0.0014818014,0.0013286384,0.0017344904,0.0017807676,0.00087603263,0.0005385184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010466254,0.00003533734,0.0006346624,0.00011440336,0.00006253597,0.00023516823,0.0001904403,0.91784674,0.004004133,0.06414349,0.00083863526,0.011789847],"study_design_scores_gemma":[0.000004171017,0.000037029164,0.00014525474,0.000012622543,0.000015938871,0.00007267431,0.000021268197,0.99113923,0.0006392019,0.0076138787,0.0002874758,0.000011198781],"about_ca_topic_score_codex":0.0034774572,"about_ca_topic_score_gemma":0.0013537143,"teacher_disagreement_score":0.0034774572,"about_ca_system_score_codex":0.0020481707,"about_ca_system_score_gemma":0.0010591798,"threshold_uncertainty_score":0.01719755},"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":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023260342,0.478894,0.0476268,0.008381865,0.007978007,0.000111360285,0.0011617773,0.0003868484,0.4531333],"genre_scores_gemma":[0.052464284,0.4582251,0.036330596,0.0049573705,0.023095662,0.0004942623,0.0020814568,0.00053779065,0.4218135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938715,0.00009494039,0.000028355415,0.0001371948,0.00031164626,0.000040657018],"domain_scores_gemma":[0.9989299,0.0006710108,0.000036641348,0.000094898045,0.00020895766,0.00005853138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048375773,0.0016552056,0.0017652452,0.0027650597,0.00087275624,0.0023581784,0.00097314874,0.0011449449,0.028748982],"category_scores_gemma":[0.0017895645,0.0004567731,0.00074745045,0.0065136775,0.0021823687,0.003983526,0.0009014339,0.003468147,0.01112858],"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.000025108939,0.000047891852,0.00020940935,0.0011232734,0.000037643804,0.00009598803,0.00026812102,0.0026741854,0.0010042915,0.46940383,0.34471837,0.18039183],"study_design_scores_gemma":[0.000008442537,0.000031330135,0.00061591645,0.00040197914,0.000011309815,0.00022675504,0.00006675481,0.0025728345,0.0002909927,0.37538,0.6203729,0.000020819754],"about_ca_topic_score_codex":0.0014466014,"about_ca_topic_score_gemma":0.001200496,"teacher_disagreement_score":0.028748982,"about_ca_system_score_codex":0.002456553,"about_ca_system_score_gemma":0.0012038253,"threshold_uncertainty_score":0.096174955},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030741632,0.005847034,0.9399062,0.0030697493,0.00078050763,0.00020643225,0.000025159989,0.0001723221,0.019250972],"genre_scores_gemma":[0.6274903,0.0072935293,0.34538442,0.0007621719,0.0012051798,0.00041229176,0.000047993657,0.00011498507,0.017289115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982331,0.001000186,0.00005979715,0.00015544762,0.000411234,0.00014013422],"domain_scores_gemma":[0.996822,0.0021309687,0.00022334531,0.00021696085,0.0004279979,0.00017867438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004512069,0.00073041633,0.000871967,0.00074060867,0.0009842906,0.0026908861,0.0016647079,0.0026138707,0.0039741662],"category_scores_gemma":[0.009222562,0.00049520045,0.000690813,0.0013393194,0.0028915673,0.004976765,0.0013037284,0.0019811701,0.00068360305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020175286,0.0001472713,0.0006882981,0.00035788826,0.00006441267,0.0002215154,0.0002829542,0.08020565,0.0034121873,0.8010877,0.005008901,0.108321495],"study_design_scores_gemma":[0.0001441362,0.00029597455,0.00026987703,0.00010457799,0.000060783426,0.00033842708,0.00015975526,0.33794478,0.002479134,0.63119364,0.026958218,0.00005060023],"about_ca_topic_score_codex":0.0005103119,"about_ca_topic_score_gemma":0.00029136922,"teacher_disagreement_score":0.004512069,"about_ca_system_score_codex":0.000993063,"about_ca_system_score_gemma":0.0012705928,"threshold_uncertainty_score":0.023862422},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001552612,0.09275723,0.5125407,0.0031672346,0.005181606,0.00013042826,0.00041141026,0.001197785,0.383061],"genre_scores_gemma":[0.043304734,0.14900911,0.23029146,0.0028550124,0.0029673362,0.0005902361,0.0010952164,0.00078516616,0.5691017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995974,0.00006107374,0.000015155582,0.000055066605,0.00024894654,0.000022426264],"domain_scores_gemma":[0.99956685,0.00025511006,0.000016062919,0.000056138557,0.00009164809,0.000014136556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037452095,0.0011144467,0.0006956454,0.0010689568,0.0005010341,0.0017121694,0.000801443,0.0012343804,0.013747518],"category_scores_gemma":[0.0011077557,0.00046464975,0.00044157988,0.0019142258,0.001416968,0.0021217521,0.00093280576,0.0024948355,0.0066289343],"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.000025525522,0.00002535407,0.00006744567,0.00066292105,0.00002826264,0.00016815947,0.00029603037,0.011966719,0.004585483,0.55079067,0.11313438,0.31824905],"study_design_scores_gemma":[0.000007585466,0.00003344172,0.00014731796,0.00034367776,0.000009722856,0.00040965623,0.000057961257,0.011762992,0.0014480377,0.18454163,0.80120844,0.000029583847],"about_ca_topic_score_codex":0.00072961906,"about_ca_topic_score_gemma":0.0008521967,"teacher_disagreement_score":0.013747518,"about_ca_system_score_codex":0.00082128803,"about_ca_system_score_gemma":0.0009230923,"threshold_uncertainty_score":0.04598999},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10727723,0.002366283,0.8720862,0.00046971883,0.0000969399,0.000081036655,0.00022097396,0.00019076851,0.017210767],"genre_scores_gemma":[0.9601711,0.0014074378,0.032156378,0.00009483739,0.00006378763,0.00007531007,0.00009255615,0.00002668542,0.005911892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991872,0.0003192499,0.000026638721,0.000164663,0.000152588,0.0001495876],"domain_scores_gemma":[0.9983895,0.0010528909,0.00020697426,0.00007595693,0.00020990409,0.000064777116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010019977,0.0013013281,0.0011746555,0.0003979281,0.00042555973,0.001341947,0.0008818746,0.0010238576,0.0019226457],"category_scores_gemma":[0.002696675,0.0004775679,0.0004365343,0.0007552605,0.00086880807,0.0016002252,0.00092999835,0.00070370146,0.00043288665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006675071,0.000027724522,0.0002311297,0.00008114468,0.000028115606,0.00010036575,0.000054101456,0.9643029,0.0024297943,0.026181992,0.00058866333,0.0059072534],"study_design_scores_gemma":[0.00001548936,0.000056592766,0.000107840846,0.0000056426534,0.000010563391,0.000042370582,0.000030084064,0.9896544,0.00053624326,0.0091935545,0.00033955122,0.000007720599],"about_ca_topic_score_codex":0.001587701,"about_ca_topic_score_gemma":0.0012977133,"teacher_disagreement_score":0.0019226457,"about_ca_system_score_codex":0.0011854752,"about_ca_system_score_gemma":0.0005470745,"threshold_uncertainty_score":0.008601248},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15748781,0.0010936141,0.8347536,0.00013046854,0.000027697834,0.00004793896,0.00004248149,0.00015115763,0.0062653013],"genre_scores_gemma":[0.88994414,0.0007657715,0.10740163,0.00005467873,0.000018137505,0.00005280936,0.00004835612,0.000011798553,0.0017026453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956554,0.00014146525,0.000021859589,0.00004970237,0.00017599708,0.000045518904],"domain_scores_gemma":[0.99940205,0.00030219296,0.000098017445,0.0000725762,0.00011537444,0.000009818711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041116143,0.0004153069,0.00037857547,0.00024332493,0.00023011606,0.00046729238,0.00040350077,0.00038658085,0.0003493735],"category_scores_gemma":[0.0014966249,0.00015549468,0.00020246679,0.0004152461,0.00039471086,0.00044090813,0.0004917769,0.00033396704,0.00015101314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029265374,0.00006753308,0.0023983645,0.00039115988,0.00008831121,0.0003009299,0.00049092463,0.56586385,0.13413243,0.123238854,0.00081993523,0.17191507],"study_design_scores_gemma":[0.000016741105,0.00025105083,0.0005738727,0.000040369556,0.000021432463,0.00026115216,0.000034554156,0.9324483,0.052500345,0.011157784,0.0026723165,0.000022122591],"about_ca_topic_score_codex":0.00075313926,"about_ca_topic_score_gemma":0.0010529626,"teacher_disagreement_score":0.00075313926,"about_ca_system_score_codex":0.0003496262,"about_ca_system_score_gemma":0.0006323155,"threshold_uncertainty_score":0.002536714},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013716565,0.0061526634,0.95989907,0.001570808,0.00032823984,0.00007071629,0.000089852496,0.0002588669,0.01791324],"genre_scores_gemma":[0.51649415,0.021589812,0.4364726,0.0005722125,0.0014742966,0.0005765205,0.00040872407,0.00021931139,0.022192303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994535,0.000206199,0.000028336428,0.000036999845,0.00021954185,0.000055410444],"domain_scores_gemma":[0.99880004,0.0007432509,0.000051907813,0.00017294305,0.00020940407,0.000022418999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007914693,0.0004270589,0.00033167648,0.0011216876,0.0004983582,0.000603044,0.00056476356,0.0007517991,0.0023141494],"category_scores_gemma":[0.0035778163,0.00025305912,0.00036685474,0.0010687232,0.0008504486,0.0014853651,0.0008751809,0.001645433,0.000616412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009037183,0.00006372232,0.00026587126,0.00025943608,0.000037101894,0.00012250301,0.000417193,0.06104816,0.01573802,0.6149849,0.012280858,0.29469183],"study_design_scores_gemma":[0.000051102244,0.000078513214,0.00028253102,0.0001352849,0.000028959355,0.00023297998,0.00008596018,0.29400694,0.0077805147,0.67264634,0.02464424,0.00002663844],"about_ca_topic_score_codex":0.00087768235,"about_ca_topic_score_gemma":0.0010361958,"teacher_disagreement_score":0.0023141494,"about_ca_system_score_codex":0.0005570034,"about_ca_system_score_gemma":0.0004887918,"threshold_uncertainty_score":0.00774163},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025237768,0.0010570061,0.02273895,0.0040170904,0.0019676087,0.0003462177,0.002914781,0.0035718912,0.9608626],"genre_scores_gemma":[0.032907248,0.0012604442,0.016411455,0.0032761162,0.0005990719,0.00042974277,0.0052702115,0.0019164662,0.9379293],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807763,0.00032204264,0.00012838222,0.0004105282,0.00081497425,0.00024637554],"domain_scores_gemma":[0.99828964,0.00022622121,0.0000709081,0.00060558354,0.0005672088,0.00024047066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014914314,0.0006506959,0.0004993584,0.0016384069,0.002904689,0.0047890404,0.0015704421,0.001989897,0.3426837],"category_scores_gemma":[0.0049224054,0.00041900136,0.00064611493,0.0014616331,0.0009717705,0.0043416894,0.0051488527,0.0019363969,0.18535379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007198109,0.00005954401,0.00041857644,0.00016688323,0.0000074669288,0.00017620028,0.0012478617,0.0002599082,0.0012328426,0.2531667,0.5614733,0.1817187],"study_design_scores_gemma":[0.0000021890642,0.000007968611,0.0001060381,0.00004191151,0.0000013397046,0.00008994712,0.00012504711,0.00006513756,0.00020272969,0.0066808355,0.9926726,0.000004192148],"about_ca_topic_score_codex":0.0021919308,"about_ca_topic_score_gemma":0.0029010768,"teacher_disagreement_score":0.3426837,"about_ca_system_score_codex":0.0016498081,"about_ca_system_score_gemma":0.0015759878,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010059265,0.003210538,0.95516104,0.0014666395,0.00040781227,0.000060437982,0.00010435131,0.000071622344,0.029458327],"genre_scores_gemma":[0.48942378,0.013114775,0.47452447,0.0016546154,0.0016612419,0.0006407288,0.00037854697,0.00018568122,0.018416254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984242,0.00079152966,0.000063458356,0.00013229591,0.00046804675,0.00012054874],"domain_scores_gemma":[0.9961035,0.0028727858,0.00021500447,0.00042756135,0.0003227064,0.000058365265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025252516,0.00083237054,0.00046079647,0.0010768971,0.0006155047,0.001503923,0.00092482875,0.001359191,0.0029681074],"category_scores_gemma":[0.01032102,0.00038920273,0.00051508227,0.0012725531,0.0033154674,0.0029541897,0.0022919802,0.0032996375,0.0010734142],"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.00003507075,0.000013119112,0.000111170746,0.000054477543,0.000004628864,0.00007270613,0.00013198731,0.05610366,0.0009717755,0.92643195,0.0011438389,0.014925617],"study_design_scores_gemma":[0.000012545824,0.00003444577,0.0000845517,0.000097543176,0.0000043366967,0.00006807371,0.00002956588,0.29659882,0.0007128255,0.695325,0.0070089744,0.000023284825],"about_ca_topic_score_codex":0.0018588755,"about_ca_topic_score_gemma":0.0014622159,"teacher_disagreement_score":0.0029681074,"about_ca_system_score_codex":0.001529891,"about_ca_system_score_gemma":0.0008679471,"threshold_uncertainty_score":0.013354957},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4755774,0.02991254,0.0020348097,0.1193352,0.002462655,0.00019860722,0.0012393511,0.00013230502,0.3691072],"genre_scores_gemma":[0.9297373,0.009114598,0.0009079106,0.0061569223,0.00011268782,0.00005166132,0.00020804965,0.00010482435,0.053606004],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.99657696,0.00056253,0.000058858343,0.00026720157,0.000944319,0.001590104],"domain_scores_gemma":[0.99714667,0.0005552664,0.0001216581,0.00007436116,0.0008692893,0.0012327997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019027421,0.0007086529,0.0006888211,0.0031762528,0.07281775,0.018072708,0.00243713,0.003097941,0.0076026777],"category_scores_gemma":[0.0046494044,0.0005254491,0.00042758987,0.0069134077,0.025803197,0.005632751,0.006973438,0.006794358,0.00038296875],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006949412,0.00003151366,0.007374546,0.00016570312,0.000018448984,0.0022700375,0.83516645,0.00022798179,0.00036490883,0.09702708,0.035761748,0.021522041],"study_design_scores_gemma":[0.000004703955,0.000011174467,0.0059706746,0.00030595154,0.000016097201,0.00036816284,0.60218674,0.00013572672,0.00018190757,0.004662168,0.38609976,0.00005688663],"about_ca_topic_score_codex":0.99667275,"about_ca_topic_score_gemma":0.9985549,"teacher_disagreement_score":0.21155356,"about_ca_system_score_codex":0.21155356,"about_ca_system_score_gemma":0.19032677,"threshold_uncertainty_score":0.9144861},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07793476,0.0020966877,0.8789089,0.00095461344,0.00035095913,0.00013168399,0.00019500799,0.0006034833,0.03882401],"genre_scores_gemma":[0.87203187,0.00272279,0.1110167,0.00019510995,0.00013924293,0.0001355327,0.00018222672,0.0000536378,0.013522976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962485,0.00014026203,0.000016354568,0.00004897131,0.00011164069,0.000057873203],"domain_scores_gemma":[0.9985953,0.00080892374,0.00011029536,0.00013334444,0.0003089177,0.000043196404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053254643,0.00058043265,0.0005606271,0.00059309445,0.00047945237,0.0012278337,0.00047423117,0.0005106567,0.0022077542],"category_scores_gemma":[0.0020308993,0.00026648425,0.00023245065,0.0008129966,0.0005696874,0.00084173266,0.00094661023,0.00065240444,0.00090576924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063573435,0.00007890754,0.001142951,0.00022661981,0.00007435405,0.00041466474,0.00053229666,0.30358726,0.048468176,0.41975647,0.0057594827,0.21932305],"study_design_scores_gemma":[0.00007273214,0.00026010486,0.00052194454,0.000101120524,0.0000710862,0.00054516597,0.00011198851,0.86200076,0.022069188,0.098731354,0.01543662,0.00007790423],"about_ca_topic_score_codex":0.0008131074,"about_ca_topic_score_gemma":0.001208045,"teacher_disagreement_score":0.0022077542,"about_ca_system_score_codex":0.00051379635,"about_ca_system_score_gemma":0.00056057796,"threshold_uncertainty_score":0.007385671},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"reproducibility","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"reproducibility","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6078305,0.0039244574,0.057649825,0.01977021,0.012635229,0.083852306,0.059188876,0.0029028542,0.15224575],"genre_scores_gemma":[0.63839877,0.000818201,0.066404805,0.011684554,0.0011513548,0.17660163,0.01460109,0.0010463953,0.0892932],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99327433,0.0025243065,0.0006515856,0.0012265573,0.0018155932,0.0005076141],"domain_scores_gemma":[0.94567806,0.008571876,0.0021613806,0.019932538,0.021173429,0.0024827342],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.01632685,0.0012705651,0.0014035231,0.0019049067,0.005493996,0.0019590382,0.00276973,0.0020674202,0.030818911],"category_scores_gemma":[0.085121624,0.001202595,0.001982213,0.0015247943,0.0018761838,0.0024559244,0.0027584773,0.0029038303,0.0072398167],"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.017352056,0.011056308,0.09962461,0.0038788056,0.0016394451,0.0022133007,0.057302438,0.0016328635,0.05796701,0.031636316,0.4585878,0.2571091],"study_design_scores_gemma":[0.006238138,0.004900643,0.60808206,0.0010637298,0.0012665234,0.0009285092,0.008447742,0.0015401759,0.009790318,0.01856841,0.33823857,0.00093514344],"about_ca_topic_score_codex":0.07732646,"about_ca_topic_score_gemma":0.09680704,"teacher_disagreement_score":0.98367316,"about_ca_system_score_codex":0.00346423,"about_ca_system_score_gemma":0.007598858,"threshold_uncertainty_score":0.15375274},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063682406,0.000881362,0.0019250413,0.0029847187,0.0021800173,0.00011964144,0.0035364593,0.0011516991,0.98658425],"genre_scores_gemma":[0.0031408323,0.00060011586,0.00045917204,0.00083252386,0.00022745931,0.000042435964,0.0012427655,0.00030030758,0.9931544],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99870634,0.00015605678,0.000074189236,0.00036605872,0.0005126703,0.00018467309],"domain_scores_gemma":[0.99681383,0.00053509837,0.00021981231,0.0010339202,0.0010365008,0.00036077367],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009172601,0.0011583815,0.0008716862,0.0015688885,0.0019060848,0.0075715925,0.0014713613,0.0035420577,0.87294847],"category_scores_gemma":[0.0075749825,0.00046151588,0.00059198757,0.0027095592,0.0013733461,0.0052764514,0.004083502,0.0027421687,0.84457034],"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.000079479665,0.000040400395,0.00028982537,0.00019755554,0.000008491513,0.00013466863,0.00011943912,0.000107067906,0.0010510337,0.023431854,0.8321435,0.14239667],"study_design_scores_gemma":[0.000006462368,0.000012948652,0.00015408003,0.000070697075,0.0000016973244,0.00011442942,0.00005892333,0.00011686742,0.0002729734,0.0020972346,0.99708766,0.000006014847],"about_ca_topic_score_codex":0.0018571492,"about_ca_topic_score_gemma":0.0021342684,"teacher_disagreement_score":0.12705153,"about_ca_system_score_codex":0.0013653731,"about_ca_system_score_gemma":0.0017183243,"threshold_uncertainty_score":0.18122357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07300456,0.00027931514,0.9243819,0.00014260635,0.000020905843,0.00002717576,0.000020963384,0.00023333356,0.001889182],"genre_scores_gemma":[0.9680714,0.00008943321,0.030713923,0.000052748237,0.000012648403,0.000046504676,0.000028459204,0.000017157672,0.00096761016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992499,0.00024697988,0.000028933044,0.00017160672,0.00017796418,0.00012459082],"domain_scores_gemma":[0.9984536,0.0008788322,0.00021782142,0.00016227439,0.00021731555,0.000070111164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014853539,0.0006902855,0.0009260239,0.00030534255,0.00041383217,0.00064739364,0.0012682189,0.00070295815,0.0005037594],"category_scores_gemma":[0.0030667796,0.00028003898,0.00036419893,0.00047236786,0.0007797442,0.0011434926,0.0012582571,0.0006402703,0.00010617707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006791315,0.000037003687,0.0005922623,0.000029119521,0.000019285964,0.000093078816,0.00006779744,0.97005403,0.0016121521,0.0038133531,0.00030235635,0.02331167],"study_design_scores_gemma":[0.0000038017813,0.000026937607,0.0000735038,0.0000015779893,0.0000037070608,0.000011338381,0.0000067132473,0.99815995,0.0003051984,0.0013245777,0.00008037828,0.000002280778],"about_ca_topic_score_codex":0.0027994146,"about_ca_topic_score_gemma":0.0020749765,"teacher_disagreement_score":0.0027994146,"about_ca_system_score_codex":0.00061263284,"about_ca_system_score_gemma":0.00075496547,"threshold_uncertainty_score":0.007855356},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15119575,0.002561372,0.82679075,0.001028698,0.00009178422,0.000060688293,0.00014538593,0.00014051472,0.017985094],"genre_scores_gemma":[0.9093394,0.0019573073,0.07890171,0.00009382531,0.00006295452,0.000107557906,0.00009819894,0.00007221261,0.009366768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997303,0.00012947305,0.000006846995,0.00004415113,0.000045711302,0.000043460204],"domain_scores_gemma":[0.99956375,0.0003307359,0.00003341184,0.000014473889,0.000039825543,0.000017805718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059247896,0.0007298611,0.00052974775,0.00045865818,0.0004021326,0.0009510779,0.00038988306,0.00071827444,0.0012769331],"category_scores_gemma":[0.001842905,0.00032716326,0.00034850743,0.0007765612,0.0007963406,0.000873319,0.0005935987,0.0006471592,0.00018516235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033975153,0.000012895747,0.00012358784,0.000023308843,0.000010630611,0.000030382518,0.000030522995,0.9682805,0.0010792583,0.020379495,0.00056468596,0.009430733],"study_design_scores_gemma":[0.0000085345655,0.000021995877,0.00007936528,0.0000051593533,0.000007864044,0.000013486507,0.000022341494,0.9846473,0.00040065876,0.014032158,0.00075664965,0.000004419806],"about_ca_topic_score_codex":0.004840779,"about_ca_topic_score_gemma":0.002863611,"teacher_disagreement_score":0.004840779,"about_ca_system_score_codex":0.0013337001,"about_ca_system_score_gemma":0.0006871943,"threshold_uncertainty_score":0.009676695},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013392874,0.0008025871,0.9736776,0.0003523953,0.00011624931,0.00016194045,0.00011651014,0.0004254174,0.010954425],"genre_scores_gemma":[0.59373796,0.0010323661,0.39050135,0.00042311507,0.0001727033,0.0007956255,0.00024686405,0.000111672496,0.012978411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957151,0.0019085419,0.00024125286,0.00042151433,0.001162739,0.0005508946],"domain_scores_gemma":[0.99285865,0.0035565514,0.0004256275,0.001747611,0.001237953,0.00017363201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036435123,0.002658077,0.0022978594,0.0016911847,0.0017553513,0.0020733322,0.0022703435,0.0025577012,0.0028019154],"category_scores_gemma":[0.010528202,0.00091125304,0.0014109375,0.0030454076,0.0018935627,0.0025561093,0.004818566,0.0015445991,0.0017737699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012436273,0.00026703975,0.0019439945,0.00062407687,0.00044591803,0.00074589,0.0014968705,0.3963817,0.037564192,0.28763196,0.007060872,0.26459387],"study_design_scores_gemma":[0.00012311971,0.0003033792,0.00044610168,0.000108096305,0.00015089332,0.0009661852,0.000099519755,0.8681114,0.021584766,0.10223602,0.0057418416,0.00012872086],"about_ca_topic_score_codex":0.0010859501,"about_ca_topic_score_gemma":0.001833723,"teacher_disagreement_score":0.0036435123,"about_ca_system_score_codex":0.0012250365,"about_ca_system_score_gemma":0.002349413,"threshold_uncertainty_score":0.01926899},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6965405,0.0013081336,0.2063152,0.0017837072,0.0004613353,0.00012839248,0.00090545893,0.0005299351,0.09202746],"genre_scores_gemma":[0.97264636,0.0005259124,0.013213771,0.00020957387,0.00027189348,0.00009778135,0.00048615778,0.00014191898,0.012406627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995677,0.00010576735,0.000020024952,0.0000650106,0.0001415071,0.000099937875],"domain_scores_gemma":[0.99820554,0.0008523117,0.00031565732,0.0001958496,0.00023252169,0.00019813325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004238676,0.00049466453,0.00048478853,0.0013737862,0.0010589493,0.0012619825,0.00073536363,0.0009312277,0.007978153],"category_scores_gemma":[0.004454846,0.00028637997,0.00032093804,0.0007340323,0.0013052989,0.0016326397,0.0012712514,0.0013086569,0.0012910333],"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.00014783867,0.000037066653,0.00050087186,0.000102889804,0.00001366281,0.0001591089,0.00035082793,0.011253072,0.008307032,0.95801115,0.0046334052,0.016482996],"study_design_scores_gemma":[0.00003411292,0.00004010631,0.00045681754,0.00003728905,0.000010539659,0.00010913032,0.0001310537,0.05121419,0.0028633282,0.94241464,0.0026682778,0.000020598942],"about_ca_topic_score_codex":0.0011150684,"about_ca_topic_score_gemma":0.0014740202,"teacher_disagreement_score":0.007978153,"about_ca_system_score_codex":0.0005473626,"about_ca_system_score_gemma":0.00035118658,"threshold_uncertainty_score":0.02668953},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2310791,0.003889442,0.7403177,0.0017963633,0.0003952868,0.00008449348,0.0003003114,0.0014137647,0.020723533],"genre_scores_gemma":[0.9550983,0.0006537719,0.03613503,0.00022074979,0.00009529591,0.00006307036,0.0000848054,0.00007210943,0.007576922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933296,0.00020240649,0.000022872237,0.00006803921,0.00016756884,0.00020604538],"domain_scores_gemma":[0.9969995,0.0015678966,0.00028058558,0.0004770837,0.0005848234,0.000090059955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079749484,0.0006675202,0.00080636406,0.00090312096,0.0011761575,0.0011938625,0.00083927275,0.0012714311,0.0024270734],"category_scores_gemma":[0.0058922223,0.0002727445,0.00029093257,0.0009150403,0.0012195661,0.0011206474,0.0014083574,0.0010944877,0.00046837764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015310716,0.00007632256,0.0013865507,0.0003272851,0.000091284935,0.0011318829,0.001147009,0.22659095,0.03528323,0.5240764,0.010646851,0.1977112],"study_design_scores_gemma":[0.00007278521,0.00023228292,0.0005882856,0.00010754588,0.000049425333,0.0012356817,0.00018121672,0.7896837,0.02079943,0.17492205,0.0120339235,0.000093612114],"about_ca_topic_score_codex":0.0057660225,"about_ca_topic_score_gemma":0.007253913,"teacher_disagreement_score":0.0057660225,"about_ca_system_score_codex":0.0013946255,"about_ca_system_score_gemma":0.0011001225,"threshold_uncertainty_score":0.011464953},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017044043,0.009822805,0.9171523,0.0011519765,0.0005864122,0.00014414414,0.00031707462,0.00048074036,0.05330048],"genre_scores_gemma":[0.884296,0.009144047,0.07747809,0.00031437475,0.00043325932,0.00022238572,0.00032376303,0.00006308926,0.027724855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998282,0.000035527373,0.000006451396,0.000036067857,0.000069293856,0.000024522786],"domain_scores_gemma":[0.9997931,0.00009204631,0.00001980707,0.000023660717,0.00006204328,0.000009283413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002243785,0.0005614314,0.00042327767,0.0003467957,0.00051882985,0.0007538652,0.0008381371,0.00086145825,0.0061208806],"category_scores_gemma":[0.0008936295,0.00017888396,0.00021963316,0.0006692248,0.00044556978,0.00075685105,0.00067018444,0.0006789665,0.0019171505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019271164,0.00009285238,0.00064709026,0.00069928716,0.000060994746,0.001162619,0.00040865786,0.22676195,0.046680264,0.39778867,0.032632492,0.29287246],"study_design_scores_gemma":[0.000025880181,0.00018727849,0.00028421392,0.00013555758,0.00004121349,0.0008013591,0.0000921089,0.8245094,0.0041179094,0.11701028,0.052753005,0.00004182779],"about_ca_topic_score_codex":0.0010696092,"about_ca_topic_score_gemma":0.00250728,"teacher_disagreement_score":0.0061208806,"about_ca_system_score_codex":0.00071332714,"about_ca_system_score_gemma":0.00033095537,"threshold_uncertainty_score":0.0204764},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020124597,0.00058298616,0.80953634,0.0022184942,0.0004888851,0.0006039926,0.0006721985,0.0007064817,0.16506611],"genre_scores_gemma":[0.57810116,0.0011948576,0.23278786,0.00080253766,0.0004554369,0.0010391019,0.00096293405,0.0002533054,0.18440278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750227,0.0007868351,0.00011291037,0.00039754232,0.00084381766,0.00035656302],"domain_scores_gemma":[0.99750865,0.0008239902,0.00013304951,0.0010767699,0.00030718246,0.00015038547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019188639,0.00080017315,0.0010370417,0.00091824605,0.0013146744,0.0023838878,0.0024109625,0.0020345778,0.021114407],"category_scores_gemma":[0.006266603,0.00050343847,0.00063570816,0.001422518,0.001326815,0.0043072947,0.0032610232,0.0029741842,0.004111659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009231124,0.00010131611,0.000065810804,0.00007524279,0.000010436045,0.000026532116,0.00005889473,0.0065457476,0.0019970168,0.94304,0.008780484,0.039206274],"study_design_scores_gemma":[0.00008785721,0.000056698427,0.00014550402,0.0000383452,0.000016913105,0.00011436577,0.000026221276,0.08442106,0.0021649261,0.88358945,0.029317321,0.000021294825],"about_ca_topic_score_codex":0.0003216769,"about_ca_topic_score_gemma":0.0003277452,"teacher_disagreement_score":0.021114407,"about_ca_system_score_codex":0.0016206731,"about_ca_system_score_gemma":0.0020270206,"threshold_uncertainty_score":0.07063472},"labels":[],"label_agreement":null}]}